Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446300076.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBLF-COL-S02J04T06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446300076
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.3K Apr 11 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 11 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 16:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 11 17:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 11 16:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 11 16:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S02J04T06-LTLFireability-00
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-01
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-02
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-03
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-04
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-05
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-06
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-07
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-08
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-09
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-10
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-11
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-12
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-13
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-14
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716903258256

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J04T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-28 13:34:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 13:34:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 13:34:20] [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-28 13:34:20] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 13:34:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1122 ms
[2024-05-28 13:34:21] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 476 PT places and 952.0 transition bindings in 52 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 13:34:21] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 7 ms.
[2024-05-28 13:34:21] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (20 resets) in 683 ms. (58 steps per ms) remains 1/28 properties
BEST_FIRST walk for 40002 steps (15 resets) in 211 ms. (188 steps per ms) remains 1/1 properties
[2024-05-28 13:34:21] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 13:34:21] [INFO ] Computed 26 invariants in 7 ms
[2024-05-28 13:34:21] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/23 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/46 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/49 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/73 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 13:34:22] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/78 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/145 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/145 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/145 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/145 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 116 constraints, problems are : Problem set: 0 solved, 1 unsolved in 580 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/23 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/46 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/49 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/73 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/78 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/143 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/145 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/145 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/145 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/145 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 117 constraints, problems are : Problem set: 0 solved, 1 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 759ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 80 transition count 56
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 71 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 19 place count 71 transition count 53
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 68 transition count 53
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 39 place count 61 transition count 46
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 61 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 59 transition count 44
Applied a total of 43 rules in 40 ms. Remains 59 /81 variables (removed 22) and now considering 44/65 (removed 21) transitions.
Running 43 sub problems to find dead transitions.
[2024-05-28 13:34:22] [INFO ] Flow matrix only has 43 transitions (discarded 1 similar events)
// Phase 1: matrix 43 rows 59 cols
[2024-05-28 13:34:22] [INFO ] Computed 25 invariants in 2 ms
[2024-05-28 13:34:22] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-28 13:34:23] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
[2024-05-28 13:34:23] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-28 13:34:23] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-28 13:34:23] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-28 13:34:23] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/59 variables, 1/30 constraints. Problems are: Problem set: 2 solved, 41 unsolved
[2024-05-28 13:34:23] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-28 13:34:23] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 13:34:23] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-28 13:34:23] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-28 13:34:23] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-28 13:34:23] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2024-05-28 13:34:23] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-28 13:34:23] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 8/38 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/38 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 43/102 variables, 59/97 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 8/105 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 0/105 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 11 (OVERLAPS) 0/102 variables, 0/105 constraints. Problems are: Problem set: 2 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 105 constraints, problems are : Problem set: 2 solved, 41 unsolved in 1667 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 59/59 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 2 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 6/30 constraints. Problems are: Problem set: 2 solved, 41 unsolved
[2024-05-28 13:34:24] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/31 constraints. Problems are: Problem set: 2 solved, 41 unsolved
[2024-05-28 13:34:24] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/32 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 1/59 variables, 1/33 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 7/40 constraints. Problems are: Problem set: 2 solved, 41 unsolved
[2024-05-28 13:34:25] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-28 13:34:25] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-28 13:34:25] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-28 13:34:25] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-28 13:34:25] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 5/45 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/59 variables, 0/45 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 10 (OVERLAPS) 43/102 variables, 59/104 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 8/112 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 41/153 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 0/153 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 14 (OVERLAPS) 0/102 variables, 0/153 constraints. Problems are: Problem set: 2 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 153 constraints, problems are : Problem set: 2 solved, 41 unsolved in 2290 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 59/59 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 41/43 constraints, Known Traps: 20/20 constraints]
After SMT, in 4013ms problems are : Problem set: 2 solved, 41 unsolved
Search for dead transitions found 2 dead transitions in 4015ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/81 places, 42/65 transitions.
Reduce places removed 2 places and 2 transitions.
Graph (complete) has 194 edges and 57 vertex of which 1 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.1 ms
Discarding 56 places :
Also discarding 39 output transitions
Drop transitions (Output transitions of discarded places.) removed 39 transitions
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1 transition count 1
Reduce places removed 0 places and 1 transitions.
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 3 rules in 12 ms. Remains 1 /59 variables (removed 58) and now considering 0/42 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4114 ms. Remains : 1/81 places, 0/65 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2024-05-28 13:34:26] [INFO ] Flatten gal took : 25 ms
[2024-05-28 13:34:26] [INFO ] Flatten gal took : 9 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-28 13:34:26] [INFO ] Unfolded HLPN to a Petri net with 476 places and 920 transitions 4242 arcs in 39 ms.
[2024-05-28 13:34:26] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Support contains 288 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 474 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 468 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 468 transition count 818
Applied a total of 14 rules in 30 ms. Remains 468 /476 variables (removed 8) and now considering 818/824 (removed 6) transitions.
Running 816 sub problems to find dead transitions.
[2024-05-28 13:34:27] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 468 cols
[2024-05-28 13:34:27] [INFO ] Computed 44 invariants in 38 ms
[2024-05-28 13:34:27] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-28 13:34:33] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:34:33] [INFO ] Deduced a trap composed of 65 places in 37 ms of which 1 ms to minimize.
[2024-05-28 13:34:33] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-05-28 13:34:33] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-05-28 13:34:33] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-05-28 13:34:33] [INFO ] Deduced a trap composed of 269 places in 182 ms of which 3 ms to minimize.
[2024-05-28 13:34:34] [INFO ] Deduced a trap composed of 92 places in 182 ms of which 2 ms to minimize.
[2024-05-28 13:34:34] [INFO ] Deduced a trap composed of 144 places in 191 ms of which 3 ms to minimize.
[2024-05-28 13:34:34] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-05-28 13:34:34] [INFO ] Deduced a trap composed of 277 places in 234 ms of which 4 ms to minimize.
[2024-05-28 13:34:35] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 2 ms to minimize.
[2024-05-28 13:34:35] [INFO ] Deduced a trap composed of 251 places in 238 ms of which 3 ms to minimize.
[2024-05-28 13:34:35] [INFO ] Deduced a trap composed of 211 places in 199 ms of which 2 ms to minimize.
[2024-05-28 13:34:36] [INFO ] Deduced a trap composed of 257 places in 260 ms of which 5 ms to minimize.
[2024-05-28 13:34:36] [INFO ] Deduced a trap composed of 245 places in 226 ms of which 4 ms to minimize.
[2024-05-28 13:34:36] [INFO ] Deduced a trap composed of 248 places in 207 ms of which 4 ms to minimize.
[2024-05-28 13:34:36] [INFO ] Deduced a trap composed of 243 places in 216 ms of which 3 ms to minimize.
[2024-05-28 13:34:42] [INFO ] Deduced a trap composed of 223 places in 230 ms of which 3 ms to minimize.
[2024-05-28 13:34:42] [INFO ] Deduced a trap composed of 245 places in 237 ms of which 5 ms to minimize.
[2024-05-28 13:34:43] [INFO ] Deduced a trap composed of 261 places in 229 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/1274 variables, and 62 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/468 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-28 13:34:52] [INFO ] Deduced a trap composed of 300 places in 243 ms of which 4 ms to minimize.
[2024-05-28 13:34:52] [INFO ] Deduced a trap composed of 253 places in 231 ms of which 3 ms to minimize.
[2024-05-28 13:34:53] [INFO ] Deduced a trap composed of 250 places in 236 ms of which 4 ms to minimize.
[2024-05-28 13:34:54] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-05-28 13:34:56] [INFO ] Deduced a trap composed of 238 places in 193 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-28 13:35:06] [INFO ] Deduced a trap composed of 318 places in 229 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/1274 variables, and 68 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/468 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/816 constraints, Known Traps: 26/26 constraints]
After SMT, in 41077ms problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 41096ms
[2024-05-28 13:35:08] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2024-05-28 13:35:08] [INFO ] Invariant cache hit.
[2024-05-28 13:35:08] [INFO ] Implicit Places using invariants in 199 ms returned [366, 367, 368, 369, 370, 371]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 226 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 462/476 places, 818/824 transitions.
Applied a total of 0 rules in 12 ms. Remains 462 /462 variables (removed 0) and now considering 818/818 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41370 ms. Remains : 462/476 places, 818/824 transitions.
Support contains 288 out of 462 places after structural reductions.
[2024-05-28 13:35:08] [INFO ] Flatten gal took : 124 ms
[2024-05-28 13:35:08] [INFO ] Flatten gal took : 102 ms
[2024-05-28 13:35:08] [INFO ] Input system was already deterministic with 818 transitions.
Support contains 248 out of 462 places (down from 288) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 27 to 25
RANDOM walk for 40000 steps (15 resets) in 594 ms. (67 steps per ms) remains 1/25 properties
BEST_FIRST walk for 40003 steps (9 resets) in 196 ms. (203 steps per ms) remains 1/1 properties
[2024-05-28 13:35:09] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 462 cols
[2024-05-28 13:35:09] [INFO ] Computed 38 invariants in 29 ms
[2024-05-28 13:35:09] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 205/211 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/221 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/457 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/460 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 806/1266 variables, 460/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1266 variables, 72/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1266 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/1268 variables, 2/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1268 variables, 1/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1268 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1268 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1268/1268 variables, and 572 constraints, problems are : Problem set: 0 solved, 1 unsolved in 710 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 462/462 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 205/211 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/221 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/457 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 13:35:10] [INFO ] Deduced a trap composed of 65 places in 115 ms of which 2 ms to minimize.
[2024-05-28 13:35:10] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 2 ms to minimize.
[2024-05-28 13:35:10] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/460 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1266/1268 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1162 ms.
Refiners :[Positive P Invariants (semi-flows): 9/10 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 460/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1916ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 164 ms.
Support contains 6 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 818/818 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 462 transition count 776
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 420 transition count 776
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 84 place count 420 transition count 728
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 180 place count 372 transition count 728
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 2 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 288 place count 318 transition count 674
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 294 place count 312 transition count 668
Iterating global reduction 2 with 6 rules applied. Total rules applied 300 place count 312 transition count 668
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 312 place count 312 transition count 656
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 324 place count 300 transition count 656
Applied a total of 324 rules in 98 ms. Remains 300 /462 variables (removed 162) and now considering 656/818 (removed 162) transitions.
Running 654 sub problems to find dead transitions.
[2024-05-28 13:35:11] [INFO ] Flow matrix only has 644 transitions (discarded 12 similar events)
// Phase 1: matrix 644 rows 300 cols
[2024-05-28 13:35:11] [INFO ] Computed 38 invariants in 16 ms
[2024-05-28 13:35:11] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 654 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/298 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 654 unsolved
[2024-05-28 13:35:15] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-28 13:35:15] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2024-05-28 13:35:15] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 0 ms to minimize.
[2024-05-28 13:35:15] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-05-28 13:35:15] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2024-05-28 13:35:16] [INFO ] Deduced a trap composed of 112 places in 159 ms of which 3 ms to minimize.
[2024-05-28 13:35:16] [INFO ] Deduced a trap composed of 103 places in 196 ms of which 12 ms to minimize.
[2024-05-28 13:35:16] [INFO ] Deduced a trap composed of 108 places in 160 ms of which 3 ms to minimize.
[2024-05-28 13:35:16] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 2 ms to minimize.
[2024-05-28 13:35:16] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-05-28 13:35:19] [INFO ] Deduced a trap composed of 102 places in 147 ms of which 3 ms to minimize.
[2024-05-28 13:35:19] [INFO ] Deduced a trap composed of 98 places in 166 ms of which 3 ms to minimize.
[2024-05-28 13:35:19] [INFO ] Deduced a trap composed of 128 places in 181 ms of which 2 ms to minimize.
[2024-05-28 13:35:20] [INFO ] Deduced a trap composed of 123 places in 134 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 654 unsolved
[2024-05-28 13:35:22] [INFO ] Deduced a trap composed of 166 places in 160 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 654 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 654 unsolved
Problem TDEAD574 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/300 variables, 2/53 constraints. Problems are: Problem set: 66 solved, 588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 300/944 variables, and 53 constraints, problems are : Problem set: 66 solved, 588 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/300 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 654/654 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 66 solved, 588 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 11/11 constraints. Problems are: Problem set: 66 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/298 variables, 25/36 constraints. Problems are: Problem set: 66 solved, 588 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 15/51 constraints. Problems are: Problem set: 66 solved, 588 unsolved
[2024-05-28 13:35:36] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 2 ms to minimize.
[2024-05-28 13:35:36] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-05-28 13:35:38] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 2 ms to minimize.
[2024-05-28 13:35:38] [INFO ] Deduced a trap composed of 50 places in 149 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 4/55 constraints. Problems are: Problem set: 66 solved, 588 unsolved
[2024-05-28 13:35:42] [INFO ] Deduced a trap composed of 110 places in 143 ms of which 3 ms to minimize.
[2024-05-28 13:35:44] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 2/57 constraints. Problems are: Problem set: 66 solved, 588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 298/944 variables, and 57 constraints, problems are : Problem set: 66 solved, 588 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/300 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/654 constraints, Known Traps: 21/21 constraints]
After SMT, in 41151ms problems are : Problem set: 66 solved, 588 unsolved
Search for dead transitions found 66 dead transitions in 41161ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 300/462 places, 590/818 transitions.
Reduce places removed 2 places and 12 transitions.
Graph (complete) has 1784 edges and 298 vertex of which 6 are kept as prefixes of interest. Removing 292 places using SCC suffix rule.1 ms
Discarding 292 places :
Also discarding 572 output transitions
Drop transitions (Output transitions of discarded places.) removed 572 transitions
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 6 transition count 6
Reduce places removed 0 places and 6 transitions.
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 3 rules in 5 ms. Remains 6 /300 variables (removed 294) and now considering 0/590 (removed 590) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 41267 ms. Remains : 6/462 places, 0/818 transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 12 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 812
Applied a total of 12 rules in 15 ms. Remains 456 /462 variables (removed 6) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 13:35:52] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2024-05-28 13:35:52] [INFO ] Computed 38 invariants in 11 ms
[2024-05-28 13:35:52] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:35:58] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-05-28 13:35:58] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-05-28 13:35:58] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:35:58] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 0 ms to minimize.
[2024-05-28 13:35:58] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-05-28 13:35:58] [INFO ] Deduced a trap composed of 240 places in 241 ms of which 4 ms to minimize.
[2024-05-28 13:35:59] [INFO ] Deduced a trap composed of 139 places in 214 ms of which 3 ms to minimize.
[2024-05-28 13:35:59] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-05-28 13:35:59] [INFO ] Deduced a trap composed of 271 places in 234 ms of which 3 ms to minimize.
[2024-05-28 13:35:59] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 2 ms to minimize.
[2024-05-28 13:36:00] [INFO ] Deduced a trap composed of 265 places in 180 ms of which 2 ms to minimize.
[2024-05-28 13:36:03] [INFO ] Deduced a trap composed of 248 places in 254 ms of which 3 ms to minimize.
[2024-05-28 13:36:04] [INFO ] Deduced a trap composed of 223 places in 143 ms of which 2 ms to minimize.
[2024-05-28 13:36:04] [INFO ] Deduced a trap composed of 241 places in 144 ms of which 3 ms to minimize.
[2024-05-28 13:36:06] [INFO ] Deduced a trap composed of 110 places in 215 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:36:08] [INFO ] Deduced a trap composed of 262 places in 204 ms of which 4 ms to minimize.
[2024-05-28 13:36:08] [INFO ] Deduced a trap composed of 269 places in 180 ms of which 2 ms to minimize.
[2024-05-28 13:36:13] [INFO ] Deduced a trap composed of 59 places in 193 ms of which 3 ms to minimize.
[2024-05-28 13:36:13] [INFO ] Deduced a trap composed of 48 places in 202 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.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 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 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 9.0)
(s123 0.0)
(s124 1.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:36:19] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-05-28 13:36:20] [INFO ] Deduced a trap composed of 226 places in 138 ms of which 2 ms to minimize.
[2024-05-28 13:36:20] [INFO ] Deduced a trap composed of 275 places in 209 ms of which 3 ms to minimize.
[2024-05-28 13:36:21] [INFO ] Deduced a trap composed of 240 places in 200 ms of which 4 ms to minimize.
[2024-05-28 13:36:22] [INFO ] Deduced a trap composed of 241 places in 132 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:36:27] [INFO ] Deduced a trap composed of 289 places in 246 ms of which 4 ms to minimize.
[2024-05-28 13:36:27] [INFO ] Deduced a trap composed of 299 places in 215 ms of which 3 ms to minimize.
[2024-05-28 13:36:27] [INFO ] Deduced a trap composed of 276 places in 210 ms of which 4 ms to minimize.
[2024-05-28 13:36:27] [INFO ] Deduced a trap composed of 252 places in 213 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 64 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 28/28 constraints]
After SMT, in 40787ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40795ms
[2024-05-28 13:36:33] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:36:33] [INFO ] Invariant cache hit.
[2024-05-28 13:36:34] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-05-28 13:36:34] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:36:34] [INFO ] Invariant cache hit.
[2024-05-28 13:36:34] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:36:38] [INFO ] Implicit Places using invariants and state equation in 4470 ms returned []
Implicit Place search using SMT with State Equation took 4830 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2024-05-28 13:36:38] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:36:38] [INFO ] Invariant cache hit.
[2024-05-28 13:36:38] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:36:44] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 2 ms to minimize.
[2024-05-28 13:36:45] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 2 ms to minimize.
[2024-05-28 13:36:45] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 0 ms to minimize.
[2024-05-28 13:36:45] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:36:45] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 1 ms to minimize.
[2024-05-28 13:36:46] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 1 ms to minimize.
[2024-05-28 13:36:48] [INFO ] Deduced a trap composed of 270 places in 224 ms of which 3 ms to minimize.
[2024-05-28 13:36:48] [INFO ] Deduced a trap composed of 286 places in 219 ms of which 5 ms to minimize.
[2024-05-28 13:36:48] [INFO ] Deduced a trap composed of 256 places in 204 ms of which 3 ms to minimize.
[2024-05-28 13:36:48] [INFO ] Deduced a trap composed of 15 places in 194 ms of which 3 ms to minimize.
[2024-05-28 13:36:48] [INFO ] Deduced a trap composed of 268 places in 227 ms of which 3 ms to minimize.
[2024-05-28 13:36:49] [INFO ] Deduced a trap composed of 245 places in 215 ms of which 3 ms to minimize.
[2024-05-28 13:36:49] [INFO ] Deduced a trap composed of 241 places in 193 ms of which 3 ms to minimize.
[2024-05-28 13:36:49] [INFO ] Deduced a trap composed of 288 places in 186 ms of which 4 ms to minimize.
[2024-05-28 13:36:49] [INFO ] Deduced a trap composed of 232 places in 190 ms of which 3 ms to minimize.
[2024-05-28 13:36:49] [INFO ] Deduced a trap composed of 248 places in 164 ms of which 2 ms to minimize.
[2024-05-28 13:36:52] [INFO ] Deduced a trap composed of 42 places in 233 ms of which 4 ms to minimize.
[2024-05-28 13:36:53] [INFO ] Deduced a trap composed of 144 places in 261 ms of which 3 ms to minimize.
[2024-05-28 13:36:54] [INFO ] Deduced a trap composed of 302 places in 196 ms of which 3 ms to minimize.
[2024-05-28 13:36:54] [INFO ] Deduced a trap composed of 278 places in 195 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:36:55] [INFO ] Deduced a trap composed of 296 places in 235 ms of which 3 ms to minimize.
[2024-05-28 13:36:55] [INFO ] Deduced a trap composed of 249 places in 210 ms of which 3 ms to minimize.
[2024-05-28 13:36:55] [INFO ] Deduced a trap composed of 261 places in 202 ms of which 4 ms to minimize.
[2024-05-28 13:36:55] [INFO ] Deduced a trap composed of 247 places in 187 ms of which 4 ms to minimize.
[2024-05-28 13:37:01] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 4 ms to minimize.
[2024-05-28 13:37:02] [INFO ] Deduced a trap composed of 242 places in 175 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 62 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 26/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:37:10] [INFO ] Deduced a trap composed of 61 places in 121 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:37:23] [INFO ] Deduced a trap composed of 244 places in 168 ms of which 2 ms to minimize.
[2024-05-28 13:37:23] [INFO ] Deduced a trap composed of 288 places in 164 ms of which 3 ms to minimize.
[2024-05-28 13:37:23] [INFO ] Deduced a trap composed of 222 places in 179 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/455 variables, 1/67 constraints. Problems are: Problem set: 36 solved, 774 unsolved
[2024-05-28 13:37:36] [INFO ] Deduced a trap composed of 320 places in 161 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1256 variables, and 68 constraints, problems are : Problem set: 36 solved, 774 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 31/31 constraints]
After SMT, in 60883ms problems are : Problem set: 36 solved, 774 unsolved
Search for dead transitions found 36 dead transitions in 60896ms
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 : 456/462 places, 776/818 transitions.
Applied a total of 0 rules in 17 ms. Remains 456 /456 variables (removed 0) and now considering 776/776 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106559 ms. Remains : 456/462 places, 776/818 transitions.
Stuttering acceptance computed with spot in 306 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-00 finished in 106938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&G(!p1))) U X(X(!p2))))'
Support contains 33 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 812
Applied a total of 12 rules in 11 ms. Remains 456 /462 variables (removed 6) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 13:37:39] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:37:39] [INFO ] Invariant cache hit.
[2024-05-28 13:37:39] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:37:45] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 5 ms to minimize.
[2024-05-28 13:37:45] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-05-28 13:37:45] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-05-28 13:37:45] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-05-28 13:37:46] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-28 13:37:46] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 0 ms to minimize.
[2024-05-28 13:37:48] [INFO ] Deduced a trap composed of 270 places in 213 ms of which 3 ms to minimize.
[2024-05-28 13:37:48] [INFO ] Deduced a trap composed of 286 places in 173 ms of which 2 ms to minimize.
[2024-05-28 13:37:48] [INFO ] Deduced a trap composed of 256 places in 166 ms of which 3 ms to minimize.
[2024-05-28 13:37:48] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 2 ms to minimize.
[2024-05-28 13:37:48] [INFO ] Deduced a trap composed of 268 places in 156 ms of which 2 ms to minimize.
[2024-05-28 13:37:49] [INFO ] Deduced a trap composed of 245 places in 164 ms of which 2 ms to minimize.
[2024-05-28 13:37:49] [INFO ] Deduced a trap composed of 241 places in 166 ms of which 3 ms to minimize.
[2024-05-28 13:37:49] [INFO ] Deduced a trap composed of 288 places in 160 ms of which 2 ms to minimize.
[2024-05-28 13:37:49] [INFO ] Deduced a trap composed of 232 places in 267 ms of which 5 ms to minimize.
[2024-05-28 13:37:49] [INFO ] Deduced a trap composed of 248 places in 248 ms of which 4 ms to minimize.
[2024-05-28 13:37:52] [INFO ] Deduced a trap composed of 42 places in 238 ms of which 4 ms to minimize.
[2024-05-28 13:37:52] [INFO ] Deduced a trap composed of 144 places in 199 ms of which 3 ms to minimize.
[2024-05-28 13:37:54] [INFO ] Deduced a trap composed of 302 places in 236 ms of which 3 ms to minimize.
[2024-05-28 13:37:54] [INFO ] Deduced a trap composed of 278 places in 210 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:37:54] [INFO ] Deduced a trap composed of 296 places in 200 ms of which 3 ms to minimize.
[2024-05-28 13:37:55] [INFO ] Deduced a trap composed of 249 places in 222 ms of which 4 ms to minimize.
[2024-05-28 13:37:55] [INFO ] Deduced a trap composed of 261 places in 215 ms of which 4 ms to minimize.
[2024-05-28 13:37:55] [INFO ] Deduced a trap composed of 247 places in 190 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 60 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:38:05] [INFO ] Deduced a trap composed of 297 places in 248 ms of which 4 ms to minimize.
[2024-05-28 13:38:09] [INFO ] Deduced a trap composed of 276 places in 155 ms of which 2 ms to minimize.
[2024-05-28 13:38:09] [INFO ] Deduced a trap composed of 246 places in 127 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:38:16] [INFO ] Deduced a trap composed of 239 places in 147 ms of which 3 ms to minimize.
[2024-05-28 13:38:16] [INFO ] Deduced a trap composed of 129 places in 93 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 65 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 29/29 constraints]
After SMT, in 40810ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40819ms
[2024-05-28 13:38:20] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:38:20] [INFO ] Invariant cache hit.
[2024-05-28 13:38:20] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-28 13:38:20] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:38:20] [INFO ] Invariant cache hit.
[2024-05-28 13:38:21] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:38:24] [INFO ] Implicit Places using invariants and state equation in 3306 ms returned []
Implicit Place search using SMT with State Equation took 3629 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2024-05-28 13:38:24] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:38:24] [INFO ] Invariant cache hit.
[2024-05-28 13:38:24] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:38:30] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 2 ms to minimize.
[2024-05-28 13:38:30] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-05-28 13:38:30] [INFO ] Deduced a trap composed of 64 places in 111 ms of which 1 ms to minimize.
[2024-05-28 13:38:31] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-05-28 13:38:31] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 1 ms to minimize.
[2024-05-28 13:38:31] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-05-28 13:38:33] [INFO ] Deduced a trap composed of 270 places in 228 ms of which 3 ms to minimize.
[2024-05-28 13:38:34] [INFO ] Deduced a trap composed of 286 places in 203 ms of which 3 ms to minimize.
[2024-05-28 13:38:34] [INFO ] Deduced a trap composed of 256 places in 179 ms of which 2 ms to minimize.
[2024-05-28 13:38:34] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 2 ms to minimize.
[2024-05-28 13:38:34] [INFO ] Deduced a trap composed of 268 places in 174 ms of which 2 ms to minimize.
[2024-05-28 13:38:34] [INFO ] Deduced a trap composed of 245 places in 212 ms of which 3 ms to minimize.
[2024-05-28 13:38:35] [INFO ] Deduced a trap composed of 241 places in 156 ms of which 2 ms to minimize.
[2024-05-28 13:38:35] [INFO ] Deduced a trap composed of 288 places in 161 ms of which 3 ms to minimize.
[2024-05-28 13:38:35] [INFO ] Deduced a trap composed of 232 places in 223 ms of which 3 ms to minimize.
[2024-05-28 13:38:35] [INFO ] Deduced a trap composed of 248 places in 221 ms of which 2 ms to minimize.
[2024-05-28 13:38:38] [INFO ] Deduced a trap composed of 42 places in 290 ms of which 4 ms to minimize.
[2024-05-28 13:38:39] [INFO ] Deduced a trap composed of 144 places in 231 ms of which 3 ms to minimize.
[2024-05-28 13:38:40] [INFO ] Deduced a trap composed of 302 places in 215 ms of which 3 ms to minimize.
[2024-05-28 13:38:40] [INFO ] Deduced a trap composed of 278 places in 227 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:38:41] [INFO ] Deduced a trap composed of 296 places in 214 ms of which 3 ms to minimize.
[2024-05-28 13:38:41] [INFO ] Deduced a trap composed of 249 places in 190 ms of which 3 ms to minimize.
[2024-05-28 13:38:41] [INFO ] Deduced a trap composed of 261 places in 190 ms of which 4 ms to minimize.
[2024-05-28 13:38:41] [INFO ] Deduced a trap composed of 247 places in 201 ms of which 3 ms to minimize.
[2024-05-28 13:38:46] [INFO ] Deduced a trap composed of 3 places in 192 ms of which 3 ms to minimize.
[2024-05-28 13:38:47] [INFO ] Deduced a trap composed of 242 places in 223 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 62 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 26/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:38:56] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:39:10] [INFO ] Deduced a trap composed of 244 places in 221 ms of which 5 ms to minimize.
[2024-05-28 13:39:10] [INFO ] Deduced a trap composed of 288 places in 187 ms of which 3 ms to minimize.
[2024-05-28 13:39:11] [INFO ] Deduced a trap composed of 222 places in 185 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/455 variables, 1/67 constraints. Problems are: Problem set: 36 solved, 774 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1256 variables, and 67 constraints, problems are : Problem set: 36 solved, 774 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 30/30 constraints]
After SMT, in 60723ms problems are : Problem set: 36 solved, 774 unsolved
Search for dead transitions found 36 dead transitions in 60734ms
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 : 456/462 places, 776/818 transitions.
Applied a total of 0 rules in 9 ms. Remains 456 /456 variables (removed 0) and now considering 776/776 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 105210 ms. Remains : 456/462 places, 776/818 transitions.
Stuttering acceptance computed with spot in 536 ms :[p2, (OR (AND (NOT p0) p2) (AND p1 p2)), p2, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), p2, (AND p1 p2), (OR (NOT p0) p1), p1]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-01
Product exploration explored 100000 steps with 33333 reset in 504 ms.
Product exploration explored 100000 steps with 33333 reset in 397 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (OR (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 32 ms. Reduced automaton from 11 states, 25 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-01 finished in 106728 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U (p1||G(!p0)))||F(G(p2)))))'
Support contains 50 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 812
Applied a total of 12 rules in 10 ms. Remains 456 /462 variables (removed 6) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 13:39:26] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:39:26] [INFO ] Invariant cache hit.
[2024-05-28 13:39:26] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:39:33] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2024-05-28 13:39:33] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 2 ms to minimize.
[2024-05-28 13:39:33] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-05-28 13:39:33] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:39:34] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2024-05-28 13:39:34] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-05-28 13:39:36] [INFO ] Deduced a trap composed of 270 places in 174 ms of which 3 ms to minimize.
[2024-05-28 13:39:36] [INFO ] Deduced a trap composed of 286 places in 246 ms of which 3 ms to minimize.
[2024-05-28 13:39:36] [INFO ] Deduced a trap composed of 256 places in 209 ms of which 3 ms to minimize.
[2024-05-28 13:39:37] [INFO ] Deduced a trap composed of 15 places in 248 ms of which 3 ms to minimize.
[2024-05-28 13:39:37] [INFO ] Deduced a trap composed of 268 places in 215 ms of which 3 ms to minimize.
[2024-05-28 13:39:37] [INFO ] Deduced a trap composed of 245 places in 242 ms of which 3 ms to minimize.
[2024-05-28 13:39:37] [INFO ] Deduced a trap composed of 241 places in 220 ms of which 4 ms to minimize.
[2024-05-28 13:39:38] [INFO ] Deduced a trap composed of 288 places in 242 ms of which 4 ms to minimize.
[2024-05-28 13:39:38] [INFO ] Deduced a trap composed of 232 places in 224 ms of which 3 ms to minimize.
[2024-05-28 13:39:38] [INFO ] Deduced a trap composed of 248 places in 213 ms of which 4 ms to minimize.
[2024-05-28 13:39:40] [INFO ] Deduced a trap composed of 42 places in 223 ms of which 3 ms to minimize.
[2024-05-28 13:39:41] [INFO ] Deduced a trap composed of 144 places in 206 ms of which 4 ms to minimize.
[2024-05-28 13:39:42] [INFO ] Deduced a trap composed of 302 places in 213 ms of which 3 ms to minimize.
[2024-05-28 13:39:42] [INFO ] Deduced a trap composed of 278 places in 203 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:39:43] [INFO ] Deduced a trap composed of 296 places in 215 ms of which 3 ms to minimize.
[2024-05-28 13:39:43] [INFO ] Deduced a trap composed of 249 places in 200 ms of which 3 ms to minimize.
[2024-05-28 13:39:43] [INFO ] Deduced a trap composed of 261 places in 203 ms of which 3 ms to minimize.
[2024-05-28 13:39:43] [INFO ] Deduced a trap composed of 247 places in 196 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 60 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:39:51] [INFO ] Deduced a trap composed of 297 places in 190 ms of which 3 ms to minimize.
[2024-05-28 13:39:55] [INFO ] Deduced a trap composed of 276 places in 214 ms of which 3 ms to minimize.
[2024-05-28 13:39:55] [INFO ] Deduced a trap composed of 246 places in 135 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:40:02] [INFO ] Deduced a trap composed of 239 places in 161 ms of which 3 ms to minimize.
[2024-05-28 13:40:02] [INFO ] Deduced a trap composed of 129 places in 123 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 65 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 29/29 constraints]
After SMT, in 40754ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40763ms
[2024-05-28 13:40:07] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:40:07] [INFO ] Invariant cache hit.
[2024-05-28 13:40:07] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-28 13:40:07] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:40:07] [INFO ] Invariant cache hit.
[2024-05-28 13:40:07] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:40:13] [INFO ] Implicit Places using invariants and state equation in 5668 ms returned []
Implicit Place search using SMT with State Equation took 5897 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2024-05-28 13:40:13] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:40:13] [INFO ] Invariant cache hit.
[2024-05-28 13:40:13] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:40:19] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 2 ms to minimize.
[2024-05-28 13:40:19] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 1 ms to minimize.
[2024-05-28 13:40:19] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-05-28 13:40:19] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-05-28 13:40:20] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-05-28 13:40:20] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-05-28 13:40:22] [INFO ] Deduced a trap composed of 270 places in 205 ms of which 3 ms to minimize.
[2024-05-28 13:40:22] [INFO ] Deduced a trap composed of 286 places in 181 ms of which 3 ms to minimize.
[2024-05-28 13:40:22] [INFO ] Deduced a trap composed of 256 places in 184 ms of which 3 ms to minimize.
[2024-05-28 13:40:23] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 2 ms to minimize.
[2024-05-28 13:40:23] [INFO ] Deduced a trap composed of 268 places in 233 ms of which 4 ms to minimize.
[2024-05-28 13:40:23] [INFO ] Deduced a trap composed of 245 places in 209 ms of which 4 ms to minimize.
[2024-05-28 13:40:23] [INFO ] Deduced a trap composed of 241 places in 195 ms of which 4 ms to minimize.
[2024-05-28 13:40:24] [INFO ] Deduced a trap composed of 288 places in 176 ms of which 4 ms to minimize.
[2024-05-28 13:40:24] [INFO ] Deduced a trap composed of 232 places in 217 ms of which 3 ms to minimize.
[2024-05-28 13:40:24] [INFO ] Deduced a trap composed of 248 places in 204 ms of which 3 ms to minimize.
[2024-05-28 13:40:27] [INFO ] Deduced a trap composed of 42 places in 232 ms of which 2 ms to minimize.
[2024-05-28 13:40:27] [INFO ] Deduced a trap composed of 144 places in 214 ms of which 4 ms to minimize.
[2024-05-28 13:40:28] [INFO ] Deduced a trap composed of 302 places in 226 ms of which 3 ms to minimize.
[2024-05-28 13:40:29] [INFO ] Deduced a trap composed of 278 places in 208 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:40:29] [INFO ] Deduced a trap composed of 296 places in 208 ms of which 3 ms to minimize.
[2024-05-28 13:40:29] [INFO ] Deduced a trap composed of 249 places in 223 ms of which 4 ms to minimize.
[2024-05-28 13:40:30] [INFO ] Deduced a trap composed of 261 places in 196 ms of which 3 ms to minimize.
[2024-05-28 13:40:30] [INFO ] Deduced a trap composed of 247 places in 234 ms of which 3 ms to minimize.
[2024-05-28 13:40:36] [INFO ] Deduced a trap composed of 3 places in 223 ms of which 4 ms to minimize.
[2024-05-28 13:40:37] [INFO ] Deduced a trap composed of 242 places in 238 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 62 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 26/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:40:45] [INFO ] Deduced a trap composed of 61 places in 134 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:41:00] [INFO ] Deduced a trap composed of 244 places in 195 ms of which 4 ms to minimize.
[2024-05-28 13:41:00] [INFO ] Deduced a trap composed of 288 places in 175 ms of which 2 ms to minimize.
[2024-05-28 13:41:00] [INFO ] Deduced a trap composed of 222 places in 181 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/455 variables, 1/67 constraints. Problems are: Problem set: 36 solved, 774 unsolved
(s81 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 6)
(s1 4)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0timeout
)
(s82 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1256 variables, and 67 constraints, problems are : Problem set: 36 solved, 774 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 30/30 constraints]
After SMT, in 60785ms problems are : Problem set: 36 solved, 774 unsolved
Search for dead transitions found 36 dead transitions in 60798ms
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 : 456/462 places, 776/818 transitions.
Applied a total of 0 rules in 4 ms. Remains 456 /456 variables (removed 0) and now considering 776/776 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 107480 ms. Remains : 456/462 places, 776/818 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) p0 (NOT p2)), (NOT p2), (AND (NOT p1) p0 (NOT p2))]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-02
Product exploration explored 100000 steps with 4151 reset in 528 ms.
Product exploration explored 100000 steps with 4157 reset in 404 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) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 182 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 300 ms :[(AND p0 (NOT p1) (NOT p2)), (NOT p2), (AND p0 (NOT p1) (NOT p2)), false, false, false, false]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (16 resets) in 728 ms. (54 steps per ms) remains 3/9 properties
BEST_FIRST walk for 40001 steps (11 resets) in 550 ms. (72 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (9 resets) in 253 ms. (157 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (12 resets) in 331 ms. (120 steps per ms) remains 3/3 properties
[2024-05-28 13:41:16] [INFO ] Flow matrix only has 764 transitions (discarded 12 similar events)
// Phase 1: matrix 764 rows 456 cols
[2024-05-28 13:41:16] [INFO ] Computed 38 invariants in 25 ms
[2024-05-28 13:41:16] [INFO ] State equation strengthened by 72 read => feed constraints.
Problem apf3 is UNSAT
Problem apf6 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 333/383 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 1/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 13/396 variables, 8/13 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Real declared 453/1220 variables, and 36 constraints, problems are : Problem set: 3 solved, 0 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 247ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1) p2)), (G (OR (NOT p0) (NOT p1) (NOT p2))), (G (OR p0 (NOT p1) (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F p2), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F p1)]
Knowledge based reduction with 13 factoid took 499 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 249 ms :[(AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 222 ms :[(AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2)), false, false]
Support contains 50 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 776/776 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 456 transition count 734
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 414 transition count 734
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 84 place count 414 transition count 698
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 156 place count 378 transition count 698
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 252 place count 330 transition count 650
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 258 place count 324 transition count 644
Iterating global reduction 2 with 6 rules applied. Total rules applied 264 place count 324 transition count 644
Applied a total of 264 rules in 49 ms. Remains 324 /456 variables (removed 132) and now considering 644/776 (removed 132) transitions.
Running 642 sub problems to find dead transitions.
[2024-05-28 13:41:17] [INFO ] Flow matrix only has 632 transitions (discarded 12 similar events)
// Phase 1: matrix 632 rows 324 cols
[2024-05-28 13:41:17] [INFO ] Computed 38 invariants in 9 ms
[2024-05-28 13:41:17] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-05-28 13:41:21] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2024-05-28 13:41:21] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-05-28 13:41:21] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-05-28 13:41:21] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-05-28 13:41:22] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-05-28 13:41:22] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2024-05-28 13:41:22] [INFO ] Deduced a trap composed of 135 places in 201 ms of which 3 ms to minimize.
[2024-05-28 13:41:23] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-05-28 13:41:26] [INFO ] Deduced a trap composed of 110 places in 174 ms of which 2 ms to minimize.
[2024-05-28 13:41:26] [INFO ] Deduced a trap composed of 120 places in 139 ms of which 2 ms to minimize.
[2024-05-28 13:41:27] [INFO ] Deduced a trap composed of 114 places in 131 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-05-28 13:41:30] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-05-28 13:41:35] [INFO ] Deduced a trap composed of 164 places in 178 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-05-28 13:41:37] [INFO ] Deduced a trap composed of 178 places in 189 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/956 variables, and 50 constraints, problems are : Problem set: 0 solved, 642 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 642/642 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 642 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-05-28 13:41:39] [INFO ] Deduced a trap composed of 145 places in 156 ms of which 3 ms to minimize.
[2024-05-28 13:41:39] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-05-28 13:41:40] [INFO ] Deduced a trap composed of 131 places in 176 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 5 (OVERLAPS) 1/323 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 642 unsolved
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
At refinement iteration 7 (OVERLAPS) 1/324 variables, 1/55 constraints. Problems are: Problem set: 30 solved, 612 unsolved
[2024-05-28 13:41:58] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 324/956 variables, and 56 constraints, problems are : Problem set: 30 solved, 612 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/642 constraints, Known Traps: 18/18 constraints]
After SMT, in 40792ms problems are : Problem set: 30 solved, 612 unsolved
Search for dead transitions found 30 dead transitions in 40801ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 30 transitions.
[2024-05-28 13:41:58] [INFO ] Flow matrix only has 602 transitions (discarded 12 similar events)
// Phase 1: matrix 602 rows 324 cols
[2024-05-28 13:41:58] [INFO ] Computed 38 invariants in 5 ms
[2024-05-28 13:41:58] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-28 13:41:58] [INFO ] Flow matrix only has 602 transitions (discarded 12 similar events)
[2024-05-28 13:41:58] [INFO ] Invariant cache hit.
[2024-05-28 13:41:58] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:42:00] [INFO ] Implicit Places using invariants and state equation in 1742 ms returned []
Implicit Place search using SMT with State Equation took 1987 ms to find 0 implicit places.
[2024-05-28 13:42:00] [INFO ] Redundant transitions in 35 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 324/456 places, 614/776 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 310 transition count 590
Applied a total of 12 rules in 18 ms. Remains 310 /324 variables (removed 14) and now considering 590/614 (removed 24) transitions.
[2024-05-28 13:42:00] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
// Phase 1: matrix 578 rows 310 cols
[2024-05-28 13:42:00] [INFO ] Computed 38 invariants in 11 ms
[2024-05-28 13:42:00] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-28 13:42:00] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-05-28 13:42:00] [INFO ] Invariant cache hit.
[2024-05-28 13:42:01] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:42:02] [INFO ] Implicit Places using invariants and state equation in 2057 ms returned []
Implicit Place search using SMT with State Equation took 2332 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 310/456 places, 590/776 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45233 ms. Remains : 310/456 places, 590/776 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 125 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 211 ms :[(AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2)), false, false]
RANDOM walk for 40000 steps (20 resets) in 212 ms. (187 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40000 steps (12 resets) in 198 ms. (201 steps per ms) remains 1/1 properties
[2024-05-28 13:42:03] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-05-28 13:42:03] [INFO ] Invariant cache hit.
[2024-05-28 13:42:03] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 129/179 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 7/186 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 304/888 variables, and 33 constraints, problems are : Problem set: 1 solved, 0 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 8/13 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/310 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 134ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (G (OR (NOT p1) (NOT p2) p0))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p1) p2 p0))), (F p1), (F p2), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 14 factoid took 297 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 284 ms :[(AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 234 ms :[(AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 221 ms :[(AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2)), false, false]
Product exploration explored 100000 steps with 5746 reset in 423 ms.
Product exploration explored 100000 steps with 5762 reset in 431 ms.
Built C files in :
/tmp/ltsmin14220211788177939933
[2024-05-28 13:42:05] [INFO ] Computing symmetric may disable matrix : 590 transitions.
[2024-05-28 13:42:05] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:42:05] [INFO ] Computing symmetric may enable matrix : 590 transitions.
[2024-05-28 13:42:05] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:42:05] [INFO ] Computing Do-Not-Accords matrix : 590 transitions.
[2024-05-28 13:42:05] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:42:05] [INFO ] Built C files in 237ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14220211788177939933
Running compilation step : cd /tmp/ltsmin14220211788177939933;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1895 ms.
Running link step : cd /tmp/ltsmin14220211788177939933;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 90 ms.
Running LTSmin : cd /tmp/ltsmin14220211788177939933;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15726273374264768732.hoa' '--buchi-type=spotba'
LTSmin run took 3703 ms.
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-02 finished in 164794 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 8 out of 462 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 462 transition count 776
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 420 transition count 776
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 84 place count 420 transition count 728
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 180 place count 372 transition count 728
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 276 place count 324 transition count 680
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 282 place count 318 transition count 674
Iterating global reduction 2 with 6 rules applied. Total rules applied 288 place count 318 transition count 674
Applied a total of 288 rules in 33 ms. Remains 318 /462 variables (removed 144) and now considering 674/818 (removed 144) transitions.
Running 672 sub problems to find dead transitions.
[2024-05-28 13:42:11] [INFO ] Flow matrix only has 662 transitions (discarded 12 similar events)
// Phase 1: matrix 662 rows 318 cols
[2024-05-28 13:42:11] [INFO ] Computed 38 invariants in 9 ms
[2024-05-28 13:42:11] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-05-28 13:42:14] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2024-05-28 13:42:14] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-05-28 13:42:14] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:42:14] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 1 ms to minimize.
[2024-05-28 13:42:15] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:42:15] [INFO ] Deduced a trap composed of 146 places in 160 ms of which 3 ms to minimize.
[2024-05-28 13:42:15] [INFO ] Deduced a trap composed of 124 places in 137 ms of which 2 ms to minimize.
[2024-05-28 13:42:15] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-28 13:42:16] [INFO ] Deduced a trap composed of 184 places in 122 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-05-28 13:42:22] [INFO ] Deduced a trap composed of 127 places in 120 ms of which 2 ms to minimize.
[2024-05-28 13:42:24] [INFO ] Deduced a trap composed of 114 places in 183 ms of which 3 ms to minimize.
[2024-05-28 13:42:24] [INFO ] Deduced a trap composed of 103 places in 167 ms of which 2 ms to minimize.
[2024-05-28 13:42:25] [INFO ] Deduced a trap composed of 33 places in 184 ms of which 3 ms to minimize.
[2024-05-28 13:42:25] [INFO ] Deduced a trap composed of 63 places in 165 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-05-28 13:42:28] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 2 ms to minimize.
[2024-05-28 13:42:28] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 316/980 variables, and 52 constraints, problems are : Problem set: 0 solved, 672 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/318 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 672 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-05-28 13:42:34] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/318 variables, 2/55 constraints. Problems are: Problem set: 66 solved, 606 unsolved
[2024-05-28 13:42:41] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 2 ms to minimize.
[2024-05-28 13:42:44] [INFO ] Deduced a trap composed of 46 places in 172 ms of which 2 ms to minimize.
[2024-05-28 13:42:45] [INFO ] Deduced a trap composed of 112 places in 140 ms of which 3 ms to minimize.
[2024-05-28 13:42:45] [INFO ] Deduced a trap composed of 117 places in 135 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 4/59 constraints. Problems are: Problem set: 66 solved, 606 unsolved
[2024-05-28 13:42:50] [INFO ] Deduced a trap composed of 114 places in 166 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 1/60 constraints. Problems are: Problem set: 66 solved, 606 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 318/980 variables, and 60 constraints, problems are : Problem set: 66 solved, 606 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/318 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/672 constraints, Known Traps: 22/22 constraints]
After SMT, in 40725ms problems are : Problem set: 66 solved, 606 unsolved
Search for dead transitions found 66 dead transitions in 40734ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
[2024-05-28 13:42:52] [INFO ] Flow matrix only has 596 transitions (discarded 12 similar events)
// Phase 1: matrix 596 rows 318 cols
[2024-05-28 13:42:52] [INFO ] Computed 38 invariants in 7 ms
[2024-05-28 13:42:52] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-28 13:42:52] [INFO ] Flow matrix only has 596 transitions (discarded 12 similar events)
[2024-05-28 13:42:52] [INFO ] Invariant cache hit.
[2024-05-28 13:42:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:42:54] [INFO ] Implicit Places using invariants and state equation in 2112 ms returned []
Implicit Place search using SMT with State Equation took 2360 ms to find 0 implicit places.
[2024-05-28 13:42:54] [INFO ] Redundant transitions in 13 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 318/462 places, 608/818 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 304 transition count 584
Applied a total of 12 rules in 22 ms. Remains 304 /318 variables (removed 14) and now considering 584/608 (removed 24) transitions.
[2024-05-28 13:42:54] [INFO ] Flow matrix only has 572 transitions (discarded 12 similar events)
// Phase 1: matrix 572 rows 304 cols
[2024-05-28 13:42:54] [INFO ] Computed 38 invariants in 7 ms
[2024-05-28 13:42:54] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-28 13:42:54] [INFO ] Flow matrix only has 572 transitions (discarded 12 similar events)
[2024-05-28 13:42:54] [INFO ] Invariant cache hit.
[2024-05-28 13:42:55] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:42:56] [INFO ] Implicit Places using invariants and state equation in 2033 ms returned []
Implicit Place search using SMT with State Equation took 2322 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 304/462 places, 584/818 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45498 ms. Remains : 304/462 places, 584/818 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-03
Product exploration explored 100000 steps with 53 reset in 298 ms.
Stack based approach found an accepted trace after 325 steps with 0 reset with depth 326 and stack size 326 in 1 ms.
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-03 finished in 45864 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) U !p1)))'
Support contains 38 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 812
Applied a total of 12 rules in 16 ms. Remains 456 /462 variables (removed 6) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 13:42:57] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2024-05-28 13:42:57] [INFO ] Computed 38 invariants in 8 ms
[2024-05-28 13:42:57] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:43:02] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:43:02] [INFO ] Deduced a trap composed of 64 places in 33 ms of which 1 ms to minimize.
[2024-05-28 13:43:02] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-05-28 13:43:02] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:43:02] [INFO ] Deduced a trap composed of 64 places in 37 ms of which 1 ms to minimize.
[2024-05-28 13:43:02] [INFO ] Deduced a trap composed of 240 places in 141 ms of which 2 ms to minimize.
[2024-05-28 13:43:02] [INFO ] Deduced a trap composed of 139 places in 177 ms of which 3 ms to minimize.
[2024-05-28 13:43:03] [INFO ] Deduced a trap composed of 64 places in 40 ms of which 1 ms to minimize.
[2024-05-28 13:43:03] [INFO ] Deduced a trap composed of 271 places in 210 ms of which 3 ms to minimize.
[2024-05-28 13:43:03] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 1 ms to minimize.
[2024-05-28 13:43:03] [INFO ] Deduced a trap composed of 265 places in 200 ms of which 3 ms to minimize.
[2024-05-28 13:43:06] [INFO ] Deduced a trap composed of 248 places in 183 ms of which 3 ms to minimize.
[2024-05-28 13:43:08] [INFO ] Deduced a trap composed of 223 places in 203 ms of which 3 ms to minimize.
[2024-05-28 13:43:09] [INFO ] Deduced a trap composed of 241 places in 180 ms of which 3 ms to minimize.
[2024-05-28 13:43:10] [INFO ] Deduced a trap composed of 110 places in 144 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:43:11] [INFO ] Deduced a trap composed of 262 places in 135 ms of which 2 ms to minimize.
[2024-05-28 13:43:12] [INFO ] Deduced a trap composed of 269 places in 149 ms of which 2 ms to minimize.
[2024-05-28 13:43:16] [INFO ] Deduced a trap composed of 59 places in 241 ms of which 3 ms to minimize.
[2024-05-28 13:43:17] [INFO ] Deduced a trap composed of 48 places in 224 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:43:22] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 2 ms to minimize.
[2024-05-28 13:43:24] [INFO ] Deduced a trap composed of 226 places in 205 ms of which 4 ms to minimize.
[2024-05-28 13:43:24] [INFO ] Deduced a trap composed of 275 places in 186 ms of which 3 ms to minimize.
[2024-05-28 13:43:24] [INFO ] Deduced a trap composed of 240 places in 192 ms of which 3 ms to minimize.
[2024-05-28 13:43:26] [INFO ] Deduced a trap composed of 241 places in 172 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:43:31] [INFO ] Deduced a trap composed of 289 places in 208 ms of which 4 ms to minimize.
[2024-05-28 13:43:31] [INFO ] Deduced a trap composed of 299 places in 179 ms of which 3 ms to minimize.
[2024-05-28 13:43:31] [INFO ] Deduced a trap composed of 276 places in 171 ms of which 3 ms to minimize.
[2024-05-28 13:43:31] [INFO ] Deduced a trap composed of 252 places in 177 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 64 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 28/28 constraints]
After SMT, in 40748ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40761ms
[2024-05-28 13:43:38] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:43:38] [INFO ] Invariant cache hit.
[2024-05-28 13:43:38] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-28 13:43:38] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:43:38] [INFO ] Invariant cache hit.
[2024-05-28 13:43:38] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:43:42] [INFO ] Implicit Places using invariants and state equation in 4450 ms returned []
Implicit Place search using SMT with State Equation took 4710 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2024-05-28 13:43:42] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:43:42] [INFO ] Invariant cache hit.
[2024-05-28 13:43:42] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:43:49] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 1 ms to minimize.
[2024-05-28 13:43:49] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 2 ms to minimize.
[2024-05-28 13:43:49] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 1 ms to minimize.
[2024-05-28 13:43:50] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-05-28 13:43:51] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 1 ms to minimize.
[2024-05-28 13:43:51] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-05-28 13:43:52] [INFO ] Deduced a trap composed of 270 places in 233 ms of which 2 ms to minimize.
[2024-05-28 13:43:53] [INFO ] Deduced a trap composed of 286 places in 213 ms of which 3 ms to minimize.
[2024-05-28 13:43:53] [INFO ] Deduced a trap composed of 256 places in 195 ms of which 2 ms to minimize.
[2024-05-28 13:43:53] [INFO ] Deduced a trap composed of 15 places in 318 ms of which 6 ms to minimize.
[2024-05-28 13:43:54] [INFO ] Deduced a trap composed of 268 places in 270 ms of which 4 ms to minimize.
[2024-05-28 13:43:54] [INFO ] Deduced a trap composed of 245 places in 248 ms of which 4 ms to minimize.
[2024-05-28 13:43:54] [INFO ] Deduced a trap composed of 241 places in 195 ms of which 3 ms to minimize.
[2024-05-28 13:43:54] [INFO ] Deduced a trap composed of 288 places in 207 ms of which 3 ms to minimize.
[2024-05-28 13:43:54] [INFO ] Deduced a trap composed of 232 places in 180 ms of which 2 ms to minimize.
[2024-05-28 13:43:55] [INFO ] Deduced a trap composed of 248 places in 209 ms of which 2 ms to minimize.
[2024-05-28 13:43:57] [INFO ] Deduced a trap composed of 42 places in 190 ms of which 3 ms to minimize.
[2024-05-28 13:43:57] [INFO ] Deduced a trap composed of 144 places in 260 ms of which 5 ms to minimize.
[2024-05-28 13:43:58] [INFO ] Deduced a trap composed of 302 places in 242 ms of which 2 ms to minimize.
[2024-05-28 13:43:59] [INFO ] Deduced a trap composed of 278 places in 194 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:43:59] [INFO ] Deduced a trap composed of 296 places in 166 ms of which 2 ms to minimize.
[2024-05-28 13:43:59] [INFO ] Deduced a trap composed of 249 places in 175 ms of which 3 ms to minimize.
[2024-05-28 13:43:59] [INFO ] Deduced a trap composed of 261 places in 176 ms of which 3 ms to minimize.
[2024-05-28 13:44:00] [INFO ] Deduced a trap composed of 247 places in 184 ms of which 3 ms to minimize.
[2024-05-28 13:44:06] [INFO ] Deduced a trap composed of 3 places in 235 ms of which 3 ms to minimize.
[2024-05-28 13:44:07] [INFO ] Deduced a trap composed of 242 places in 256 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 62 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 26/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:44:14] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:44:28] [INFO ] Deduced a trap composed of 244 places in 201 ms of which 4 ms to minimize.
[2024-05-28 13:44:28] [INFO ] Deduced a trap composed of 288 places in 221 ms of which 3 ms to minimize.
[2024-05-28 13:44:28] [INFO ] Deduced a trap composed of 222 places in 190 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/455 variables, 1/67 constraints. Problems are: Problem set: 36 solved, 774 unsolved
[2024-05-28 13:44:42] [INFO ] Deduced a trap composed of 320 places in 233 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 6)
(s1 4)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1256 variables, and 68 constraints, problems are : Problem set: 36 solved, 774 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 31/31 constraints]
After SMT, in 60822ms problems are : Problem set: 36 solved, 774 unsolved
Search for dead transitions found 36 dead transitions in 60835ms
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 : 456/462 places, 776/818 transitions.
Applied a total of 0 rules in 4 ms. Remains 456 /456 variables (removed 0) and now considering 776/776 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106334 ms. Remains : 456/462 places, 776/818 transitions.
Stuttering acceptance computed with spot in 123 ms :[p1, p1, true, (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 372 ms.
Product exploration explored 100000 steps with 50000 reset in 393 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 (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 30 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-05 finished in 107289 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 12 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 812
Applied a total of 12 rules in 9 ms. Remains 456 /462 variables (removed 6) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 13:44:44] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:44:44] [INFO ] Invariant cache hit.
[2024-05-28 13:44:44] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:44:50] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-05-28 13:44:51] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 2 ms to minimize.
[2024-05-28 13:44:51] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-05-28 13:44:51] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-05-28 13:44:52] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 2 ms to minimize.
[2024-05-28 13:44:52] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:44:54] [INFO ] Deduced a trap composed of 270 places in 226 ms of which 3 ms to minimize.
[2024-05-28 13:44:54] [INFO ] Deduced a trap composed of 286 places in 198 ms of which 3 ms to minimize.
[2024-05-28 13:44:54] [INFO ] Deduced a trap composed of 256 places in 227 ms of which 4 ms to minimize.
[2024-05-28 13:44:54] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 3 ms to minimize.
[2024-05-28 13:44:55] [INFO ] Deduced a trap composed of 268 places in 177 ms of which 2 ms to minimize.
[2024-05-28 13:44:55] [INFO ] Deduced a trap composed of 245 places in 212 ms of which 2 ms to minimize.
[2024-05-28 13:44:55] [INFO ] Deduced a trap composed of 241 places in 157 ms of which 2 ms to minimize.
[2024-05-28 13:44:55] [INFO ] Deduced a trap composed of 288 places in 197 ms of which 2 ms to minimize.
[2024-05-28 13:44:55] [INFO ] Deduced a trap composed of 232 places in 185 ms of which 3 ms to minimize.
[2024-05-28 13:44:56] [INFO ] Deduced a trap composed of 248 places in 183 ms of which 3 ms to minimize.
[2024-05-28 13:44:58] [INFO ] Deduced a trap composed of 42 places in 221 ms of which 3 ms to minimize.
[2024-05-28 13:44:58] [INFO ] Deduced a trap composed of 144 places in 206 ms of which 3 ms to minimize.
[2024-05-28 13:44:59] [INFO ] Deduced a trap composed of 302 places in 241 ms of which 3 ms to minimize.
[2024-05-28 13:45:00] [INFO ] Deduced a trap composed of 278 places in 217 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:45:00] [INFO ] Deduced a trap composed of 296 places in 227 ms of which 3 ms to minimize.
[2024-05-28 13:45:00] [INFO ] Deduced a trap composed of 249 places in 192 ms of which 3 ms to minimize.
[2024-05-28 13:45:01] [INFO ] Deduced a trap composed of 261 places in 213 ms of which 4 ms to minimize.
[2024-05-28 13:45:01] [INFO ] Deduced a trap composed of 247 places in 205 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.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 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 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 9.0)
(s123 1.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 60 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:45:09] [INFO ] Deduced a trap composed of 297 places in 138 ms of which 2 ms to minimize.
[2024-05-28 13:45:12] [INFO ] Deduced a trap composed of 276 places in 134 ms of which 2 ms to minimize.
[2024-05-28 13:45:13] [INFO ] Deduced a trap composed of 246 places in 113 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:45:19] [INFO ] Deduced a trap composed of 239 places in 173 ms of which 2 ms to minimize.
[2024-05-28 13:45:19] [INFO ] Deduced a trap composed of 129 places in 114 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 65 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 29/29 constraints]
After SMT, in 40920ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40931ms
[2024-05-28 13:45:25] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:45:25] [INFO ] Invariant cache hit.
[2024-05-28 13:45:25] [INFO ] Implicit Places using invariants in 339 ms returned []
[2024-05-28 13:45:25] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:45:25] [INFO ] Invariant cache hit.
[2024-05-28 13:45:26] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:45:29] [INFO ] Implicit Places using invariants and state equation in 4101 ms returned []
Implicit Place search using SMT with State Equation took 4446 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2024-05-28 13:45:29] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:45:29] [INFO ] Invariant cache hit.
[2024-05-28 13:45:29] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:45:35] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 2 ms to minimize.
[2024-05-28 13:45:35] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 1 ms to minimize.
[2024-05-28 13:45:35] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:45:35] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:45:36] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:45:36] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 0 ms to minimize.
[2024-05-28 13:45:38] [INFO ] Deduced a trap composed of 270 places in 144 ms of which 3 ms to minimize.
[2024-05-28 13:45:38] [INFO ] Deduced a trap composed of 286 places in 205 ms of which 3 ms to minimize.
[2024-05-28 13:45:38] [INFO ] Deduced a trap composed of 256 places in 167 ms of which 3 ms to minimize.
[2024-05-28 13:45:38] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 2 ms to minimize.
[2024-05-28 13:45:38] [INFO ] Deduced a trap composed of 268 places in 222 ms of which 4 ms to minimize.
[2024-05-28 13:45:39] [INFO ] Deduced a trap composed of 245 places in 152 ms of which 2 ms to minimize.
[2024-05-28 13:45:39] [INFO ] Deduced a trap composed of 241 places in 167 ms of which 3 ms to minimize.
[2024-05-28 13:45:39] [INFO ] Deduced a trap composed of 288 places in 215 ms of which 4 ms to minimize.
[2024-05-28 13:45:39] [INFO ] Deduced a trap composed of 232 places in 140 ms of which 2 ms to minimize.
[2024-05-28 13:45:39] [INFO ] Deduced a trap composed of 248 places in 222 ms of which 3 ms to minimize.
[2024-05-28 13:45:41] [INFO ] Deduced a trap composed of 42 places in 174 ms of which 3 ms to minimize.
[2024-05-28 13:45:42] [INFO ] Deduced a trap composed of 144 places in 198 ms of which 2 ms to minimize.
[2024-05-28 13:45:43] [INFO ] Deduced a trap composed of 302 places in 138 ms of which 3 ms to minimize.
[2024-05-28 13:45:43] [INFO ] Deduced a trap composed of 278 places in 195 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:45:43] [INFO ] Deduced a trap composed of 296 places in 201 ms of which 3 ms to minimize.
[2024-05-28 13:45:44] [INFO ] Deduced a trap composed of 249 places in 186 ms of which 3 ms to minimize.
[2024-05-28 13:45:44] [INFO ] Deduced a trap composed of 261 places in 210 ms of which 3 ms to minimize.
[2024-05-28 13:45:44] [INFO ] Deduced a trap composed of 247 places in 203 ms of which 4 ms to minimize.
[2024-05-28 13:45:49] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 2 ms to minimize.
[2024-05-28 13:45:50] [INFO ] Deduced a trap composed of 242 places in 149 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:45:58] [INFO ] Deduced a trap composed of 78 places in 140 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 1.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 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 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 9.0)
(s123 0.0)
(s124 1.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 7.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 63 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 27/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:46:07] [INFO ] Deduced a trap composed of 222 places in 208 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/455 variables, 1/65 constraints. Problems are: Problem set: 36 solved, 774 unsolved
[2024-05-28 13:46:26] [INFO ] Deduced a trap composed of 145 places in 147 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 1/66 constraints. Problems are: Problem set: 36 solved, 774 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1256 variables, and 66 constraints, problems are : Problem set: 36 solved, 774 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 29/29 constraints]
After SMT, in 60722ms problems are : Problem set: 36 solved, 774 unsolved
Search for dead transitions found 36 dead transitions in 60737ms
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 : 456/462 places, 776/818 transitions.
Applied a total of 0 rules in 8 ms. Remains 456 /456 variables (removed 0) and now considering 776/776 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106139 ms. Remains : 456/462 places, 776/818 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-06
Product exploration explored 100000 steps with 2885 reset in 287 ms.
Product exploration explored 100000 steps with 2877 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 139 steps (0 resets) in 11 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 13:46:31] [INFO ] Flow matrix only has 764 transitions (discarded 12 similar events)
// Phase 1: matrix 764 rows 456 cols
[2024-05-28 13:46:32] [INFO ] Computed 38 invariants in 9 ms
[2024-05-28 13:46:32] [INFO ] [Real]Absence check using 14 positive place invariants in 31 ms returned sat
[2024-05-28 13:46:32] [INFO ] [Real]Absence check using 14 positive and 24 generalized place invariants in 54 ms returned sat
[2024-05-28 13:46:33] [INFO ] [Real]Absence check using state equation in 960 ms returned sat
[2024-05-28 13:46:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:46:33] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2024-05-28 13:46:33] [INFO ] [Nat]Absence check using 14 positive and 24 generalized place invariants in 52 ms returned sat
[2024-05-28 13:46:37] [INFO ] [Nat]Absence check using state equation in 4040 ms returned sat
[2024-05-28 13:46:37] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:46:38] [INFO ] [Nat]Added 72 Read/Feed constraints in 338 ms returned sat
[2024-05-28 13:46:38] [INFO ] Deduced a trap composed of 121 places in 272 ms of which 5 ms to minimize.
[2024-05-28 13:46:38] [INFO ] Deduced a trap composed of 64 places in 182 ms of which 4 ms to minimize.
[2024-05-28 13:46:39] [INFO ] Deduced a trap composed of 64 places in 167 ms of which 2 ms to minimize.
[2024-05-28 13:46:39] [INFO ] Deduced a trap composed of 64 places in 141 ms of which 1 ms to minimize.
[2024-05-28 13:46:39] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 1 ms to minimize.
[2024-05-28 13:46:39] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-05-28 13:46:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1529 ms
[2024-05-28 13:46:39] [INFO ] Computed and/alt/rep : 570/2085/564 causal constraints (skipped 198 transitions) in 79 ms.
[2024-05-28 13:46:46] [INFO ] Added : 402 causal constraints over 81 iterations in 6733 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 12 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 776/776 transitions.
Applied a total of 0 rules in 9 ms. Remains 456 /456 variables (removed 0) and now considering 776/776 (removed 0) transitions.
Running 774 sub problems to find dead transitions.
[2024-05-28 13:46:46] [INFO ] Flow matrix only has 764 transitions (discarded 12 similar events)
[2024-05-28 13:46:46] [INFO ] Invariant cache hit.
[2024-05-28 13:46:46] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 774 unsolved
[2024-05-28 13:46:52] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-05-28 13:46:52] [INFO ] Deduced a trap composed of 243 places in 263 ms of which 3 ms to minimize.
[2024-05-28 13:46:52] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-05-28 13:46:54] [INFO ] Deduced a trap composed of 65 places in 169 ms of which 2 ms to minimize.
[2024-05-28 13:46:54] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 2 ms to minimize.
[2024-05-28 13:46:54] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-05-28 13:46:55] [INFO ] Deduced a trap composed of 230 places in 160 ms of which 3 ms to minimize.
[2024-05-28 13:46:55] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-05-28 13:46:55] [INFO ] Deduced a trap composed of 64 places in 111 ms of which 1 ms to minimize.
[2024-05-28 13:46:56] [INFO ] Deduced a trap composed of 263 places in 226 ms of which 3 ms to minimize.
[2024-05-28 13:46:56] [INFO ] Deduced a trap composed of 288 places in 234 ms of which 3 ms to minimize.
[2024-05-28 13:46:56] [INFO ] Deduced a trap composed of 246 places in 187 ms of which 3 ms to minimize.
[2024-05-28 13:46:57] [INFO ] Deduced a trap composed of 249 places in 191 ms of which 3 ms to minimize.
[2024-05-28 13:46:57] [INFO ] Deduced a trap composed of 249 places in 203 ms of which 4 ms to minimize.
[2024-05-28 13:46:57] [INFO ] Deduced a trap composed of 245 places in 177 ms of which 3 ms to minimize.
[2024-05-28 13:46:57] [INFO ] Deduced a trap composed of 246 places in 173 ms of which 3 ms to minimize.
[2024-05-28 13:46:57] [INFO ] Deduced a trap composed of 213 places in 169 ms of which 3 ms to minimize.
[2024-05-28 13:46:58] [INFO ] Deduced a trap composed of 250 places in 171 ms of which 3 ms to minimize.
[2024-05-28 13:46:58] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 2 ms to minimize.
[2024-05-28 13:46:58] [INFO ] Deduced a trap composed of 244 places in 191 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 774 unsolved
[2024-05-28 13:46:59] [INFO ] Deduced a trap composed of 145 places in 159 ms of which 3 ms to minimize.
[2024-05-28 13:46:59] [INFO ] Deduced a trap composed of 222 places in 211 ms of which 3 ms to minimize.
[2024-05-28 13:46:59] [INFO ] Deduced a trap composed of 271 places in 196 ms of which 3 ms to minimize.
[2024-05-28 13:47:00] [INFO ] Deduced a trap composed of 251 places in 210 ms of which 4 ms to minimize.
[2024-05-28 13:47:00] [INFO ] Deduced a trap composed of 283 places in 281 ms of which 4 ms to minimize.
[2024-05-28 13:47:00] [INFO ] Deduced a trap composed of 260 places in 217 ms of which 4 ms to minimize.
[2024-05-28 13:47:01] [INFO ] Deduced a trap composed of 250 places in 203 ms of which 3 ms to minimize.
[2024-05-28 13:47:01] [INFO ] Deduced a trap composed of 256 places in 224 ms of which 3 ms to minimize.
[2024-05-28 13:47:01] [INFO ] Deduced a trap composed of 241 places in 187 ms of which 3 ms to minimize.
[2024-05-28 13:47:03] [INFO ] Deduced a trap composed of 278 places in 210 ms of which 3 ms to minimize.
[2024-05-28 13:47:05] [INFO ] Deduced a trap composed of 234 places in 188 ms of which 3 ms to minimize.
[2024-05-28 13:47:05] [INFO ] Deduced a trap composed of 242 places in 160 ms of which 3 ms to minimize.
[2024-05-28 13:47:05] [INFO ] Deduced a trap composed of 241 places in 166 ms of which 3 ms to minimize.
[2024-05-28 13:47:07] [INFO ] Deduced a trap composed of 263 places in 275 ms of which 3 ms to minimize.
SMT process timed out in 20792ms, After SMT, problems are : Problem set: 0 solved, 774 unsolved
Search for dead transitions found 0 dead transitions in 20808ms
[2024-05-28 13:47:07] [INFO ] Flow matrix only has 764 transitions (discarded 12 similar events)
[2024-05-28 13:47:07] [INFO ] Invariant cache hit.
[2024-05-28 13:47:07] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-05-28 13:47:07] [INFO ] Flow matrix only has 764 transitions (discarded 12 similar events)
[2024-05-28 13:47:07] [INFO ] Invariant cache hit.
[2024-05-28 13:47:07] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:47:11] [INFO ] Implicit Places using invariants and state equation in 4140 ms returned []
Implicit Place search using SMT with State Equation took 4448 ms to find 0 implicit places.
Running 774 sub problems to find dead transitions.
[2024-05-28 13:47:11] [INFO ] Flow matrix only has 764 transitions (discarded 12 similar events)
[2024-05-28 13:47:11] [INFO ] Invariant cache hit.
[2024-05-28 13:47:11] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 774 unsolved
[2024-05-28 13:47:17] [INFO ] Deduced a trap composed of 64 places in 104 ms of which 2 ms to minimize.
[2024-05-28 13:47:17] [INFO ] Deduced a trap composed of 243 places in 230 ms of which 4 ms to minimize.
[2024-05-28 13:47:17] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-05-28 13:47:18] [INFO ] Deduced a trap composed of 65 places in 153 ms of which 2 ms to minimize.
[2024-05-28 13:47:19] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 2 ms to minimize.
[2024-05-28 13:47:19] [INFO ] Deduced a trap composed of 64 places in 38 ms of which 1 ms to minimize.
[2024-05-28 13:47:19] [INFO ] Deduced a trap composed of 230 places in 239 ms of which 3 ms to minimize.
[2024-05-28 13:47:20] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-05-28 13:47:20] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-05-28 13:47:21] [INFO ] Deduced a trap composed of 263 places in 223 ms of which 3 ms to minimize.
[2024-05-28 13:47:21] [INFO ] Deduced a trap composed of 288 places in 189 ms of which 3 ms to minimize.
[2024-05-28 13:47:21] [INFO ] Deduced a trap composed of 246 places in 221 ms of which 2 ms to minimize.
[2024-05-28 13:47:22] [INFO ] Deduced a trap composed of 249 places in 206 ms of which 2 ms to minimize.
[2024-05-28 13:47:22] [INFO ] Deduced a trap composed of 249 places in 194 ms of which 3 ms to minimize.
[2024-05-28 13:47:22] [INFO ] Deduced a trap composed of 245 places in 181 ms of which 3 ms to minimize.
[2024-05-28 13:47:22] [INFO ] Deduced a trap composed of 246 places in 183 ms of which 2 ms to minimize.
[2024-05-28 13:47:22] [INFO ] Deduced a trap composed of 213 places in 179 ms of which 3 ms to minimize.
[2024-05-28 13:47:23] [INFO ] Deduced a trap composed of 250 places in 178 ms of which 3 ms to minimize.
[2024-05-28 13:47:23] [INFO ] Deduced a trap composed of 15 places in 201 ms of which 2 ms to minimize.
[2024-05-28 13:47:23] [INFO ] Deduced a trap composed of 244 places in 209 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 774 unsolved
[2024-05-28 13:47:24] [INFO ] Deduced a trap composed of 145 places in 180 ms of which 3 ms to minimize.
[2024-05-28 13:47:24] [INFO ] Deduced a trap composed of 222 places in 232 ms of which 4 ms to minimize.
[2024-05-28 13:47:24] [INFO ] Deduced a trap composed of 271 places in 207 ms of which 3 ms to minimize.
[2024-05-28 13:47:25] [INFO ] Deduced a trap composed of 251 places in 186 ms of which 3 ms to minimize.
[2024-05-28 13:47:25] [INFO ] Deduced a trap composed of 283 places in 171 ms of which 3 ms to minimize.
[2024-05-28 13:47:25] [INFO ] Deduced a trap composed of 260 places in 139 ms of which 3 ms to minimize.
[2024-05-28 13:47:25] [INFO ] Deduced a trap composed of 250 places in 140 ms of which 2 ms to minimize.
[2024-05-28 13:47:25] [INFO ] Deduced a trap composed of 256 places in 150 ms of which 2 ms to minimize.
[2024-05-28 13:47:26] [INFO ] Deduced a trap composed of 241 places in 158 ms of which 3 ms to minimize.
[2024-05-28 13:47:26] [INFO ] Deduced a trap composed of 278 places in 139 ms of which 2 ms to minimize.
[2024-05-28 13:47:29] [INFO ] Deduced a trap composed of 234 places in 215 ms of which 3 ms to minimize.
[2024-05-28 13:47:29] [INFO ] Deduced a trap composed of 242 places in 194 ms of which 7 ms to minimize.
[2024-05-28 13:47:29] [INFO ] Deduced a trap composed of 241 places in 170 ms of which 3 ms to minimize.
[2024-05-28 13:47:31] [INFO ] Deduced a trap composed of 263 places in 157 ms of which 3 ms to minimize.
[2024-05-28 13:47:31] [INFO ] Deduced a trap composed of 265 places in 234 ms of which 2 ms to minimize.
[2024-05-28 13:47:31] [INFO ] Deduced a trap composed of 251 places in 182 ms of which 2 ms to minimize.
[2024-05-28 13:47:33] [INFO ] Deduced a trap composed of 246 places in 114 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 17/73 constraints. Problems are: Problem set: 0 solved, 774 unsolved
[2024-05-28 13:47:39] [INFO ] Deduced a trap composed of 280 places in 180 ms of which 3 ms to minimize.
[2024-05-28 13:47:40] [INFO ] Deduced a trap composed of 287 places in 184 ms of which 3 ms to minimize.
[2024-05-28 13:47:40] [INFO ] Deduced a trap composed of 298 places in 162 ms of which 3 ms to minimize.
[2024-05-28 13:47:41] [INFO ] Deduced a trap composed of 282 places in 218 ms of which 2 ms to minimize.
[2024-05-28 13:47:42] [INFO ] Deduced a trap composed of 282 places in 189 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1220 variables, and 78 constraints, problems are : Problem set: 0 solved, 774 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 774/774 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 774 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 42/78 constraints. Problems are: Problem set: 0 solved, 774 unsolved
[2024-05-28 13:47:43] [INFO ] Deduced a trap composed of 271 places in 201 ms of which 3 ms to minimize.
[2024-05-28 13:47:43] [INFO ] Deduced a trap composed of 261 places in 153 ms of which 2 ms to minimize.
[2024-05-28 13:47:44] [INFO ] Deduced a trap composed of 263 places in 167 ms of which 2 ms to minimize.
[2024-05-28 13:47:44] [INFO ] Deduced a trap composed of 240 places in 162 ms of which 3 ms to minimize.
[2024-05-28 13:47:45] [INFO ] Deduced a trap composed of 297 places in 219 ms of which 2 ms to minimize.
[2024-05-28 13:47:45] [INFO ] Deduced a trap composed of 246 places in 183 ms of which 3 ms to minimize.
[2024-05-28 13:48:09] [INFO ] Deduced a trap composed of 242 places in 158 ms of which 3 ms to minimize.
[2024-05-28 13:48:10] [INFO ] Deduced a trap composed of 225 places in 217 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1220 variables, and 86 constraints, problems are : Problem set: 0 solved, 774 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/774 constraints, Known Traps: 50/50 constraints]
After SMT, in 60667ms problems are : Problem set: 0 solved, 774 unsolved
Search for dead transitions found 0 dead transitions in 60678ms
Finished structural reductions in LTL mode , in 1 iterations and 85951 ms. Remains : 456/456 places, 776/776 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 (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 153 steps (0 resets) in 7 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 13:48:13] [INFO ] Flow matrix only has 764 transitions (discarded 12 similar events)
[2024-05-28 13:48:13] [INFO ] Invariant cache hit.
[2024-05-28 13:48:13] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2024-05-28 13:48:13] [INFO ] [Real]Absence check using 14 positive and 24 generalized place invariants in 72 ms returned sat
[2024-05-28 13:48:14] [INFO ] [Real]Absence check using state equation in 784 ms returned sat
[2024-05-28 13:48:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:48:14] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2024-05-28 13:48:14] [INFO ] [Nat]Absence check using 14 positive and 24 generalized place invariants in 34 ms returned sat
[2024-05-28 13:48:16] [INFO ] [Nat]Absence check using state equation in 1294 ms returned sat
[2024-05-28 13:48:16] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:48:17] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 13:48:19] [INFO ] [Nat]Added 72 Read/Feed constraints in 3013 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2880 reset in 254 ms.
Product exploration explored 100000 steps with 2881 reset in 223 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 12 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 776/776 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 456 transition count 776
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 42 Pre rules applied. Total rules applied 36 place count 456 transition count 806
Deduced a syphon composed of 78 places in 1 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 78 place count 456 transition count 806
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 90 place count 444 transition count 794
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 102 place count 444 transition count 794
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 114 places in 0 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 150 place count 444 transition count 794
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 174 place count 420 transition count 770
Deduced a syphon composed of 96 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 198 place count 420 transition count 770
Deduced a syphon composed of 96 places in 1 ms
Applied a total of 198 rules in 82 ms. Remains 420 /456 variables (removed 36) and now considering 770/776 (removed 6) transitions.
Running 768 sub problems to find dead transitions.
[2024-05-28 13:48:20] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
// Phase 1: matrix 758 rows 420 cols
[2024-05-28 13:48:20] [INFO ] Computed 38 invariants in 17 ms
[2024-05-28 13:48:20] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 768 unsolved
[2024-05-28 13:48:25] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 2 ms to minimize.
[2024-05-28 13:48:25] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 2 ms to minimize.
[2024-05-28 13:48:25] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:48:25] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 0 ms to minimize.
[2024-05-28 13:48:25] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-05-28 13:48:25] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 0 ms to minimize.
[2024-05-28 13:48:26] [INFO ] Deduced a trap composed of 133 places in 155 ms of which 3 ms to minimize.
[2024-05-28 13:48:26] [INFO ] Deduced a trap composed of 122 places in 166 ms of which 2 ms to minimize.
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
[2024-05-28 13:48:28] [INFO ] Deduced a trap composed of 100 places in 146 ms of which 2 ms to minimize.
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
[2024-05-28 13:48:30] [INFO ] Deduced a trap composed of 124 places in 234 ms of which 3 ms to minimize.
[2024-05-28 13:48:30] [INFO ] Deduced a trap composed of 15 places in 212 ms of which 3 ms to minimize.
[2024-05-28 13:48:30] [INFO ] Deduced a trap composed of 115 places in 232 ms of which 3 ms to minimize.
Problem TDEAD716 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD757 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 12/48 constraints. Problems are: Problem set: 114 solved, 654 unsolved
[2024-05-28 13:48:32] [INFO ] Deduced a trap composed of 133 places in 212 ms of which 3 ms to minimize.
[2024-05-28 13:48:32] [INFO ] Deduced a trap composed of 126 places in 187 ms of which 3 ms to minimize.
[2024-05-28 13:48:32] [INFO ] Deduced a trap composed of 122 places in 263 ms of which 3 ms to minimize.
[2024-05-28 13:48:32] [INFO ] Deduced a trap composed of 131 places in 191 ms of which 3 ms to minimize.
[2024-05-28 13:48:33] [INFO ] Deduced a trap composed of 116 places in 181 ms of which 5 ms to minimize.
[2024-05-28 13:48:37] [INFO ] Deduced a trap composed of 110 places in 154 ms of which 2 ms to minimize.
[2024-05-28 13:48:37] [INFO ] Deduced a trap composed of 3 places in 195 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 7/55 constraints. Problems are: Problem set: 114 solved, 654 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1178 variables, and 55 constraints, problems are : Problem set: 114 solved, 654 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/420 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 768/768 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 114 solved, 654 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 9/9 constraints. Problems are: Problem set: 114 solved, 654 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/334 variables, 10/19 constraints. Problems are: Problem set: 114 solved, 654 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 19/38 constraints. Problems are: Problem set: 114 solved, 654 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/334 variables, 0/38 constraints. Problems are: Problem set: 114 solved, 654 unsolved
At refinement iteration 4 (OVERLAPS) 37/371 variables, 6/44 constraints. Problems are: Problem set: 114 solved, 654 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 3/47 constraints. Problems are: Problem set: 114 solved, 654 unsolved
[2024-05-28 13:48:45] [INFO ] Deduced a trap composed of 106 places in 140 ms of which 2 ms to minimize.
[2024-05-28 13:48:45] [INFO ] Deduced a trap composed of 105 places in 125 ms of which 2 ms to minimize.
[2024-05-28 13:48:45] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 2 ms to minimize.
[2024-05-28 13:48:45] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 2 ms to minimize.
[2024-05-28 13:48:45] [INFO ] Deduced a trap composed of 87 places in 171 ms of which 3 ms to minimize.
[2024-05-28 13:48:46] [INFO ] Deduced a trap composed of 80 places in 168 ms of which 2 ms to minimize.
[2024-05-28 13:48:46] [INFO ] Deduced a trap composed of 56 places in 124 ms of which 2 ms to minimize.
[2024-05-28 13:48:46] [INFO ] Deduced a trap composed of 56 places in 119 ms of which 2 ms to minimize.
[2024-05-28 13:48:46] [INFO ] Deduced a trap composed of 56 places in 137 ms of which 2 ms to minimize.
[2024-05-28 13:48:46] [INFO ] Deduced a trap composed of 74 places in 144 ms of which 2 ms to minimize.
[2024-05-28 13:48:47] [INFO ] Deduced a trap composed of 92 places in 138 ms of which 2 ms to minimize.
[2024-05-28 13:48:47] [INFO ] Deduced a trap composed of 110 places in 124 ms of which 2 ms to minimize.
[2024-05-28 13:48:47] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-28 13:48:47] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 14/61 constraints. Problems are: Problem set: 114 solved, 654 unsolved
[2024-05-28 13:48:53] [INFO ] Deduced a trap composed of 82 places in 151 ms of which 2 ms to minimize.
[2024-05-28 13:48:53] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 2 ms to minimize.
[2024-05-28 13:48:54] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
[2024-05-28 13:48:54] [INFO ] Deduced a trap composed of 97 places in 94 ms of which 1 ms to minimize.
[2024-05-28 13:48:54] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 1 ms to minimize.
[2024-05-28 13:48:55] [INFO ] Deduced a trap composed of 105 places in 84 ms of which 2 ms to minimize.
[2024-05-28 13:48:55] [INFO ] Deduced a trap composed of 92 places in 78 ms of which 1 ms to minimize.
[2024-05-28 13:48:56] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 2 ms to minimize.
[2024-05-28 13:48:56] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 9/70 constraints. Problems are: Problem set: 114 solved, 654 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 371/1178 variables, and 70 constraints, problems are : Problem set: 114 solved, 654 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 13/23 constraints, State Equation: 0/420 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/768 constraints, Known Traps: 42/42 constraints]
After SMT, in 40642ms problems are : Problem set: 114 solved, 654 unsolved
Search for dead transitions found 114 dead transitions in 40651ms
Found 114 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 114 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 114 transitions.
[2024-05-28 13:49:00] [INFO ] Redundant transitions in 3 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 420/456 places, 656/776 transitions.
Graph (complete) has 1942 edges and 420 vertex of which 336 are kept as prefixes of interest. Removing 84 places using SCC suffix rule.1 ms
Discarding 84 places :
Also discarding 0 output transitions
Deduced a syphon composed of 12 places in 1 ms
Applied a total of 1 rules in 12 ms. Remains 336 /420 variables (removed 84) and now considering 656/656 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 336/456 places, 656/776 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 40759 ms. Remains : 336/456 places, 656/776 transitions.
Built C files in :
/tmp/ltsmin3301799712426123494
[2024-05-28 13:49:00] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3301799712426123494
Running compilation step : cd /tmp/ltsmin3301799712426123494;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1375 ms.
Running link step : cd /tmp/ltsmin3301799712426123494;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin3301799712426123494;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9462544028567036010.hoa' '--buchi-type=spotba'
LTSmin run took 3523 ms.
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-06 finished in 261416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 31 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 812
Applied a total of 12 rules in 8 ms. Remains 456 /462 variables (removed 6) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 13:49:05] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2024-05-28 13:49:05] [INFO ] Computed 38 invariants in 8 ms
[2024-05-28 13:49:05] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:49:11] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 1 ms to minimize.
[2024-05-28 13:49:11] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-05-28 13:49:11] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 2 ms to minimize.
[2024-05-28 13:49:11] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-28 13:49:11] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 2 ms to minimize.
[2024-05-28 13:49:11] [INFO ] Deduced a trap composed of 240 places in 236 ms of which 4 ms to minimize.
[2024-05-28 13:49:12] [INFO ] Deduced a trap composed of 139 places in 219 ms of which 3 ms to minimize.
[2024-05-28 13:49:12] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-05-28 13:49:12] [INFO ] Deduced a trap composed of 271 places in 223 ms of which 4 ms to minimize.
[2024-05-28 13:49:13] [INFO ] Deduced a trap composed of 55 places in 140 ms of which 4 ms to minimize.
[2024-05-28 13:49:13] [INFO ] Deduced a trap composed of 265 places in 242 ms of which 3 ms to minimize.
[2024-05-28 13:49:17] [INFO ] Deduced a trap composed of 248 places in 258 ms of which 4 ms to minimize.
[2024-05-28 13:49:18] [INFO ] Deduced a trap composed of 223 places in 222 ms of which 3 ms to minimize.
[2024-05-28 13:49:19] [INFO ] Deduced a trap composed of 241 places in 175 ms of which 3 ms to minimize.
[2024-05-28 13:49:20] [INFO ] Deduced a trap composed of 110 places in 201 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:49:22] [INFO ] Deduced a trap composed of 262 places in 198 ms of which 3 ms to minimize.
[2024-05-28 13:49:22] [INFO ] Deduced a trap composed of 269 places in 200 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 53 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:49:30] [INFO ] Deduced a trap composed of 309 places in 170 ms of which 3 ms to minimize.
[2024-05-28 13:49:30] [INFO ] Deduced a trap composed of 298 places in 185 ms of which 2 ms to minimize.
[2024-05-28 13:49:31] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
[2024-05-28 13:49:35] [INFO ] Deduced a trap composed of 243 places in 229 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:49:45] [INFO ] Deduced a trap composed of 242 places in 187 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 58 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 22/22 constraints]
After SMT, in 40653ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40660ms
[2024-05-28 13:49:46] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:49:46] [INFO ] Invariant cache hit.
[2024-05-28 13:49:46] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-28 13:49:46] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:49:46] [INFO ] Invariant cache hit.
[2024-05-28 13:49:47] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:49:51] [INFO ] Implicit Places using invariants and state equation in 5018 ms returned []
Implicit Place search using SMT with State Equation took 5351 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2024-05-28 13:49:51] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:49:51] [INFO ] Invariant cache hit.
[2024-05-28 13:49:51] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:49:57] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-05-28 13:49:57] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-05-28 13:49:58] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:49:58] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 2 ms to minimize.
[2024-05-28 13:49:58] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-05-28 13:49:58] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 0 ms to minimize.
[2024-05-28 13:50:00] [INFO ] Deduced a trap composed of 270 places in 219 ms of which 3 ms to minimize.
[2024-05-28 13:50:00] [INFO ] Deduced a trap composed of 286 places in 187 ms of which 3 ms to minimize.
[2024-05-28 13:50:01] [INFO ] Deduced a trap composed of 256 places in 167 ms of which 2 ms to minimize.
[2024-05-28 13:50:01] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 3 ms to minimize.
[2024-05-28 13:50:01] [INFO ] Deduced a trap composed of 268 places in 200 ms of which 5 ms to minimize.
[2024-05-28 13:50:01] [INFO ] Deduced a trap composed of 245 places in 216 ms of which 3 ms to minimize.
[2024-05-28 13:50:01] [INFO ] Deduced a trap composed of 241 places in 193 ms of which 3 ms to minimize.
[2024-05-28 13:50:02] [INFO ] Deduced a trap composed of 288 places in 161 ms of which 2 ms to minimize.
[2024-05-28 13:50:02] [INFO ] Deduced a trap composed of 232 places in 155 ms of which 3 ms to minimize.
[2024-05-28 13:50:02] [INFO ] Deduced a trap composed of 248 places in 158 ms of which 3 ms to minimize.
[2024-05-28 13:50:04] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 2 ms to minimize.
[2024-05-28 13:50:05] [INFO ] Deduced a trap composed of 144 places in 217 ms of which 3 ms to minimize.
[2024-05-28 13:50:06] [INFO ] Deduced a trap composed of 302 places in 241 ms of which 3 ms to minimize.
[2024-05-28 13:50:06] [INFO ] Deduced a trap composed of 278 places in 210 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:50:06] [INFO ] Deduced a trap composed of 296 places in 216 ms of which 3 ms to minimize.
[2024-05-28 13:50:07] [INFO ] Deduced a trap composed of 249 places in 190 ms of which 4 ms to minimize.
[2024-05-28 13:50:07] [INFO ] Deduced a trap composed of 261 places in 203 ms of which 4 ms to minimize.
[2024-05-28 13:50:07] [INFO ] Deduced a trap composed of 247 places in 214 ms of which 3 ms to minimize.
[2024-05-28 13:50:13] [INFO ] Deduced a trap composed of 3 places in 206 ms of which 4 ms to minimize.
[2024-05-28 13:50:14] [INFO ] Deduced a trap composed of 242 places in 231 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:50:22] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 63 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 27/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:50:30] [INFO ] Deduced a trap composed of 222 places in 242 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/455 variables, 1/65 constraints. Problems are: Problem set: 36 solved, 774 unsolved
[2024-05-28 13:50:49] [INFO ] Deduced a trap composed of 145 places in 171 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 1/66 constraints. Problems are: Problem set: 36 solved, 774 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1256 variables, and 66 constraints, problems are : Problem set: 36 solved, 774 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 29/29 constraints]
After SMT, in 60874ms problems are : Problem set: 36 solved, 774 unsolved
Search for dead transitions found 36 dead transitions in 60892ms
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 : 456/462 places, 776/818 transitions.
Applied a total of 0 rules in 8 ms. Remains 456 /456 variables (removed 0) and now considering 776/776 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106927 ms. Remains : 456/462 places, 776/818 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-07
Product exploration explored 100000 steps with 25000 reset in 221 ms.
Product exploration explored 100000 steps with 25000 reset in 233 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]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 21 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 138 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 31 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 776/776 transitions.
Applied a total of 0 rules in 5 ms. Remains 456 /456 variables (removed 0) and now considering 776/776 (removed 0) transitions.
Running 774 sub problems to find dead transitions.
[2024-05-28 13:50:54] [INFO ] Flow matrix only has 764 transitions (discarded 12 similar events)
// Phase 1: matrix 764 rows 456 cols
[2024-05-28 13:50:54] [INFO ] Computed 38 invariants in 9 ms
[2024-05-28 13:50:54] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 774 unsolved
[2024-05-28 13:51:00] [INFO ] Deduced a trap composed of 224 places in 208 ms of which 4 ms to minimize.
[2024-05-28 13:51:00] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-05-28 13:51:00] [INFO ] Deduced a trap composed of 61 places in 138 ms of which 2 ms to minimize.
[2024-05-28 13:51:01] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 1 ms to minimize.
[2024-05-28 13:51:01] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 1 ms to minimize.
[2024-05-28 13:51:01] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-05-28 13:51:01] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-05-28 13:51:02] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-05-28 13:51:03] [INFO ] Deduced a trap composed of 259 places in 237 ms of which 4 ms to minimize.
[2024-05-28 13:51:03] [INFO ] Deduced a trap composed of 238 places in 260 ms of which 3 ms to minimize.
[2024-05-28 13:51:03] [INFO ] Deduced a trap composed of 15 places in 216 ms of which 3 ms to minimize.
[2024-05-28 13:51:05] [INFO ] Deduced a trap composed of 270 places in 195 ms of which 3 ms to minimize.
[2024-05-28 13:51:06] [INFO ] Deduced a trap composed of 42 places in 255 ms of which 3 ms to minimize.
[2024-05-28 13:51:08] [INFO ] Deduced a trap composed of 271 places in 157 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 774 unsolved
[2024-05-28 13:51:09] [INFO ] Deduced a trap composed of 120 places in 211 ms of which 3 ms to minimize.
[2024-05-28 13:51:09] [INFO ] Deduced a trap composed of 139 places in 184 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.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 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 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1220 variables, and 52 constraints, problems are : Problem set: 0 solved, 774 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 774/774 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 774 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 774 unsolved
[2024-05-28 13:51:16] [INFO ] Deduced a trap composed of 223 places in 155 ms of which 3 ms to minimize.
[2024-05-28 13:51:18] [INFO ] Deduced a trap composed of 234 places in 199 ms of which 2 ms to minimize.
[2024-05-28 13:51:18] [INFO ] Deduced a trap composed of 229 places in 182 ms of which 3 ms to minimize.
[2024-05-28 13:51:23] [INFO ] Deduced a trap composed of 210 places in 156 ms of which 2 ms to minimize.
[2024-05-28 13:51:23] [INFO ] Deduced a trap composed of 261 places in 218 ms of which 4 ms to minimize.
[2024-05-28 13:51:24] [INFO ] Deduced a trap composed of 244 places in 207 ms of which 4 ms to minimize.
[2024-05-28 13:51:25] [INFO ] Deduced a trap composed of 222 places in 125 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 774 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1220 variables, and 59 constraints, problems are : Problem set: 0 solved, 774 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/774 constraints, Known Traps: 23/23 constraints]
After SMT, in 40701ms problems are : Problem set: 0 solved, 774 unsolved
Search for dead transitions found 0 dead transitions in 40712ms
[2024-05-28 13:51:34] [INFO ] Flow matrix only has 764 transitions (discarded 12 similar events)
[2024-05-28 13:51:34] [INFO ] Invariant cache hit.
[2024-05-28 13:51:35] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-05-28 13:51:35] [INFO ] Flow matrix only has 764 transitions (discarded 12 similar events)
[2024-05-28 13:51:35] [INFO ] Invariant cache hit.
[2024-05-28 13:51:35] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:51:40] [INFO ] Implicit Places using invariants and state equation in 5108 ms returned []
Implicit Place search using SMT with State Equation took 5405 ms to find 0 implicit places.
Running 774 sub problems to find dead transitions.
[2024-05-28 13:51:40] [INFO ] Flow matrix only has 764 transitions (discarded 12 similar events)
[2024-05-28 13:51:40] [INFO ] Invariant cache hit.
[2024-05-28 13:51:40] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 774 unsolved
[2024-05-28 13:51:46] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-05-28 13:51:46] [INFO ] Deduced a trap composed of 243 places in 145 ms of which 3 ms to minimize.
[2024-05-28 13:51:46] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-28 13:51:47] [INFO ] Deduced a trap composed of 65 places in 202 ms of which 3 ms to minimize.
[2024-05-28 13:51:48] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 2 ms to minimize.
[2024-05-28 13:51:48] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-05-28 13:51:49] [INFO ] Deduced a trap composed of 230 places in 236 ms of which 4 ms to minimize.
[2024-05-28 13:51:49] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-05-28 13:51:49] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-05-28 13:51:50] [INFO ] Deduced a trap composed of 263 places in 171 ms of which 4 ms to minimize.
[2024-05-28 13:51:50] [INFO ] Deduced a trap composed of 288 places in 381 ms of which 6 ms to minimize.
[2024-05-28 13:51:50] [INFO ] Deduced a trap composed of 246 places in 246 ms of which 3 ms to minimize.
[2024-05-28 13:51:51] [INFO ] Deduced a trap composed of 249 places in 182 ms of which 3 ms to minimize.
[2024-05-28 13:51:51] [INFO ] Deduced a trap composed of 249 places in 247 ms of which 3 ms to minimize.
[2024-05-28 13:51:51] [INFO ] Deduced a trap composed of 245 places in 223 ms of which 3 ms to minimize.
[2024-05-28 13:51:51] [INFO ] Deduced a trap composed of 246 places in 215 ms of which 3 ms to minimize.
[2024-05-28 13:51:52] [INFO ] Deduced a trap composed of 213 places in 197 ms of which 3 ms to minimize.
[2024-05-28 13:51:52] [INFO ] Deduced a trap composed of 250 places in 222 ms of which 4 ms to minimize.
[2024-05-28 13:51:52] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 3 ms to minimize.
[2024-05-28 13:51:52] [INFO ] Deduced a trap composed of 244 places in 231 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 774 unsolved
[2024-05-28 13:51:53] [INFO ] Deduced a trap composed of 145 places in 164 ms of which 2 ms to minimize.
[2024-05-28 13:51:53] [INFO ] Deduced a trap composed of 222 places in 226 ms of which 3 ms to minimize.
[2024-05-28 13:51:54] [INFO ] Deduced a trap composed of 271 places in 251 ms of which 4 ms to minimize.
[2024-05-28 13:51:54] [INFO ] Deduced a trap composed of 251 places in 228 ms of which 6 ms to minimize.
[2024-05-28 13:51:54] [INFO ] Deduced a trap composed of 283 places in 185 ms of which 3 ms to minimize.
[2024-05-28 13:51:55] [INFO ] Deduced a trap composed of 260 places in 202 ms of which 3 ms to minimize.
[2024-05-28 13:51:55] [INFO ] Deduced a trap composed of 250 places in 197 ms of which 3 ms to minimize.
[2024-05-28 13:51:55] [INFO ] Deduced a trap composed of 256 places in 179 ms of which 3 ms to minimize.
[2024-05-28 13:51:55] [INFO ] Deduced a trap composed of 241 places in 150 ms of which 2 ms to minimize.
[2024-05-28 13:51:56] [INFO ] Deduced a trap composed of 278 places in 222 ms of which 3 ms to minimize.
[2024-05-28 13:51:58] [INFO ] Deduced a trap composed of 234 places in 116 ms of which 2 ms to minimize.
[2024-05-28 13:51:58] [INFO ] Deduced a trap composed of 242 places in 160 ms of which 3 ms to minimize.
[2024-05-28 13:51:59] [INFO ] Deduced a trap composed of 241 places in 161 ms of which 3 ms to minimize.
[2024-05-28 13:52:00] [INFO ] Deduced a trap composed of 263 places in 163 ms of which 2 ms to minimize.
[2024-05-28 13:52:01] [INFO ] Deduced a trap composed of 265 places in 263 ms of which 3 ms to minimize.
[2024-05-28 13:52:01] [INFO ] Deduced a trap composed of 251 places in 239 ms of which 3 ms to minimize.
[2024-05-28 13:52:02] [INFO ] Deduced a trap composed of 246 places in 143 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 17/73 constraints. Problems are: Problem set: 0 solved, 774 unsolved
[2024-05-28 13:52:09] [INFO ] Deduced a trap composed of 280 places in 221 ms of which 3 ms to minimize.
[2024-05-28 13:52:09] [INFO ] Deduced a trap composed of 287 places in 190 ms of which 3 ms to minimize.
[2024-05-28 13:52:09] [INFO ] Deduced a trap composed of 298 places in 255 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1220 variables, and 76 constraints, problems are : Problem set: 0 solved, 774 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 774/774 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 774 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 40/76 constraints. Problems are: Problem set: 0 solved, 774 unsolved
[2024-05-28 13:52:12] [INFO ] Deduced a trap composed of 266 places in 184 ms of which 3 ms to minimize.
[2024-05-28 13:52:12] [INFO ] Deduced a trap composed of 234 places in 153 ms of which 3 ms to minimize.
[2024-05-28 13:52:13] [INFO ] Deduced a trap composed of 218 places in 175 ms of which 3 ms to minimize.
[2024-05-28 13:52:13] [INFO ] Deduced a trap composed of 231 places in 148 ms of which 2 ms to minimize.
[2024-05-28 13:52:13] [INFO ] Deduced a trap composed of 231 places in 189 ms of which 3 ms to minimize.
[2024-05-28 13:52:19] [INFO ] Deduced a trap composed of 309 places in 247 ms of which 4 ms to minimize.
[2024-05-28 13:52:21] [INFO ] Deduced a trap composed of 244 places in 194 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 7/83 constraints. Problems are: Problem set: 0 solved, 774 unsolved
[2024-05-28 13:52:24] [INFO ] Deduced a trap composed of 271 places in 241 ms of which 3 ms to minimize.
[2024-05-28 13:52:24] [INFO ] Deduced a trap composed of 261 places in 235 ms of which 3 ms to minimize.
[2024-05-28 13:52:25] [INFO ] Deduced a trap composed of 263 places in 217 ms of which 3 ms to minimize.
[2024-05-28 13:52:25] [INFO ] Deduced a trap composed of 240 places in 222 ms of which 3 ms to minimize.
[2024-05-28 13:52:30] [INFO ] Deduced a trap composed of 124 places in 192 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 5/88 constraints. Problems are: Problem set: 0 solved, 774 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1220 variables, and 88 constraints, problems are : Problem set: 0 solved, 774 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/774 constraints, Known Traps: 52/52 constraints]
After SMT, in 60713ms problems are : Problem set: 0 solved, 774 unsolved
Search for dead transitions found 0 dead transitions in 60727ms
Finished structural reductions in LTL mode , in 1 iterations and 106854 ms. Remains : 456/456 places, 776/776 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]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 109 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 24 steps (0 resets) in 5 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 77 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 310 ms.
Product exploration explored 100000 steps with 25000 reset in 304 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 31 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 776/776 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 456 transition count 776
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 54 Pre rules applied. Total rules applied 36 place count 456 transition count 830
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 54 rules applied. Total rules applied 90 place count 456 transition count 830
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 102 place count 444 transition count 818
Deduced a syphon composed of 78 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 114 place count 444 transition count 818
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 126 places in 0 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 162 place count 444 transition count 818
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 186 place count 420 transition count 794
Deduced a syphon composed of 108 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 210 place count 420 transition count 794
Deduced a syphon composed of 108 places in 0 ms
Applied a total of 210 rules in 45 ms. Remains 420 /456 variables (removed 36) and now considering 794/776 (removed -18) transitions.
Running 792 sub problems to find dead transitions.
[2024-05-28 13:52:42] [INFO ] Flow matrix only has 782 transitions (discarded 12 similar events)
// Phase 1: matrix 782 rows 420 cols
[2024-05-28 13:52:43] [INFO ] Computed 38 invariants in 10 ms
[2024-05-28 13:52:43] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 792 unsolved
[2024-05-28 13:52:48] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-28 13:52:48] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 2 ms to minimize.
[2024-05-28 13:52:49] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-28 13:52:49] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
[2024-05-28 13:52:49] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
[2024-05-28 13:52:49] [INFO ] Deduced a trap composed of 40 places in 245 ms of which 3 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
[2024-05-28 13:52:49] [INFO ] Deduced a trap composed of 115 places in 178 ms of which 3 ms to minimize.
[2024-05-28 13:52:49] [INFO ] Deduced a trap composed of 104 places in 192 ms of which 2 ms to minimize.
[2024-05-28 13:52:50] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 2 ms to minimize.
[2024-05-28 13:52:51] [INFO ] Deduced a trap composed of 181 places in 173 ms of which 2 ms to minimize.
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
[2024-05-28 13:52:52] [INFO ] Deduced a trap composed of 98 places in 183 ms of which 3 ms to minimize.
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD781 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 11/47 constraints. Problems are: Problem set: 150 solved, 642 unsolved
[2024-05-28 13:52:59] [INFO ] Deduced a trap composed of 108 places in 186 ms of which 2 ms to minimize.
[2024-05-28 13:52:59] [INFO ] Deduced a trap composed of 100 places in 197 ms of which 3 ms to minimize.
[2024-05-28 13:53:00] [INFO ] Deduced a trap composed of 116 places in 226 ms of which 3 ms to minimize.
[2024-05-28 13:53:00] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 3 ms to minimize.
(s85 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.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 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 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 4/51 constraints. Problems are: Problem set: 150 solved, 642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1202 variables, and 51 constraints, problems are : Problem set: 150 solved, 642 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 792/792 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 150 solved, 642 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 9/9 constraints. Problems are: Problem set: 150 solved, 642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 11/20 constraints. Problems are: Problem set: 150 solved, 642 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 15/35 constraints. Problems are: Problem set: 150 solved, 642 unsolved
[2024-05-28 13:53:05] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 1/36 constraints. Problems are: Problem set: 150 solved, 642 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 0/36 constraints. Problems are: Problem set: 150 solved, 642 unsolved
At refinement iteration 5 (OVERLAPS) 37/359 variables, 5/41 constraints. Problems are: Problem set: 150 solved, 642 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 2/43 constraints. Problems are: Problem set: 150 solved, 642 unsolved
[2024-05-28 13:53:10] [INFO ] Deduced a trap composed of 105 places in 90 ms of which 1 ms to minimize.
[2024-05-28 13:53:12] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 2 ms to minimize.
[2024-05-28 13:53:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-28 13:53:12] [INFO ] Deduced a trap composed of 93 places in 153 ms of which 2 ms to minimize.
[2024-05-28 13:53:12] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2024-05-28 13:53:12] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-28 13:53:13] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-28 13:53:14] [INFO ] Deduced a trap composed of 47 places in 154 ms of which 2 ms to minimize.
[2024-05-28 13:53:14] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 2 ms to minimize.
[2024-05-28 13:53:14] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-28 13:53:14] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-28 13:53:15] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 12/55 constraints. Problems are: Problem set: 150 solved, 642 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 0/55 constraints. Problems are: Problem set: 150 solved, 642 unsolved
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
At refinement iteration 9 (OVERLAPS) 61/420 variables, 11/66 constraints. Problems are: Problem set: 180 solved, 612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/1202 variables, and 66 constraints, problems are : Problem set: 180 solved, 612 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/792 constraints, Known Traps: 28/28 constraints]
After SMT, in 40838ms problems are : Problem set: 180 solved, 612 unsolved
Search for dead transitions found 180 dead transitions in 40846ms
Found 180 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 180 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 180 transitions.
[2024-05-28 13:53:23] [INFO ] Redundant transitions in 2 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 420/456 places, 614/776 transitions.
Graph (complete) has 1912 edges and 420 vertex of which 324 are kept as prefixes of interest. Removing 96 places using SCC suffix rule.2 ms
Discarding 96 places :
Also discarding 0 output transitions
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 310 transition count 590
Deduced a syphon composed of 12 places in 0 ms
Applied a total of 13 rules in 20 ms. Remains 310 /420 variables (removed 110) and now considering 590/614 (removed 24) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 310/456 places, 590/776 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 40934 ms. Remains : 310/456 places, 590/776 transitions.
Built C files in :
/tmp/ltsmin7180989308308287751
[2024-05-28 13:53:23] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7180989308308287751
Running compilation step : cd /tmp/ltsmin7180989308308287751;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1400 ms.
Running link step : cd /tmp/ltsmin7180989308308287751;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin7180989308308287751;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13564459540910354554.hoa' '--buchi-type=spotba'
LTSmin run took 373 ms.
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-07 finished in 259803 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 462 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 462 transition count 776
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 420 transition count 776
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 84 place count 420 transition count 728
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 180 place count 372 transition count 728
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 288 place count 318 transition count 674
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 294 place count 312 transition count 668
Iterating global reduction 2 with 6 rules applied. Total rules applied 300 place count 312 transition count 668
Applied a total of 300 rules in 31 ms. Remains 312 /462 variables (removed 150) and now considering 668/818 (removed 150) transitions.
Running 666 sub problems to find dead transitions.
[2024-05-28 13:53:25] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
// Phase 1: matrix 656 rows 312 cols
[2024-05-28 13:53:25] [INFO ] Computed 38 invariants in 5 ms
[2024-05-28 13:53:25] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-05-28 13:53:30] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
[2024-05-28 13:53:30] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2024-05-28 13:53:30] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 0 ms to minimize.
[2024-05-28 13:53:30] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 0 ms to minimize.
[2024-05-28 13:53:30] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
[2024-05-28 13:53:30] [INFO ] Deduced a trap composed of 115 places in 119 ms of which 1 ms to minimize.
[2024-05-28 13:53:31] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 0 ms to minimize.
[2024-05-28 13:53:31] [INFO ] Deduced a trap composed of 178 places in 123 ms of which 2 ms to minimize.
[2024-05-28 13:53:33] [INFO ] Deduced a trap composed of 108 places in 113 ms of which 2 ms to minimize.
[2024-05-28 13:53:34] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 2 ms to minimize.
[2024-05-28 13:53:34] [INFO ] Deduced a trap composed of 101 places in 111 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-05-28 13:53:37] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 2 ms to minimize.
[2024-05-28 13:53:37] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/311 variables, 1/50 constraints. Problems are: Problem set: 36 solved, 630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 311/968 variables, and 50 constraints, problems are : Problem set: 36 solved, 630 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 36 solved, 630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 14/14 constraints. Problems are: Problem set: 36 solved, 630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 22/36 constraints. Problems are: Problem set: 36 solved, 630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 13/49 constraints. Problems are: Problem set: 36 solved, 630 unsolved
[2024-05-28 13:53:50] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 1/50 constraints. Problems are: Problem set: 36 solved, 630 unsolved
[2024-05-28 13:53:55] [INFO ] Deduced a trap composed of 108 places in 133 ms of which 2 ms to minimize.
[2024-05-28 13:53:55] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2024-05-28 13:53:55] [INFO ] Deduced a trap composed of 59 places in 115 ms of which 1 ms to minimize.
[2024-05-28 13:53:56] [INFO ] Deduced a trap composed of 103 places in 139 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 4/54 constraints. Problems are: Problem set: 36 solved, 630 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/54 constraints. Problems are: Problem set: 36 solved, 630 unsolved
SMT process timed out in 40875ms, After SMT, problems are : Problem set: 36 solved, 630 unsolved
Search for dead transitions found 36 dead transitions in 40882ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 36 transitions.
[2024-05-28 13:54:06] [INFO ] Flow matrix only has 620 transitions (discarded 12 similar events)
// Phase 1: matrix 620 rows 312 cols
[2024-05-28 13:54:06] [INFO ] Computed 38 invariants in 11 ms
[2024-05-28 13:54:06] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-28 13:54:06] [INFO ] Flow matrix only has 620 transitions (discarded 12 similar events)
[2024-05-28 13:54:06] [INFO ] Invariant cache hit.
[2024-05-28 13:54:07] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:54:09] [INFO ] Implicit Places using invariants and state equation in 2256 ms returned []
Implicit Place search using SMT with State Equation took 2513 ms to find 0 implicit places.
[2024-05-28 13:54:09] [INFO ] Redundant transitions in 8 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 312/462 places, 632/818 transitions.
Applied a total of 0 rules in 15 ms. Remains 312 /312 variables (removed 0) and now considering 632/632 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43461 ms. Remains : 312/462 places, 632/818 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-08
Product exploration explored 100000 steps with 4292 reset in 314 ms.
Product exploration explored 100000 steps with 4322 reset in 303 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 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 58 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 96 steps (0 resets) in 7 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 83 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 70 ms :[(NOT p0), (NOT p0)]
[2024-05-28 13:54:10] [INFO ] Flow matrix only has 620 transitions (discarded 12 similar events)
[2024-05-28 13:54:10] [INFO ] Invariant cache hit.
[2024-05-28 13:54:10] [INFO ] [Real]Absence check using 15 positive place invariants in 50 ms returned sat
[2024-05-28 13:54:10] [INFO ] [Real]Absence check using 15 positive and 23 generalized place invariants in 85 ms returned sat
[2024-05-28 13:54:11] [INFO ] [Real]Absence check using state equation in 1109 ms returned sat
[2024-05-28 13:54:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:54:12] [INFO ] [Nat]Absence check using 15 positive place invariants in 29 ms returned sat
[2024-05-28 13:54:12] [INFO ] [Nat]Absence check using 15 positive and 23 generalized place invariants in 22 ms returned sat
[2024-05-28 13:54:14] [INFO ] [Nat]Absence check using state equation in 1638 ms returned sat
[2024-05-28 13:54:14] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:54:14] [INFO ] [Nat]Added 72 Read/Feed constraints in 224 ms returned sat
[2024-05-28 13:54:14] [INFO ] Deduced a trap composed of 42 places in 213 ms of which 2 ms to minimize.
[2024-05-28 13:54:14] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 2 ms to minimize.
[2024-05-28 13:54:14] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 2 ms to minimize.
[2024-05-28 13:54:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 873 ms
[2024-05-28 13:54:15] [INFO ] Computed and/alt/rep : 378/1797/372 causal constraints (skipped 246 transitions) in 71 ms.
[2024-05-28 13:54:18] [INFO ] Added : 263 causal constraints over 53 iterations in 3124 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 12 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 632/632 transitions.
Applied a total of 0 rules in 11 ms. Remains 312 /312 variables (removed 0) and now considering 632/632 (removed 0) transitions.
Running 630 sub problems to find dead transitions.
[2024-05-28 13:54:18] [INFO ] Flow matrix only has 620 transitions (discarded 12 similar events)
[2024-05-28 13:54:18] [INFO ] Invariant cache hit.
[2024-05-28 13:54:18] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 630 unsolved
[2024-05-28 13:54:21] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2024-05-28 13:54:22] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-28 13:54:22] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 0 ms to minimize.
[2024-05-28 13:54:22] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-28 13:54:22] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 1 ms to minimize.
[2024-05-28 13:54:22] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 0 ms to minimize.
[2024-05-28 13:54:22] [INFO ] Deduced a trap composed of 128 places in 103 ms of which 2 ms to minimize.
[2024-05-28 13:54:22] [INFO ] Deduced a trap composed of 109 places in 110 ms of which 2 ms to minimize.
[2024-05-28 13:54:22] [INFO ] Deduced a trap composed of 40 places in 22 ms of which 0 ms to minimize.
[2024-05-28 13:54:23] [INFO ] Deduced a trap composed of 181 places in 145 ms of which 2 ms to minimize.
[2024-05-28 13:54:24] [INFO ] Deduced a trap composed of 138 places in 168 ms of which 2 ms to minimize.
[2024-05-28 13:54:24] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 2 ms to minimize.
[2024-05-28 13:54:26] [INFO ] Deduced a trap composed of 108 places in 169 ms of which 2 ms to minimize.
[2024-05-28 13:54:26] [INFO ] Deduced a trap composed of 102 places in 137 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 630 unsolved
[2024-05-28 13:54:29] [INFO ] Deduced a trap composed of 139 places in 95 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 5 (OVERLAPS) 1/311 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 630 unsolved
SMT process timed out in 20675ms, After SMT, problems are : Problem set: 0 solved, 630 unsolved
Search for dead transitions found 0 dead transitions in 20683ms
[2024-05-28 13:54:38] [INFO ] Flow matrix only has 620 transitions (discarded 12 similar events)
[2024-05-28 13:54:38] [INFO ] Invariant cache hit.
[2024-05-28 13:54:39] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-28 13:54:39] [INFO ] Flow matrix only has 620 transitions (discarded 12 similar events)
[2024-05-28 13:54:39] [INFO ] Invariant cache hit.
[2024-05-28 13:54:39] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:54:41] [INFO ] Implicit Places using invariants and state equation in 2519 ms returned []
Implicit Place search using SMT with State Equation took 2727 ms to find 0 implicit places.
[2024-05-28 13:54:41] [INFO ] Redundant transitions in 4 ms returned []
Running 630 sub problems to find dead transitions.
[2024-05-28 13:54:41] [INFO ] Flow matrix only has 620 transitions (discarded 12 similar events)
[2024-05-28 13:54:41] [INFO ] Invariant cache hit.
[2024-05-28 13:54:41] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 630 unsolved
[2024-05-28 13:54:45] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 1 ms to minimize.
[2024-05-28 13:54:45] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 0 ms to minimize.
[2024-05-28 13:54:45] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 0 ms to minimize.
[2024-05-28 13:54:45] [INFO ] Deduced a trap composed of 40 places in 24 ms of which 0 ms to minimize.
[2024-05-28 13:54:45] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 1 ms to minimize.
[2024-05-28 13:54:45] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-05-28 13:54:45] [INFO ] Deduced a trap composed of 128 places in 121 ms of which 2 ms to minimize.
[2024-05-28 13:54:45] [INFO ] Deduced a trap composed of 109 places in 137 ms of which 2 ms to minimize.
[2024-05-28 13:54:46] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 ms to minimize.
[2024-05-28 13:54:46] [INFO ] Deduced a trap composed of 181 places in 108 ms of which 1 ms to minimize.
[2024-05-28 13:54:47] [INFO ] Deduced a trap composed of 138 places in 110 ms of which 2 ms to minimize.
[2024-05-28 13:54:47] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 1 ms to minimize.
[2024-05-28 13:54:49] [INFO ] Deduced a trap composed of 108 places in 99 ms of which 2 ms to minimize.
[2024-05-28 13:54:49] [INFO ] Deduced a trap composed of 102 places in 140 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 630 unsolved
[2024-05-28 13:54:52] [INFO ] Deduced a trap composed of 139 places in 115 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 5 (OVERLAPS) 1/311 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 630 unsolved
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
At refinement iteration 7 (OVERLAPS) 1/312 variables, 1/53 constraints. Problems are: Problem set: 30 solved, 600 unsolved
[2024-05-28 13:55:05] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 2 ms to minimize.
[2024-05-28 13:55:05] [INFO ] Deduced a trap composed of 101 places in 129 ms of which 2 ms to minimize.
[2024-05-28 13:55:06] [INFO ] Deduced a trap composed of 139 places in 125 ms of which 2 ms to minimize.
[2024-05-28 13:55:06] [INFO ] Deduced a trap composed of 106 places in 113 ms of which 1 ms to minimize.
[2024-05-28 13:55:06] [INFO ] Deduced a trap composed of 137 places in 115 ms of which 2 ms to minimize.
[2024-05-28 13:55:06] [INFO ] Deduced a trap composed of 120 places in 129 ms of which 2 ms to minimize.
[2024-05-28 13:55:07] [INFO ] Deduced a trap composed of 129 places in 115 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 7/60 constraints. Problems are: Problem set: 30 solved, 600 unsolved
[2024-05-28 13:55:10] [INFO ] Deduced a trap composed of 168 places in 134 ms of which 2 ms to minimize.
[2024-05-28 13:55:10] [INFO ] Deduced a trap composed of 107 places in 122 ms of which 2 ms to minimize.
[2024-05-28 13:55:10] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 2 ms to minimize.
[2024-05-28 13:55:10] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 1 ms to minimize.
[2024-05-28 13:55:11] [INFO ] Deduced a trap composed of 51 places in 128 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 5/65 constraints. Problems are: Problem set: 30 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 312/932 variables, and 65 constraints, problems are : Problem set: 30 solved, 600 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 630/630 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 30 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 14/14 constraints. Problems are: Problem set: 30 solved, 600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 22/36 constraints. Problems are: Problem set: 30 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 19/55 constraints. Problems are: Problem set: 30 solved, 600 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/55 constraints. Problems are: Problem set: 30 solved, 600 unsolved
At refinement iteration 4 (OVERLAPS) 1/311 variables, 1/56 constraints. Problems are: Problem set: 30 solved, 600 unsolved
[2024-05-28 13:55:20] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 1/57 constraints. Problems are: Problem set: 30 solved, 600 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/57 constraints. Problems are: Problem set: 30 solved, 600 unsolved
At refinement iteration 7 (OVERLAPS) 1/312 variables, 1/58 constraints. Problems are: Problem set: 30 solved, 600 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 8/66 constraints. Problems are: Problem set: 30 solved, 600 unsolved
[2024-05-28 13:55:33] [INFO ] Deduced a trap composed of 104 places in 135 ms of which 2 ms to minimize.
[2024-05-28 13:55:37] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 2 ms to minimize.
[2024-05-28 13:55:37] [INFO ] Deduced a trap composed of 53 places in 125 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 3/69 constraints. Problems are: Problem set: 30 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 312/932 variables, and 69 constraints, problems are : Problem set: 30 solved, 600 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/630 constraints, Known Traps: 31/31 constraints]
After SMT, in 60472ms problems are : Problem set: 30 solved, 600 unsolved
Search for dead transitions found 30 dead transitions in 60484ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 312/312 places, 602/632 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 298 transition count 578
Applied a total of 12 rules in 9 ms. Remains 298 /312 variables (removed 14) and now considering 578/602 (removed 24) transitions.
[2024-05-28 13:55:42] [INFO ] Flow matrix only has 566 transitions (discarded 12 similar events)
// Phase 1: matrix 566 rows 298 cols
[2024-05-28 13:55:42] [INFO ] Computed 38 invariants in 6 ms
[2024-05-28 13:55:42] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-28 13:55:42] [INFO ] Flow matrix only has 566 transitions (discarded 12 similar events)
[2024-05-28 13:55:42] [INFO ] Invariant cache hit.
[2024-05-28 13:55:42] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:55:44] [INFO ] Implicit Places using invariants and state equation in 2342 ms returned []
Implicit Place search using SMT with State Equation took 2543 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 298/312 places, 578/632 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 86475 ms. Remains : 298/312 places, 578/632 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 138 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 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 88 steps (0 resets) in 4 ms. (17 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 97 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 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
[2024-05-28 13:55:45] [INFO ] Flow matrix only has 566 transitions (discarded 12 similar events)
[2024-05-28 13:55:45] [INFO ] Invariant cache hit.
[2024-05-28 13:55:45] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2024-05-28 13:55:45] [INFO ] [Real]Absence check using 12 positive and 26 generalized place invariants in 122 ms returned sat
[2024-05-28 13:55:46] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2024-05-28 13:55:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:55:46] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-28 13:55:46] [INFO ] [Nat]Absence check using 12 positive and 26 generalized place invariants in 24 ms returned sat
[2024-05-28 13:55:46] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2024-05-28 13:55:46] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:55:46] [INFO ] [Nat]Added 72 Read/Feed constraints in 38 ms returned sat
[2024-05-28 13:55:47] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 2 ms to minimize.
[2024-05-28 13:55:47] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 3 ms to minimize.
[2024-05-28 13:55:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 388 ms
[2024-05-28 13:55:47] [INFO ] Computed and/alt/rep : 342/1533/336 causal constraints (skipped 228 transitions) in 51 ms.
[2024-05-28 13:55:49] [INFO ] Added : 213 causal constraints over 43 iterations in 1855 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4303 reset in 298 ms.
Product exploration explored 100000 steps with 4322 reset in 316 ms.
Built C files in :
/tmp/ltsmin7450337270227503669
[2024-05-28 13:55:49] [INFO ] Computing symmetric may disable matrix : 578 transitions.
[2024-05-28 13:55:49] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:55:49] [INFO ] Computing symmetric may enable matrix : 578 transitions.
[2024-05-28 13:55:49] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:55:49] [INFO ] Computing Do-Not-Accords matrix : 578 transitions.
[2024-05-28 13:55:49] [INFO ] Computation of Completed DNA matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:55:49] [INFO ] Built C files in 149ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7450337270227503669
Running compilation step : cd /tmp/ltsmin7450337270227503669;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1968 ms.
Running link step : cd /tmp/ltsmin7450337270227503669;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin7450337270227503669;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11908116767738308572.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 12 out of 298 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 298/298 places, 578/578 transitions.
Applied a total of 0 rules in 14 ms. Remains 298 /298 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Running 576 sub problems to find dead transitions.
[2024-05-28 13:56:04] [INFO ] Flow matrix only has 566 transitions (discarded 12 similar events)
[2024-05-28 13:56:04] [INFO ] Invariant cache hit.
[2024-05-28 13:56:04] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-05-28 13:56:08] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 1 ms to minimize.
[2024-05-28 13:56:08] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 2 ms to minimize.
[2024-05-28 13:56:08] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2024-05-28 13:56:08] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-28 13:56:08] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-28 13:56:08] [INFO ] Deduced a trap composed of 110 places in 159 ms of which 2 ms to minimize.
[2024-05-28 13:56:08] [INFO ] Deduced a trap composed of 107 places in 149 ms of which 3 ms to minimize.
[2024-05-28 13:56:09] [INFO ] Deduced a trap composed of 118 places in 135 ms of which 2 ms to minimize.
[2024-05-28 13:56:09] [INFO ] Deduced a trap composed of 122 places in 133 ms of which 2 ms to minimize.
[2024-05-28 13:56:09] [INFO ] Deduced a trap composed of 109 places in 133 ms of which 3 ms to minimize.
[2024-05-28 13:56:09] [INFO ] Deduced a trap composed of 121 places in 129 ms of which 2 ms to minimize.
[2024-05-28 13:56:09] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2024-05-28 13:56:09] [INFO ] Deduced a trap composed of 122 places in 137 ms of which 3 ms to minimize.
[2024-05-28 13:56:09] [INFO ] Deduced a trap composed of 125 places in 138 ms of which 2 ms to minimize.
[2024-05-28 13:56:09] [INFO ] Deduced a trap composed of 124 places in 131 ms of which 2 ms to minimize.
[2024-05-28 13:56:10] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 2 ms to minimize.
[2024-05-28 13:56:10] [INFO ] Deduced a trap composed of 126 places in 133 ms of which 2 ms to minimize.
[2024-05-28 13:56:10] [INFO ] Deduced a trap composed of 121 places in 134 ms of which 2 ms to minimize.
[2024-05-28 13:56:10] [INFO ] Deduced a trap composed of 125 places in 136 ms of which 2 ms to minimize.
[2024-05-28 13:56:10] [INFO ] Deduced a trap composed of 111 places in 130 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-05-28 13:56:11] [INFO ] Deduced a trap composed of 109 places in 219 ms of which 2 ms to minimize.
[2024-05-28 13:56:11] [INFO ] Deduced a trap composed of 121 places in 161 ms of which 2 ms to minimize.
[2024-05-28 13:56:11] [INFO ] Deduced a trap composed of 130 places in 148 ms of which 2 ms to minimize.
[2024-05-28 13:56:12] [INFO ] Deduced a trap composed of 136 places in 163 ms of which 2 ms to minimize.
[2024-05-28 13:56:12] [INFO ] Deduced a trap composed of 138 places in 129 ms of which 2 ms to minimize.
[2024-05-28 13:56:12] [INFO ] Deduced a trap composed of 125 places in 133 ms of which 3 ms to minimize.
[2024-05-28 13:56:12] [INFO ] Deduced a trap composed of 137 places in 151 ms of which 3 ms to minimize.
[2024-05-28 13:56:12] [INFO ] Deduced a trap composed of 153 places in 126 ms of which 2 ms to minimize.
[2024-05-28 13:56:12] [INFO ] Deduced a trap composed of 133 places in 143 ms of which 3 ms to minimize.
[2024-05-28 13:56:13] [INFO ] Deduced a trap composed of 140 places in 142 ms of which 2 ms to minimize.
[2024-05-28 13:56:13] [INFO ] Deduced a trap composed of 138 places in 166 ms of which 2 ms to minimize.
[2024-05-28 13:56:13] [INFO ] Deduced a trap composed of 143 places in 141 ms of which 2 ms to minimize.
[2024-05-28 13:56:13] [INFO ] Deduced a trap composed of 131 places in 139 ms of which 2 ms to minimize.
[2024-05-28 13:56:13] [INFO ] Deduced a trap composed of 142 places in 134 ms of which 2 ms to minimize.
[2024-05-28 13:56:13] [INFO ] Deduced a trap composed of 132 places in 127 ms of which 1 ms to minimize.
[2024-05-28 13:56:13] [INFO ] Deduced a trap composed of 127 places in 134 ms of which 2 ms to minimize.
[2024-05-28 13:56:14] [INFO ] Deduced a trap composed of 129 places in 132 ms of which 2 ms to minimize.
[2024-05-28 13:56:14] [INFO ] Deduced a trap composed of 128 places in 148 ms of which 2 ms to minimize.
[2024-05-28 13:56:14] [INFO ] Deduced a trap composed of 121 places in 121 ms of which 2 ms to minimize.
[2024-05-28 13:56:14] [INFO ] Deduced a trap composed of 124 places in 114 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-05-28 13:56:17] [INFO ] Deduced a trap composed of 117 places in 153 ms of which 2 ms to minimize.
[2024-05-28 13:56:17] [INFO ] Deduced a trap composed of 115 places in 159 ms of which 2 ms to minimize.
[2024-05-28 13:56:17] [INFO ] Deduced a trap composed of 122 places in 133 ms of which 2 ms to minimize.
[2024-05-28 13:56:17] [INFO ] Deduced a trap composed of 125 places in 133 ms of which 2 ms to minimize.
[2024-05-28 13:56:17] [INFO ] Deduced a trap composed of 139 places in 142 ms of which 2 ms to minimize.
[2024-05-28 13:56:18] [INFO ] Deduced a trap composed of 132 places in 139 ms of which 2 ms to minimize.
[2024-05-28 13:56:18] [INFO ] Deduced a trap composed of 136 places in 152 ms of which 2 ms to minimize.
[2024-05-28 13:56:18] [INFO ] Deduced a trap composed of 146 places in 135 ms of which 2 ms to minimize.
[2024-05-28 13:56:18] [INFO ] Deduced a trap composed of 138 places in 139 ms of which 2 ms to minimize.
[2024-05-28 13:56:18] [INFO ] Deduced a trap composed of 133 places in 132 ms of which 2 ms to minimize.
[2024-05-28 13:56:18] [INFO ] Deduced a trap composed of 142 places in 134 ms of which 2 ms to minimize.
[2024-05-28 13:56:18] [INFO ] Deduced a trap composed of 157 places in 135 ms of which 3 ms to minimize.
[2024-05-28 13:56:19] [INFO ] Deduced a trap composed of 135 places in 135 ms of which 2 ms to minimize.
[2024-05-28 13:56:19] [INFO ] Deduced a trap composed of 143 places in 134 ms of which 2 ms to minimize.
[2024-05-28 13:56:19] [INFO ] Deduced a trap composed of 164 places in 156 ms of which 2 ms to minimize.
[2024-05-28 13:56:19] [INFO ] Deduced a trap composed of 135 places in 130 ms of which 2 ms to minimize.
[2024-05-28 13:56:19] [INFO ] Deduced a trap composed of 139 places in 133 ms of which 3 ms to minimize.
[2024-05-28 13:56:19] [INFO ] Deduced a trap composed of 135 places in 130 ms of which 2 ms to minimize.
[2024-05-28 13:56:20] [INFO ] Deduced a trap composed of 142 places in 160 ms of which 5 ms to minimize.
[2024-05-28 13:56:20] [INFO ] Deduced a trap composed of 159 places in 161 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-05-28 13:56:20] [INFO ] Deduced a trap composed of 132 places in 111 ms of which 3 ms to minimize.
[2024-05-28 13:56:21] [INFO ] Deduced a trap composed of 136 places in 125 ms of which 3 ms to minimize.
[2024-05-28 13:56:21] [INFO ] Deduced a trap composed of 131 places in 111 ms of which 2 ms to minimize.
[2024-05-28 13:56:21] [INFO ] Deduced a trap composed of 135 places in 111 ms of which 2 ms to minimize.
[2024-05-28 13:56:21] [INFO ] Deduced a trap composed of 144 places in 132 ms of which 2 ms to minimize.
[2024-05-28 13:56:21] [INFO ] Deduced a trap composed of 133 places in 167 ms of which 3 ms to minimize.
[2024-05-28 13:56:21] [INFO ] Deduced a trap composed of 141 places in 123 ms of which 2 ms to minimize.
[2024-05-28 13:56:22] [INFO ] Deduced a trap composed of 157 places in 154 ms of which 2 ms to minimize.
[2024-05-28 13:56:22] [INFO ] Deduced a trap composed of 153 places in 125 ms of which 2 ms to minimize.
[2024-05-28 13:56:22] [INFO ] Deduced a trap composed of 117 places in 156 ms of which 3 ms to minimize.
[2024-05-28 13:56:22] [INFO ] Deduced a trap composed of 134 places in 124 ms of which 2 ms to minimize.
[2024-05-28 13:56:22] [INFO ] Deduced a trap composed of 132 places in 121 ms of which 2 ms to minimize.
[2024-05-28 13:56:22] [INFO ] Deduced a trap composed of 141 places in 129 ms of which 2 ms to minimize.
[2024-05-28 13:56:22] [INFO ] Deduced a trap composed of 147 places in 130 ms of which 2 ms to minimize.
[2024-05-28 13:56:23] [INFO ] Deduced a trap composed of 137 places in 153 ms of which 2 ms to minimize.
[2024-05-28 13:56:23] [INFO ] Deduced a trap composed of 120 places in 177 ms of which 2 ms to minimize.
[2024-05-28 13:56:23] [INFO ] Deduced a trap composed of 116 places in 152 ms of which 2 ms to minimize.
[2024-05-28 13:56:23] [INFO ] Deduced a trap composed of 128 places in 129 ms of which 2 ms to minimize.
[2024-05-28 13:56:23] [INFO ] Deduced a trap composed of 139 places in 133 ms of which 2 ms to minimize.
[2024-05-28 13:56:23] [INFO ] Deduced a trap composed of 131 places in 132 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-05-28 13:56:24] [INFO ] Deduced a trap composed of 140 places in 96 ms of which 1 ms to minimize.
[2024-05-28 13:56:24] [INFO ] Deduced a trap composed of 145 places in 140 ms of which 2 ms to minimize.
[2024-05-28 13:56:24] [INFO ] Deduced a trap composed of 150 places in 110 ms of which 2 ms to minimize.
[2024-05-28 13:56:25] [INFO ] Deduced a trap composed of 144 places in 134 ms of which 1 ms to minimize.
[2024-05-28 13:56:25] [INFO ] Deduced a trap composed of 141 places in 127 ms of which 2 ms to minimize.
[2024-05-28 13:56:25] [INFO ] Deduced a trap composed of 143 places in 147 ms of which 3 ms to minimize.
[2024-05-28 13:56:25] [INFO ] Deduced a trap composed of 142 places in 140 ms of which 2 ms to minimize.
SMT process timed out in 20645ms, After SMT, problems are : Problem set: 0 solved, 576 unsolved
Search for dead transitions found 0 dead transitions in 20656ms
[2024-05-28 13:56:25] [INFO ] Flow matrix only has 566 transitions (discarded 12 similar events)
[2024-05-28 13:56:25] [INFO ] Invariant cache hit.
[2024-05-28 13:56:25] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-28 13:56:25] [INFO ] Flow matrix only has 566 transitions (discarded 12 similar events)
[2024-05-28 13:56:25] [INFO ] Invariant cache hit.
[2024-05-28 13:56:25] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:56:27] [INFO ] Implicit Places using invariants and state equation in 2049 ms returned []
Implicit Place search using SMT with State Equation took 2260 ms to find 0 implicit places.
[2024-05-28 13:56:27] [INFO ] Redundant transitions in 6 ms returned []
Running 576 sub problems to find dead transitions.
[2024-05-28 13:56:27] [INFO ] Flow matrix only has 566 transitions (discarded 12 similar events)
[2024-05-28 13:56:27] [INFO ] Invariant cache hit.
[2024-05-28 13:56:27] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-05-28 13:56:31] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-28 13:56:31] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 0 ms to minimize.
[2024-05-28 13:56:31] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
[2024-05-28 13:56:31] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 0 ms to minimize.
[2024-05-28 13:56:31] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-28 13:56:31] [INFO ] Deduced a trap composed of 110 places in 110 ms of which 1 ms to minimize.
[2024-05-28 13:56:31] [INFO ] Deduced a trap composed of 107 places in 118 ms of which 1 ms to minimize.
[2024-05-28 13:56:32] [INFO ] Deduced a trap composed of 118 places in 137 ms of which 2 ms to minimize.
[2024-05-28 13:56:32] [INFO ] Deduced a trap composed of 122 places in 95 ms of which 2 ms to minimize.
[2024-05-28 13:56:32] [INFO ] Deduced a trap composed of 109 places in 110 ms of which 1 ms to minimize.
[2024-05-28 13:56:32] [INFO ] Deduced a trap composed of 121 places in 108 ms of which 1 ms to minimize.
[2024-05-28 13:56:32] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-05-28 13:56:32] [INFO ] Deduced a trap composed of 122 places in 113 ms of which 1 ms to minimize.
[2024-05-28 13:56:32] [INFO ] Deduced a trap composed of 125 places in 105 ms of which 2 ms to minimize.
[2024-05-28 13:56:32] [INFO ] Deduced a trap composed of 124 places in 128 ms of which 2 ms to minimize.
[2024-05-28 13:56:32] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-05-28 13:56:33] [INFO ] Deduced a trap composed of 126 places in 125 ms of which 1 ms to minimize.
[2024-05-28 13:56:33] [INFO ] Deduced a trap composed of 121 places in 104 ms of which 1 ms to minimize.
[2024-05-28 13:56:33] [INFO ] Deduced a trap composed of 125 places in 105 ms of which 2 ms to minimize.
[2024-05-28 13:56:33] [INFO ] Deduced a trap composed of 111 places in 135 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-05-28 13:56:33] [INFO ] Deduced a trap composed of 109 places in 140 ms of which 2 ms to minimize.
[2024-05-28 13:56:33] [INFO ] Deduced a trap composed of 121 places in 135 ms of which 2 ms to minimize.
[2024-05-28 13:56:34] [INFO ] Deduced a trap composed of 130 places in 134 ms of which 2 ms to minimize.
[2024-05-28 13:56:34] [INFO ] Deduced a trap composed of 136 places in 171 ms of which 2 ms to minimize.
[2024-05-28 13:56:34] [INFO ] Deduced a trap composed of 138 places in 143 ms of which 1 ms to minimize.
[2024-05-28 13:56:34] [INFO ] Deduced a trap composed of 125 places in 146 ms of which 2 ms to minimize.
[2024-05-28 13:56:35] [INFO ] Deduced a trap composed of 137 places in 140 ms of which 2 ms to minimize.
[2024-05-28 13:56:35] [INFO ] Deduced a trap composed of 153 places in 134 ms of which 1 ms to minimize.
[2024-05-28 13:56:35] [INFO ] Deduced a trap composed of 133 places in 160 ms of which 2 ms to minimize.
[2024-05-28 13:56:35] [INFO ] Deduced a trap composed of 140 places in 166 ms of which 2 ms to minimize.
[2024-05-28 13:56:35] [INFO ] Deduced a trap composed of 138 places in 145 ms of which 2 ms to minimize.
[2024-05-28 13:56:35] [INFO ] Deduced a trap composed of 143 places in 138 ms of which 3 ms to minimize.
[2024-05-28 13:56:36] [INFO ] Deduced a trap composed of 131 places in 157 ms of which 2 ms to minimize.
[2024-05-28 13:56:36] [INFO ] Deduced a trap composed of 142 places in 163 ms of which 3 ms to minimize.
[2024-05-28 13:56:36] [INFO ] Deduced a trap composed of 132 places in 130 ms of which 2 ms to minimize.
[2024-05-28 13:56:36] [INFO ] Deduced a trap composed of 127 places in 134 ms of which 2 ms to minimize.
[2024-05-28 13:56:36] [INFO ] Deduced a trap composed of 129 places in 148 ms of which 2 ms to minimize.
[2024-05-28 13:56:36] [INFO ] Deduced a trap composed of 128 places in 145 ms of which 2 ms to minimize.
[2024-05-28 13:56:37] [INFO ] Deduced a trap composed of 121 places in 160 ms of which 2 ms to minimize.
[2024-05-28 13:56:37] [INFO ] Deduced a trap composed of 124 places in 135 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-05-28 13:56:40] [INFO ] Deduced a trap composed of 117 places in 156 ms of which 2 ms to minimize.
[2024-05-28 13:56:40] [INFO ] Deduced a trap composed of 115 places in 111 ms of which 4 ms to minimize.
[2024-05-28 13:56:40] [INFO ] Deduced a trap composed of 122 places in 125 ms of which 3 ms to minimize.
[2024-05-28 13:56:40] [INFO ] Deduced a trap composed of 125 places in 103 ms of which 1 ms to minimize.
[2024-05-28 13:56:40] [INFO ] Deduced a trap composed of 139 places in 100 ms of which 2 ms to minimize.
[2024-05-28 13:56:40] [INFO ] Deduced a trap composed of 132 places in 104 ms of which 2 ms to minimize.
[2024-05-28 13:56:40] [INFO ] Deduced a trap composed of 136 places in 113 ms of which 2 ms to minimize.
[2024-05-28 13:56:40] [INFO ] Deduced a trap composed of 146 places in 116 ms of which 1 ms to minimize.
[2024-05-28 13:56:41] [INFO ] Deduced a trap composed of 138 places in 126 ms of which 2 ms to minimize.
[2024-05-28 13:56:41] [INFO ] Deduced a trap composed of 133 places in 123 ms of which 2 ms to minimize.
[2024-05-28 13:56:41] [INFO ] Deduced a trap composed of 142 places in 116 ms of which 2 ms to minimize.
[2024-05-28 13:56:41] [INFO ] Deduced a trap composed of 157 places in 111 ms of which 1 ms to minimize.
[2024-05-28 13:56:41] [INFO ] Deduced a trap composed of 135 places in 131 ms of which 1 ms to minimize.
[2024-05-28 13:56:41] [INFO ] Deduced a trap composed of 143 places in 110 ms of which 2 ms to minimize.
[2024-05-28 13:56:41] [INFO ] Deduced a trap composed of 164 places in 122 ms of which 2 ms to minimize.
[2024-05-28 13:56:42] [INFO ] Deduced a trap composed of 135 places in 122 ms of which 2 ms to minimize.
[2024-05-28 13:56:42] [INFO ] Deduced a trap composed of 139 places in 130 ms of which 1 ms to minimize.
[2024-05-28 13:56:42] [INFO ] Deduced a trap composed of 135 places in 107 ms of which 2 ms to minimize.
[2024-05-28 13:56:42] [INFO ] Deduced a trap composed of 142 places in 103 ms of which 1 ms to minimize.
[2024-05-28 13:56:42] [INFO ] Deduced a trap composed of 159 places in 116 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-05-28 13:56:43] [INFO ] Deduced a trap composed of 132 places in 142 ms of which 2 ms to minimize.
[2024-05-28 13:56:43] [INFO ] Deduced a trap composed of 136 places in 180 ms of which 2 ms to minimize.
[2024-05-28 13:56:43] [INFO ] Deduced a trap composed of 131 places in 151 ms of which 2 ms to minimize.
[2024-05-28 13:56:43] [INFO ] Deduced a trap composed of 135 places in 127 ms of which 2 ms to minimize.
[2024-05-28 13:56:43] [INFO ] Deduced a trap composed of 144 places in 147 ms of which 2 ms to minimize.
[2024-05-28 13:56:44] [INFO ] Deduced a trap composed of 133 places in 136 ms of which 2 ms to minimize.
[2024-05-28 13:56:44] [INFO ] Deduced a trap composed of 141 places in 156 ms of which 2 ms to minimize.
[2024-05-28 13:56:44] [INFO ] Deduced a trap composed of 157 places in 130 ms of which 3 ms to minimize.
[2024-05-28 13:56:44] [INFO ] Deduced a trap composed of 153 places in 158 ms of which 2 ms to minimize.
[2024-05-28 13:56:44] [INFO ] Deduced a trap composed of 117 places in 127 ms of which 2 ms to minimize.
[2024-05-28 13:56:45] [INFO ] Deduced a trap composed of 134 places in 131 ms of which 1 ms to minimize.
[2024-05-28 13:56:45] [INFO ] Deduced a trap composed of 132 places in 125 ms of which 1 ms to minimize.
[2024-05-28 13:56:45] [INFO ] Deduced a trap composed of 141 places in 121 ms of which 2 ms to minimize.
[2024-05-28 13:56:45] [INFO ] Deduced a trap composed of 147 places in 125 ms of which 1 ms to minimize.
[2024-05-28 13:56:45] [INFO ] Deduced a trap composed of 137 places in 141 ms of which 2 ms to minimize.
[2024-05-28 13:56:45] [INFO ] Deduced a trap composed of 120 places in 190 ms of which 6 ms to minimize.
[2024-05-28 13:56:45] [INFO ] Deduced a trap composed of 116 places in 128 ms of which 2 ms to minimize.
[2024-05-28 13:56:46] [INFO ] Deduced a trap composed of 128 places in 128 ms of which 2 ms to minimize.
[2024-05-28 13:56:46] [INFO ] Deduced a trap composed of 139 places in 146 ms of which 2 ms to minimize.
[2024-05-28 13:56:46] [INFO ] Deduced a trap composed of 131 places in 128 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-05-28 13:56:47] [INFO ] Deduced a trap composed of 140 places in 145 ms of which 2 ms to minimize.
[2024-05-28 13:56:47] [INFO ] Deduced a trap composed of 145 places in 159 ms of which 2 ms to minimize.
[2024-05-28 13:56:47] [INFO ] Deduced a trap composed of 150 places in 157 ms of which 2 ms to minimize.
[2024-05-28 13:56:47] [INFO ] Deduced a trap composed of 144 places in 139 ms of which 2 ms to minimize.
[2024-05-28 13:56:47] [INFO ] Deduced a trap composed of 141 places in 124 ms of which 2 ms to minimize.
[2024-05-28 13:56:47] [INFO ] Deduced a trap composed of 143 places in 133 ms of which 3 ms to minimize.
[2024-05-28 13:56:48] [INFO ] Deduced a trap composed of 142 places in 127 ms of which 2 ms to minimize.
[2024-05-28 13:56:48] [INFO ] Deduced a trap composed of 130 places in 147 ms of which 2 ms to minimize.
[2024-05-28 13:56:48] [INFO ] Deduced a trap composed of 147 places in 126 ms of which 2 ms to minimize.
[2024-05-28 13:56:48] [INFO ] Deduced a trap composed of 139 places in 123 ms of which 1 ms to minimize.
[2024-05-28 13:56:48] [INFO ] Deduced a trap composed of 133 places in 135 ms of which 1 ms to minimize.
[2024-05-28 13:56:48] [INFO ] Deduced a trap composed of 145 places in 108 ms of which 1 ms to minimize.
[2024-05-28 13:56:49] [INFO ] Deduced a trap composed of 131 places in 107 ms of which 1 ms to minimize.
[2024-05-28 13:56:49] [INFO ] Deduced a trap composed of 140 places in 160 ms of which 2 ms to minimize.
[2024-05-28 13:56:49] [INFO ] Deduced a trap composed of 147 places in 135 ms of which 3 ms to minimize.
[2024-05-28 13:56:49] [INFO ] Deduced a trap composed of 140 places in 156 ms of which 3 ms to minimize.
[2024-05-28 13:56:49] [INFO ] Deduced a trap composed of 140 places in 156 ms of which 2 ms to minimize.
[2024-05-28 13:56:49] [INFO ] Deduced a trap composed of 135 places in 138 ms of which 2 ms to minimize.
[2024-05-28 13:56:50] [INFO ] Deduced a trap composed of 150 places in 138 ms of which 2 ms to minimize.
[2024-05-28 13:56:50] [INFO ] Deduced a trap composed of 148 places in 160 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-05-28 13:56:53] [INFO ] Deduced a trap composed of 139 places in 158 ms of which 2 ms to minimize.
[2024-05-28 13:56:55] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 1 ms to minimize.
[2024-05-28 13:56:55] [INFO ] Deduced a trap composed of 94 places in 161 ms of which 2 ms to minimize.
[2024-05-28 13:56:55] [INFO ] Deduced a trap composed of 162 places in 126 ms of which 2 ms to minimize.
[2024-05-28 13:56:55] [INFO ] Deduced a trap composed of 178 places in 162 ms of which 2 ms to minimize.
[2024-05-28 13:56:56] [INFO ] Deduced a trap composed of 154 places in 162 ms of which 2 ms to minimize.
[2024-05-28 13:56:56] [INFO ] Deduced a trap composed of 169 places in 142 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 7/143 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-05-28 13:56:57] [INFO ] Deduced a trap composed of 122 places in 167 ms of which 3 ms to minimize.
[2024-05-28 13:56:58] [INFO ] Deduced a trap composed of 137 places in 119 ms of which 1 ms to minimize.
[2024-05-28 13:56:58] [INFO ] Deduced a trap composed of 141 places in 120 ms of which 2 ms to minimize.
[2024-05-28 13:56:58] [INFO ] Deduced a trap composed of 138 places in 129 ms of which 2 ms to minimize.
[2024-05-28 13:56:58] [INFO ] Deduced a trap composed of 125 places in 119 ms of which 2 ms to minimize.
SMT process timed out in 30653ms, After SMT, problems are : Problem set: 0 solved, 576 unsolved
Search for dead transitions found 0 dead transitions in 30664ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53614 ms. Remains : 298/298 places, 578/578 transitions.
Built C files in :
/tmp/ltsmin18104388688664809483
[2024-05-28 13:56:58] [INFO ] Computing symmetric may disable matrix : 578 transitions.
[2024-05-28 13:56:58] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:56:58] [INFO ] Computing symmetric may enable matrix : 578 transitions.
[2024-05-28 13:56:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:56:58] [INFO ] Computing Do-Not-Accords matrix : 578 transitions.
[2024-05-28 13:56:58] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:56:58] [INFO ] Built C files in 111ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18104388688664809483
Running compilation step : cd /tmp/ltsmin18104388688664809483;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1593 ms.
Running link step : cd /tmp/ltsmin18104388688664809483;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin18104388688664809483;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1101723755007834811.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 13:57:13] [INFO ] Flatten gal took : 45 ms
[2024-05-28 13:57:13] [INFO ] Flatten gal took : 37 ms
[2024-05-28 13:57:13] [INFO ] Time to serialize gal into /tmp/LTL12815181457451415907.gal : 9 ms
[2024-05-28 13:57:13] [INFO ] Time to serialize properties into /tmp/LTL12794213849007742476.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12815181457451415907.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5460887502888766814.hoa' '-atoms' '/tmp/LTL12794213849007742476.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12794213849007742476.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5460887502888766814.hoa
Detected timeout of ITS tools.
[2024-05-28 13:57:29] [INFO ] Flatten gal took : 55 ms
[2024-05-28 13:57:29] [INFO ] Flatten gal took : 30 ms
[2024-05-28 13:57:29] [INFO ] Time to serialize gal into /tmp/LTL1287317311735982621.gal : 16 ms
[2024-05-28 13:57:29] [INFO ] Time to serialize properties into /tmp/LTL1316068221525407514.ltl : 16 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1287317311735982621.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1316068221525407514.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((P_1725_4>=1)&&(MarkerRead>=1))&&(FetchJobB_1>=1))||(((P_1725_4>=1)&&(MarkerRead>=1))&&(FetchJobB_0>=1)))||((((P_1725_0...1710
Formula 0 simplified : FG!"((((((((P_1725_4>=1)&&(MarkerRead>=1))&&(FetchJobB_1>=1))||(((P_1725_4>=1)&&(MarkerRead>=1))&&(FetchJobB_0>=1)))||((((P_1725_0>=...1704
Detected timeout of ITS tools.
[2024-05-28 13:57:44] [INFO ] Flatten gal took : 40 ms
[2024-05-28 13:57:44] [INFO ] Applying decomposition
[2024-05-28 13:57:44] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1883596878184063258.txt' '-o' '/tmp/graph1883596878184063258.bin' '-w' '/tmp/graph1883596878184063258.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1883596878184063258.bin' '-l' '-1' '-v' '-w' '/tmp/graph1883596878184063258.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:57:44] [INFO ] Decomposing Gal with order
[2024-05-28 13:57:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:57:44] [INFO ] Removed a total of 591 redundant transitions.
[2024-05-28 13:57:44] [INFO ] Flatten gal took : 183 ms
[2024-05-28 13:57:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 313 labels/synchronizations in 40 ms.
[2024-05-28 13:57:44] [INFO ] Time to serialize gal into /tmp/LTL8095663950854922631.gal : 16 ms
[2024-05-28 13:57:44] [INFO ] Time to serialize properties into /tmp/LTL15632023846574782658.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8095663950854922631.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15632023846574782658.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((i0.u3.P_1725_4>=1)&&(i2.u4.MarkerRead>=1))&&(i2.u6.FetchJobB_1>=1))||(((i0.u3.P_1725_4>=1)&&(i2.u4.MarkerRead>=1))&&(i...2250
Formula 0 simplified : FG!"((((((((i0.u3.P_1725_4>=1)&&(i2.u4.MarkerRead>=1))&&(i2.u6.FetchJobB_1>=1))||(((i0.u3.P_1725_4>=1)&&(i2.u4.MarkerRead>=1))&&(i2....2244
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-08 finished in 274137 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F(p1)))))'
Support contains 16 out of 462 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 462 transition count 776
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 420 transition count 776
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 84 place count 420 transition count 728
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 180 place count 372 transition count 728
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 276 place count 324 transition count 680
Applied a total of 276 rules in 44 ms. Remains 324 /462 variables (removed 138) and now considering 680/818 (removed 138) transitions.
Running 678 sub problems to find dead transitions.
[2024-05-28 13:57:59] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
// Phase 1: matrix 668 rows 324 cols
[2024-05-28 13:57:59] [INFO ] Computed 38 invariants in 7 ms
[2024-05-28 13:57:59] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-05-28 13:58:04] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
[2024-05-28 13:58:04] [INFO ] Deduced a trap composed of 42 places in 30 ms of which 1 ms to minimize.
[2024-05-28 13:58:04] [INFO ] Deduced a trap composed of 42 places in 28 ms of which 1 ms to minimize.
[2024-05-28 13:58:04] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 1 ms to minimize.
[2024-05-28 13:58:04] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 3 ms to minimize.
[2024-05-28 13:58:04] [INFO ] Deduced a trap composed of 121 places in 134 ms of which 6 ms to minimize.
[2024-05-28 13:58:04] [INFO ] Deduced a trap composed of 109 places in 148 ms of which 2 ms to minimize.
[2024-05-28 13:58:04] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 3 ms to minimize.
[2024-05-28 13:58:05] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-05-28 13:58:08] [INFO ] Deduced a trap composed of 127 places in 168 ms of which 2 ms to minimize.
[2024-05-28 13:58:08] [INFO ] Deduced a trap composed of 25 places in 153 ms of which 2 ms to minimize.
[2024-05-28 13:58:08] [INFO ] Deduced a trap composed of 114 places in 147 ms of which 2 ms to minimize.
[2024-05-28 13:58:08] [INFO ] Deduced a trap composed of 144 places in 168 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-05-28 13:58:13] [INFO ] Deduced a trap composed of 65 places in 149 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/324 variables, 2/52 constraints. Problems are: Problem set: 66 solved, 612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 324/992 variables, and 52 constraints, problems are : Problem set: 66 solved, 612 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 678/678 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 66 solved, 612 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 13/13 constraints. Problems are: Problem set: 66 solved, 612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 23/36 constraints. Problems are: Problem set: 66 solved, 612 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 14/50 constraints. Problems are: Problem set: 66 solved, 612 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 0/50 constraints. Problems are: Problem set: 66 solved, 612 unsolved
At refinement iteration 4 (OVERLAPS) 2/324 variables, 2/52 constraints. Problems are: Problem set: 66 solved, 612 unsolved
[2024-05-28 13:58:40] [INFO ] Deduced a trap composed of 153 places in 159 ms of which 2 ms to minimize.
[2024-05-28 13:58:40] [INFO ] Deduced a trap composed of 170 places in 148 ms of which 2 ms to minimize.
[2024-05-28 13:58:40] [INFO ] Deduced a trap composed of 117 places in 163 ms of which 3 ms to minimize.
SMT process timed out in 40898ms, After SMT, problems are : Problem set: 66 solved, 612 unsolved
Search for dead transitions found 66 dead transitions in 40909ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
[2024-05-28 13:58:40] [INFO ] Flow matrix only has 602 transitions (discarded 12 similar events)
// Phase 1: matrix 602 rows 324 cols
[2024-05-28 13:58:40] [INFO ] Computed 38 invariants in 10 ms
[2024-05-28 13:58:41] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-28 13:58:41] [INFO ] Flow matrix only has 602 transitions (discarded 12 similar events)
[2024-05-28 13:58:41] [INFO ] Invariant cache hit.
[2024-05-28 13:58:41] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:58:42] [INFO ] Implicit Places using invariants and state equation in 1678 ms returned []
Implicit Place search using SMT with State Equation took 1982 ms to find 0 implicit places.
[2024-05-28 13:58:42] [INFO ] Redundant transitions in 3 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 324/462 places, 614/818 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 310 transition count 590
Applied a total of 12 rules in 13 ms. Remains 310 /324 variables (removed 14) and now considering 590/614 (removed 24) transitions.
[2024-05-28 13:58:42] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
// Phase 1: matrix 578 rows 310 cols
[2024-05-28 13:58:42] [INFO ] Computed 38 invariants in 12 ms
[2024-05-28 13:58:43] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-28 13:58:43] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-05-28 13:58:43] [INFO ] Invariant cache hit.
[2024-05-28 13:58:43] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:58:44] [INFO ] Implicit Places using invariants and state equation in 1841 ms returned []
Implicit Place search using SMT with State Equation took 2163 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 310/462 places, 590/818 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45124 ms. Remains : 310/462 places, 590/818 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-09
Product exploration explored 100000 steps with 2687 reset in 285 ms.
Product exploration explored 100000 steps with 2713 reset in 284 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 133 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 6 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0), false, false]
RANDOM walk for 40000 steps (21 resets) in 295 ms. (135 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40000 steps (48 resets) in 212 ms. (187 steps per ms) remains 1/1 properties
[2024-05-28 13:58:46] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-05-28 13:58:46] [INFO ] Invariant cache hit.
[2024-05-28 13:58:46] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 109/125 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 62/187 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/194 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 307/888 variables, and 36 constraints, problems are : Problem set: 1 solved, 0 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/310 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 136ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 243 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter insensitive) to 6 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0), false, false]
Stuttering acceptance computed with spot in 321 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0), false, false]
[2024-05-28 13:58:47] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-05-28 13:58:47] [INFO ] Invariant cache hit.
[2024-05-28 13:58:47] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-05-28 13:58:47] [INFO ] [Real]Absence check using 15 positive and 23 generalized place invariants in 90 ms returned sat
[2024-05-28 13:58:48] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
[2024-05-28 13:58:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:58:48] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-05-28 13:58:48] [INFO ] [Nat]Absence check using 15 positive and 23 generalized place invariants in 27 ms returned sat
[2024-05-28 13:58:49] [INFO ] [Nat]Absence check using state equation in 580 ms returned sat
[2024-05-28 13:58:49] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:58:49] [INFO ] [Nat]Added 72 Read/Feed constraints in 74 ms returned sat
[2024-05-28 13:58:49] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-05-28 13:58:49] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
[2024-05-28 13:58:49] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-28 13:58:49] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 16 ms to minimize.
[2024-05-28 13:58:49] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-28 13:58:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 605 ms
[2024-05-28 13:58:49] [INFO ] Computed and/alt/rep : 354/1545/348 causal constraints (skipped 228 transitions) in 54 ms.
[2024-05-28 13:58:52] [INFO ] Added : 295 causal constraints over 59 iterations in 2968 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-28 13:58:52] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-05-28 13:58:52] [INFO ] Invariant cache hit.
[2024-05-28 13:58:53] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-05-28 13:58:53] [INFO ] [Real]Absence check using 15 positive and 23 generalized place invariants in 34 ms returned sat
[2024-05-28 13:58:53] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2024-05-28 13:58:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:58:53] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-05-28 13:58:53] [INFO ] [Nat]Absence check using 15 positive and 23 generalized place invariants in 24 ms returned sat
[2024-05-28 13:58:54] [INFO ] [Nat]Absence check using state equation in 534 ms returned sat
[2024-05-28 13:58:54] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:58:54] [INFO ] [Nat]Added 72 Read/Feed constraints in 78 ms returned sat
[2024-05-28 13:58:54] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 2 ms to minimize.
[2024-05-28 13:58:54] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 2 ms to minimize.
[2024-05-28 13:58:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 403 ms
[2024-05-28 13:58:55] [INFO ] Computed and/alt/rep : 354/1545/348 causal constraints (skipped 228 transitions) in 44 ms.
[2024-05-28 13:58:56] [INFO ] Added : 250 causal constraints over 50 iterations in 1876 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 16 out of 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 590/590 transitions.
Applied a total of 0 rules in 10 ms. Remains 310 /310 variables (removed 0) and now considering 590/590 (removed 0) transitions.
Running 588 sub problems to find dead transitions.
[2024-05-28 13:58:56] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-05-28 13:58:56] [INFO ] Invariant cache hit.
[2024-05-28 13:58:56] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-28 13:59:00] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:59:00] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:59:00] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-05-28 13:59:00] [INFO ] Deduced a trap composed of 40 places in 26 ms of which 0 ms to minimize.
[2024-05-28 13:59:00] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
[2024-05-28 13:59:00] [INFO ] Deduced a trap composed of 40 places in 26 ms of which 1 ms to minimize.
[2024-05-28 13:59:00] [INFO ] Deduced a trap composed of 120 places in 121 ms of which 2 ms to minimize.
[2024-05-28 13:59:01] [INFO ] Deduced a trap composed of 124 places in 125 ms of which 1 ms to minimize.
[2024-05-28 13:59:01] [INFO ] Deduced a trap composed of 138 places in 104 ms of which 2 ms to minimize.
[2024-05-28 13:59:01] [INFO ] Deduced a trap composed of 111 places in 141 ms of which 3 ms to minimize.
[2024-05-28 13:59:01] [INFO ] Deduced a trap composed of 111 places in 142 ms of which 2 ms to minimize.
[2024-05-28 13:59:01] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 1 ms to minimize.
[2024-05-28 13:59:01] [INFO ] Deduced a trap composed of 104 places in 117 ms of which 2 ms to minimize.
[2024-05-28 13:59:01] [INFO ] Deduced a trap composed of 137 places in 118 ms of which 2 ms to minimize.
[2024-05-28 13:59:02] [INFO ] Deduced a trap composed of 119 places in 111 ms of which 2 ms to minimize.
[2024-05-28 13:59:02] [INFO ] Deduced a trap composed of 141 places in 164 ms of which 2 ms to minimize.
[2024-05-28 13:59:02] [INFO ] Deduced a trap composed of 118 places in 122 ms of which 2 ms to minimize.
[2024-05-28 13:59:02] [INFO ] Deduced a trap composed of 143 places in 151 ms of which 4 ms to minimize.
[2024-05-28 13:59:02] [INFO ] Deduced a trap composed of 154 places in 139 ms of which 2 ms to minimize.
[2024-05-28 13:59:03] [INFO ] Deduced a trap composed of 113 places in 173 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-28 13:59:03] [INFO ] Deduced a trap composed of 111 places in 135 ms of which 2 ms to minimize.
[2024-05-28 13:59:03] [INFO ] Deduced a trap composed of 117 places in 151 ms of which 2 ms to minimize.
[2024-05-28 13:59:03] [INFO ] Deduced a trap composed of 113 places in 205 ms of which 3 ms to minimize.
[2024-05-28 13:59:04] [INFO ] Deduced a trap composed of 111 places in 173 ms of which 3 ms to minimize.
[2024-05-28 13:59:04] [INFO ] Deduced a trap composed of 123 places in 155 ms of which 3 ms to minimize.
[2024-05-28 13:59:04] [INFO ] Deduced a trap composed of 123 places in 143 ms of which 5 ms to minimize.
[2024-05-28 13:59:04] [INFO ] Deduced a trap composed of 137 places in 184 ms of which 2 ms to minimize.
[2024-05-28 13:59:04] [INFO ] Deduced a trap composed of 125 places in 154 ms of which 2 ms to minimize.
[2024-05-28 13:59:05] [INFO ] Deduced a trap composed of 132 places in 146 ms of which 2 ms to minimize.
[2024-05-28 13:59:05] [INFO ] Deduced a trap composed of 129 places in 146 ms of which 2 ms to minimize.
[2024-05-28 13:59:05] [INFO ] Deduced a trap composed of 135 places in 164 ms of which 2 ms to minimize.
[2024-05-28 13:59:05] [INFO ] Deduced a trap composed of 148 places in 139 ms of which 2 ms to minimize.
[2024-05-28 13:59:05] [INFO ] Deduced a trap composed of 148 places in 151 ms of which 2 ms to minimize.
[2024-05-28 13:59:05] [INFO ] Deduced a trap composed of 137 places in 146 ms of which 2 ms to minimize.
[2024-05-28 13:59:06] [INFO ] Deduced a trap composed of 148 places in 131 ms of which 3 ms to minimize.
[2024-05-28 13:59:06] [INFO ] Deduced a trap composed of 143 places in 144 ms of which 2 ms to minimize.
[2024-05-28 13:59:06] [INFO ] Deduced a trap composed of 121 places in 180 ms of which 3 ms to minimize.
[2024-05-28 13:59:06] [INFO ] Deduced a trap composed of 124 places in 175 ms of which 3 ms to minimize.
[2024-05-28 13:59:06] [INFO ] Deduced a trap composed of 144 places in 178 ms of which 2 ms to minimize.
[2024-05-28 13:59:07] [INFO ] Deduced a trap composed of 125 places in 137 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-28 13:59:10] [INFO ] Deduced a trap composed of 115 places in 105 ms of which 2 ms to minimize.
[2024-05-28 13:59:10] [INFO ] Deduced a trap composed of 158 places in 124 ms of which 2 ms to minimize.
[2024-05-28 13:59:10] [INFO ] Deduced a trap composed of 152 places in 112 ms of which 2 ms to minimize.
[2024-05-28 13:59:10] [INFO ] Deduced a trap composed of 132 places in 107 ms of which 2 ms to minimize.
[2024-05-28 13:59:10] [INFO ] Deduced a trap composed of 140 places in 118 ms of which 1 ms to minimize.
[2024-05-28 13:59:10] [INFO ] Deduced a trap composed of 155 places in 115 ms of which 1 ms to minimize.
[2024-05-28 13:59:10] [INFO ] Deduced a trap composed of 142 places in 127 ms of which 2 ms to minimize.
[2024-05-28 13:59:10] [INFO ] Deduced a trap composed of 145 places in 117 ms of which 1 ms to minimize.
[2024-05-28 13:59:11] [INFO ] Deduced a trap composed of 158 places in 120 ms of which 1 ms to minimize.
[2024-05-28 13:59:11] [INFO ] Deduced a trap composed of 140 places in 115 ms of which 2 ms to minimize.
[2024-05-28 13:59:11] [INFO ] Deduced a trap composed of 156 places in 98 ms of which 2 ms to minimize.
[2024-05-28 13:59:11] [INFO ] Deduced a trap composed of 139 places in 112 ms of which 1 ms to minimize.
[2024-05-28 13:59:11] [INFO ] Deduced a trap composed of 158 places in 182 ms of which 2 ms to minimize.
[2024-05-28 13:59:11] [INFO ] Deduced a trap composed of 134 places in 116 ms of which 2 ms to minimize.
[2024-05-28 13:59:11] [INFO ] Deduced a trap composed of 132 places in 109 ms of which 2 ms to minimize.
[2024-05-28 13:59:12] [INFO ] Deduced a trap composed of 125 places in 112 ms of which 1 ms to minimize.
[2024-05-28 13:59:12] [INFO ] Deduced a trap composed of 147 places in 99 ms of which 1 ms to minimize.
[2024-05-28 13:59:12] [INFO ] Deduced a trap composed of 140 places in 108 ms of which 2 ms to minimize.
[2024-05-28 13:59:12] [INFO ] Deduced a trap composed of 137 places in 109 ms of which 2 ms to minimize.
[2024-05-28 13:59:12] [INFO ] Deduced a trap composed of 142 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-28 13:59:14] [INFO ] Deduced a trap composed of 143 places in 169 ms of which 3 ms to minimize.
[2024-05-28 13:59:14] [INFO ] Deduced a trap composed of 147 places in 137 ms of which 2 ms to minimize.
[2024-05-28 13:59:14] [INFO ] Deduced a trap composed of 133 places in 137 ms of which 2 ms to minimize.
[2024-05-28 13:59:14] [INFO ] Deduced a trap composed of 132 places in 144 ms of which 2 ms to minimize.
[2024-05-28 13:59:14] [INFO ] Deduced a trap composed of 139 places in 131 ms of which 2 ms to minimize.
[2024-05-28 13:59:14] [INFO ] Deduced a trap composed of 139 places in 164 ms of which 2 ms to minimize.
[2024-05-28 13:59:14] [INFO ] Deduced a trap composed of 146 places in 131 ms of which 2 ms to minimize.
[2024-05-28 13:59:15] [INFO ] Deduced a trap composed of 137 places in 111 ms of which 2 ms to minimize.
[2024-05-28 13:59:15] [INFO ] Deduced a trap composed of 140 places in 128 ms of which 2 ms to minimize.
[2024-05-28 13:59:15] [INFO ] Deduced a trap composed of 124 places in 133 ms of which 2 ms to minimize.
[2024-05-28 13:59:15] [INFO ] Deduced a trap composed of 131 places in 111 ms of which 2 ms to minimize.
[2024-05-28 13:59:15] [INFO ] Deduced a trap composed of 143 places in 129 ms of which 2 ms to minimize.
[2024-05-28 13:59:15] [INFO ] Deduced a trap composed of 153 places in 160 ms of which 3 ms to minimize.
[2024-05-28 13:59:16] [INFO ] Deduced a trap composed of 150 places in 116 ms of which 2 ms to minimize.
[2024-05-28 13:59:16] [INFO ] Deduced a trap composed of 147 places in 113 ms of which 2 ms to minimize.
[2024-05-28 13:59:16] [INFO ] Deduced a trap composed of 158 places in 129 ms of which 1 ms to minimize.
[2024-05-28 13:59:16] [INFO ] Deduced a trap composed of 153 places in 118 ms of which 1 ms to minimize.
[2024-05-28 13:59:16] [INFO ] Deduced a trap composed of 153 places in 120 ms of which 1 ms to minimize.
[2024-05-28 13:59:16] [INFO ] Deduced a trap composed of 134 places in 109 ms of which 1 ms to minimize.
[2024-05-28 13:59:16] [INFO ] Deduced a trap composed of 140 places in 111 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-28 13:59:17] [INFO ] Deduced a trap composed of 146 places in 103 ms of which 2 ms to minimize.
[2024-05-28 13:59:17] [INFO ] Deduced a trap composed of 121 places in 121 ms of which 1 ms to minimize.
[2024-05-28 13:59:17] [INFO ] Deduced a trap composed of 123 places in 109 ms of which 2 ms to minimize.
[2024-05-28 13:59:17] [INFO ] Deduced a trap composed of 125 places in 137 ms of which 2 ms to minimize.
SMT process timed out in 20779ms, After SMT, problems are : Problem set: 0 solved, 588 unsolved
Search for dead transitions found 0 dead transitions in 20786ms
[2024-05-28 13:59:17] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-05-28 13:59:17] [INFO ] Invariant cache hit.
[2024-05-28 13:59:17] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-28 13:59:17] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-05-28 13:59:17] [INFO ] Invariant cache hit.
[2024-05-28 13:59:18] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:59:19] [INFO ] Implicit Places using invariants and state equation in 1938 ms returned []
Implicit Place search using SMT with State Equation took 2167 ms to find 0 implicit places.
[2024-05-28 13:59:19] [INFO ] Redundant transitions in 2 ms returned []
Running 588 sub problems to find dead transitions.
[2024-05-28 13:59:19] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-05-28 13:59:19] [INFO ] Invariant cache hit.
[2024-05-28 13:59:19] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-28 13:59:22] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-28 13:59:22] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-28 13:59:22] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
[2024-05-28 13:59:22] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
[2024-05-28 13:59:22] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
[2024-05-28 13:59:22] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 0 ms to minimize.
[2024-05-28 13:59:23] [INFO ] Deduced a trap composed of 120 places in 184 ms of which 2 ms to minimize.
[2024-05-28 13:59:23] [INFO ] Deduced a trap composed of 124 places in 142 ms of which 2 ms to minimize.
[2024-05-28 13:59:23] [INFO ] Deduced a trap composed of 138 places in 108 ms of which 2 ms to minimize.
[2024-05-28 13:59:23] [INFO ] Deduced a trap composed of 111 places in 98 ms of which 2 ms to minimize.
[2024-05-28 13:59:23] [INFO ] Deduced a trap composed of 111 places in 165 ms of which 2 ms to minimize.
[2024-05-28 13:59:23] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 2 ms to minimize.
[2024-05-28 13:59:24] [INFO ] Deduced a trap composed of 104 places in 138 ms of which 2 ms to minimize.
[2024-05-28 13:59:24] [INFO ] Deduced a trap composed of 137 places in 129 ms of which 2 ms to minimize.
[2024-05-28 13:59:24] [INFO ] Deduced a trap composed of 119 places in 116 ms of which 1 ms to minimize.
[2024-05-28 13:59:24] [INFO ] Deduced a trap composed of 141 places in 112 ms of which 2 ms to minimize.
[2024-05-28 13:59:24] [INFO ] Deduced a trap composed of 118 places in 99 ms of which 1 ms to minimize.
[2024-05-28 13:59:24] [INFO ] Deduced a trap composed of 143 places in 113 ms of which 1 ms to minimize.
[2024-05-28 13:59:24] [INFO ] Deduced a trap composed of 154 places in 100 ms of which 2 ms to minimize.
[2024-05-28 13:59:24] [INFO ] Deduced a trap composed of 113 places in 98 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-28 13:59:25] [INFO ] Deduced a trap composed of 111 places in 90 ms of which 1 ms to minimize.
[2024-05-28 13:59:25] [INFO ] Deduced a trap composed of 117 places in 93 ms of which 2 ms to minimize.
[2024-05-28 13:59:25] [INFO ] Deduced a trap composed of 113 places in 93 ms of which 2 ms to minimize.
[2024-05-28 13:59:25] [INFO ] Deduced a trap composed of 111 places in 93 ms of which 1 ms to minimize.
[2024-05-28 13:59:25] [INFO ] Deduced a trap composed of 123 places in 147 ms of which 2 ms to minimize.
[2024-05-28 13:59:25] [INFO ] Deduced a trap composed of 123 places in 112 ms of which 2 ms to minimize.
[2024-05-28 13:59:26] [INFO ] Deduced a trap composed of 137 places in 114 ms of which 2 ms to minimize.
[2024-05-28 13:59:26] [INFO ] Deduced a trap composed of 125 places in 146 ms of which 2 ms to minimize.
[2024-05-28 13:59:26] [INFO ] Deduced a trap composed of 132 places in 133 ms of which 2 ms to minimize.
[2024-05-28 13:59:26] [INFO ] Deduced a trap composed of 129 places in 106 ms of which 2 ms to minimize.
[2024-05-28 13:59:26] [INFO ] Deduced a trap composed of 135 places in 138 ms of which 3 ms to minimize.
[2024-05-28 13:59:26] [INFO ] Deduced a trap composed of 148 places in 131 ms of which 3 ms to minimize.
[2024-05-28 13:59:26] [INFO ] Deduced a trap composed of 148 places in 129 ms of which 2 ms to minimize.
[2024-05-28 13:59:26] [INFO ] Deduced a trap composed of 137 places in 126 ms of which 2 ms to minimize.
[2024-05-28 13:59:27] [INFO ] Deduced a trap composed of 148 places in 112 ms of which 2 ms to minimize.
[2024-05-28 13:59:27] [INFO ] Deduced a trap composed of 143 places in 142 ms of which 2 ms to minimize.
[2024-05-28 13:59:27] [INFO ] Deduced a trap composed of 121 places in 150 ms of which 2 ms to minimize.
[2024-05-28 13:59:27] [INFO ] Deduced a trap composed of 124 places in 135 ms of which 3 ms to minimize.
[2024-05-28 13:59:27] [INFO ] Deduced a trap composed of 144 places in 135 ms of which 2 ms to minimize.
[2024-05-28 13:59:27] [INFO ] Deduced a trap composed of 125 places in 153 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-28 13:59:31] [INFO ] Deduced a trap composed of 115 places in 102 ms of which 1 ms to minimize.
[2024-05-28 13:59:31] [INFO ] Deduced a trap composed of 158 places in 125 ms of which 2 ms to minimize.
[2024-05-28 13:59:31] [INFO ] Deduced a trap composed of 152 places in 141 ms of which 2 ms to minimize.
[2024-05-28 13:59:31] [INFO ] Deduced a trap composed of 132 places in 124 ms of which 2 ms to minimize.
[2024-05-28 13:59:31] [INFO ] Deduced a trap composed of 140 places in 122 ms of which 1 ms to minimize.
[2024-05-28 13:59:32] [INFO ] Deduced a trap composed of 155 places in 121 ms of which 1 ms to minimize.
[2024-05-28 13:59:32] [INFO ] Deduced a trap composed of 142 places in 125 ms of which 2 ms to minimize.
[2024-05-28 13:59:32] [INFO ] Deduced a trap composed of 145 places in 123 ms of which 1 ms to minimize.
[2024-05-28 13:59:32] [INFO ] Deduced a trap composed of 158 places in 108 ms of which 1 ms to minimize.
[2024-05-28 13:59:32] [INFO ] Deduced a trap composed of 140 places in 107 ms of which 1 ms to minimize.
[2024-05-28 13:59:32] [INFO ] Deduced a trap composed of 156 places in 190 ms of which 3 ms to minimize.
[2024-05-28 13:59:32] [INFO ] Deduced a trap composed of 139 places in 131 ms of which 3 ms to minimize.
[2024-05-28 13:59:33] [INFO ] Deduced a trap composed of 158 places in 127 ms of which 2 ms to minimize.
[2024-05-28 13:59:33] [INFO ] Deduced a trap composed of 134 places in 128 ms of which 2 ms to minimize.
[2024-05-28 13:59:33] [INFO ] Deduced a trap composed of 132 places in 134 ms of which 2 ms to minimize.
[2024-05-28 13:59:33] [INFO ] Deduced a trap composed of 125 places in 129 ms of which 2 ms to minimize.
[2024-05-28 13:59:33] [INFO ] Deduced a trap composed of 147 places in 117 ms of which 2 ms to minimize.
[2024-05-28 13:59:33] [INFO ] Deduced a trap composed of 140 places in 120 ms of which 2 ms to minimize.
[2024-05-28 13:59:33] [INFO ] Deduced a trap composed of 137 places in 112 ms of which 2 ms to minimize.
[2024-05-28 13:59:34] [INFO ] Deduced a trap composed of 142 places in 109 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-28 13:59:35] [INFO ] Deduced a trap composed of 143 places in 168 ms of which 2 ms to minimize.
[2024-05-28 13:59:35] [INFO ] Deduced a trap composed of 147 places in 134 ms of which 2 ms to minimize.
[2024-05-28 13:59:35] [INFO ] Deduced a trap composed of 133 places in 135 ms of which 3 ms to minimize.
[2024-05-28 13:59:35] [INFO ] Deduced a trap composed of 132 places in 126 ms of which 1 ms to minimize.
[2024-05-28 13:59:35] [INFO ] Deduced a trap composed of 139 places in 166 ms of which 2 ms to minimize.
[2024-05-28 13:59:35] [INFO ] Deduced a trap composed of 139 places in 109 ms of which 2 ms to minimize.
[2024-05-28 13:59:36] [INFO ] Deduced a trap composed of 146 places in 186 ms of which 2 ms to minimize.
[2024-05-28 13:59:36] [INFO ] Deduced a trap composed of 137 places in 156 ms of which 3 ms to minimize.
[2024-05-28 13:59:36] [INFO ] Deduced a trap composed of 140 places in 150 ms of which 2 ms to minimize.
[2024-05-28 13:59:36] [INFO ] Deduced a trap composed of 124 places in 157 ms of which 2 ms to minimize.
[2024-05-28 13:59:36] [INFO ] Deduced a trap composed of 131 places in 148 ms of which 2 ms to minimize.
[2024-05-28 13:59:37] [INFO ] Deduced a trap composed of 143 places in 148 ms of which 3 ms to minimize.
[2024-05-28 13:59:37] [INFO ] Deduced a trap composed of 153 places in 170 ms of which 2 ms to minimize.
[2024-05-28 13:59:37] [INFO ] Deduced a trap composed of 150 places in 160 ms of which 2 ms to minimize.
[2024-05-28 13:59:37] [INFO ] Deduced a trap composed of 147 places in 218 ms of which 3 ms to minimize.
[2024-05-28 13:59:37] [INFO ] Deduced a trap composed of 158 places in 160 ms of which 3 ms to minimize.
[2024-05-28 13:59:38] [INFO ] Deduced a trap composed of 153 places in 136 ms of which 3 ms to minimize.
[2024-05-28 13:59:38] [INFO ] Deduced a trap composed of 153 places in 167 ms of which 2 ms to minimize.
[2024-05-28 13:59:38] [INFO ] Deduced a trap composed of 134 places in 148 ms of which 2 ms to minimize.
[2024-05-28 13:59:38] [INFO ] Deduced a trap composed of 140 places in 130 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-28 13:59:39] [INFO ] Deduced a trap composed of 146 places in 177 ms of which 3 ms to minimize.
[2024-05-28 13:59:39] [INFO ] Deduced a trap composed of 121 places in 132 ms of which 2 ms to minimize.
[2024-05-28 13:59:39] [INFO ] Deduced a trap composed of 123 places in 128 ms of which 2 ms to minimize.
[2024-05-28 13:59:39] [INFO ] Deduced a trap composed of 125 places in 132 ms of which 2 ms to minimize.
[2024-05-28 13:59:39] [INFO ] Deduced a trap composed of 147 places in 109 ms of which 2 ms to minimize.
[2024-05-28 13:59:39] [INFO ] Deduced a trap composed of 159 places in 116 ms of which 2 ms to minimize.
[2024-05-28 13:59:40] [INFO ] Deduced a trap composed of 144 places in 157 ms of which 2 ms to minimize.
[2024-05-28 13:59:40] [INFO ] Deduced a trap composed of 137 places in 128 ms of which 2 ms to minimize.
[2024-05-28 13:59:40] [INFO ] Deduced a trap composed of 143 places in 136 ms of which 3 ms to minimize.
[2024-05-28 13:59:41] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 2 ms to minimize.
[2024-05-28 13:59:41] [INFO ] Deduced a trap composed of 170 places in 144 ms of which 2 ms to minimize.
[2024-05-28 13:59:41] [INFO ] Deduced a trap composed of 147 places in 177 ms of which 2 ms to minimize.
[2024-05-28 13:59:42] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 2 ms to minimize.
[2024-05-28 13:59:43] [INFO ] Deduced a trap composed of 153 places in 126 ms of which 1 ms to minimize.
[2024-05-28 13:59:43] [INFO ] Deduced a trap composed of 150 places in 146 ms of which 2 ms to minimize.
[2024-05-28 13:59:44] [INFO ] Deduced a trap composed of 142 places in 153 ms of which 2 ms to minimize.
[2024-05-28 13:59:44] [INFO ] Deduced a trap composed of 146 places in 115 ms of which 2 ms to minimize.
[2024-05-28 13:59:44] [INFO ] Deduced a trap composed of 146 places in 139 ms of which 2 ms to minimize.
[2024-05-28 13:59:44] [INFO ] Deduced a trap composed of 127 places in 140 ms of which 2 ms to minimize.
[2024-05-28 13:59:44] [INFO ] Deduced a trap composed of 129 places in 120 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-28 13:59:48] [INFO ] Deduced a trap composed of 130 places in 113 ms of which 1 ms to minimize.
[2024-05-28 13:59:48] [INFO ] Deduced a trap composed of 148 places in 114 ms of which 1 ms to minimize.
[2024-05-28 13:59:48] [INFO ] Deduced a trap composed of 146 places in 114 ms of which 1 ms to minimize.
[2024-05-28 13:59:49] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 2 ms to minimize.
[2024-05-28 13:59:49] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 4 ms to minimize.
[2024-05-28 13:59:49] [INFO ] Deduced a trap composed of 148 places in 105 ms of which 2 ms to minimize.
[2024-05-28 13:59:49] [INFO ] Deduced a trap composed of 125 places in 114 ms of which 2 ms to minimize.
[2024-05-28 13:59:50] [INFO ] Deduced a trap composed of 132 places in 119 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/888 variables, and 144 constraints, problems are : Problem set: 0 solved, 588 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/310 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 588/588 constraints, Known Traps: 108/108 constraints]
Escalating to Integer solving :Problem set: 0 solved, 588 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 108/144 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-28 13:59:51] [INFO ] Deduced a trap composed of 143 places in 93 ms of which 2 ms to minimize.
[2024-05-28 13:59:52] [INFO ] Deduced a trap composed of 152 places in 117 ms of which 1 ms to minimize.
[2024-05-28 13:59:52] [INFO ] Deduced a trap composed of 147 places in 109 ms of which 1 ms to minimize.
[2024-05-28 13:59:52] [INFO ] Deduced a trap composed of 142 places in 107 ms of which 1 ms to minimize.
[2024-05-28 13:59:52] [INFO ] Deduced a trap composed of 147 places in 107 ms of which 2 ms to minimize.
[2024-05-28 13:59:52] [INFO ] Deduced a trap composed of 132 places in 115 ms of which 2 ms to minimize.
[2024-05-28 13:59:52] [INFO ] Deduced a trap composed of 137 places in 103 ms of which 1 ms to minimize.
[2024-05-28 13:59:52] [INFO ] Deduced a trap composed of 148 places in 116 ms of which 2 ms to minimize.
[2024-05-28 13:59:53] [INFO ] Deduced a trap composed of 145 places in 129 ms of which 2 ms to minimize.
[2024-05-28 13:59:53] [INFO ] Deduced a trap composed of 151 places in 112 ms of which 1 ms to minimize.
[2024-05-28 13:59:53] [INFO ] Deduced a trap composed of 152 places in 170 ms of which 1 ms to minimize.
[2024-05-28 13:59:53] [INFO ] Deduced a trap composed of 145 places in 101 ms of which 1 ms to minimize.
[2024-05-28 13:59:53] [INFO ] Deduced a trap composed of 139 places in 116 ms of which 1 ms to minimize.
[2024-05-28 13:59:53] [INFO ] Deduced a trap composed of 139 places in 129 ms of which 2 ms to minimize.
[2024-05-28 13:59:53] [INFO ] Deduced a trap composed of 128 places in 114 ms of which 1 ms to minimize.
[2024-05-28 13:59:54] [INFO ] Deduced a trap composed of 142 places in 108 ms of which 2 ms to minimize.
[2024-05-28 13:59:54] [INFO ] Deduced a trap composed of 152 places in 157 ms of which 1 ms to minimize.
[2024-05-28 13:59:54] [INFO ] Deduced a trap composed of 126 places in 115 ms of which 1 ms to minimize.
[2024-05-28 13:59:54] [INFO ] Deduced a trap composed of 146 places in 127 ms of which 2 ms to minimize.
[2024-05-28 13:59:54] [INFO ] Deduced a trap composed of 150 places in 116 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-28 13:59:56] [INFO ] Deduced a trap composed of 142 places in 114 ms of which 2 ms to minimize.
[2024-05-28 13:59:56] [INFO ] Deduced a trap composed of 160 places in 112 ms of which 2 ms to minimize.
[2024-05-28 13:59:56] [INFO ] Deduced a trap composed of 139 places in 123 ms of which 1 ms to minimize.
[2024-05-28 13:59:56] [INFO ] Deduced a trap composed of 136 places in 104 ms of which 2 ms to minimize.
[2024-05-28 13:59:56] [INFO ] Deduced a trap composed of 152 places in 98 ms of which 1 ms to minimize.
[2024-05-28 13:59:56] [INFO ] Deduced a trap composed of 143 places in 106 ms of which 1 ms to minimize.
[2024-05-28 13:59:56] [INFO ] Deduced a trap composed of 152 places in 135 ms of which 2 ms to minimize.
[2024-05-28 13:59:57] [INFO ] Deduced a trap composed of 151 places in 183 ms of which 2 ms to minimize.
[2024-05-28 13:59:57] [INFO ] Deduced a trap composed of 142 places in 177 ms of which 2 ms to minimize.
[2024-05-28 13:59:58] [INFO ] Deduced a trap composed of 147 places in 171 ms of which 3 ms to minimize.
[2024-05-28 13:59:58] [INFO ] Deduced a trap composed of 148 places in 140 ms of which 3 ms to minimize.
[2024-05-28 13:59:58] [INFO ] Deduced a trap composed of 147 places in 167 ms of which 3 ms to minimize.
[2024-05-28 13:59:58] [INFO ] Deduced a trap composed of 146 places in 145 ms of which 2 ms to minimize.
[2024-05-28 13:59:58] [INFO ] Deduced a trap composed of 144 places in 138 ms of which 2 ms to minimize.
[2024-05-28 13:59:59] [INFO ] Deduced a trap composed of 147 places in 238 ms of which 4 ms to minimize.
[2024-05-28 13:59:59] [INFO ] Deduced a trap composed of 137 places in 169 ms of which 2 ms to minimize.
[2024-05-28 13:59:59] [INFO ] Deduced a trap composed of 148 places in 151 ms of which 3 ms to minimize.
[2024-05-28 13:59:59] [INFO ] Deduced a trap composed of 148 places in 140 ms of which 3 ms to minimize.
[2024-05-28 13:59:59] [INFO ] Deduced a trap composed of 134 places in 146 ms of which 2 ms to minimize.
[2024-05-28 13:59:59] [INFO ] Deduced a trap composed of 147 places in 138 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 20/184 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-28 14:00:02] [INFO ] Deduced a trap composed of 148 places in 167 ms of which 2 ms to minimize.
[2024-05-28 14:00:02] [INFO ] Deduced a trap composed of 138 places in 146 ms of which 3 ms to minimize.
[2024-05-28 14:00:02] [INFO ] Deduced a trap composed of 141 places in 162 ms of which 2 ms to minimize.
[2024-05-28 14:00:02] [INFO ] Deduced a trap composed of 142 places in 145 ms of which 2 ms to minimize.
[2024-05-28 14:00:02] [INFO ] Deduced a trap composed of 153 places in 157 ms of which 2 ms to minimize.
[2024-05-28 14:00:03] [INFO ] Deduced a trap composed of 155 places in 187 ms of which 2 ms to minimize.
[2024-05-28 14:00:03] [INFO ] Deduced a trap composed of 141 places in 151 ms of which 2 ms to minimize.
[2024-05-28 14:00:03] [INFO ] Deduced a trap composed of 144 places in 129 ms of which 2 ms to minimize.
[2024-05-28 14:00:03] [INFO ] Deduced a trap composed of 135 places in 137 ms of which 2 ms to minimize.
[2024-05-28 14:00:04] [INFO ] Deduced a trap composed of 138 places in 149 ms of which 2 ms to minimize.
[2024-05-28 14:00:04] [INFO ] Deduced a trap composed of 148 places in 120 ms of which 2 ms to minimize.
[2024-05-28 14:00:04] [INFO ] Deduced a trap composed of 138 places in 138 ms of which 2 ms to minimize.
[2024-05-28 14:00:04] [INFO ] Deduced a trap composed of 147 places in 116 ms of which 2 ms to minimize.
[2024-05-28 14:00:04] [INFO ] Deduced a trap composed of 139 places in 112 ms of which 1 ms to minimize.
[2024-05-28 14:00:05] [INFO ] Deduced a trap composed of 141 places in 112 ms of which 2 ms to minimize.
[2024-05-28 14:00:05] [INFO ] Deduced a trap composed of 158 places in 187 ms of which 2 ms to minimize.
[2024-05-28 14:00:05] [INFO ] Deduced a trap composed of 157 places in 124 ms of which 2 ms to minimize.
[2024-05-28 14:00:05] [INFO ] Deduced a trap composed of 141 places in 148 ms of which 2 ms to minimize.
[2024-05-28 14:00:06] [INFO ] Deduced a trap composed of 133 places in 153 ms of which 2 ms to minimize.
[2024-05-28 14:00:06] [INFO ] Deduced a trap composed of 155 places in 145 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-28 14:00:08] [INFO ] Deduced a trap composed of 143 places in 121 ms of which 2 ms to minimize.
[2024-05-28 14:00:13] [INFO ] Deduced a trap composed of 155 places in 154 ms of which 2 ms to minimize.
[2024-05-28 14:00:13] [INFO ] Deduced a trap composed of 160 places in 156 ms of which 2 ms to minimize.
[2024-05-28 14:00:13] [INFO ] Deduced a trap composed of 160 places in 148 ms of which 2 ms to minimize.
[2024-05-28 14:00:13] [INFO ] Deduced a trap composed of 128 places in 153 ms of which 2 ms to minimize.
[2024-05-28 14:00:13] [INFO ] Deduced a trap composed of 100 places in 155 ms of which 2 ms to minimize.
[2024-05-28 14:00:14] [INFO ] Deduced a trap composed of 112 places in 158 ms of which 2 ms to minimize.
[2024-05-28 14:00:14] [INFO ] Deduced a trap composed of 128 places in 134 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 8/212 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-28 14:00:17] [INFO ] Deduced a trap composed of 149 places in 189 ms of which 4 ms to minimize.
[2024-05-28 14:00:17] [INFO ] Deduced a trap composed of 133 places in 149 ms of which 2 ms to minimize.
[2024-05-28 14:00:18] [INFO ] Deduced a trap composed of 139 places in 143 ms of which 2 ms to minimize.
[2024-05-28 14:00:18] [INFO ] Deduced a trap composed of 141 places in 148 ms of which 2 ms to minimize.
[2024-05-28 14:00:18] [INFO ] Deduced a trap composed of 141 places in 132 ms of which 2 ms to minimize.
[2024-05-28 14:00:18] [INFO ] Deduced a trap composed of 138 places in 184 ms of which 5 ms to minimize.
[2024-05-28 14:00:19] [INFO ] Deduced a trap composed of 128 places in 187 ms of which 3 ms to minimize.
[2024-05-28 14:00:19] [INFO ] Deduced a trap composed of 128 places in 188 ms of which 3 ms to minimize.
[2024-05-28 14:00:19] [INFO ] Deduced a trap composed of 133 places in 131 ms of which 2 ms to minimize.
[2024-05-28 14:00:19] [INFO ] Deduced a trap composed of 145 places in 141 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/888 variables, and 222 constraints, problems are : Problem set: 0 solved, 588 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/310 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/588 constraints, Known Traps: 186/186 constraints]
After SMT, in 60427ms problems are : Problem set: 0 solved, 588 unsolved
Search for dead transitions found 0 dead transitions in 60433ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 83413 ms. Remains : 310/310 places, 590/590 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 146 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter insensitive) to 6 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 298 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0), false, false]
RANDOM walk for 40000 steps (21 resets) in 209 ms. (190 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (57 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
[2024-05-28 14:00:20] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-05-28 14:00:20] [INFO ] Invariant cache hit.
[2024-05-28 14:00:20] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 109/125 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 62/187 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/194 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 307/888 variables, and 36 constraints, problems are : Problem set: 1 solved, 0 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/310 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 116ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT p0))), (G (OR (NOT p1) (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p1 (NOT p0)))), (F p1)]
Knowledge based reduction with 10 factoid took 222 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter insensitive) to 6 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0), false, false]
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0), false, false]
[2024-05-28 14:00:21] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-05-28 14:00:21] [INFO ] Invariant cache hit.
[2024-05-28 14:00:21] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-05-28 14:00:21] [INFO ] [Real]Absence check using 15 positive and 23 generalized place invariants in 91 ms returned sat
[2024-05-28 14:00:22] [INFO ] [Real]Absence check using state equation in 473 ms returned sat
[2024-05-28 14:00:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:00:22] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-05-28 14:00:22] [INFO ] [Nat]Absence check using 15 positive and 23 generalized place invariants in 27 ms returned sat
[2024-05-28 14:00:23] [INFO ] [Nat]Absence check using state equation in 643 ms returned sat
[2024-05-28 14:00:23] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:00:23] [INFO ] [Nat]Added 72 Read/Feed constraints in 145 ms returned sat
[2024-05-28 14:00:23] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 2 ms to minimize.
[2024-05-28 14:00:23] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 1 ms to minimize.
[2024-05-28 14:00:24] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:00:24] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:00:24] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2024-05-28 14:00:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 807 ms
[2024-05-28 14:00:24] [INFO ] Computed and/alt/rep : 354/1545/348 causal constraints (skipped 228 transitions) in 51 ms.
[2024-05-28 14:00:27] [INFO ] Added : 295 causal constraints over 59 iterations in 3233 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-28 14:00:27] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-05-28 14:00:27] [INFO ] Invariant cache hit.
[2024-05-28 14:00:27] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-05-28 14:00:27] [INFO ] [Real]Absence check using 15 positive and 23 generalized place invariants in 36 ms returned sat
[2024-05-28 14:00:28] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
[2024-05-28 14:00:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:00:28] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-28 14:00:28] [INFO ] [Nat]Absence check using 15 positive and 23 generalized place invariants in 16 ms returned sat
[2024-05-28 14:00:29] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2024-05-28 14:00:29] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:00:29] [INFO ] [Nat]Added 72 Read/Feed constraints in 127 ms returned sat
[2024-05-28 14:00:29] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 2 ms to minimize.
[2024-05-28 14:00:29] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 2 ms to minimize.
[2024-05-28 14:00:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 378 ms
[2024-05-28 14:00:29] [INFO ] Computed and/alt/rep : 354/1545/348 causal constraints (skipped 228 transitions) in 35 ms.
[2024-05-28 14:00:31] [INFO ] Added : 250 causal constraints over 50 iterations in 2415 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0), false, false]
Product exploration explored 100000 steps with 2707 reset in 369 ms.
Product exploration explored 100000 steps with 2738 reset in 382 ms.
Built C files in :
/tmp/ltsmin1486151392382719520
[2024-05-28 14:00:33] [INFO ] Computing symmetric may disable matrix : 590 transitions.
[2024-05-28 14:00:33] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:00:33] [INFO ] Computing symmetric may enable matrix : 590 transitions.
[2024-05-28 14:00:33] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:00:33] [INFO ] Computing Do-Not-Accords matrix : 590 transitions.
[2024-05-28 14:00:33] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:00:33] [INFO ] Built C files in 122ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1486151392382719520
Running compilation step : cd /tmp/ltsmin1486151392382719520;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1886 ms.
Running link step : cd /tmp/ltsmin1486151392382719520;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin1486151392382719520;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10147662640625405632.hoa' '--buchi-type=spotba'
LTSmin run took 3964 ms.
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-09 finished in 159207 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 6 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Applied a total of 0 rules in 4 ms. Remains 462 /462 variables (removed 0) and now considering 818/818 (removed 0) transitions.
Running 816 sub problems to find dead transitions.
[2024-05-28 14:00:39] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 462 cols
[2024-05-28 14:00:39] [INFO ] Computed 38 invariants in 9 ms
[2024-05-28 14:00:39] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-28 14:00:44] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2024-05-28 14:00:45] [INFO ] Deduced a trap composed of 130 places in 239 ms of which 3 ms to minimize.
[2024-05-28 14:00:45] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 2 ms to minimize.
[2024-05-28 14:00:45] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 2 ms to minimize.
[2024-05-28 14:00:45] [INFO ] Deduced a trap composed of 65 places in 200 ms of which 2 ms to minimize.
[2024-05-28 14:00:46] [INFO ] Deduced a trap composed of 235 places in 207 ms of which 3 ms to minimize.
[2024-05-28 14:00:46] [INFO ] Deduced a trap composed of 277 places in 211 ms of which 3 ms to minimize.
[2024-05-28 14:00:46] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 2 ms to minimize.
[2024-05-28 14:00:48] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 2 ms to minimize.
[2024-05-28 14:00:49] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 2 ms to minimize.
[2024-05-28 14:00:50] [INFO ] Deduced a trap composed of 228 places in 230 ms of which 3 ms to minimize.
[2024-05-28 14:00:51] [INFO ] Deduced a trap composed of 223 places in 209 ms of which 3 ms to minimize.
[2024-05-28 14:00:52] [INFO ] Deduced a trap composed of 264 places in 137 ms of which 3 ms to minimize.
[2024-05-28 14:00:52] [INFO ] Deduced a trap composed of 256 places in 141 ms of which 2 ms to minimize.
[2024-05-28 14:00:52] [INFO ] Deduced a trap composed of 214 places in 187 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/1268 variables, and 51 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-28 14:01:06] [INFO ] Deduced a trap composed of 263 places in 255 ms of which 3 ms to minimize.
[2024-05-28 14:01:06] [INFO ] Deduced a trap composed of 295 places in 208 ms of which 3 ms to minimize.
[2024-05-28 14:01:06] [INFO ] Deduced a trap composed of 258 places in 217 ms of which 4 ms to minimize.
[2024-05-28 14:01:08] [INFO ] Deduced a trap composed of 234 places in 193 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-28 14:01:12] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 2 ms to minimize.
[2024-05-28 14:01:12] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-28 14:01:15] [INFO ] Deduced a trap composed of 191 places in 204 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 6)
(s1 4)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 1)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 10)
(s123 1)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/1268 variables, and 58 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/816 constraints, Known Traps: 22/22 constraints]
After SMT, in 40891ms problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 40902ms
[2024-05-28 14:01:19] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2024-05-28 14:01:19] [INFO ] Invariant cache hit.
[2024-05-28 14:01:20] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-28 14:01:20] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2024-05-28 14:01:20] [INFO ] Invariant cache hit.
[2024-05-28 14:01:20] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:01:25] [INFO ] Implicit Places using invariants and state equation in 4859 ms returned []
Implicit Place search using SMT with State Equation took 5151 ms to find 0 implicit places.
Running 816 sub problems to find dead transitions.
[2024-05-28 14:01:25] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2024-05-28 14:01:25] [INFO ] Invariant cache hit.
[2024-05-28 14:01:25] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-28 14:01:30] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:01:31] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:01:31] [INFO ] Deduced a trap composed of 65 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:01:31] [INFO ] Deduced a trap composed of 65 places in 42 ms of which 0 ms to minimize.
[2024-05-28 14:01:31] [INFO ] Deduced a trap composed of 65 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:01:31] [INFO ] Deduced a trap composed of 251 places in 161 ms of which 4 ms to minimize.
[2024-05-28 14:01:31] [INFO ] Deduced a trap composed of 134 places in 208 ms of which 4 ms to minimize.
[2024-05-28 14:01:31] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:01:32] [INFO ] Deduced a trap composed of 278 places in 249 ms of which 3 ms to minimize.
[2024-05-28 14:01:32] [INFO ] Deduced a trap composed of 254 places in 226 ms of which 3 ms to minimize.
[2024-05-28 14:01:33] [INFO ] Deduced a trap composed of 264 places in 213 ms of which 3 ms to minimize.
[2024-05-28 14:01:33] [INFO ] Deduced a trap composed of 259 places in 220 ms of which 4 ms to minimize.
[2024-05-28 14:01:33] [INFO ] Deduced a trap composed of 247 places in 208 ms of which 4 ms to minimize.
[2024-05-28 14:01:34] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-05-28 14:01:37] [INFO ] Deduced a trap composed of 228 places in 155 ms of which 3 ms to minimize.
[2024-05-28 14:01:38] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 3 ms to minimize.
[2024-05-28 14:01:38] [INFO ] Deduced a trap composed of 327 places in 199 ms of which 3 ms to minimize.
[2024-05-28 14:01:39] [INFO ] Deduced a trap composed of 239 places in 204 ms of which 3 ms to minimize.
[2024-05-28 14:01:39] [INFO ] Deduced a trap composed of 236 places in 188 ms of which 3 ms to minimize.
[2024-05-28 14:01:39] [INFO ] Deduced a trap composed of 233 places in 154 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-28 14:01:44] [INFO ] Deduced a trap composed of 225 places in 154 ms of which 2 ms to minimize.
[2024-05-28 14:01:45] [INFO ] Deduced a trap composed of 275 places in 155 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-28 14:01:52] [INFO ] Deduced a trap composed of 247 places in 161 ms of which 2 ms to minimize.
[2024-05-28 14:01:54] [INFO ] Deduced a trap composed of 134 places in 241 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/1268 variables, and 60 constraints, problems are : Problem set: 0 solved, 816 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-28 14:01:59] [INFO ] Deduced a trap composed of 247 places in 151 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/462 variables, 2/63 constraints. Problems are: Problem set: 66 solved, 750 unsolved
[2024-05-28 14:02:11] [INFO ] Deduced a trap composed of 219 places in 174 ms of which 2 ms to minimize.
[2024-05-28 14:02:11] [INFO ] Deduced a trap composed of 88 places in 183 ms of which 2 ms to minimize.
[2024-05-28 14:02:18] [INFO ] Deduced a trap composed of 197 places in 241 ms of which 3 ms to minimize.
[2024-05-28 14:02:18] [INFO ] Deduced a trap composed of 214 places in 202 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 4/67 constraints. Problems are: Problem set: 66 solved, 750 unsolved
[2024-05-28 14:02:26] [INFO ] Deduced a trap composed of 203 places in 233 ms of which 4 ms to minimize.
SMT process timed out in 61053ms, After SMT, problems are : Problem set: 66 solved, 750 unsolved
Search for dead transitions found 66 dead transitions in 61068ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in LTL mode, iteration 1 : 462/462 places, 752/818 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 460 transition count 740
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 14 place count 448 transition count 728
Applied a total of 14 rules in 6 ms. Remains 448 /462 variables (removed 14) and now considering 728/752 (removed 24) transitions.
[2024-05-28 14:02:26] [INFO ] Flow matrix only has 716 transitions (discarded 12 similar events)
// Phase 1: matrix 716 rows 448 cols
[2024-05-28 14:02:26] [INFO ] Computed 38 invariants in 8 ms
[2024-05-28 14:02:26] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-05-28 14:02:26] [INFO ] Flow matrix only has 716 transitions (discarded 12 similar events)
[2024-05-28 14:02:26] [INFO ] Invariant cache hit.
[2024-05-28 14:02:26] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:02:30] [INFO ] Implicit Places using invariants and state equation in 4219 ms returned []
Implicit Place search using SMT with State Equation took 4500 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 448/462 places, 728/818 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 111640 ms. Remains : 448/462 places, 728/818 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-10 finished in 111733 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||G(p1)))'
Support contains 23 out of 462 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 462 transition count 776
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 420 transition count 776
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 84 place count 420 transition count 728
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 180 place count 372 transition count 728
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 276 place count 324 transition count 680
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 282 place count 318 transition count 674
Iterating global reduction 2 with 6 rules applied. Total rules applied 288 place count 318 transition count 674
Applied a total of 288 rules in 21 ms. Remains 318 /462 variables (removed 144) and now considering 674/818 (removed 144) transitions.
Running 672 sub problems to find dead transitions.
[2024-05-28 14:02:30] [INFO ] Flow matrix only has 662 transitions (discarded 12 similar events)
// Phase 1: matrix 662 rows 318 cols
[2024-05-28 14:02:30] [INFO ] Computed 38 invariants in 5 ms
[2024-05-28 14:02:30] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-05-28 14:02:35] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 2 ms to minimize.
[2024-05-28 14:02:35] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
[2024-05-28 14:02:35] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
[2024-05-28 14:02:35] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 0 ms to minimize.
[2024-05-28 14:02:35] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
[2024-05-28 14:02:35] [INFO ] Deduced a trap composed of 119 places in 181 ms of which 3 ms to minimize.
[2024-05-28 14:02:35] [INFO ] Deduced a trap composed of 117 places in 161 ms of which 3 ms to minimize.
[2024-05-28 14:02:36] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 2 ms to minimize.
[2024-05-28 14:02:37] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/317 variables, 1/46 constraints. Problems are: Problem set: 36 solved, 636 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 0/46 constraints. Problems are: Problem set: 36 solved, 636 unsolved
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.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 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 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 9.0)
(s111 0.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 1/318 variables, 1/47 constraints. Problems are: Problem set: 66 solved, 606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 318/980 variables, and 47 constraints, problems are : Problem set: 66 solved, 606 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/318 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 66 solved, 606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 13/13 constraints. Problems are: Problem set: 66 solved, 606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 23/36 constraints. Problems are: Problem set: 66 solved, 606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 9/45 constraints. Problems are: Problem set: 66 solved, 606 unsolved
[2024-05-28 14:02:54] [INFO ] Deduced a trap composed of 184 places in 174 ms of which 3 ms to minimize.
[2024-05-28 14:02:54] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
[2024-05-28 14:02:56] [INFO ] Deduced a trap composed of 108 places in 167 ms of which 3 ms to minimize.
[2024-05-28 14:02:57] [INFO ] Deduced a trap composed of 91 places in 184 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 4/49 constraints. Problems are: Problem set: 66 solved, 606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/49 constraints. Problems are: Problem set: 66 solved, 606 unsolved
At refinement iteration 5 (OVERLAPS) 1/317 variables, 1/50 constraints. Problems are: Problem set: 66 solved, 606 unsolved
[2024-05-28 14:03:03] [INFO ] Deduced a trap composed of 43 places in 154 ms of which 3 ms to minimize.
[2024-05-28 14:03:04] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 2/52 constraints. Problems are: Problem set: 66 solved, 606 unsolved
[2024-05-28 14:03:10] [INFO ] Deduced a trap composed of 59 places in 172 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 1/53 constraints. Problems are: Problem set: 66 solved, 606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/980 variables, and 53 constraints, problems are : Problem set: 66 solved, 606 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/318 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/672 constraints, Known Traps: 16/16 constraints]
After SMT, in 40734ms problems are : Problem set: 66 solved, 606 unsolved
Search for dead transitions found 66 dead transitions in 40741ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
[2024-05-28 14:03:11] [INFO ] Flow matrix only has 596 transitions (discarded 12 similar events)
// Phase 1: matrix 596 rows 318 cols
[2024-05-28 14:03:11] [INFO ] Computed 38 invariants in 19 ms
[2024-05-28 14:03:11] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-28 14:03:11] [INFO ] Flow matrix only has 596 transitions (discarded 12 similar events)
[2024-05-28 14:03:11] [INFO ] Invariant cache hit.
[2024-05-28 14:03:12] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:03:13] [INFO ] Implicit Places using invariants and state equation in 2181 ms returned []
Implicit Place search using SMT with State Equation took 2446 ms to find 0 implicit places.
[2024-05-28 14:03:14] [INFO ] Redundant transitions in 7 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 318/462 places, 608/818 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 304 transition count 584
Applied a total of 12 rules in 17 ms. Remains 304 /318 variables (removed 14) and now considering 584/608 (removed 24) transitions.
[2024-05-28 14:03:14] [INFO ] Flow matrix only has 572 transitions (discarded 12 similar events)
// Phase 1: matrix 572 rows 304 cols
[2024-05-28 14:03:14] [INFO ] Computed 38 invariants in 13 ms
[2024-05-28 14:03:14] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-05-28 14:03:14] [INFO ] Flow matrix only has 572 transitions (discarded 12 similar events)
[2024-05-28 14:03:14] [INFO ] Invariant cache hit.
[2024-05-28 14:03:14] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:03:16] [INFO ] Implicit Places using invariants and state equation in 2183 ms returned []
Implicit Place search using SMT with State Equation took 2504 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 304/462 places, 584/818 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45747 ms. Remains : 304/462 places, 584/818 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p1), (AND (NOT p1) p0), p0]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-11
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-11 finished in 45873 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((X((p0&&G(p1))) U (X((G(p3) U (p0&&G(p3))))||p2)))))'
Support contains 20 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 812
Applied a total of 12 rules in 15 ms. Remains 456 /462 variables (removed 6) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 14:03:16] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2024-05-28 14:03:16] [INFO ] Computed 38 invariants in 16 ms
[2024-05-28 14:03:16] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 14:03:21] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2024-05-28 14:03:21] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:03:21] [INFO ] Deduced a trap composed of 64 places in 40 ms of which 0 ms to minimize.
[2024-05-28 14:03:21] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:03:21] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 1 ms to minimize.
[2024-05-28 14:03:22] [INFO ] Deduced a trap composed of 240 places in 208 ms of which 3 ms to minimize.
[2024-05-28 14:03:22] [INFO ] Deduced a trap composed of 139 places in 174 ms of which 3 ms to minimize.
[2024-05-28 14:03:22] [INFO ] Deduced a trap composed of 64 places in 39 ms of which 1 ms to minimize.
[2024-05-28 14:03:22] [INFO ] Deduced a trap composed of 271 places in 198 ms of which 3 ms to minimize.
[2024-05-28 14:03:23] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 2 ms to minimize.
[2024-05-28 14:03:23] [INFO ] Deduced a trap composed of 265 places in 172 ms of which 3 ms to minimize.
[2024-05-28 14:03:26] [INFO ] Deduced a trap composed of 248 places in 226 ms of which 3 ms to minimize.
[2024-05-28 14:03:28] [INFO ] Deduced a trap composed of 223 places in 201 ms of which 4 ms to minimize.
[2024-05-28 14:03:28] [INFO ] Deduced a trap composed of 241 places in 193 ms of which 4 ms to minimize.
[2024-05-28 14:03:29] [INFO ] Deduced a trap composed of 110 places in 204 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 14:03:31] [INFO ] Deduced a trap composed of 262 places in 222 ms of which 3 ms to minimize.
[2024-05-28 14:03:31] [INFO ] Deduced a trap composed of 269 places in 211 ms of which 4 ms to minimize.
[2024-05-28 14:03:36] [INFO ] Deduced a trap composed of 59 places in 268 ms of which 4 ms to minimize.
[2024-05-28 14:03:37] [INFO ] Deduced a trap composed of 48 places in 237 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 14:03:42] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-28 14:03:44] [INFO ] Deduced a trap composed of 226 places in 158 ms of which 2 ms to minimize.
[2024-05-28 14:03:44] [INFO ] Deduced a trap composed of 275 places in 148 ms of which 2 ms to minimize.
[2024-05-28 14:03:44] [INFO ] Deduced a trap composed of 240 places in 147 ms of which 2 ms to minimize.
[2024-05-28 14:03:46] [INFO ] Deduced a trap composed of 241 places in 181 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 14:03:51] [INFO ] Deduced a trap composed of 289 places in 220 ms of which 4 ms to minimize.
[2024-05-28 14:03:51] [INFO ] Deduced a trap composed of 299 places in 213 ms of which 3 ms to minimize.
[2024-05-28 14:03:51] [INFO ] Deduced a trap composed of 276 places in 211 ms of which 3 ms to minimize.
[2024-05-28 14:03:52] [INFO ] Deduced a trap composed of 252 places in 203 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 64 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 28/28 constraints]
After SMT, in 40832ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40846ms
[2024-05-28 14:03:57] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 14:03:57] [INFO ] Invariant cache hit.
[2024-05-28 14:03:57] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-05-28 14:03:57] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 14:03:57] [INFO ] Invariant cache hit.
[2024-05-28 14:03:58] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:04:02] [INFO ] Implicit Places using invariants and state equation in 4273 ms returned []
Implicit Place search using SMT with State Equation took 4630 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2024-05-28 14:04:02] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 14:04:02] [INFO ] Invariant cache hit.
[2024-05-28 14:04:02] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 14:04:08] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 1 ms to minimize.
[2024-05-28 14:04:08] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 1 ms to minimize.
[2024-05-28 14:04:08] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-05-28 14:04:08] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:04:09] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2024-05-28 14:04:09] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:04:11] [INFO ] Deduced a trap composed of 270 places in 207 ms of which 4 ms to minimize.
[2024-05-28 14:04:12] [INFO ] Deduced a trap composed of 286 places in 204 ms of which 3 ms to minimize.
[2024-05-28 14:04:12] [INFO ] Deduced a trap composed of 256 places in 212 ms of which 3 ms to minimize.
[2024-05-28 14:04:12] [INFO ] Deduced a trap composed of 15 places in 203 ms of which 3 ms to minimize.
[2024-05-28 14:04:12] [INFO ] Deduced a trap composed of 268 places in 192 ms of which 3 ms to minimize.
[2024-05-28 14:04:12] [INFO ] Deduced a trap composed of 245 places in 211 ms of which 3 ms to minimize.
[2024-05-28 14:04:13] [INFO ] Deduced a trap composed of 241 places in 207 ms of which 3 ms to minimize.
[2024-05-28 14:04:13] [INFO ] Deduced a trap composed of 288 places in 184 ms of which 3 ms to minimize.
[2024-05-28 14:04:13] [INFO ] Deduced a trap composed of 232 places in 179 ms of which 2 ms to minimize.
[2024-05-28 14:04:13] [INFO ] Deduced a trap composed of 248 places in 155 ms of which 2 ms to minimize.
[2024-05-28 14:04:15] [INFO ] Deduced a trap composed of 42 places in 186 ms of which 3 ms to minimize.
[2024-05-28 14:04:16] [INFO ] Deduced a trap composed of 144 places in 138 ms of which 2 ms to minimize.
[2024-05-28 14:04:16] [INFO ] Deduced a trap composed of 302 places in 178 ms of which 3 ms to minimize.
[2024-05-28 14:04:17] [INFO ] Deduced a trap composed of 278 places in 157 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 14:04:17] [INFO ] Deduced a trap composed of 296 places in 138 ms of which 2 ms to minimize.
[2024-05-28 14:04:17] [INFO ] Deduced a trap composed of 249 places in 133 ms of which 2 ms to minimize.
[2024-05-28 14:04:17] [INFO ] Deduced a trap composed of 261 places in 147 ms of which 2 ms to minimize.
[2024-05-28 14:04:17] [INFO ] Deduced a trap composed of 247 places in 145 ms of which 2 ms to minimize.
[2024-05-28 14:04:22] [INFO ] Deduced a trap composed of 3 places in 172 ms of which 2 ms to minimize.
[2024-05-28 14:04:23] [INFO ] Deduced a trap composed of 242 places in 213 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 14:04:31] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 3.0)
(s11 0.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 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 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 9.0)
(s123 0.0)
(s124 1.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 4.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 1.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 63 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 27/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 14:04:38] [INFO ] Deduced a trap composed of 222 places in 192 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/455 variables, 1/65 constraints. Problems are: Problem set: 36 solved, 774 unsolved
[2024-05-28 14:04:57] [INFO ] Deduced a trap composed of 145 places in 172 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 1/66 constraints. Problems are: Problem set: 36 solved, 774 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1256 variables, and 66 constraints, problems are : Problem set: 36 solved, 774 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 29/29 constraints]
After SMT, in 60571ms problems are : Problem set: 36 solved, 774 unsolved
Search for dead transitions found 36 dead transitions in 60578ms
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 : 456/462 places, 776/818 transitions.
Applied a total of 0 rules in 4 ms. Remains 456 /456 variables (removed 0) and now considering 776/776 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106081 ms. Remains : 456/462 places, 776/818 transitions.
Stuttering acceptance computed with spot in 429 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-12
Stuttering criterion allowed to conclude after 926 steps with 0 reset in 6 ms.
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-12 finished in 106556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)&&G((p2&&F(!p0))))))'
Support contains 44 out of 462 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 462 transition count 788
Reduce places removed 30 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 66 place count 432 transition count 782
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 426 transition count 782
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 72 place count 426 transition count 764
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 108 place count 408 transition count 764
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 204 place count 360 transition count 716
Applied a total of 204 rules in 57 ms. Remains 360 /462 variables (removed 102) and now considering 716/818 (removed 102) transitions.
Running 714 sub problems to find dead transitions.
[2024-05-28 14:05:03] [INFO ] Flow matrix only has 704 transitions (discarded 12 similar events)
// Phase 1: matrix 704 rows 360 cols
[2024-05-28 14:05:03] [INFO ] Computed 38 invariants in 15 ms
[2024-05-28 14:05:03] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 714 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 714 unsolved
[2024-05-28 14:05:07] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 2 ms to minimize.
[2024-05-28 14:05:08] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 2 ms to minimize.
[2024-05-28 14:05:08] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 2 ms to minimize.
[2024-05-28 14:05:08] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:05:08] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:05:08] [INFO ] Deduced a trap composed of 167 places in 213 ms of which 3 ms to minimize.
[2024-05-28 14:05:08] [INFO ] Deduced a trap composed of 167 places in 181 ms of which 3 ms to minimize.
[2024-05-28 14:05:08] [INFO ] Deduced a trap composed of 224 places in 156 ms of which 2 ms to minimize.
[2024-05-28 14:05:09] [INFO ] Deduced a trap composed of 155 places in 156 ms of which 2 ms to minimize.
[2024-05-28 14:05:09] [INFO ] Deduced a trap composed of 48 places in 33 ms of which 1 ms to minimize.
[2024-05-28 14:05:13] [INFO ] Deduced a trap composed of 73 places in 127 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 714 unsolved
[2024-05-28 14:05:14] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 1 ms to minimize.
[2024-05-28 14:05:17] [INFO ] Deduced a trap composed of 145 places in 147 ms of which 2 ms to minimize.
[2024-05-28 14:05:18] [INFO ] Deduced a trap composed of 145 places in 195 ms of which 3 ms to minimize.
[2024-05-28 14:05:18] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 714 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 358/1064 variables, and 51 constraints, problems are : Problem set: 0 solved, 714 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 714/714 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 714 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 714 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 714 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 714 unsolved
[2024-05-28 14:05:26] [INFO ] Deduced a trap composed of 221 places in 184 ms of which 3 ms to minimize.
[2024-05-28 14:05:27] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 714 unsolved
[2024-05-28 14:05:34] [INFO ] Deduced a trap composed of 176 places in 129 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 714 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 714 unsolved
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/359 variables, 1/55 constraints. Problems are: Problem set: 36 solved, 678 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 359/1064 variables, and 55 constraints, problems are : Problem set: 36 solved, 678 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/714 constraints, Known Traps: 18/18 constraints]
After SMT, in 41119ms problems are : Problem set: 36 solved, 678 unsolved
Search for dead transitions found 36 dead transitions in 41142ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 36 transitions.
[2024-05-28 14:05:44] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
// Phase 1: matrix 668 rows 360 cols
[2024-05-28 14:05:44] [INFO ] Computed 38 invariants in 5 ms
[2024-05-28 14:05:44] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-28 14:05:44] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
[2024-05-28 14:05:44] [INFO ] Invariant cache hit.
[2024-05-28 14:05:44] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:05:48] [INFO ] Implicit Places using invariants and state equation in 3519 ms returned []
Implicit Place search using SMT with State Equation took 3750 ms to find 0 implicit places.
[2024-05-28 14:05:48] [INFO ] Redundant transitions in 3 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 360/462 places, 680/818 transitions.
Applied a total of 0 rules in 7 ms. Remains 360 /360 variables (removed 0) and now considering 680/680 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44971 ms. Remains : 360/462 places, 680/818 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), p0, (OR (NOT p2) p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-13
Stuttering criterion allowed to conclude after 534 steps with 0 reset in 6 ms.
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-13 finished in 45167 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)))'
[2024-05-28 14:05:48] [INFO ] Flatten gal took : 33 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1227191646006566923
[2024-05-28 14:05:48] [INFO ] Computing symmetric may disable matrix : 818 transitions.
[2024-05-28 14:05:48] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:05:48] [INFO ] Applying decomposition
[2024-05-28 14:05:48] [INFO ] Computing symmetric may enable matrix : 818 transitions.
[2024-05-28 14:05:48] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:05:48] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph59555916499162478.txt' '-o' '/tmp/graph59555916499162478.bin' '-w' '/tmp/graph59555916499162478.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph59555916499162478.bin' '-l' '-1' '-v' '-w' '/tmp/graph59555916499162478.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:05:48] [INFO ] Decomposing Gal with order
[2024-05-28 14:05:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:05:48] [INFO ] Computing Do-Not-Accords matrix : 818 transitions.
[2024-05-28 14:05:48] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:05:48] [INFO ] Built C files in 246ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1227191646006566923
Running compilation step : cd /tmp/ltsmin1227191646006566923;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-28 14:05:48] [INFO ] Removed a total of 543 redundant transitions.
[2024-05-28 14:05:48] [INFO ] Flatten gal took : 145 ms
[2024-05-28 14:05:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 278 labels/synchronizations in 56 ms.
[2024-05-28 14:05:49] [INFO ] Time to serialize gal into /tmp/LTLFireability7970283642398394148.gal : 17 ms
[2024-05-28 14:05:49] [INFO ] Time to serialize properties into /tmp/LTLFireability12589525438831628247.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7970283642398394148.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12589525438831628247.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((i0.u13.P_1725_4>=1)&&(i4.u25.MarkerRead>=1))&&(i4.u25.FetchJobB_1>=1))||(((i0.u13.P_1725_4>=1)&&(i4.u25.MarkerRead>=1)...2340
Formula 0 simplified : FG!"((((((((i0.u13.P_1725_4>=1)&&(i4.u25.MarkerRead>=1))&&(i4.u25.FetchJobB_1>=1))||(((i0.u13.P_1725_4>=1)&&(i4.u25.MarkerRead>=1))&...2334
Compilation finished in 2759 ms.
Running link step : cd /tmp/ltsmin1227191646006566923;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin1227191646006566923;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
LTSmin run took 146829 ms.
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2038695 ms.

BK_STOP 1716905298607

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is PolyORBLF-COL-S02J04T06, 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 r290-tajo-171654446300076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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