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-171654446400100.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-S02J06T06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446400100
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.9K Apr 11 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 11 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 16:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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 5.1K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K 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 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 17:00 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-S02J06T06-LTLFireability-00
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLFireability-01
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLFireability-02
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLFireability-03
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLFireability-04
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLFireability-05
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLFireability-06
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLFireability-07
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLFireability-08
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLFireability-09
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLFireability-10
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLFireability-11
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLFireability-12
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLFireability-13
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLFireability-14
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716905578669

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-S02J06T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-28 14:12:59] [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 14:12:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 14:13:00] [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 14:13:00] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 14:13:00] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 632 ms
[2024-05-28 14:13:00] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 536 PT places and 1096.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 14:13:00] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-28 14:13:00] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA PolyORBLF-COL-S02J06T06-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-LTLFireability-11 TRUE 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
Reduction of identical properties reduced properties to check from 33 to 32
RANDOM walk for 40000 steps (15 resets) in 2159 ms. (18 steps per ms) remains 7/32 properties
BEST_FIRST walk for 40001 steps (13 resets) in 568 ms. (70 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40001 steps (21 resets) in 228 ms. (174 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (82 resets) in 141 ms. (281 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (24 resets) in 148 ms. (268 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (9 resets) in 126 ms. (314 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (16 resets) in 193 ms. (206 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (13 resets) in 119 ms. (333 steps per ms) remains 6/6 properties
[2024-05-28 14:13:02] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 14:13:02] [INFO ] Computed 26 invariants in 11 ms
[2024-05-28 14:13:02] [INFO ] State equation strengthened by 8 read => feed constraints.
Problem AtomicPropp2 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 37/55 variables, 7/8 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 3/58 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp12 is UNSAT
At refinement iteration 6 (OVERLAPS) 17/75 variables, 12/22 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-28 14:13:02] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 1/23 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/23 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 5/80 variables, 3/26 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/80 variables, 0/26 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/81 variables, 1/27 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/81 variables, 0/27 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 64/145 variables, 81/108 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/145 variables, 8/116 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/145 variables, 0/116 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/145 variables, 0/116 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 116 constraints, problems are : Problem set: 3 solved, 3 unsolved in 502 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: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/24 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 23/47 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 3/50 variables, 2/9 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 23/73 variables, 12/21 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 1/22 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 5/78 variables, 3/25 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 3/116 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-28 14:13:02] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 3 ms to minimize.
[2024-05-28 14:13:02] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/143 variables, 2/118 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/143 variables, 0/118 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/145 variables, 2/120 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/145 variables, 1/121 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/145 variables, 0/121 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/145 variables, 0/121 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 121 constraints, problems are : Problem set: 3 solved, 3 unsolved in 382 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: 3/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 950ms problems are : Problem set: 3 solved, 3 unsolved
Parikh walk visited 0 properties in 1097 ms.
Support contains 4 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 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 80 transition count 58
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 73 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 72 transition count 57
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 17 place count 72 transition count 54
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 69 transition count 54
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 37 place count 62 transition count 47
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 62 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 41 place count 60 transition count 45
Applied a total of 41 rules in 27 ms. Remains 60 /81 variables (removed 21) and now considering 45/65 (removed 20) transitions.
Running 44 sub problems to find dead transitions.
[2024-05-28 14:13:04] [INFO ] Flow matrix only has 44 transitions (discarded 1 similar events)
// Phase 1: matrix 44 rows 60 cols
[2024-05-28 14:13:04] [INFO ] Computed 25 invariants in 1 ms
[2024-05-28 14:13:04] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-28 14:13:04] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-28 14:13:04] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:13:04] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-28 14:13:04] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-28 14:13:04] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-28 14:13:04] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-28 14:13:04] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 14:13:04] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/60 variables, 1/33 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-05-28 14:13:05] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-28 14:13:05] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-28 14:13:05] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-28 14:13:05] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-28 14:13:05] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 5/38 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/38 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 44/104 variables, 60/98 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 8/106 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-05-28 14:13:05] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 1/107 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/104 variables, 0/107 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 13 (OVERLAPS) 0/104 variables, 0/107 constraints. Problems are: Problem set: 2 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 107 constraints, problems are : Problem set: 2 solved, 42 unsolved in 1669 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 2 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 10/34 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-05-28 14:13:06] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/35 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 1/60 variables, 1/36 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 4/40 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/40 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 44/104 variables, 60/100 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 8/108 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 42/150 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 0/150 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-05-28 14:13:06] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/104 variables, 1/151 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/104 variables, 0/151 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 14 (OVERLAPS) 0/104 variables, 0/151 constraints. Problems are: Problem set: 2 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 151 constraints, problems are : Problem set: 2 solved, 42 unsolved in 1818 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 42/44 constraints, Known Traps: 16/16 constraints]
After SMT, in 3506ms problems are : Problem set: 2 solved, 42 unsolved
Search for dead transitions found 2 dead transitions in 3507ms
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 : 60/81 places, 43/65 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 59 transition count 41
Reduce places removed 0 places and 2 transitions.
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 1 rules in 3 ms. Remains 59 /60 variables (removed 1) and now considering 39/43 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3550 ms. Remains : 59/81 places, 39/65 transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Successfully simplified 6 atomic propositions for a total of 14 simplifications.
FORMULA PolyORBLF-COL-S02J06T06-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 14:13:07] [INFO ] Flatten gal took : 39 ms
[2024-05-28 14:13:07] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA PolyORBLF-COL-S02J06T06-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 14:13:07] [INFO ] Flatten gal took : 11 ms
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-28 14:13:07] [INFO ] Unfolded HLPN to a Petri net with 536 places and 1064 transitions 4866 arcs in 31 ms.
[2024-05-28 14:13:07] [INFO ] Unfolded 12 HLPN properties in 0 ms.
[2024-05-28 14:13:07] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-28 14:13:07] [INFO ] Reduced 6 identical enabling conditions.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Support contains 276 out of 536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 534 transition count 968
Applied a total of 2 rules in 24 ms. Remains 534 /536 variables (removed 2) and now considering 968/968 (removed 0) transitions.
Running 966 sub problems to find dead transitions.
[2024-05-28 14:13:07] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 534 cols
[2024-05-28 14:13:08] [INFO ] Computed 48 invariants in 39 ms
[2024-05-28 14:13:08] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 14:13:16] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 2 ms to minimize.
[2024-05-28 14:13:16] [INFO ] Deduced a trap composed of 74 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:13:16] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 4 ms to minimize.
[2024-05-28 14:13:16] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 2 ms to minimize.
[2024-05-28 14:13:16] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 1 ms to minimize.
[2024-05-28 14:13:17] [INFO ] Deduced a trap composed of 255 places in 271 ms of which 4 ms to minimize.
[2024-05-28 14:13:17] [INFO ] Deduced a trap composed of 148 places in 249 ms of which 4 ms to minimize.
[2024-05-28 14:13:17] [INFO ] Deduced a trap composed of 146 places in 240 ms of which 3 ms to minimize.
[2024-05-28 14:13:18] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 4 ms to minimize.
[2024-05-28 14:13:18] [INFO ] Deduced a trap composed of 311 places in 281 ms of which 4 ms to minimize.
[2024-05-28 14:13:19] [INFO ] Deduced a trap composed of 286 places in 298 ms of which 4 ms to minimize.
[2024-05-28 14:13:19] [INFO ] Deduced a trap composed of 288 places in 259 ms of which 4 ms to minimize.
[2024-05-28 14:13:19] [INFO ] Deduced a trap composed of 292 places in 268 ms of which 4 ms to minimize.
[2024-05-28 14:13:20] [INFO ] Deduced a trap composed of 310 places in 247 ms of which 3 ms to minimize.
[2024-05-28 14:13:20] [INFO ] Deduced a trap composed of 15 places in 257 ms of which 4 ms to minimize.
[2024-05-28 14:13:20] [INFO ] Deduced a trap composed of 276 places in 227 ms of which 4 ms to minimize.
[2024-05-28 14:13:20] [INFO ] Deduced a trap composed of 274 places in 225 ms of which 3 ms to minimize.
[2024-05-28 14:13:21] [INFO ] Deduced a trap composed of 290 places in 210 ms of which 5 ms to minimize.
[2024-05-28 14:13:21] [INFO ] Deduced a trap composed of 281 places in 192 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1490 variables, and 65 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 32/33 constraints, State Equation: 0/534 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 19/65 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 14:13:36] [INFO ] Deduced a trap composed of 360 places in 324 ms of which 6 ms to minimize.
[2024-05-28 14:13:39] [INFO ] Deduced a trap composed of 262 places in 240 ms of which 5 ms to minimize.
[2024-05-28 14:13:40] [INFO ] Deduced a trap composed of 259 places in 214 ms of which 4 ms to minimize.
[2024-05-28 14:13:40] [INFO ] Deduced a trap composed of 271 places in 258 ms of which 4 ms to minimize.
[2024-05-28 14:13:41] [INFO ] Deduced a trap composed of 63 places in 249 ms of which 3 ms to minimize.
[2024-05-28 14:13:41] [INFO ] Deduced a trap composed of 63 places in 314 ms of which 3 ms to minimize.
[2024-05-28 14:13:41] [INFO ] Deduced a trap composed of 269 places in 263 ms of which 3 ms to minimize.
[2024-05-28 14:13:42] [INFO ] Deduced a trap composed of 275 places in 191 ms of which 3 ms to minimize.
[2024-05-28 14:13:42] [INFO ] Deduced a trap composed of 267 places in 267 ms of which 3 ms to minimize.
[2024-05-28 14:13:42] [INFO ] Deduced a trap composed of 259 places in 239 ms of which 4 ms to minimize.
[2024-05-28 14:13:43] [INFO ] Deduced a trap composed of 342 places in 263 ms of which 3 ms to minimize.
[2024-05-28 14:13:43] [INFO ] Deduced a trap composed of 289 places in 344 ms of which 4 ms to minimize.
[2024-05-28 14:13:43] [INFO ] Deduced a trap composed of 296 places in 273 ms of which 4 ms to minimize.
[2024-05-28 14:13:44] [INFO ] Deduced a trap composed of 292 places in 275 ms of which 4 ms to minimize.
[2024-05-28 14:13:46] [INFO ] Deduced a trap composed of 285 places in 239 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 15/80 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 14:13:48] [INFO ] Deduced a trap composed of 59 places in 147 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/1490 variables, and 81 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 32/33 constraints, State Equation: 0/534 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 35/35 constraints]
After SMT, in 41227ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 41260ms
[2024-05-28 14:13:49] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 14:13:49] [INFO ] Invariant cache hit.
[2024-05-28 14:13:49] [INFO ] Implicit Places using invariants in 420 ms returned [414, 415, 416, 417, 418, 419]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 430 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 528/536 places, 968/968 transitions.
Applied a total of 0 rules in 22 ms. Remains 528 /528 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41742 ms. Remains : 528/536 places, 968/968 transitions.
Support contains 276 out of 528 places after structural reductions.
[2024-05-28 14:13:49] [INFO ] Flatten gal took : 116 ms
[2024-05-28 14:13:49] [INFO ] Flatten gal took : 92 ms
[2024-05-28 14:13:50] [INFO ] Input system was already deterministic with 968 transitions.
Support contains 270 out of 528 places (down from 276) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 26 to 25
RANDOM walk for 40000 steps (14 resets) in 722 ms. (55 steps per ms) remains 4/25 properties
BEST_FIRST walk for 40003 steps (10 resets) in 333 ms. (119 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (10 resets) in 251 ms. (158 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (9 resets) in 251 ms. (158 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (10 resets) in 285 ms. (139 steps per ms) remains 4/4 properties
[2024-05-28 14:13:50] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 528 cols
[2024-05-28 14:13:50] [INFO ] Computed 42 invariants in 33 ms
[2024-05-28 14:13:50] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 151/178 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 49/227 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 13/240 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 7 (OVERLAPS) 280/520 variables, 22/34 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 5/525 variables, 5/39 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/525 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 3/528 variables, 3/42 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/528 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 956/1484 variables, 528/570 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1484 variables, 72/642 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1484 variables, 0/642 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/1484 variables, 0/642 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1484/1484 variables, and 642 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2182 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 528/528 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 150/169 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 49/218 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 13/231 variables, 7/11 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 287/518 variables, 22/33 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-28 14:13:53] [INFO ] Deduced a trap composed of 74 places in 157 ms of which 2 ms to minimize.
[2024-05-28 14:13:53] [INFO ] Deduced a trap composed of 74 places in 117 ms of which 2 ms to minimize.
[2024-05-28 14:13:53] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 2 ms to minimize.
[2024-05-28 14:13:53] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/518 variables, 4/37 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/518 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 5/523 variables, 5/42 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/523 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 3/526 variables, 3/45 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/526 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 956/1482 variables, 526/571 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1482 variables, 72/643 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1482 variables, 3/646 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1482 variables, 0/646 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/1484 variables, 2/648 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1484 variables, 1/649 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-28 14:13:56] [INFO ] Deduced a trap composed of 15 places in 482 ms of which 5 ms to minimize.
[2024-05-28 14:13:57] [INFO ] Deduced a trap composed of 264 places in 455 ms of which 7 ms to minimize.
[2024-05-28 14:13:57] [INFO ] Deduced a trap composed of 293 places in 374 ms of which 5 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1484 variables, 3/652 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1484/1484 variables, and 652 constraints, problems are : Problem set: 1 solved, 3 unsolved in 5024 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 528/528 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 7/7 constraints]
After SMT, in 7270ms problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 528 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 528/528 places, 968/968 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 528 transition count 926
Reduce places removed 42 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 48 rules applied. Total rules applied 90 place count 486 transition count 920
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 96 place count 480 transition count 920
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 96 place count 480 transition count 860
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 216 place count 420 transition count 860
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 222 place count 414 transition count 854
Iterating global reduction 3 with 6 rules applied. Total rules applied 228 place count 414 transition count 854
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 324 place count 366 transition count 806
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 336 place count 366 transition count 794
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 348 place count 354 transition count 794
Applied a total of 348 rules in 312 ms. Remains 354 /528 variables (removed 174) and now considering 794/968 (removed 174) transitions.
Running 792 sub problems to find dead transitions.
[2024-05-28 14:13:58] [INFO ] Flow matrix only has 782 transitions (discarded 12 similar events)
// Phase 1: matrix 782 rows 354 cols
[2024-05-28 14:13:58] [INFO ] Computed 42 invariants in 36 ms
[2024-05-28 14:13:58] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 792 unsolved
[2024-05-28 14:14:04] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 1 ms to minimize.
[2024-05-28 14:14:04] [INFO ] Deduced a trap composed of 45 places in 35 ms of which 1 ms to minimize.
[2024-05-28 14:14:04] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 0 ms to minimize.
[2024-05-28 14:14:04] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2024-05-28 14:14:04] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 0 ms to minimize.
[2024-05-28 14:14:04] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:14:05] [INFO ] Deduced a trap composed of 139 places in 332 ms of which 2 ms to minimize.
[2024-05-28 14:14:05] [INFO ] Deduced a trap composed of 135 places in 264 ms of which 2 ms to minimize.
[2024-05-28 14:14:05] [INFO ] Deduced a trap composed of 129 places in 213 ms of which 3 ms to minimize.
[2024-05-28 14:14:06] [INFO ] Deduced a trap composed of 151 places in 211 ms of which 3 ms to minimize.
[2024-05-28 14:14:06] [INFO ] Deduced a trap composed of 56 places in 164 ms of which 2 ms to minimize.
[2024-05-28 14:14:07] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 2 ms to minimize.
[2024-05-28 14:14:14] [INFO ] Deduced a trap composed of 123 places in 232 ms of which 3 ms to minimize.
[2024-05-28 14:14:14] [INFO ] Deduced a trap composed of 118 places in 218 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 792 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/1136 variables, and 54 constraints, problems are : Problem set: 0 solved, 792 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 792/792 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 792 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 792 unsolved
[2024-05-28 14:14:23] [INFO ] Deduced a trap composed of 210 places in 181 ms of which 3 ms to minimize.
[2024-05-28 14:14:23] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-28 14:14:26] [INFO ] Deduced a trap composed of 114 places in 220 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 792 unsolved
Problem TDEAD714 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/353 variables, 1/58 constraints. Problems are: Problem set: 36 solved, 756 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 353/1136 variables, and 58 constraints, problems are : Problem set: 36 solved, 756 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/792 constraints, Known Traps: 17/17 constraints]
After SMT, in 41600ms problems are : Problem set: 36 solved, 756 unsolved
Search for dead transitions found 36 dead transitions in 41610ms
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.
Starting structural reductions in REACHABILITY mode, iteration 1 : 354/528 places, 758/968 transitions.
Applied a total of 0 rules in 21 ms. Remains 354 /354 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41961 ms. Remains : 354/528 places, 758/968 transitions.
RANDOM walk for 40000 steps (33 resets) in 387 ms. (103 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (12 resets) in 248 ms. (160 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (11 resets) in 189 ms. (210 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (12 resets) in 141 ms. (281 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 221549 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 3
Probabilistic random walk after 221549 steps, saw 111318 distinct states, run finished after 3005 ms. (steps per millisecond=73 ) properties seen :0
[2024-05-28 14:14:43] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
// Phase 1: matrix 746 rows 354 cols
[2024-05-28 14:14:43] [INFO ] Computed 42 invariants in 22 ms
[2024-05-28 14:14:43] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 139/158 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 33/191 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 13/204 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 143/347 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 14:14:43] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 2 ms to minimize.
[2024-05-28 14:14:43] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 2 ms to minimize.
[2024-05-28 14:14:43] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 14:14:43] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/351 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/351 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/352 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/352 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 746/1098 variables, 352/397 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1098 variables, 72/469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1098 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/1100 variables, 2/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1100 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1100 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/1100 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1100/1100 variables, and 472 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2373 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 354/354 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 139/158 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 33/191 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 13/204 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 143/347 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 14:14:46] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/351 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/351 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/352 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/352 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 746/1098 variables, 352/398 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1098 variables, 72/470 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1098 variables, 3/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1098 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/1100 variables, 2/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1100 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 14:14:49] [INFO ] Deduced a trap composed of 122 places in 181 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1100 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1100 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/1100 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1100/1100 variables, and 477 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3902 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 354/354 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints]
After SMT, in 6310ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 3950 ms.
Support contains 19 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 758/758 transitions.
Applied a total of 0 rules in 13 ms. Remains 354 /354 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 354/354 places, 758/758 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 758/758 transitions.
Applied a total of 0 rules in 12 ms. Remains 354 /354 variables (removed 0) and now considering 758/758 (removed 0) transitions.
[2024-05-28 14:14:53] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-05-28 14:14:53] [INFO ] Invariant cache hit.
[2024-05-28 14:14:54] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-05-28 14:14:54] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-05-28 14:14:54] [INFO ] Invariant cache hit.
[2024-05-28 14:14:54] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:14:56] [INFO ] Implicit Places using invariants and state equation in 2694 ms returned []
Implicit Place search using SMT with State Equation took 3081 ms to find 0 implicit places.
[2024-05-28 14:14:56] [INFO ] Redundant transitions in 63 ms returned []
Running 756 sub problems to find dead transitions.
[2024-05-28 14:14:56] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-05-28 14:14:56] [INFO ] Invariant cache hit.
[2024-05-28 14:14:56] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-28 14:15:01] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 1 ms to minimize.
[2024-05-28 14:15:01] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 0 ms to minimize.
[2024-05-28 14:15:01] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 0 ms to minimize.
[2024-05-28 14:15:01] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:15:01] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:15:02] [INFO ] Deduced a trap composed of 118 places in 229 ms of which 6 ms to minimize.
[2024-05-28 14:15:02] [INFO ] Deduced a trap composed of 119 places in 235 ms of which 6 ms to minimize.
[2024-05-28 14:15:02] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:15:03] [INFO ] Deduced a trap composed of 143 places in 132 ms of which 1 ms to minimize.
[2024-05-28 14:15:04] [INFO ] Deduced a trap composed of 128 places in 232 ms of which 5 ms to minimize.
[2024-05-28 14:15:06] [INFO ] Deduced a trap composed of 154 places in 249 ms of which 2 ms to minimize.
[2024-05-28 14:15:07] [INFO ] Deduced a trap composed of 165 places in 216 ms of which 2 ms to minimize.
[2024-05-28 14:15:07] [INFO ] Deduced a trap composed of 114 places in 144 ms of which 4 ms to minimize.
[2024-05-28 14:15:08] [INFO ] Deduced a trap composed of 98 places in 234 ms of which 2 ms to minimize.
[2024-05-28 14:15:08] [INFO ] Deduced a trap composed of 136 places in 159 ms of which 2 ms to minimize.
[2024-05-28 14:15:08] [INFO ] Deduced a trap composed of 122 places in 116 ms of which 2 ms to minimize.
[2024-05-28 14:15:09] [INFO ] Deduced a trap composed of 117 places in 229 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 4 (OVERLAPS) 1/353 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Problem TDEAD712 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/354 variables, 1/59 constraints. Problems are: Problem set: 30 solved, 726 unsolved
[2024-05-28 14:15:27] [INFO ] Deduced a trap composed of 25 places in 234 ms of which 3 ms to minimize.
SMT process timed out in 31080ms, After SMT, problems are : Problem set: 30 solved, 726 unsolved
Search for dead transitions found 30 dead transitions in 31090ms
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 REACHABILITY mode, iteration 1 : 354/354 places, 728/758 transitions.
Reduce places removed 1 places and 12 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 353 transition count 716
Reduce places removed 0 places and 12 transitions.
Deduced a syphon composed of 13 places in 1 ms
Applied a total of 1 rules in 23 ms. Remains 353 /354 variables (removed 1) and now considering 704/728 (removed 24) transitions.
[2024-05-28 14:15:27] [INFO ] Flow matrix only has 692 transitions (discarded 12 similar events)
// Phase 1: matrix 692 rows 353 cols
[2024-05-28 14:15:27] [INFO ] Computed 55 invariants in 13 ms
[2024-05-28 14:15:28] [INFO ] Implicit Places using invariants in 466 ms returned []
[2024-05-28 14:15:28] [INFO ] Flow matrix only has 692 transitions (discarded 12 similar events)
[2024-05-28 14:15:28] [INFO ] Invariant cache hit.
[2024-05-28 14:15:28] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:15:31] [INFO ] Implicit Places using invariants and state equation in 3180 ms returned []
Implicit Place search using SMT with State Equation took 3648 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 353/354 places, 704/758 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 37932 ms. Remains : 353/354 places, 704/758 transitions.
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
FORMULA PolyORBLF-COL-S02J06T06-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 11 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' '!((G((X(p1)||p0)) U G(p2)))'
Support contains 21 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 522 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 516 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 516 transition count 956
Applied a total of 24 rules in 21 ms. Remains 516 /528 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-28 14:15:32] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 516 cols
[2024-05-28 14:15:32] [INFO ] Computed 42 invariants in 31 ms
[2024-05-28 14:15:32] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:15:39] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 1 ms to minimize.
[2024-05-28 14:15:39] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:15:39] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:15:39] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:15:39] [INFO ] Deduced a trap composed of 72 places in 35 ms of which 1 ms to minimize.
[2024-05-28 14:15:39] [INFO ] Deduced a trap composed of 293 places in 194 ms of which 2 ms to minimize.
[2024-05-28 14:15:39] [INFO ] Deduced a trap composed of 281 places in 224 ms of which 4 ms to minimize.
[2024-05-28 14:15:40] [INFO ] Deduced a trap composed of 272 places in 228 ms of which 4 ms to minimize.
[2024-05-28 14:15:40] [INFO ] Deduced a trap composed of 124 places in 140 ms of which 2 ms to minimize.
[2024-05-28 14:15:40] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:15:41] [INFO ] Deduced a trap composed of 289 places in 182 ms of which 2 ms to minimize.
[2024-05-28 14:15:41] [INFO ] Deduced a trap composed of 284 places in 273 ms of which 4 ms to minimize.
[2024-05-28 14:15:41] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 3 ms to minimize.
[2024-05-28 14:15:41] [INFO ] Deduced a trap composed of 349 places in 219 ms of which 3 ms to minimize.
[2024-05-28 14:15:42] [INFO ] Deduced a trap composed of 273 places in 217 ms of which 3 ms to minimize.
[2024-05-28 14:15:42] [INFO ] Deduced a trap composed of 269 places in 219 ms of which 3 ms to minimize.
[2024-05-28 14:15:48] [INFO ] Deduced a trap composed of 268 places in 270 ms of which 4 ms to minimize.
[2024-05-28 14:15:49] [INFO ] Deduced a trap composed of 275 places in 231 ms of which 4 ms to minimize.
[2024-05-28 14:15:49] [INFO ] Deduced a trap composed of 260 places in 225 ms of which 4 ms to minimize.
[2024-05-28 14:15:50] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:15:51] [INFO ] Deduced a trap composed of 249 places in 253 ms of which 4 ms to minimize.
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 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.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 1.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 1.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 1.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 1.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 9.0)
(s147 0.0)
(s148 1.0)
(s149 1.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 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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 61 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 21/61 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:15:54] [INFO ] Deduced a trap composed of 292 places in 231 ms of which 3 ms to minimize.
[2024-05-28 14:16:03] [INFO ] Deduced a trap composed of 269 places in 305 ms of which 4 ms to minimize.
[2024-05-28 14:16:05] [INFO ] Deduced a trap composed of 95 places in 252 ms of which 4 ms to minimize.
[2024-05-28 14:16:05] [INFO ] Deduced a trap composed of 288 places in 214 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:16:12] [INFO ] Deduced a trap composed of 278 places in 250 ms of which 3 ms to minimize.
[2024-05-28 14:16:12] [INFO ] Deduced a trap composed of 348 places in 278 ms of which 3 ms to minimize.
[2024-05-28 14:16:12] [INFO ] Deduced a trap composed of 280 places in 213 ms of which 3 ms to minimize.
[2024-05-28 14:16:13] [INFO ] Deduced a trap composed of 275 places in 247 ms of which 4 ms to minimize.
SMT process timed out in 41135ms, After SMT, problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 41147ms
[2024-05-28 14:16:13] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:16:13] [INFO ] Invariant cache hit.
[2024-05-28 14:16:13] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-28 14:16:13] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:16:13] [INFO ] Invariant cache hit.
[2024-05-28 14:16:13] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:16:17] [INFO ] Implicit Places using invariants and state equation in 4183 ms returned []
Implicit Place search using SMT with State Equation took 4462 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2024-05-28 14:16:17] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:16:17] [INFO ] Invariant cache hit.
[2024-05-28 14:16:17] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:16:25] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:16:25] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 1 ms to minimize.
[2024-05-28 14:16:25] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 1 ms to minimize.
[2024-05-28 14:16:26] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 1 ms to minimize.
[2024-05-28 14:16:26] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 1 ms to minimize.
[2024-05-28 14:16:26] [INFO ] Deduced a trap composed of 288 places in 226 ms of which 3 ms to minimize.
[2024-05-28 14:16:26] [INFO ] Deduced a trap composed of 276 places in 223 ms of which 4 ms to minimize.
[2024-05-28 14:16:27] [INFO ] Deduced a trap composed of 274 places in 216 ms of which 4 ms to minimize.
[2024-05-28 14:16:27] [INFO ] Deduced a trap composed of 294 places in 215 ms of which 4 ms to minimize.
[2024-05-28 14:16:27] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 0 ms to minimize.
[2024-05-28 14:16:27] [INFO ] Deduced a trap composed of 290 places in 220 ms of which 3 ms to minimize.
[2024-05-28 14:16:28] [INFO ] Deduced a trap composed of 289 places in 217 ms of which 4 ms to minimize.
[2024-05-28 14:16:28] [INFO ] Deduced a trap composed of 314 places in 207 ms of which 4 ms to minimize.
[2024-05-28 14:16:29] [INFO ] Deduced a trap composed of 294 places in 239 ms of which 3 ms to minimize.
[2024-05-28 14:16:29] [INFO ] Deduced a trap composed of 280 places in 234 ms of which 4 ms to minimize.
[2024-05-28 14:16:29] [INFO ] Deduced a trap composed of 42 places in 228 ms of which 3 ms to minimize.
[2024-05-28 14:16:29] [INFO ] Deduced a trap composed of 261 places in 195 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:16:39] [INFO ] Deduced a trap composed of 117 places in 201 ms of which 3 ms to minimize.
[2024-05-28 14:16:39] [INFO ] Deduced a trap composed of 149 places in 178 ms of which 3 ms to minimize.
[2024-05-28 14:16:39] [INFO ] Deduced a trap composed of 283 places in 246 ms of which 4 ms to minimize.
[2024-05-28 14:16:47] [INFO ] Deduced a trap composed of 247 places in 242 ms of which 4 ms to minimize.
[2024-05-28 14:16:47] [INFO ] Deduced a trap composed of 258 places in 213 ms of which 3 ms to minimize.
[2024-05-28 14:16:47] [INFO ] Deduced a trap composed of 266 places in 193 ms of which 3 ms to minimize.
[2024-05-28 14:16:48] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 64 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:16:55] [INFO ] Deduced a trap composed of 343 places in 259 ms of which 3 ms to minimize.
[2024-05-28 14:16:57] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 66 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 26/26 constraints]
After SMT, in 61098ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 61120ms
Starting structural reductions in LTL mode, iteration 1 : 516/528 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106757 ms. Remains : 516/528 places, 956/968 transitions.
Stuttering acceptance computed with spot in 319 ms :[(NOT p2), (NOT p1), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-COL-S02J06T06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T06-LTLFireability-00 finished in 107157 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((X(p1)&&p0))))'
Support contains 19 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Applied a total of 0 rules in 8 ms. Remains 528 /528 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Running 966 sub problems to find dead transitions.
[2024-05-28 14:17:19] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 528 cols
[2024-05-28 14:17:19] [INFO ] Computed 42 invariants in 11 ms
[2024-05-28 14:17:19] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 14:17:27] [INFO ] Deduced a trap composed of 74 places in 34 ms of which 1 ms to minimize.
[2024-05-28 14:17:27] [INFO ] Deduced a trap composed of 74 places in 35 ms of which 1 ms to minimize.
[2024-05-28 14:17:27] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 0 ms to minimize.
[2024-05-28 14:17:27] [INFO ] Deduced a trap composed of 74 places in 38 ms of which 1 ms to minimize.
[2024-05-28 14:17:27] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:17:27] [INFO ] Deduced a trap composed of 289 places in 168 ms of which 3 ms to minimize.
[2024-05-28 14:17:27] [INFO ] Deduced a trap composed of 135 places in 143 ms of which 2 ms to minimize.
[2024-05-28 14:17:28] [INFO ] Deduced a trap composed of 158 places in 156 ms of which 3 ms to minimize.
[2024-05-28 14:17:28] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:17:28] [INFO ] Deduced a trap composed of 311 places in 180 ms of which 3 ms to minimize.
[2024-05-28 14:17:28] [INFO ] Deduced a trap composed of 382 places in 187 ms of which 3 ms to minimize.
[2024-05-28 14:17:29] [INFO ] Deduced a trap composed of 293 places in 275 ms of which 4 ms to minimize.
[2024-05-28 14:17:29] [INFO ] Deduced a trap composed of 276 places in 250 ms of which 3 ms to minimize.
[2024-05-28 14:17:29] [INFO ] Deduced a trap composed of 53 places in 180 ms of which 3 ms to minimize.
[2024-05-28 14:17:30] [INFO ] Deduced a trap composed of 248 places in 241 ms of which 4 ms to minimize.
[2024-05-28 14:17:30] [INFO ] Deduced a trap composed of 328 places in 170 ms of which 2 ms to minimize.
[2024-05-28 14:17:30] [INFO ] Deduced a trap composed of 288 places in 229 ms of which 4 ms to minimize.
[2024-05-28 14:17:30] [INFO ] Deduced a trap composed of 306 places in 382 ms of which 3 ms to minimize.
[2024-05-28 14:17:31] [INFO ] Deduced a trap composed of 302 places in 187 ms of which 3 ms to minimize.
[2024-05-28 14:17:31] [INFO ] Deduced a trap composed of 318 places in 193 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 14:17:32] [INFO ] Deduced a trap composed of 283 places in 256 ms of which 4 ms to minimize.
[2024-05-28 14:17:32] [INFO ] Deduced a trap composed of 281 places in 251 ms of which 4 ms to minimize.
[2024-05-28 14:17:40] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1484 variables, and 63 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 23/63 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 14:17:46] [INFO ] Deduced a trap composed of 288 places in 163 ms of which 3 ms to minimize.
[2024-05-28 14:17:46] [INFO ] Deduced a trap composed of 350 places in 159 ms of which 3 ms to minimize.
[2024-05-28 14:17:46] [INFO ] Deduced a trap composed of 363 places in 158 ms of which 3 ms to minimize.
[2024-05-28 14:17:47] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
[2024-05-28 14:17:47] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-05-28 14:17:50] [INFO ] Deduced a trap composed of 268 places in 247 ms of which 4 ms to minimize.
[2024-05-28 14:17:51] [INFO ] Deduced a trap composed of 289 places in 178 ms of which 4 ms to minimize.
[2024-05-28 14:17:51] [INFO ] Deduced a trap composed of 259 places in 227 ms of which 3 ms to minimize.
[2024-05-28 14:17:53] [INFO ] Deduced a trap composed of 288 places in 209 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1484 variables, and 72 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 32/32 constraints]
After SMT, in 41336ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 41353ms
[2024-05-28 14:18:00] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 14:18:00] [INFO ] Invariant cache hit.
[2024-05-28 14:18:00] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-05-28 14:18:00] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 14:18:00] [INFO ] Invariant cache hit.
[2024-05-28 14:18:01] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:18:05] [INFO ] Implicit Places using invariants and state equation in 4773 ms returned []
Implicit Place search using SMT with State Equation took 5031 ms to find 0 implicit places.
Running 966 sub problems to find dead transitions.
[2024-05-28 14:18:05] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 14:18:05] [INFO ] Invariant cache hit.
[2024-05-28 14:18:05] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 14:18:12] [INFO ] Deduced a trap composed of 74 places in 33 ms of which 1 ms to minimize.
[2024-05-28 14:18:12] [INFO ] Deduced a trap composed of 74 places in 35 ms of which 0 ms to minimize.
[2024-05-28 14:18:12] [INFO ] Deduced a trap composed of 74 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:18:12] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 1 ms to minimize.
[2024-05-28 14:18:12] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 2 ms to minimize.
[2024-05-28 14:18:13] [INFO ] Deduced a trap composed of 283 places in 169 ms of which 3 ms to minimize.
[2024-05-28 14:18:13] [INFO ] Deduced a trap composed of 294 places in 177 ms of which 2 ms to minimize.
[2024-05-28 14:18:13] [INFO ] Deduced a trap composed of 250 places in 164 ms of which 3 ms to minimize.
[2024-05-28 14:18:13] [INFO ] Deduced a trap composed of 129 places in 219 ms of which 3 ms to minimize.
[2024-05-28 14:18:13] [INFO ] Deduced a trap composed of 158 places in 192 ms of which 4 ms to minimize.
[2024-05-28 14:18:13] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:18:14] [INFO ] Deduced a trap composed of 262 places in 250 ms of which 3 ms to minimize.
[2024-05-28 14:18:14] [INFO ] Deduced a trap composed of 309 places in 225 ms of which 4 ms to minimize.
[2024-05-28 14:18:15] [INFO ] Deduced a trap composed of 284 places in 185 ms of which 3 ms to minimize.
[2024-05-28 14:18:15] [INFO ] Deduced a trap composed of 285 places in 182 ms of which 3 ms to minimize.
[2024-05-28 14:18:22] [INFO ] Deduced a trap composed of 285 places in 260 ms of which 4 ms to minimize.
[2024-05-28 14:18:22] [INFO ] Deduced a trap composed of 15 places in 227 ms of which 4 ms to minimize.
[2024-05-28 14:18:23] [INFO ] Deduced a trap composed of 163 places in 261 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 14:18:32] [INFO ] Deduced a trap composed of 243 places in 241 ms of which 4 ms to minimize.
[2024-05-28 14:18:32] [INFO ] Deduced a trap composed of 273 places in 252 ms of which 4 ms to minimize.
[2024-05-28 14:18:32] [INFO ] Deduced a trap composed of 271 places in 230 ms of which 4 ms to minimize.
[2024-05-28 14:18:33] [INFO ] Deduced a trap composed of 63 places in 236 ms of which 4 ms to minimize.
[2024-05-28 14:18:33] [INFO ] Deduced a trap composed of 158 places in 262 ms of which 3 ms to minimize.
[2024-05-28 14:18:33] [INFO ] Deduced a trap composed of 282 places in 182 ms of which 3 ms to minimize.
[2024-05-28 14:18:34] [INFO ] Deduced a trap composed of 264 places in 228 ms of which 4 ms to minimize.
[2024-05-28 14:18:34] [INFO ] Deduced a trap composed of 3 places in 258 ms of which 4 ms to minimize.
[2024-05-28 14:18:35] [INFO ] Deduced a trap composed of 291 places in 235 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1484 variables, and 67 constraints, problems are : Problem set: 0 solved, 966 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 14:18:38] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 2 ms to minimize.
[2024-05-28 14:18:41] [INFO ] Deduced a trap composed of 364 places in 217 ms of which 4 ms to minimize.
[2024-05-28 14:18:42] [INFO ] Deduced a trap composed of 366 places in 253 ms of which 4 ms to minimize.
[2024-05-28 14:18:42] [INFO ] Deduced a trap composed of 361 places in 225 ms of which 4 ms to minimize.
[2024-05-28 14:18:45] [INFO ] Deduced a trap composed of 262 places in 181 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 14:18:55] [INFO ] Deduced a trap composed of 287 places in 171 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1484 variables, and 73 constraints, problems are : Problem set: 0 solved, 966 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 33/33 constraints]
After SMT, in 60985ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 61002ms
Finished structural reductions in LTL mode , in 1 iterations and 107401 ms. Remains : 528/528 places, 968/968 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLFireability-03
Product exploration explored 100000 steps with 4549 reset in 437 ms.
Product exploration explored 100000 steps with 4557 reset in 418 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 101 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 204 steps (0 resets) in 6 ms. (29 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 345 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-28 14:19:08] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 14:19:08] [INFO ] Invariant cache hit.
[2024-05-28 14:19:08] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2024-05-28 14:19:08] [INFO ] [Real]Absence check using 17 positive and 25 generalized place invariants in 58 ms returned sat
[2024-05-28 14:19:09] [INFO ] [Real]Absence check using state equation in 788 ms returned sat
[2024-05-28 14:19:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:19:10] [INFO ] [Nat]Absence check using 17 positive place invariants in 27 ms returned sat
[2024-05-28 14:19:10] [INFO ] [Nat]Absence check using 17 positive and 25 generalized place invariants in 46 ms returned sat
[2024-05-28 14:19:12] [INFO ] [Nat]Absence check using state equation in 1888 ms returned sat
[2024-05-28 14:19:12] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:19:12] [INFO ] [Nat]Added 72 Read/Feed constraints in 530 ms returned sat
[2024-05-28 14:19:13] [INFO ] Deduced a trap composed of 250 places in 292 ms of which 3 ms to minimize.
[2024-05-28 14:19:13] [INFO ] Deduced a trap composed of 74 places in 138 ms of which 3 ms to minimize.
[2024-05-28 14:19:14] [INFO ] Deduced a trap composed of 74 places in 119 ms of which 2 ms to minimize.
[2024-05-28 14:19:14] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 2 ms to minimize.
[2024-05-28 14:19:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2170 ms
[2024-05-28 14:19:14] [INFO ] Computed and/alt/rep : 630/2205/624 causal constraints (skipped 330 transitions) in 117 ms.
[2024-05-28 14:19:20] [INFO ] Added : 266 causal constraints over 54 iterations in 5851 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 19 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Applied a total of 0 rules in 9 ms. Remains 528 /528 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Running 966 sub problems to find dead transitions.
[2024-05-28 14:19:20] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 14:19:20] [INFO ] Invariant cache hit.
[2024-05-28 14:19:20] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 14:19:27] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:19:27] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 0 ms to minimize.
[2024-05-28 14:19:27] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 0 ms to minimize.
[2024-05-28 14:19:27] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 0 ms to minimize.
[2024-05-28 14:19:28] [INFO ] Deduced a trap composed of 74 places in 60 ms of which 0 ms to minimize.
[2024-05-28 14:19:28] [INFO ] Deduced a trap composed of 283 places in 172 ms of which 5 ms to minimize.
[2024-05-28 14:19:28] [INFO ] Deduced a trap composed of 294 places in 216 ms of which 3 ms to minimize.
[2024-05-28 14:19:28] [INFO ] Deduced a trap composed of 250 places in 181 ms of which 3 ms to minimize.
[2024-05-28 14:19:29] [INFO ] Deduced a trap composed of 129 places in 194 ms of which 3 ms to minimize.
[2024-05-28 14:19:29] [INFO ] Deduced a trap composed of 158 places in 156 ms of which 3 ms to minimize.
[2024-05-28 14:19:29] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2024-05-28 14:19:29] [INFO ] Deduced a trap composed of 262 places in 164 ms of which 3 ms to minimize.
[2024-05-28 14:19:29] [INFO ] Deduced a trap composed of 309 places in 182 ms of which 2 ms to minimize.
[2024-05-28 14:19:30] [INFO ] Deduced a trap composed of 284 places in 211 ms of which 3 ms to minimize.
[2024-05-28 14:19:30] [INFO ] Deduced a trap composed of 285 places in 185 ms of which 3 ms to minimize.
[2024-05-28 14:19:36] [INFO ] Deduced a trap composed of 285 places in 193 ms of which 3 ms to minimize.
[2024-05-28 14:19:36] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 3 ms to minimize.
[2024-05-28 14:19:37] [INFO ] Deduced a trap composed of 163 places in 205 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1484 variables, and 58 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 14:19:43] [INFO ] Deduced a trap composed of 59 places in 106 ms of which 1 ms to minimize.
[2024-05-28 14:19:47] [INFO ] Deduced a trap composed of 262 places in 179 ms of which 3 ms to minimize.
[2024-05-28 14:19:47] [INFO ] Deduced a trap composed of 361 places in 191 ms of which 2 ms to minimize.
[2024-05-28 14:19:47] [INFO ] Deduced a trap composed of 370 places in 183 ms of which 2 ms to minimize.
[2024-05-28 14:19:50] [INFO ] Deduced a trap composed of 247 places in 170 ms of which 8 ms to minimize.
[2024-05-28 14:19:51] [INFO ] Deduced a trap composed of 263 places in 178 ms of which 2 ms to minimize.
[2024-05-28 14:19:51] [INFO ] Deduced a trap composed of 262 places in 178 ms of which 3 ms to minimize.
[2024-05-28 14:19:51] [INFO ] Deduced a trap composed of 284 places in 158 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 966 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 526/1484 variables, and 66 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 26/26 constraints]
After SMT, in 41107ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 41118ms
[2024-05-28 14:20:01] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 14:20:01] [INFO ] Invariant cache hit.
[2024-05-28 14:20:02] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-28 14:20:02] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 14:20:02] [INFO ] Invariant cache hit.
[2024-05-28 14:20:02] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:20:06] [INFO ] Implicit Places using invariants and state equation in 4288 ms returned []
Implicit Place search using SMT with State Equation took 4560 ms to find 0 implicit places.
Running 966 sub problems to find dead transitions.
[2024-05-28 14:20:06] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 14:20:06] [INFO ] Invariant cache hit.
[2024-05-28 14:20:06] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 14:20:14] [INFO ] Deduced a trap composed of 74 places in 33 ms of which 1 ms to minimize.
[2024-05-28 14:20:14] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:20:14] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 2 ms to minimize.
[2024-05-28 14:20:14] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 1 ms to minimize.
[2024-05-28 14:20:14] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:20:14] [INFO ] Deduced a trap composed of 283 places in 261 ms of which 4 ms to minimize.
[2024-05-28 14:20:15] [INFO ] Deduced a trap composed of 294 places in 364 ms of which 4 ms to minimize.
[2024-05-28 14:20:15] [INFO ] Deduced a trap composed of 250 places in 291 ms of which 4 ms to minimize.
[2024-05-28 14:20:15] [INFO ] Deduced a trap composed of 129 places in 247 ms of which 4 ms to minimize.
[2024-05-28 14:20:16] [INFO ] Deduced a trap composed of 158 places in 180 ms of which 3 ms to minimize.
[2024-05-28 14:20:16] [INFO ] Deduced a trap composed of 74 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:20:16] [INFO ] Deduced a trap composed of 262 places in 282 ms of which 4 ms to minimize.
[2024-05-28 14:20:16] [INFO ] Deduced a trap composed of 309 places in 274 ms of which 5 ms to minimize.
[2024-05-28 14:20:17] [INFO ] Deduced a trap composed of 284 places in 290 ms of which 4 ms to minimize.
[2024-05-28 14:20:17] [INFO ] Deduced a trap composed of 285 places in 231 ms of which 3 ms to minimize.
[2024-05-28 14:20:25] [INFO ] Deduced a trap composed of 285 places in 276 ms of which 4 ms to minimize.
[2024-05-28 14:20:25] [INFO ] Deduced a trap composed of 15 places in 231 ms of which 3 ms to minimize.
[2024-05-28 14:20:26] [INFO ] Deduced a trap composed of 163 places in 193 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 966 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 526/1484 variables, and 58 constraints, problems are : Problem set: 0 solved, 966 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 14:20:40] [INFO ] Deduced a trap composed of 59 places in 179 ms of which 2 ms to minimize.
[2024-05-28 14:20:46] [INFO ] Deduced a trap composed of 262 places in 331 ms of which 6 ms to minimize.
[2024-05-28 14:20:47] [INFO ] Deduced a trap composed of 361 places in 240 ms of which 3 ms to minimize.
[2024-05-28 14:20:47] [INFO ] Deduced a trap composed of 370 places in 208 ms of which 3 ms to minimize.
[2024-05-28 14:20:50] [INFO ] Deduced a trap composed of 247 places in 201 ms of which 3 ms to minimize.
[2024-05-28 14:20:51] [INFO ] Deduced a trap composed of 263 places in 324 ms of which 7 ms to minimize.
[2024-05-28 14:20:51] [INFO ] Deduced a trap composed of 262 places in 328 ms of which 5 ms to minimize.
[2024-05-28 14:20:52] [INFO ] Deduced a trap composed of 284 places in 277 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 14:21:04] [INFO ] Deduced a trap composed of 62 places in 322 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1484 variables, and 67 constraints, problems are : Problem set: 0 solved, 966 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 27/27 constraints]
After SMT, in 61379ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 61401ms
Finished structural reductions in LTL mode , in 1 iterations and 107096 ms. Remains : 528/528 places, 968/968 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 72 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 737 steps (0 resets) in 35 ms. (20 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 153 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-28 14:21:08] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 14:21:08] [INFO ] Invariant cache hit.
[2024-05-28 14:21:08] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2024-05-28 14:21:08] [INFO ] [Real]Absence check using 17 positive and 25 generalized place invariants in 59 ms returned sat
[2024-05-28 14:21:09] [INFO ] [Real]Absence check using state equation in 800 ms returned sat
[2024-05-28 14:21:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:21:10] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2024-05-28 14:21:10] [INFO ] [Nat]Absence check using 17 positive and 25 generalized place invariants in 34 ms returned sat
[2024-05-28 14:21:11] [INFO ] [Nat]Absence check using state equation in 1705 ms returned sat
[2024-05-28 14:21:11] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:21:12] [INFO ] [Nat]Added 72 Read/Feed constraints in 574 ms returned sat
[2024-05-28 14:21:12] [INFO ] Deduced a trap composed of 250 places in 223 ms of which 3 ms to minimize.
[2024-05-28 14:21:12] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 2 ms to minimize.
[2024-05-28 14:21:14] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 1 ms to minimize.
[2024-05-28 14:21:14] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 1 ms to minimize.
[2024-05-28 14:21:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1954 ms
[2024-05-28 14:21:14] [INFO ] Computed and/alt/rep : 630/2205/624 causal constraints (skipped 330 transitions) in 104 ms.
[2024-05-28 14:21:19] [INFO ] Added : 266 causal constraints over 54 iterations in 4804 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 4562 reset in 453 ms.
Product exploration explored 100000 steps with 4583 reset in 438 ms.
Built C files in :
/tmp/ltsmin11335424270430064665
[2024-05-28 14:21:20] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11335424270430064665
Running compilation step : cd /tmp/ltsmin11335424270430064665;'/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 2293 ms.
Running link step : cd /tmp/ltsmin11335424270430064665;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin11335424270430064665;'/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/stateBased1394629494254617476.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 19 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Applied a total of 0 rules in 7 ms. Remains 528 /528 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Running 966 sub problems to find dead transitions.
[2024-05-28 14:21:35] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 14:21:35] [INFO ] Invariant cache hit.
[2024-05-28 14:21:35] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 14:21:43] [INFO ] Deduced a trap composed of 74 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:21:43] [INFO ] Deduced a trap composed of 74 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:21:43] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:21:43] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:21:43] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 2 ms to minimize.
[2024-05-28 14:21:44] [INFO ] Deduced a trap composed of 283 places in 259 ms of which 4 ms to minimize.
[2024-05-28 14:21:44] [INFO ] Deduced a trap composed of 294 places in 229 ms of which 4 ms to minimize.
[2024-05-28 14:21:44] [INFO ] Deduced a trap composed of 250 places in 184 ms of which 3 ms to minimize.
[2024-05-28 14:21:44] [INFO ] Deduced a trap composed of 129 places in 174 ms of which 3 ms to minimize.
[2024-05-28 14:21:45] [INFO ] Deduced a trap composed of 158 places in 212 ms of which 4 ms to minimize.
[2024-05-28 14:21:45] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:21:45] [INFO ] Deduced a trap composed of 262 places in 256 ms of which 3 ms to minimize.
[2024-05-28 14:21:45] [INFO ] Deduced a trap composed of 309 places in 175 ms of which 2 ms to minimize.
[2024-05-28 14:21:46] [INFO ] Deduced a trap composed of 284 places in 186 ms of which 3 ms to minimize.
[2024-05-28 14:21:46] [INFO ] Deduced a trap composed of 285 places in 184 ms of which 2 ms to minimize.
[2024-05-28 14:21:52] [INFO ] Deduced a trap composed of 285 places in 187 ms of which 2 ms to minimize.
[2024-05-28 14:21:52] [INFO ] Deduced a trap composed of 15 places in 247 ms of which 3 ms to minimize.
[2024-05-28 14:21:53] [INFO ] Deduced a trap composed of 163 places in 165 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 966 unsolved
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 1.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.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 1.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 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 1.0)
(s133 1.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 9.0)
(s147 0.0)
(s148 1.0)
(s149 1.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 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 1.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 0.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)
(s233 0.0)
(s234 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 1.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 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s277 1.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 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 4.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 1.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 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1484 variables, and 58 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 14:21:58] [INFO ] Deduced a trap composed of 59 places in 91 ms of which 2 ms to minimize.
[2024-05-28 14:22:02] [INFO ] Deduced a trap composed of 262 places in 202 ms of which 2 ms to minimize.
[2024-05-28 14:22:02] [INFO ] Deduced a trap composed of 361 places in 228 ms of which 3 ms to minimize.
[2024-05-28 14:22:03] [INFO ] Deduced a trap composed of 370 places in 210 ms of which 3 ms to minimize.
[2024-05-28 14:22:06] [INFO ] Deduced a trap composed of 247 places in 236 ms of which 4 ms to minimize.
[2024-05-28 14:22:07] [INFO ] Deduced a trap composed of 263 places in 211 ms of which 3 ms to minimize.
[2024-05-28 14:22:07] [INFO ] Deduced a trap composed of 262 places in 224 ms of which 3 ms to minimize.
[2024-05-28 14:22:07] [INFO ] Deduced a trap composed of 284 places in 167 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1484 variables, and 66 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 26/26 constraints]
After SMT, in 40952ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 40963ms
[2024-05-28 14:22:16] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 14:22:16] [INFO ] Invariant cache hit.
[2024-05-28 14:22:17] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-28 14:22:17] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 14:22:17] [INFO ] Invariant cache hit.
[2024-05-28 14:22:17] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:22:21] [INFO ] Implicit Places using invariants and state equation in 4299 ms returned []
Implicit Place search using SMT with State Equation took 4589 ms to find 0 implicit places.
Running 966 sub problems to find dead transitions.
[2024-05-28 14:22:21] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 14:22:21] [INFO ] Invariant cache hit.
[2024-05-28 14:22:21] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 14:22:29] [INFO ] Deduced a trap composed of 74 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:22:29] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 0 ms to minimize.
[2024-05-28 14:22:29] [INFO ] Deduced a trap composed of 74 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:22:29] [INFO ] Deduced a trap composed of 74 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:22:29] [INFO ] Deduced a trap composed of 74 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:22:29] [INFO ] Deduced a trap composed of 283 places in 182 ms of which 2 ms to minimize.
[2024-05-28 14:22:30] [INFO ] Deduced a trap composed of 294 places in 247 ms of which 4 ms to minimize.
[2024-05-28 14:22:30] [INFO ] Deduced a trap composed of 250 places in 259 ms of which 4 ms to minimize.
[2024-05-28 14:22:30] [INFO ] Deduced a trap composed of 129 places in 197 ms of which 3 ms to minimize.
[2024-05-28 14:22:30] [INFO ] Deduced a trap composed of 158 places in 187 ms of which 2 ms to minimize.
[2024-05-28 14:22:30] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:22:31] [INFO ] Deduced a trap composed of 262 places in 216 ms of which 3 ms to minimize.
[2024-05-28 14:22:31] [INFO ] Deduced a trap composed of 309 places in 223 ms of which 2 ms to minimize.
[2024-05-28 14:22:32] [INFO ] Deduced a trap composed of 284 places in 194 ms of which 2 ms to minimize.
[2024-05-28 14:22:32] [INFO ] Deduced a trap composed of 285 places in 222 ms of which 3 ms to minimize.
[2024-05-28 14:22:39] [INFO ] Deduced a trap composed of 285 places in 255 ms of which 4 ms to minimize.
[2024-05-28 14:22:39] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 2 ms to minimize.
[2024-05-28 14:22:40] [INFO ] Deduced a trap composed of 163 places in 208 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 14:22:48] [INFO ] Deduced a trap composed of 243 places in 171 ms of which 3 ms to minimize.
[2024-05-28 14:22:49] [INFO ] Deduced a trap composed of 273 places in 195 ms of which 3 ms to minimize.
[2024-05-28 14:22:49] [INFO ] Deduced a trap composed of 271 places in 241 ms of which 3 ms to minimize.
[2024-05-28 14:22:50] [INFO ] Deduced a trap composed of 63 places in 270 ms of which 4 ms to minimize.
[2024-05-28 14:22:50] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 2 ms to minimize.
[2024-05-28 14:22:50] [INFO ] Deduced a trap composed of 282 places in 234 ms of which 5 ms to minimize.
[2024-05-28 14:22:50] [INFO ] Deduced a trap composed of 264 places in 185 ms of which 3 ms to minimize.
[2024-05-28 14:22:51] [INFO ] Deduced a trap composed of 3 places in 246 ms of which 4 ms to minimize.
[2024-05-28 14:22:52] [INFO ] Deduced a trap composed of 291 places in 171 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1484 variables, and 67 constraints, problems are : Problem set: 0 solved, 966 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 14:22:54] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 2 ms to minimize.
[2024-05-28 14:22:58] [INFO ] Deduced a trap composed of 364 places in 180 ms of which 2 ms to minimize.
[2024-05-28 14:22:59] [INFO ] Deduced a trap composed of 366 places in 181 ms of which 3 ms to minimize.
[2024-05-28 14:22:59] [INFO ] Deduced a trap composed of 361 places in 226 ms of which 3 ms to minimize.
[2024-05-28 14:23:03] [INFO ] Deduced a trap composed of 262 places in 239 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 14:23:13] [INFO ] Deduced a trap composed of 287 places in 250 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1484 variables, and 73 constraints, problems are : Problem set: 0 solved, 966 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 33/33 constraints]
After SMT, in 61299ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 61314ms
Finished structural reductions in LTL mode , in 1 iterations and 106886 ms. Remains : 528/528 places, 968/968 transitions.
Built C files in :
/tmp/ltsmin2268920636054369408
[2024-05-28 14:23:22] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2268920636054369408
Running compilation step : cd /tmp/ltsmin2268920636054369408;'/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 1757 ms.
Running link step : cd /tmp/ltsmin2268920636054369408;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin2268920636054369408;'/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/stateBased7447543615305473308.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 14:23:38] [INFO ] Flatten gal took : 57 ms
[2024-05-28 14:23:38] [INFO ] Flatten gal took : 43 ms
[2024-05-28 14:23:38] [INFO ] Time to serialize gal into /tmp/LTL18403099853002030132.gal : 14 ms
[2024-05-28 14:23:38] [INFO ] Time to serialize properties into /tmp/LTL14267586676154915341.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/LTL18403099853002030132.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3693823878935454396.hoa' '-atoms' '/tmp/LTL14267586676154915341.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/LTL14267586676154915341.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3693823878935454396.hoa
Detected timeout of ITS tools.
[2024-05-28 14:23:53] [INFO ] Flatten gal took : 61 ms
[2024-05-28 14:23:53] [INFO ] Flatten gal took : 49 ms
[2024-05-28 14:23:53] [INFO ] Time to serialize gal into /tmp/LTL12036555855348551816.gal : 9 ms
[2024-05-28 14:23:53] [INFO ] Time to serialize properties into /tmp/LTL4735186992315824860.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/LTL12036555855348551816.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4735186992315824860.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...276
Read 1 LTL properties
Checking formula 0 : !((G(F(((((X("((((Try_Check_Sources_E_5>=1)||(Try_Check_Sources_E_4>=1))||((Try_Check_Sources_E_3>=1)||(Try_Check_Sources_E_2>=1)))||(...795
Formula 0 simplified : FG(!"(((((cBlockedTasks<10)||(DisablePollingB_2<1))&&((cBlockedTasks<10)||(DisablePollingB_1<1)))&&(((cBlockedTasks<10)||(DisablePol...781
Detected timeout of ITS tools.
[2024-05-28 14:24:08] [INFO ] Flatten gal took : 49 ms
[2024-05-28 14:24:08] [INFO ] Applying decomposition
[2024-05-28 14:24:08] [INFO ] Flatten gal took : 42 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/graph579663290195789879.txt' '-o' '/tmp/graph579663290195789879.bin' '-w' '/tmp/graph579663290195789879.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph579663290195789879.bin' '-l' '-1' '-v' '-w' '/tmp/graph579663290195789879.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:24:08] [INFO ] Decomposing Gal with order
[2024-05-28 14:24:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:24:09] [INFO ] Removed a total of 817 redundant transitions.
[2024-05-28 14:24:09] [INFO ] Flatten gal took : 203 ms
[2024-05-28 14:24:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 155 labels/synchronizations in 31 ms.
[2024-05-28 14:24:09] [INFO ] Time to serialize gal into /tmp/LTL1914860256984356570.gal : 14 ms
[2024-05-28 14:24:09] [INFO ] Time to serialize properties into /tmp/LTL14785915326034511022.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1914860256984356570.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14785915326034511022.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(((((X("((((i2.i1.u62.Try_Check_Sources_E_5>=1)||(i2.i2.u82.Try_Check_Sources_E_4>=1))||((i11.i1.u61.Try_Check_Sources_E_3>=1)||...1069
Formula 0 simplified : FG(!"(((((i2.i0.u12.cBlockedTasks<10)||(i0.i0.u15.DisablePollingB_2<1))&&((i2.i0.u12.cBlockedTasks<10)||(i0.i1.u14.DisablePollingB_1...1055
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J06T06-LTLFireability-03 finished in 425250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 12 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 522 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 522 transition count 962
Applied a total of 12 rules in 21 ms. Remains 522 /528 variables (removed 6) and now considering 962/968 (removed 6) transitions.
Running 960 sub problems to find dead transitions.
[2024-05-28 14:24:24] [INFO ] Flow matrix only has 950 transitions (discarded 12 similar events)
// Phase 1: matrix 950 rows 522 cols
[2024-05-28 14:24:24] [INFO ] Computed 42 invariants in 25 ms
[2024-05-28 14:24:24] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 14:24:32] [INFO ] Deduced a trap composed of 73 places in 64 ms of which 2 ms to minimize.
[2024-05-28 14:24:32] [INFO ] Deduced a trap composed of 73 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:24:32] [INFO ] Deduced a trap composed of 73 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:24:32] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:24:32] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:24:33] [INFO ] Deduced a trap composed of 289 places in 246 ms of which 4 ms to minimize.
[2024-05-28 14:24:33] [INFO ] Deduced a trap composed of 289 places in 218 ms of which 4 ms to minimize.
[2024-05-28 14:24:33] [INFO ] Deduced a trap composed of 283 places in 302 ms of which 4 ms to minimize.
[2024-05-28 14:24:33] [INFO ] Deduced a trap composed of 295 places in 236 ms of which 3 ms to minimize.
[2024-05-28 14:24:34] [INFO ] Deduced a trap composed of 141 places in 180 ms of which 2 ms to minimize.
[2024-05-28 14:24:34] [INFO ] Deduced a trap composed of 138 places in 168 ms of which 3 ms to minimize.
[2024-05-28 14:24:34] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:24:34] [INFO ] Deduced a trap composed of 296 places in 261 ms of which 3 ms to minimize.
[2024-05-28 14:24:35] [INFO ] Deduced a trap composed of 296 places in 185 ms of which 2 ms to minimize.
[2024-05-28 14:24:35] [INFO ] Deduced a trap composed of 296 places in 187 ms of which 2 ms to minimize.
[2024-05-28 14:24:35] [INFO ] Deduced a trap composed of 346 places in 166 ms of which 2 ms to minimize.
[2024-05-28 14:24:35] [INFO ] Deduced a trap composed of 298 places in 177 ms of which 3 ms to minimize.
[2024-05-28 14:24:35] [INFO ] Deduced a trap composed of 279 places in 166 ms of which 3 ms to minimize.
[2024-05-28 14:24:36] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 2 ms to minimize.
[2024-05-28 14:24:36] [INFO ] Deduced a trap composed of 326 places in 256 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 14:24:37] [INFO ] Deduced a trap composed of 306 places in 180 ms of which 3 ms to minimize.
[2024-05-28 14:24:38] [INFO ] Deduced a trap composed of 289 places in 236 ms of which 3 ms to minimize.
[2024-05-28 14:24:38] [INFO ] Deduced a trap composed of 284 places in 270 ms of which 4 ms to minimize.
[2024-05-28 14:24:39] [INFO ] Deduced a trap composed of 281 places in 239 ms of which 4 ms to minimize.
[2024-05-28 14:24:45] [INFO ] Deduced a trap composed of 244 places in 234 ms of which 3 ms to minimize.
SMT process timed out in 21141ms, After SMT, problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 21158ms
[2024-05-28 14:24:45] [INFO ] Flow matrix only has 950 transitions (discarded 12 similar events)
[2024-05-28 14:24:45] [INFO ] Invariant cache hit.
[2024-05-28 14:24:45] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-28 14:24:45] [INFO ] Flow matrix only has 950 transitions (discarded 12 similar events)
[2024-05-28 14:24:45] [INFO ] Invariant cache hit.
[2024-05-28 14:24:46] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:24:49] [INFO ] Implicit Places using invariants and state equation in 3635 ms returned []
Implicit Place search using SMT with State Equation took 4001 ms to find 0 implicit places.
Running 960 sub problems to find dead transitions.
[2024-05-28 14:24:49] [INFO ] Flow matrix only has 950 transitions (discarded 12 similar events)
[2024-05-28 14:24:49] [INFO ] Invariant cache hit.
[2024-05-28 14:24:49] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 14:24:57] [INFO ] Deduced a trap composed of 73 places in 35 ms of which 1 ms to minimize.
[2024-05-28 14:24:57] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 2 ms to minimize.
[2024-05-28 14:24:57] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:24:58] [INFO ] Deduced a trap composed of 73 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:24:58] [INFO ] Deduced a trap composed of 73 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:24:58] [INFO ] Deduced a trap composed of 288 places in 200 ms of which 3 ms to minimize.
[2024-05-28 14:24:58] [INFO ] Deduced a trap composed of 286 places in 239 ms of which 3 ms to minimize.
[2024-05-28 14:24:58] [INFO ] Deduced a trap composed of 297 places in 257 ms of which 4 ms to minimize.
[2024-05-28 14:24:59] [INFO ] Deduced a trap composed of 73 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:24:59] [INFO ] Deduced a trap composed of 346 places in 174 ms of which 2 ms to minimize.
[2024-05-28 14:24:59] [INFO ] Deduced a trap composed of 312 places in 235 ms of which 4 ms to minimize.
[2024-05-28 14:25:00] [INFO ] Deduced a trap composed of 293 places in 241 ms of which 4 ms to minimize.
[2024-05-28 14:25:00] [INFO ] Deduced a trap composed of 312 places in 236 ms of which 4 ms to minimize.
[2024-05-28 14:25:00] [INFO ] Deduced a trap composed of 349 places in 217 ms of which 3 ms to minimize.
[2024-05-28 14:25:00] [INFO ] Deduced a trap composed of 311 places in 195 ms of which 3 ms to minimize.
[2024-05-28 14:25:01] [INFO ] Deduced a trap composed of 296 places in 183 ms of which 4 ms to minimize.
[2024-05-28 14:25:01] [INFO ] Deduced a trap composed of 320 places in 225 ms of which 3 ms to minimize.
[2024-05-28 14:25:01] [INFO ] Deduced a trap composed of 282 places in 199 ms of which 3 ms to minimize.
[2024-05-28 14:25:01] [INFO ] Deduced a trap composed of 292 places in 209 ms of which 2 ms to minimize.
[2024-05-28 14:25:01] [INFO ] Deduced a trap composed of 308 places in 233 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 14:25:02] [INFO ] Deduced a trap composed of 300 places in 259 ms of which 4 ms to minimize.
[2024-05-28 14:25:02] [INFO ] Deduced a trap composed of 132 places in 182 ms of which 3 ms to minimize.
[2024-05-28 14:25:03] [INFO ] Deduced a trap composed of 141 places in 182 ms of which 2 ms to minimize.
[2024-05-28 14:25:03] [INFO ] Deduced a trap composed of 263 places in 261 ms of which 3 ms to minimize.
[2024-05-28 14:25:03] [INFO ] Deduced a trap composed of 302 places in 190 ms of which 3 ms to minimize.
[2024-05-28 14:25:04] [INFO ] Deduced a trap composed of 59 places in 154 ms of which 2 ms to minimize.
[2024-05-28 14:25:04] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 2 ms to minimize.
[2024-05-28 14:25:04] [INFO ] Deduced a trap composed of 343 places in 231 ms of which 3 ms to minimize.
[2024-05-28 14:25:10] [INFO ] Deduced a trap composed of 248 places in 166 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 9/69 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 6.0)
(s1 4.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.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 1.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 1.0)
(s87 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/1472 variables, and 69 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 29/69 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 14:25:22] [INFO ] Deduced a trap composed of 303 places in 168 ms of which 3 ms to minimize.
[2024-05-28 14:25:26] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-05-28 14:25:26] [INFO ] Deduced a trap composed of 356 places in 191 ms of which 3 ms to minimize.
[2024-05-28 14:25:27] [INFO ] Deduced a trap composed of 354 places in 186 ms of which 3 ms to minimize.
[2024-05-28 14:25:30] [INFO ] Deduced a trap composed of 252 places in 179 ms of which 3 ms to minimize.
[2024-05-28 14:25:30] [INFO ] Deduced a trap composed of 63 places in 206 ms of which 3 ms to minimize.
[2024-05-28 14:25:31] [INFO ] Deduced a trap composed of 345 places in 193 ms of which 3 ms to minimize.
[2024-05-28 14:25:31] [INFO ] Deduced a trap composed of 270 places in 180 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 960 unsolved
SMT process timed out in 61155ms, After SMT, problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 61173ms
Starting structural reductions in LTL mode, iteration 1 : 522/528 places, 962/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86363 ms. Remains : 522/528 places, 962/968 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S02J06T06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T06-LTLFireability-04 finished in 86514 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&(G(F(!p1))||(F(!p1)&&X(F(p2))))))))'
Support contains 58 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 522 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 516 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 516 transition count 956
Applied a total of 24 rules in 20 ms. Remains 516 /528 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-28 14:25:50] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 516 cols
[2024-05-28 14:25:50] [INFO ] Computed 42 invariants in 19 ms
[2024-05-28 14:25:50] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:25:58] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 2 ms to minimize.
[2024-05-28 14:25:58] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 2 ms to minimize.
[2024-05-28 14:25:58] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-05-28 14:25:58] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:25:58] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:25:58] [INFO ] Deduced a trap composed of 293 places in 242 ms of which 3 ms to minimize.
[2024-05-28 14:25:58] [INFO ] Deduced a trap composed of 281 places in 205 ms of which 3 ms to minimize.
[2024-05-28 14:25:59] [INFO ] Deduced a trap composed of 272 places in 206 ms of which 3 ms to minimize.
[2024-05-28 14:25:59] [INFO ] Deduced a trap composed of 124 places in 177 ms of which 3 ms to minimize.
[2024-05-28 14:25:59] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:26:00] [INFO ] Deduced a trap composed of 289 places in 254 ms of which 5 ms to minimize.
[2024-05-28 14:26:00] [INFO ] Deduced a trap composed of 284 places in 220 ms of which 3 ms to minimize.
[2024-05-28 14:26:00] [INFO ] Deduced a trap composed of 15 places in 227 ms of which 3 ms to minimize.
[2024-05-28 14:26:01] [INFO ] Deduced a trap composed of 349 places in 228 ms of which 4 ms to minimize.
[2024-05-28 14:26:01] [INFO ] Deduced a trap composed of 273 places in 212 ms of which 3 ms to minimize.
[2024-05-28 14:26:01] [INFO ] Deduced a trap composed of 269 places in 201 ms of which 3 ms to minimize.
[2024-05-28 14:26:07] [INFO ] Deduced a trap composed of 268 places in 209 ms of which 2 ms to minimize.
[2024-05-28 14:26:08] [INFO ] Deduced a trap composed of 275 places in 238 ms of which 4 ms to minimize.
[2024-05-28 14:26:08] [INFO ] Deduced a trap composed of 260 places in 222 ms of which 3 ms to minimize.
[2024-05-28 14:26:09] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:26:10] [INFO ] Deduced a trap composed of 249 places in 246 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 61 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 21/61 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:26:14] [INFO ] Deduced a trap composed of 292 places in 252 ms of which 3 ms to minimize.
[2024-05-28 14:26:21] [INFO ] Deduced a trap composed of 269 places in 247 ms of which 3 ms to minimize.
[2024-05-28 14:26:23] [INFO ] Deduced a trap composed of 95 places in 241 ms of which 4 ms to minimize.
[2024-05-28 14:26:24] [INFO ] Deduced a trap composed of 288 places in 201 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:26:30] [INFO ] Deduced a trap composed of 278 places in 187 ms of which 3 ms to minimize.
[2024-05-28 14:26:30] [INFO ] Deduced a trap composed of 348 places in 201 ms of which 4 ms to minimize.
[2024-05-28 14:26:31] [INFO ] Deduced a trap composed of 280 places in 243 ms of which 4 ms to minimize.
[2024-05-28 14:26:31] [INFO ] Deduced a trap composed of 275 places in 253 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 69 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 29/29 constraints]
After SMT, in 41199ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 41210ms
[2024-05-28 14:26:32] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:26:32] [INFO ] Invariant cache hit.
[2024-05-28 14:26:32] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-05-28 14:26:32] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:26:32] [INFO ] Invariant cache hit.
[2024-05-28 14:26:32] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:26:35] [INFO ] Implicit Places using invariants and state equation in 3226 ms returned []
Implicit Place search using SMT with State Equation took 3573 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2024-05-28 14:26:35] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:26:35] [INFO ] Invariant cache hit.
[2024-05-28 14:26:35] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:26:43] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 2 ms to minimize.
[2024-05-28 14:26:43] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 0 ms to minimize.
[2024-05-28 14:26:43] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:26:44] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:26:44] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:26:44] [INFO ] Deduced a trap composed of 288 places in 292 ms of which 4 ms to minimize.
[2024-05-28 14:26:44] [INFO ] Deduced a trap composed of 276 places in 250 ms of which 4 ms to minimize.
[2024-05-28 14:26:45] [INFO ] Deduced a trap composed of 274 places in 242 ms of which 3 ms to minimize.
[2024-05-28 14:26:45] [INFO ] Deduced a trap composed of 294 places in 221 ms of which 3 ms to minimize.
[2024-05-28 14:26:45] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:26:45] [INFO ] Deduced a trap composed of 290 places in 225 ms of which 3 ms to minimize.
[2024-05-28 14:26:46] [INFO ] Deduced a trap composed of 289 places in 249 ms of which 4 ms to minimize.
[2024-05-28 14:26:46] [INFO ] Deduced a trap composed of 314 places in 311 ms of which 3 ms to minimize.
[2024-05-28 14:26:47] [INFO ] Deduced a trap composed of 294 places in 258 ms of which 4 ms to minimize.
[2024-05-28 14:26:47] [INFO ] Deduced a trap composed of 280 places in 240 ms of which 4 ms to minimize.
[2024-05-28 14:26:47] [INFO ] Deduced a trap composed of 42 places in 265 ms of which 3 ms to minimize.
[2024-05-28 14:26:47] [INFO ] Deduced a trap composed of 261 places in 255 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:26:56] [INFO ] Deduced a trap composed of 117 places in 227 ms of which 3 ms to minimize.
[2024-05-28 14:26:56] [INFO ] Deduced a trap composed of 149 places in 172 ms of which 3 ms to minimize.
[2024-05-28 14:26:56] [INFO ] Deduced a trap composed of 283 places in 235 ms of which 3 ms to minimize.
[2024-05-28 14:27:03] [INFO ] Deduced a trap composed of 247 places in 223 ms of which 3 ms to minimize.
[2024-05-28 14:27:03] [INFO ] Deduced a trap composed of 258 places in 224 ms of which 3 ms to minimize.
[2024-05-28 14:27:03] [INFO ] Deduced a trap composed of 266 places in 203 ms of which 6 ms to minimize.
[2024-05-28 14:27:04] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 64 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:27:12] [INFO ] Deduced a trap composed of 343 places in 246 ms of which 4 ms to minimize.
[2024-05-28 14:27:15] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 66 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 26/26 constraints]
After SMT, in 60996ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 61012ms
Starting structural reductions in LTL mode, iteration 1 : 516/528 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105822 ms. Remains : 516/528 places, 956/968 transitions.
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND (NOT p2) p1), p1, (AND p1 (NOT p2))]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLFireability-05
Stuttering criterion allowed to conclude after 8558 steps with 133 reset in 44 ms.
FORMULA PolyORBLF-COL-S02J06T06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T06-LTLFireability-05 finished in 106196 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 12 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 522 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 516 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 516 transition count 956
Applied a total of 24 rules in 13 ms. Remains 516 /528 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-28 14:27:37] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:27:37] [INFO ] Invariant cache hit.
[2024-05-28 14:27:37] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:27:43] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 1 ms to minimize.
[2024-05-28 14:27:43] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:27:44] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:27:44] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:27:44] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:27:44] [INFO ] Deduced a trap composed of 288 places in 196 ms of which 4 ms to minimize.
[2024-05-28 14:27:44] [INFO ] Deduced a trap composed of 276 places in 196 ms of which 2 ms to minimize.
[2024-05-28 14:27:45] [INFO ] Deduced a trap composed of 274 places in 243 ms of which 4 ms to minimize.
[2024-05-28 14:27:45] [INFO ] Deduced a trap composed of 294 places in 267 ms of which 4 ms to minimize.
[2024-05-28 14:27:45] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 0 ms to minimize.
[2024-05-28 14:27:45] [INFO ] Deduced a trap composed of 290 places in 313 ms of which 3 ms to minimize.
[2024-05-28 14:27:46] [INFO ] Deduced a trap composed of 289 places in 275 ms of which 4 ms to minimize.
[2024-05-28 14:27:46] [INFO ] Deduced a trap composed of 314 places in 232 ms of which 3 ms to minimize.
[2024-05-28 14:27:47] [INFO ] Deduced a trap composed of 294 places in 232 ms of which 3 ms to minimize.
[2024-05-28 14:27:47] [INFO ] Deduced a trap composed of 280 places in 235 ms of which 3 ms to minimize.
[2024-05-28 14:27:47] [INFO ] Deduced a trap composed of 42 places in 200 ms of which 3 ms to minimize.
[2024-05-28 14:27:47] [INFO ] Deduced a trap composed of 261 places in 215 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:27:55] [INFO ] Deduced a trap composed of 117 places in 217 ms of which 3 ms to minimize.
[2024-05-28 14:27:55] [INFO ] Deduced a trap composed of 149 places in 146 ms of which 2 ms to minimize.
[2024-05-28 14:27:55] [INFO ] Deduced a trap composed of 283 places in 241 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 60 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:28:08] [INFO ] Deduced a trap composed of 26 places in 192 ms of which 3 ms to minimize.
[2024-05-28 14:28:08] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 1 ms to minimize.
[2024-05-28 14:28:08] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-05-28 14:28:09] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
[2024-05-28 14:28:10] [INFO ] Deduced a trap composed of 349 places in 192 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 Int declared 514/1460 variables, and 65 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 25/25 constraints]
After SMT, in 40851ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40860ms
[2024-05-28 14:28:17] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:28:17] [INFO ] Invariant cache hit.
[2024-05-28 14:28:18] [INFO ] Implicit Places using invariants in 399 ms returned []
[2024-05-28 14:28:18] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:28:18] [INFO ] Invariant cache hit.
[2024-05-28 14:28:18] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:28:23] [INFO ] Implicit Places using invariants and state equation in 4965 ms returned []
Implicit Place search using SMT with State Equation took 5378 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2024-05-28 14:28:23] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:28:23] [INFO ] Invariant cache hit.
[2024-05-28 14:28:23] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:28:30] [INFO ] Deduced a trap composed of 72 places in 33 ms of which 1 ms to minimize.
[2024-05-28 14:28:30] [INFO ] Deduced a trap composed of 72 places in 31 ms of which 1 ms to minimize.
[2024-05-28 14:28:30] [INFO ] Deduced a trap composed of 72 places in 31 ms of which 1 ms to minimize.
[2024-05-28 14:28:30] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 0 ms to minimize.
[2024-05-28 14:28:30] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:28:31] [INFO ] Deduced a trap composed of 288 places in 170 ms of which 3 ms to minimize.
[2024-05-28 14:28:31] [INFO ] Deduced a trap composed of 276 places in 172 ms of which 2 ms to minimize.
[2024-05-28 14:28:31] [INFO ] Deduced a trap composed of 274 places in 175 ms of which 2 ms to minimize.
[2024-05-28 14:28:31] [INFO ] Deduced a trap composed of 294 places in 170 ms of which 3 ms to minimize.
[2024-05-28 14:28:31] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:28:32] [INFO ] Deduced a trap composed of 290 places in 159 ms of which 2 ms to minimize.
[2024-05-28 14:28:32] [INFO ] Deduced a trap composed of 289 places in 180 ms of which 2 ms to minimize.
[2024-05-28 14:28:32] [INFO ] Deduced a trap composed of 314 places in 246 ms of which 4 ms to minimize.
[2024-05-28 14:28:32] [INFO ] Deduced a trap composed of 294 places in 166 ms of which 3 ms to minimize.
[2024-05-28 14:28:33] [INFO ] Deduced a trap composed of 280 places in 165 ms of which 2 ms to minimize.
[2024-05-28 14:28:33] [INFO ] Deduced a trap composed of 42 places in 180 ms of which 3 ms to minimize.
[2024-05-28 14:28:33] [INFO ] Deduced a trap composed of 261 places in 237 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:28:41] [INFO ] Deduced a trap composed of 117 places in 177 ms of which 3 ms to minimize.
[2024-05-28 14:28:41] [INFO ] Deduced a trap composed of 149 places in 160 ms of which 2 ms to minimize.
[2024-05-28 14:28:42] [INFO ] Deduced a trap composed of 283 places in 189 ms of which 3 ms to minimize.
[2024-05-28 14:28:48] [INFO ] Deduced a trap composed of 247 places in 202 ms of which 3 ms to minimize.
[2024-05-28 14:28:48] [INFO ] Deduced a trap composed of 258 places in 230 ms of which 3 ms to minimize.
[2024-05-28 14:28:48] [INFO ] Deduced a trap composed of 266 places in 196 ms of which 3 ms to minimize.
[2024-05-28 14:28:48] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 64 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:28:59] [INFO ] Deduced a trap composed of 343 places in 207 ms of which 4 ms to minimize.
[2024-05-28 14:29:02] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 66 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 26/26 constraints]
After SMT, in 60932ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 60947ms
Starting structural reductions in LTL mode, iteration 1 : 516/528 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107203 ms. Remains : 516/528 places, 956/968 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLFireability-06
Product exploration explored 100000 steps with 1844 reset in 380 ms.
Product exploration explored 100000 steps with 1855 reset in 371 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 170 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 224 steps (0 resets) in 9 ms. (22 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 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
[2024-05-28 14:29:25] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:29:25] [INFO ] Invariant cache hit.
[2024-05-28 14:29:26] [INFO ] [Real]Absence check using 15 positive place invariants in 14 ms returned sat
[2024-05-28 14:29:26] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 78 ms returned sat
[2024-05-28 14:29:27] [INFO ] [Real]Absence check using state equation in 991 ms returned sat
[2024-05-28 14:29:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:29:27] [INFO ] [Nat]Absence check using 15 positive place invariants in 20 ms returned sat
[2024-05-28 14:29:27] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 102 ms returned sat
[2024-05-28 14:29:28] [INFO ] [Nat]Absence check using state equation in 1221 ms returned sat
[2024-05-28 14:29:28] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:29:29] [INFO ] [Nat]Added 72 Read/Feed constraints in 216 ms returned sat
[2024-05-28 14:29:29] [INFO ] Deduced a trap composed of 95 places in 208 ms of which 4 ms to minimize.
[2024-05-28 14:29:29] [INFO ] Deduced a trap composed of 124 places in 215 ms of which 26 ms to minimize.
[2024-05-28 14:29:30] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 1 ms to minimize.
[2024-05-28 14:29:30] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 0 ms to minimize.
[2024-05-28 14:29:30] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
[2024-05-28 14:29:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1624 ms
[2024-05-28 14:29:30] [INFO ] Computed and/alt/rep : 618/2193/612 causal constraints (skipped 330 transitions) in 80 ms.
[2024-05-28 14:29:36] [INFO ] Added : 287 causal constraints over 58 iterations in 5894 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 12 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 956/956 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 516 transition count 914
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 474 transition count 914
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 84 place count 474 transition count 854
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 204 place count 414 transition count 854
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
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 276 place count 378 transition count 818
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 282 place count 372 transition count 812
Iterating global reduction 2 with 6 rules applied. Total rules applied 288 place count 372 transition count 812
Applied a total of 288 rules in 86 ms. Remains 372 /516 variables (removed 144) and now considering 812/956 (removed 144) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 14:29:36] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 372 cols
[2024-05-28 14:29:36] [INFO ] Computed 42 invariants in 10 ms
[2024-05-28 14:29:36] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 14:29:41] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 1 ms to minimize.
[2024-05-28 14:29:41] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 0 ms to minimize.
[2024-05-28 14:29:41] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:29:41] [INFO ] Deduced a trap composed of 48 places in 32 ms of which 1 ms to minimize.
[2024-05-28 14:29:42] [INFO ] Deduced a trap composed of 48 places in 30 ms of which 1 ms to minimize.
[2024-05-28 14:29:42] [INFO ] Deduced a trap composed of 130 places in 134 ms of which 2 ms to minimize.
[2024-05-28 14:29:42] [INFO ] Deduced a trap composed of 145 places in 199 ms of which 4 ms to minimize.
[2024-05-28 14:29:42] [INFO ] Deduced a trap composed of 147 places in 151 ms of which 1 ms to minimize.
[2024-05-28 14:29:43] [INFO ] Deduced a trap composed of 48 places in 26 ms of which 0 ms to minimize.
[2024-05-28 14:29:44] [INFO ] Deduced a trap composed of 228 places in 122 ms of which 2 ms to minimize.
[2024-05-28 14:29:45] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 2 ms to minimize.
[2024-05-28 14:29:45] [INFO ] Deduced a trap composed of 71 places in 152 ms of which 2 ms to minimize.
[2024-05-28 14:29:46] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-05-28 14:29:48] [INFO ] Deduced a trap composed of 142 places in 125 ms of which 2 ms to minimize.
[2024-05-28 14:29:48] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 14:29:48] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 1/56 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 370/1172 variables, and 56 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/372 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 14:30:00] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-05-28 14:30:00] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-28 14:30:04] [INFO ] Deduced a trap composed of 132 places in 153 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 810 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 5 (OVERLAPS) 1/371 variables, 1/60 constraints. Problems are: Problem set: 36 solved, 774 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 8)
(s1 2)
(s2 0)
(s3 1)
(s4 1)
(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)
(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 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 10)
(s129 0)
(s130 1)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 371/1172 variables, and 60 constraints, problems are : Problem set: 36 solved, 774 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/372 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 19/19 constraints]
After SMT, in 41030ms problems are : Problem set: 36 solved, 774 unsolved
Search for dead transitions found 36 dead transitions in 41040ms
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:30:17] [INFO ] Flow matrix only has 764 transitions (discarded 12 similar events)
// Phase 1: matrix 764 rows 372 cols
[2024-05-28 14:30:17] [INFO ] Computed 42 invariants in 8 ms
[2024-05-28 14:30:18] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-28 14:30:18] [INFO ] Flow matrix only has 764 transitions (discarded 12 similar events)
[2024-05-28 14:30:18] [INFO ] Invariant cache hit.
[2024-05-28 14:30:18] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:30:20] [INFO ] Implicit Places using invariants and state equation in 2544 ms returned []
Implicit Place search using SMT with State Equation took 2843 ms to find 0 implicit places.
[2024-05-28 14:30:20] [INFO ] Redundant transitions in 9 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 372/516 places, 776/956 transitions.
Applied a total of 0 rules in 12 ms. Remains 372 /372 variables (removed 0) and now considering 776/776 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44010 ms. Remains : 372/516 places, 776/956 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 117 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 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 148 steps (0 resets) in 4 ms. (29 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 135 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)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
[2024-05-28 14:30:21] [INFO ] Flow matrix only has 764 transitions (discarded 12 similar events)
[2024-05-28 14:30:21] [INFO ] Invariant cache hit.
[2024-05-28 14:30:21] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-05-28 14:30:21] [INFO ] [Real]Absence check using 16 positive and 26 generalized place invariants in 29 ms returned sat
[2024-05-28 14:30:21] [INFO ] [Real]Absence check using state equation in 584 ms returned sat
[2024-05-28 14:30:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:30:22] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-28 14:30:22] [INFO ] [Nat]Absence check using 16 positive and 26 generalized place invariants in 29 ms returned sat
[2024-05-28 14:30:23] [INFO ] [Nat]Absence check using state equation in 1493 ms returned sat
[2024-05-28 14:30:23] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:30:24] [INFO ] [Nat]Added 72 Read/Feed constraints in 371 ms returned sat
[2024-05-28 14:30:24] [INFO ] Deduced a trap composed of 71 places in 186 ms of which 2 ms to minimize.
[2024-05-28 14:30:24] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 2 ms to minimize.
[2024-05-28 14:30:24] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 2 ms to minimize.
[2024-05-28 14:30:24] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2024-05-28 14:30:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 751 ms
[2024-05-28 14:30:25] [INFO ] Computed and/alt/rep : 474/2301/468 causal constraints (skipped 294 transitions) in 69 ms.
[2024-05-28 14:30:30] [INFO ] Added : 436 causal constraints over 88 iterations in 5910 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2634 reset in 342 ms.
Product exploration explored 100000 steps with 2637 reset in 311 ms.
Built C files in :
/tmp/ltsmin5020327529188549942
[2024-05-28 14:30:31] [INFO ] Computing symmetric may disable matrix : 776 transitions.
[2024-05-28 14:30:31] [INFO ] Computation of Complete disable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:30:31] [INFO ] Computing symmetric may enable matrix : 776 transitions.
[2024-05-28 14:30:31] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:30:31] [INFO ] Computing Do-Not-Accords matrix : 776 transitions.
[2024-05-28 14:30:31] [INFO ] Computation of Completed DNA matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:30:31] [INFO ] Built C files in 233ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5020327529188549942
Running compilation step : cd /tmp/ltsmin5020327529188549942;'/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 2220 ms.
Running link step : cd /tmp/ltsmin5020327529188549942;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin5020327529188549942;'/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/stateBased289018250360036708.hoa' '--buchi-type=spotba'
LTSmin run took 12100 ms.
FORMULA PolyORBLF-COL-S02J06T06-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-COL-S02J06T06-LTLFireability-06 finished in 189226 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&&F(p1)&&(G(p1)||p2))))'
Support contains 63 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 522 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 516 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 516 transition count 956
Applied a total of 24 rules in 33 ms. Remains 516 /528 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-28 14:30:46] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 516 cols
[2024-05-28 14:30:46] [INFO ] Computed 42 invariants in 12 ms
[2024-05-28 14:30:46] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:30:53] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:30:53] [INFO ] Deduced a trap composed of 72 places in 31 ms of which 1 ms to minimize.
[2024-05-28 14:30:53] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 0 ms to minimize.
[2024-05-28 14:30:53] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:30:53] [INFO ] Deduced a trap composed of 72 places in 36 ms of which 1 ms to minimize.
[2024-05-28 14:30:53] [INFO ] Deduced a trap composed of 293 places in 154 ms of which 2 ms to minimize.
[2024-05-28 14:30:53] [INFO ] Deduced a trap composed of 281 places in 170 ms of which 2 ms to minimize.
[2024-05-28 14:30:54] [INFO ] Deduced a trap composed of 272 places in 239 ms of which 4 ms to minimize.
[2024-05-28 14:30:54] [INFO ] Deduced a trap composed of 124 places in 138 ms of which 3 ms to minimize.
[2024-05-28 14:30:54] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 0 ms to minimize.
[2024-05-28 14:30:54] [INFO ] Deduced a trap composed of 289 places in 170 ms of which 3 ms to minimize.
[2024-05-28 14:30:55] [INFO ] Deduced a trap composed of 284 places in 232 ms of which 5 ms to minimize.
[2024-05-28 14:30:55] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 3 ms to minimize.
[2024-05-28 14:30:55] [INFO ] Deduced a trap composed of 349 places in 166 ms of which 3 ms to minimize.
[2024-05-28 14:30:55] [INFO ] Deduced a trap composed of 273 places in 259 ms of which 4 ms to minimize.
[2024-05-28 14:30:56] [INFO ] Deduced a trap composed of 269 places in 245 ms of which 4 ms to minimize.
[2024-05-28 14:31:01] [INFO ] Deduced a trap composed of 268 places in 163 ms of which 3 ms to minimize.
[2024-05-28 14:31:01] [INFO ] Deduced a trap composed of 275 places in 184 ms of which 3 ms to minimize.
[2024-05-28 14:31:01] [INFO ] Deduced a trap composed of 260 places in 161 ms of which 2 ms to minimize.
[2024-05-28 14:31:02] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:31:03] [INFO ] Deduced a trap composed of 249 places in 245 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 61 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 21/61 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:31:09] [INFO ] Deduced a trap composed of 292 places in 259 ms of which 3 ms to minimize.
[2024-05-28 14:31:15] [INFO ] Deduced a trap composed of 269 places in 163 ms of which 2 ms to minimize.
[2024-05-28 14:31:17] [INFO ] Deduced a trap composed of 95 places in 172 ms of which 2 ms to minimize.
[2024-05-28 14:31:17] [INFO ] Deduced a trap composed of 288 places in 164 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:31:23] [INFO ] Deduced a trap composed of 278 places in 180 ms of which 3 ms to minimize.
[2024-05-28 14:31:23] [INFO ] Deduced a trap composed of 348 places in 190 ms of which 3 ms to minimize.
[2024-05-28 14:31:23] [INFO ] Deduced a trap composed of 280 places in 192 ms of which 3 ms to minimize.
[2024-05-28 14:31:24] [INFO ] Deduced a trap composed of 275 places in 175 ms of which 3 ms to minimize.
[2024-05-28 14:31:27] [INFO ] Deduced a trap composed of 267 places in 194 ms of which 3 ms to minimize.
(s68 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 9)
(s1 1)
(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)
(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 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 70 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 30/30 constraints]
After SMT, in 41002ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 41010ms
[2024-05-28 14:31:27] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:31:27] [INFO ] Invariant cache hit.
[2024-05-28 14:31:27] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-28 14:31:27] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:31:27] [INFO ] Invariant cache hit.
[2024-05-28 14:31:27] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:31:31] [INFO ] Implicit Places using invariants and state equation in 3742 ms returned []
Implicit Place search using SMT with State Equation took 3972 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2024-05-28 14:31:31] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:31:31] [INFO ] Invariant cache hit.
[2024-05-28 14:31:31] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:31:38] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 0 ms to minimize.
[2024-05-28 14:31:38] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 0 ms to minimize.
[2024-05-28 14:31:39] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 0 ms to minimize.
[2024-05-28 14:31:39] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 0 ms to minimize.
[2024-05-28 14:31:39] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:31:39] [INFO ] Deduced a trap composed of 288 places in 175 ms of which 3 ms to minimize.
[2024-05-28 14:31:39] [INFO ] Deduced a trap composed of 276 places in 202 ms of which 2 ms to minimize.
[2024-05-28 14:31:39] [INFO ] Deduced a trap composed of 274 places in 170 ms of which 3 ms to minimize.
[2024-05-28 14:31:40] [INFO ] Deduced a trap composed of 294 places in 186 ms of which 3 ms to minimize.
[2024-05-28 14:31:40] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:31:40] [INFO ] Deduced a trap composed of 290 places in 191 ms of which 3 ms to minimize.
[2024-05-28 14:31:40] [INFO ] Deduced a trap composed of 289 places in 206 ms of which 2 ms to minimize.
[2024-05-28 14:31:41] [INFO ] Deduced a trap composed of 314 places in 178 ms of which 3 ms to minimize.
[2024-05-28 14:31:41] [INFO ] Deduced a trap composed of 294 places in 188 ms of which 3 ms to minimize.
[2024-05-28 14:31:41] [INFO ] Deduced a trap composed of 280 places in 187 ms of which 7 ms to minimize.
[2024-05-28 14:31:41] [INFO ] Deduced a trap composed of 42 places in 183 ms of which 3 ms to minimize.
[2024-05-28 14:31:42] [INFO ] Deduced a trap composed of 261 places in 222 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:31:49] [INFO ] Deduced a trap composed of 117 places in 142 ms of which 2 ms to minimize.
[2024-05-28 14:31:49] [INFO ] Deduced a trap composed of 149 places in 159 ms of which 3 ms to minimize.
[2024-05-28 14:31:50] [INFO ] Deduced a trap composed of 283 places in 180 ms of which 2 ms to minimize.
[2024-05-28 14:31:56] [INFO ] Deduced a trap composed of 247 places in 188 ms of which 3 ms to minimize.
[2024-05-28 14:31:56] [INFO ] Deduced a trap composed of 258 places in 168 ms of which 3 ms to minimize.
[2024-05-28 14:31:56] [INFO ] Deduced a trap composed of 266 places in 214 ms of which 3 ms to minimize.
[2024-05-28 14:31:56] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 64 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:32:07] [INFO ] Deduced a trap composed of 343 places in 177 ms of which 3 ms to minimize.
[2024-05-28 14:32:10] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 66 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 26/26 constraints]
After SMT, in 61015ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 61031ms
Starting structural reductions in LTL mode, iteration 1 : 516/528 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106052 ms. Remains : 516/528 places, 956/968 transitions.
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J06T06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T06-LTLFireability-07 finished in 106281 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(G(p1)))))'
Support contains 19 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 522 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 516 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 516 transition count 956
Applied a total of 24 rules in 23 ms. Remains 516 /528 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-28 14:32:32] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:32:32] [INFO ] Invariant cache hit.
[2024-05-28 14:32:32] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:32:40] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 0 ms to minimize.
[2024-05-28 14:32:40] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:32:40] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 0 ms to minimize.
[2024-05-28 14:32:40] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:32:41] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 0 ms to minimize.
[2024-05-28 14:32:41] [INFO ] Deduced a trap composed of 288 places in 173 ms of which 3 ms to minimize.
[2024-05-28 14:32:41] [INFO ] Deduced a trap composed of 276 places in 204 ms of which 2 ms to minimize.
[2024-05-28 14:32:41] [INFO ] Deduced a trap composed of 274 places in 277 ms of which 3 ms to minimize.
[2024-05-28 14:32:42] [INFO ] Deduced a trap composed of 294 places in 175 ms of which 3 ms to minimize.
[2024-05-28 14:32:42] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:32:42] [INFO ] Deduced a trap composed of 290 places in 192 ms of which 2 ms to minimize.
[2024-05-28 14:32:42] [INFO ] Deduced a trap composed of 289 places in 165 ms of which 2 ms to minimize.
[2024-05-28 14:32:43] [INFO ] Deduced a trap composed of 314 places in 213 ms of which 3 ms to minimize.
[2024-05-28 14:32:43] [INFO ] Deduced a trap composed of 294 places in 215 ms of which 3 ms to minimize.
[2024-05-28 14:32:43] [INFO ] Deduced a trap composed of 280 places in 190 ms of which 2 ms to minimize.
[2024-05-28 14:32:43] [INFO ] Deduced a trap composed of 42 places in 192 ms of which 3 ms to minimize.
[2024-05-28 14:32:43] [INFO ] Deduced a trap composed of 261 places in 199 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:32:51] [INFO ] Deduced a trap composed of 117 places in 160 ms of which 2 ms to minimize.
[2024-05-28 14:32:51] [INFO ] Deduced a trap composed of 149 places in 155 ms of which 2 ms to minimize.
[2024-05-28 14:32:51] [INFO ] Deduced a trap composed of 283 places in 180 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 60 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:32:59] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-28 14:33:03] [INFO ] Deduced a trap composed of 92 places in 177 ms of which 3 ms to minimize.
[2024-05-28 14:33:04] [INFO ] Deduced a trap composed of 90 places in 182 ms of which 3 ms to minimize.
[2024-05-28 14:33:04] [INFO ] Deduced a trap composed of 364 places in 179 ms of which 2 ms to minimize.
[2024-05-28 14:33:04] [INFO ] Deduced a trap composed of 358 places in 178 ms of which 3 ms to minimize.
[2024-05-28 14:33:04] [INFO ] Deduced a trap composed of 363 places in 184 ms of which 3 ms to minimize.
[2024-05-28 14:33:05] [INFO ] Deduced a trap composed of 352 places in 185 ms of which 2 ms to minimize.
[2024-05-28 14:33:05] [INFO ] Deduced a trap composed of 353 places in 193 ms of which 2 ms to minimize.
[2024-05-28 14:33:05] [INFO ] Deduced a trap composed of 311 places in 151 ms of which 3 ms to minimize.
[2024-05-28 14:33:05] [INFO ] Deduced a trap composed of 271 places in 171 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 70 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 30/30 constraints]
After SMT, in 41007ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 41018ms
[2024-05-28 14:33:13] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:33:13] [INFO ] Invariant cache hit.
[2024-05-28 14:33:13] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-28 14:33:13] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:33:13] [INFO ] Invariant cache hit.
[2024-05-28 14:33:14] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:33:17] [INFO ] Implicit Places using invariants and state equation in 4001 ms returned []
Implicit Place search using SMT with State Equation took 4336 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2024-05-28 14:33:17] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:33:17] [INFO ] Invariant cache hit.
[2024-05-28 14:33:17] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:33:25] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 0 ms to minimize.
[2024-05-28 14:33:25] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 0 ms to minimize.
[2024-05-28 14:33:25] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:33:25] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:33:25] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:33:25] [INFO ] Deduced a trap composed of 288 places in 206 ms of which 2 ms to minimize.
[2024-05-28 14:33:26] [INFO ] Deduced a trap composed of 276 places in 202 ms of which 4 ms to minimize.
[2024-05-28 14:33:26] [INFO ] Deduced a trap composed of 274 places in 204 ms of which 3 ms to minimize.
[2024-05-28 14:33:26] [INFO ] Deduced a trap composed of 294 places in 187 ms of which 4 ms to minimize.
[2024-05-28 14:33:26] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 0 ms to minimize.
[2024-05-28 14:33:26] [INFO ] Deduced a trap composed of 290 places in 239 ms of which 3 ms to minimize.
[2024-05-28 14:33:27] [INFO ] Deduced a trap composed of 289 places in 378 ms of which 3 ms to minimize.
[2024-05-28 14:33:27] [INFO ] Deduced a trap composed of 314 places in 192 ms of which 3 ms to minimize.
[2024-05-28 14:33:28] [INFO ] Deduced a trap composed of 294 places in 201 ms of which 3 ms to minimize.
[2024-05-28 14:33:28] [INFO ] Deduced a trap composed of 280 places in 212 ms of which 3 ms to minimize.
[2024-05-28 14:33:28] [INFO ] Deduced a trap composed of 42 places in 219 ms of which 2 ms to minimize.
[2024-05-28 14:33:28] [INFO ] Deduced a trap composed of 261 places in 220 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:33:37] [INFO ] Deduced a trap composed of 117 places in 190 ms of which 2 ms to minimize.
[2024-05-28 14:33:37] [INFO ] Deduced a trap composed of 149 places in 186 ms of which 2 ms to minimize.
[2024-05-28 14:33:38] [INFO ] Deduced a trap composed of 283 places in 190 ms of which 3 ms to minimize.
[2024-05-28 14:33:44] [INFO ] Deduced a trap composed of 247 places in 191 ms of which 2 ms to minimize.
[2024-05-28 14:33:44] [INFO ] Deduced a trap composed of 258 places in 181 ms of which 2 ms to minimize.
[2024-05-28 14:33:44] [INFO ] Deduced a trap composed of 266 places in 184 ms of which 3 ms to minimize.
[2024-05-28 14:33:45] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 64 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:33:54] [INFO ] Deduced a trap composed of 343 places in 216 ms of which 3 ms to minimize.
[2024-05-28 14:33:57] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 66 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 26/26 constraints]
After SMT, in 60965ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 60975ms
Starting structural reductions in LTL mode, iteration 1 : 516/528 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106358 ms. Remains : 516/528 places, 956/968 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLFireability-08
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J06T06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T06-LTLFireability-08 finished in 106551 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)))))'
Support contains 13 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 522 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 516 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 516 transition count 956
Applied a total of 24 rules in 16 ms. Remains 516 /528 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-28 14:34:19] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:34:19] [INFO ] Invariant cache hit.
[2024-05-28 14:34:19] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:34:27] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:34:27] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:34:27] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:34:27] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 0 ms to minimize.
[2024-05-28 14:34:27] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 0 ms to minimize.
[2024-05-28 14:34:27] [INFO ] Deduced a trap composed of 288 places in 214 ms of which 3 ms to minimize.
[2024-05-28 14:34:27] [INFO ] Deduced a trap composed of 276 places in 209 ms of which 4 ms to minimize.
[2024-05-28 14:34:28] [INFO ] Deduced a trap composed of 274 places in 204 ms of which 3 ms to minimize.
[2024-05-28 14:34:28] [INFO ] Deduced a trap composed of 294 places in 187 ms of which 2 ms to minimize.
[2024-05-28 14:34:28] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 0 ms to minimize.
[2024-05-28 14:34:28] [INFO ] Deduced a trap composed of 290 places in 201 ms of which 3 ms to minimize.
[2024-05-28 14:34:29] [INFO ] Deduced a trap composed of 289 places in 259 ms of which 4 ms to minimize.
[2024-05-28 14:34:29] [INFO ] Deduced a trap composed of 314 places in 234 ms of which 3 ms to minimize.
[2024-05-28 14:34:30] [INFO ] Deduced a trap composed of 294 places in 244 ms of which 3 ms to minimize.
[2024-05-28 14:34:30] [INFO ] Deduced a trap composed of 280 places in 212 ms of which 3 ms to minimize.
[2024-05-28 14:34:30] [INFO ] Deduced a trap composed of 42 places in 219 ms of which 4 ms to minimize.
[2024-05-28 14:34:30] [INFO ] Deduced a trap composed of 261 places in 195 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:34:39] [INFO ] Deduced a trap composed of 117 places in 174 ms of which 3 ms to minimize.
[2024-05-28 14:34:39] [INFO ] Deduced a trap composed of 149 places in 163 ms of which 3 ms to minimize.
[2024-05-28 14:34:40] [INFO ] Deduced a trap composed of 283 places in 202 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 60 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:34:51] [INFO ] Deduced a trap composed of 247 places in 240 ms of which 2 ms to minimize.
[2024-05-28 14:34:52] [INFO ] Deduced a trap composed of 211 places in 214 ms of which 3 ms to minimize.
[2024-05-28 14:34:52] [INFO ] Deduced a trap composed of 350 places in 183 ms of which 3 ms to minimize.
[2024-05-28 14:34:52] [INFO ] Deduced a trap composed of 361 places in 172 ms of which 3 ms to minimize.
[2024-05-28 14:34:52] [INFO ] Deduced a trap composed of 349 places in 171 ms of which 3 ms to minimize.
[2024-05-28 14:34:53] [INFO ] Deduced a trap composed of 266 places in 241 ms of which 3 ms to minimize.
[2024-05-28 14:34:54] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 2 ms to minimize.
[2024-05-28 14:34:54] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-05-28 14:34:54] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-05-28 14:34:58] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 70 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 30/30 constraints]
After SMT, in 41132ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 41142ms
[2024-05-28 14:35:00] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:35:00] [INFO ] Invariant cache hit.
[2024-05-28 14:35:00] [INFO ] Implicit Places using invariants in 354 ms returned []
[2024-05-28 14:35:00] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:35:00] [INFO ] Invariant cache hit.
[2024-05-28 14:35:01] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:35:05] [INFO ] Implicit Places using invariants and state equation in 5177 ms returned []
Implicit Place search using SMT with State Equation took 5545 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2024-05-28 14:35:05] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:35:05] [INFO ] Invariant cache hit.
[2024-05-28 14:35:05] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:35:13] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 0 ms to minimize.
[2024-05-28 14:35:13] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 0 ms to minimize.
[2024-05-28 14:35:13] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:35:13] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:35:13] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 0 ms to minimize.
[2024-05-28 14:35:14] [INFO ] Deduced a trap composed of 288 places in 189 ms of which 3 ms to minimize.
[2024-05-28 14:35:14] [INFO ] Deduced a trap composed of 276 places in 194 ms of which 3 ms to minimize.
[2024-05-28 14:35:14] [INFO ] Deduced a trap composed of 274 places in 205 ms of which 3 ms to minimize.
[2024-05-28 14:35:14] [INFO ] Deduced a trap composed of 294 places in 180 ms of which 3 ms to minimize.
[2024-05-28 14:35:14] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:35:15] [INFO ] Deduced a trap composed of 290 places in 202 ms of which 3 ms to minimize.
[2024-05-28 14:35:15] [INFO ] Deduced a trap composed of 289 places in 281 ms of which 4 ms to minimize.
[2024-05-28 14:35:16] [INFO ] Deduced a trap composed of 314 places in 283 ms of which 5 ms to minimize.
[2024-05-28 14:35:16] [INFO ] Deduced a trap composed of 294 places in 197 ms of which 3 ms to minimize.
[2024-05-28 14:35:16] [INFO ] Deduced a trap composed of 280 places in 262 ms of which 4 ms to minimize.
[2024-05-28 14:35:16] [INFO ] Deduced a trap composed of 42 places in 240 ms of which 4 ms to minimize.
[2024-05-28 14:35:17] [INFO ] Deduced a trap composed of 261 places in 212 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:35:25] [INFO ] Deduced a trap composed of 117 places in 144 ms of which 2 ms to minimize.
[2024-05-28 14:35:25] [INFO ] Deduced a trap composed of 149 places in 179 ms of which 2 ms to minimize.
[2024-05-28 14:35:25] [INFO ] Deduced a trap composed of 283 places in 238 ms of which 3 ms to minimize.
[2024-05-28 14:35:32] [INFO ] Deduced a trap composed of 247 places in 268 ms of which 4 ms to minimize.
[2024-05-28 14:35:32] [INFO ] Deduced a trap composed of 258 places in 263 ms of which 4 ms to minimize.
[2024-05-28 14:35:33] [INFO ] Deduced a trap composed of 266 places in 244 ms of which 4 ms to minimize.
[2024-05-28 14:35:33] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 64 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:35:41] [INFO ] Deduced a trap composed of 343 places in 207 ms of which 3 ms to minimize.
[2024-05-28 14:35:44] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 66 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 26/26 constraints]
After SMT, in 60934ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 60944ms
Starting structural reductions in LTL mode, iteration 1 : 516/528 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107652 ms. Remains : 516/528 places, 956/968 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J06T06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T06-LTLFireability-10 finished in 107770 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 7 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 968/968 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 528 transition count 926
Reduce places removed 42 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 48 rules applied. Total rules applied 90 place count 486 transition count 920
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 96 place count 480 transition count 920
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 96 place count 480 transition count 860
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 216 place count 420 transition count 860
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 222 place count 414 transition count 854
Iterating global reduction 3 with 6 rules applied. Total rules applied 228 place count 414 transition count 854
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 3 with 96 rules applied. Total rules applied 324 place count 366 transition count 806
Applied a total of 324 rules in 46 ms. Remains 366 /528 variables (removed 162) and now considering 806/968 (removed 162) transitions.
Running 804 sub problems to find dead transitions.
[2024-05-28 14:36:06] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
// Phase 1: matrix 794 rows 366 cols
[2024-05-28 14:36:06] [INFO ] Computed 42 invariants in 10 ms
[2024-05-28 14:36:06] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 804 unsolved
[2024-05-28 14:36:11] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 2 ms to minimize.
[2024-05-28 14:36:12] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:36:12] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2024-05-28 14:36:12] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 0 ms to minimize.
[2024-05-28 14:36:12] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:36:12] [INFO ] Deduced a trap composed of 148 places in 209 ms of which 3 ms to minimize.
[2024-05-28 14:36:12] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:36:14] [INFO ] Deduced a trap composed of 222 places in 124 ms of which 2 ms to minimize.
[2024-05-28 14:36:16] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 1 ms to minimize.
[2024-05-28 14:36:18] [INFO ] Deduced a trap composed of 73 places in 193 ms of which 2 ms to minimize.
[2024-05-28 14:36:19] [INFO ] Deduced a trap composed of 55 places in 171 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 804 unsolved
[2024-05-28 14:36:24] [INFO ] Deduced a trap composed of 120 places in 140 ms of which 2 ms to minimize.
[2024-05-28 14:36:24] [INFO ] Deduced a trap composed of 119 places in 138 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 364/1160 variables, and 53 constraints, problems are : Problem set: 0 solved, 804 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 804/804 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 804 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 804 unsolved
[2024-05-28 14:36:31] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 2 ms to minimize.
[2024-05-28 14:36:32] [INFO ] Deduced a trap composed of 151 places in 204 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 804 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 364/1160 variables, and 55 constraints, problems are : Problem set: 0 solved, 804 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/804 constraints, Known Traps: 15/15 constraints]
After SMT, in 40920ms problems are : Problem set: 0 solved, 804 unsolved
Search for dead transitions found 0 dead transitions in 40928ms
[2024-05-28 14:36:47] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2024-05-28 14:36:47] [INFO ] Invariant cache hit.
[2024-05-28 14:36:48] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-28 14:36:48] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2024-05-28 14:36:48] [INFO ] Invariant cache hit.
[2024-05-28 14:36:48] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:36:50] [INFO ] Implicit Places using invariants and state equation in 2532 ms returned []
Implicit Place search using SMT with State Equation took 2852 ms to find 0 implicit places.
[2024-05-28 14:36:50] [INFO ] Redundant transitions in 11 ms returned []
Running 804 sub problems to find dead transitions.
[2024-05-28 14:36:50] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2024-05-28 14:36:50] [INFO ] Invariant cache hit.
[2024-05-28 14:36:50] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 804 unsolved
[2024-05-28 14:36:56] [INFO ] Deduced a trap composed of 47 places in 110 ms of which 1 ms to minimize.
[2024-05-28 14:36:56] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 1 ms to minimize.
[2024-05-28 14:36:56] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 0 ms to minimize.
[2024-05-28 14:36:56] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 0 ms to minimize.
[2024-05-28 14:36:56] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 0 ms to minimize.
[2024-05-28 14:36:56] [INFO ] Deduced a trap composed of 154 places in 219 ms of which 3 ms to minimize.
[2024-05-28 14:36:57] [INFO ] Deduced a trap composed of 130 places in 213 ms of which 3 ms to minimize.
[2024-05-28 14:36:58] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:36:58] [INFO ] Deduced a trap composed of 46 places in 138 ms of which 2 ms to minimize.
[2024-05-28 14:36:59] [INFO ] Deduced a trap composed of 230 places in 157 ms of which 1 ms to minimize.
[2024-05-28 14:37:02] [INFO ] Deduced a trap composed of 120 places in 123 ms of which 2 ms to minimize.
[2024-05-28 14:37:03] [INFO ] Deduced a trap composed of 103 places in 120 ms of which 2 ms to minimize.
[2024-05-28 14:37:03] [INFO ] Deduced a trap composed of 133 places in 128 ms of which 2 ms to minimize.
[2024-05-28 14:37:03] [INFO ] Deduced a trap composed of 154 places in 131 ms of which 2 ms to minimize.
[2024-05-28 14:37:03] [INFO ] Deduced a trap composed of 154 places in 130 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 804 unsolved
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 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 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
At refinement iteration 4 (OVERLAPS) 1/365 variables, 1/56 constraints. Problems are: Problem set: 36 solved, 768 unsolved
[2024-05-28 14:37:14] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-05-28 14:37:16] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 1 ms to minimize.
[2024-05-28 14:37:18] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-05-28 14:37:18] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 4/60 constraints. Problems are: Problem set: 36 solved, 768 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 365/1160 variables, and 60 constraints, problems are : Problem set: 36 solved, 768 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 804/804 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 36 solved, 768 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 14/14 constraints. Problems are: Problem set: 36 solved, 768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 26/40 constraints. Problems are: Problem set: 36 solved, 768 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 19/59 constraints. Problems are: Problem set: 36 solved, 768 unsolved
[2024-05-28 14:37:28] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 2 ms to minimize.
[2024-05-28 14:37:28] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 2 ms to minimize.
[2024-05-28 14:37:28] [INFO ] Deduced a trap composed of 64 places in 158 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 3/62 constraints. Problems are: Problem set: 36 solved, 768 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/62 constraints. Problems are: Problem set: 36 solved, 768 unsolved
At refinement iteration 5 (OVERLAPS) 1/365 variables, 1/63 constraints. Problems are: Problem set: 36 solved, 768 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/63 constraints. Problems are: Problem set: 36 solved, 768 unsolved
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 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 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
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/64 constraints. Problems are: Problem set: 66 solved, 738 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 366/1160 variables, and 64 constraints, problems are : Problem set: 66 solved, 738 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/804 constraints, Known Traps: 22/22 constraints]
After SMT, in 61127ms problems are : Problem set: 66 solved, 738 unsolved
Search for dead transitions found 66 dead transitions in 61141ms
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 SI_LTL mode, iteration 1 : 366/528 places, 740/968 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 352 transition count 716
Applied a total of 12 rules in 25 ms. Remains 352 /366 variables (removed 14) and now considering 716/740 (removed 24) transitions.
[2024-05-28 14:37:51] [INFO ] Flow matrix only has 704 transitions (discarded 12 similar events)
// Phase 1: matrix 704 rows 352 cols
[2024-05-28 14:37:51] [INFO ] Computed 42 invariants in 21 ms
[2024-05-28 14:37:52] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-05-28 14:37:52] [INFO ] Flow matrix only has 704 transitions (discarded 12 similar events)
[2024-05-28 14:37:52] [INFO ] Invariant cache hit.
[2024-05-28 14:37:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:37:54] [INFO ] Implicit Places using invariants and state equation in 2423 ms returned []
Implicit Place search using SMT with State Equation took 2820 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 352/528 places, 716/968 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 107839 ms. Remains : 352/528 places, 716/968 transitions.
Stuttering acceptance computed with spot in 48 ms :[p0]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLFireability-13
Stuttering criterion allowed to conclude after 1146 steps with 0 reset in 5 ms.
FORMULA PolyORBLF-COL-S02J06T06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T06-LTLFireability-13 finished in 107904 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))&&F(p1)))))'
Support contains 13 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 522 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 516 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 516 transition count 956
Applied a total of 24 rules in 17 ms. Remains 516 /528 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-28 14:37:54] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 516 cols
[2024-05-28 14:37:54] [INFO ] Computed 42 invariants in 25 ms
[2024-05-28 14:37:54] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:38:02] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:38:02] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:38:02] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 0 ms to minimize.
[2024-05-28 14:38:02] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:38:02] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:38:02] [INFO ] Deduced a trap composed of 293 places in 262 ms of which 3 ms to minimize.
[2024-05-28 14:38:03] [INFO ] Deduced a trap composed of 281 places in 220 ms of which 4 ms to minimize.
[2024-05-28 14:38:03] [INFO ] Deduced a trap composed of 272 places in 201 ms of which 2 ms to minimize.
[2024-05-28 14:38:03] [INFO ] Deduced a trap composed of 124 places in 220 ms of which 3 ms to minimize.
[2024-05-28 14:38:03] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:38:04] [INFO ] Deduced a trap composed of 289 places in 263 ms of which 4 ms to minimize.
[2024-05-28 14:38:04] [INFO ] Deduced a trap composed of 284 places in 238 ms of which 4 ms to minimize.
[2024-05-28 14:38:04] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 3 ms to minimize.
[2024-05-28 14:38:05] [INFO ] Deduced a trap composed of 349 places in 169 ms of which 2 ms to minimize.
[2024-05-28 14:38:05] [INFO ] Deduced a trap composed of 273 places in 255 ms of which 4 ms to minimize.
[2024-05-28 14:38:05] [INFO ] Deduced a trap composed of 269 places in 204 ms of which 3 ms to minimize.
[2024-05-28 14:38:10] [INFO ] Deduced a trap composed of 268 places in 161 ms of which 3 ms to minimize.
[2024-05-28 14:38:11] [INFO ] Deduced a trap composed of 275 places in 197 ms of which 3 ms to minimize.
[2024-05-28 14:38:11] [INFO ] Deduced a trap composed of 260 places in 193 ms of which 3 ms to minimize.
[2024-05-28 14:38:11] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:38:12] [INFO ] Deduced a trap composed of 249 places in 203 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 61 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 21/61 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:38:17] [INFO ] Deduced a trap composed of 292 places in 209 ms of which 3 ms to minimize.
[2024-05-28 14:38:24] [INFO ] Deduced a trap composed of 269 places in 174 ms of which 2 ms to minimize.
[2024-05-28 14:38:26] [INFO ] Deduced a trap composed of 95 places in 173 ms of which 3 ms to minimize.
[2024-05-28 14:38:26] [INFO ] Deduced a trap composed of 288 places in 151 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:38:32] [INFO ] Deduced a trap composed of 278 places in 192 ms of which 3 ms to minimize.
[2024-05-28 14:38:33] [INFO ] Deduced a trap composed of 348 places in 183 ms of which 3 ms to minimize.
[2024-05-28 14:38:33] [INFO ] Deduced a trap composed of 280 places in 193 ms of which 3 ms to minimize.
[2024-05-28 14:38:33] [INFO ] Deduced a trap composed of 275 places in 212 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 69 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 29/29 constraints]
After SMT, in 41296ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 41306ms
[2024-05-28 14:38:36] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:38:36] [INFO ] Invariant cache hit.
[2024-05-28 14:38:36] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-05-28 14:38:36] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:38:36] [INFO ] Invariant cache hit.
[2024-05-28 14:38:36] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:38:41] [INFO ] Implicit Places using invariants and state equation in 4719 ms returned []
Implicit Place search using SMT with State Equation took 5028 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2024-05-28 14:38:41] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:38:41] [INFO ] Invariant cache hit.
[2024-05-28 14:38:41] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:38:48] [INFO ] Deduced a trap composed of 72 places in 37 ms of which 1 ms to minimize.
[2024-05-28 14:38:48] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 0 ms to minimize.
[2024-05-28 14:38:48] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:38:48] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:38:48] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:38:48] [INFO ] Deduced a trap composed of 288 places in 171 ms of which 2 ms to minimize.
[2024-05-28 14:38:49] [INFO ] Deduced a trap composed of 276 places in 181 ms of which 3 ms to minimize.
[2024-05-28 14:38:49] [INFO ] Deduced a trap composed of 274 places in 216 ms of which 3 ms to minimize.
[2024-05-28 14:38:49] [INFO ] Deduced a trap composed of 294 places in 179 ms of which 2 ms to minimize.
[2024-05-28 14:38:49] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 0 ms to minimize.
[2024-05-28 14:38:50] [INFO ] Deduced a trap composed of 290 places in 200 ms of which 3 ms to minimize.
[2024-05-28 14:38:50] [INFO ] Deduced a trap composed of 289 places in 207 ms of which 2 ms to minimize.
[2024-05-28 14:38:50] [INFO ] Deduced a trap composed of 314 places in 192 ms of which 3 ms to minimize.
[2024-05-28 14:38:50] [INFO ] Deduced a trap composed of 294 places in 195 ms of which 3 ms to minimize.
[2024-05-28 14:38:51] [INFO ] Deduced a trap composed of 280 places in 197 ms of which 3 ms to minimize.
[2024-05-28 14:38:51] [INFO ] Deduced a trap composed of 42 places in 177 ms of which 2 ms to minimize.
[2024-05-28 14:38:51] [INFO ] Deduced a trap composed of 261 places in 187 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:38:59] [INFO ] Deduced a trap composed of 117 places in 170 ms of which 3 ms to minimize.
[2024-05-28 14:38:59] [INFO ] Deduced a trap composed of 149 places in 166 ms of which 3 ms to minimize.
[2024-05-28 14:38:59] [INFO ] Deduced a trap composed of 283 places in 187 ms of which 3 ms to minimize.
[2024-05-28 14:39:06] [INFO ] Deduced a trap composed of 247 places in 216 ms of which 2 ms to minimize.
[2024-05-28 14:39:06] [INFO ] Deduced a trap composed of 258 places in 188 ms of which 3 ms to minimize.
[2024-05-28 14:39:06] [INFO ] Deduced a trap composed of 266 places in 187 ms of which 3 ms to minimize.
[2024-05-28 14:39:06] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 64 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:39:17] [INFO ] Deduced a trap composed of 343 places in 196 ms of which 3 ms to minimize.
[2024-05-28 14:39:20] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 66 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 26/26 constraints]
After SMT, in 60913ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 60927ms
Starting structural reductions in LTL mode, iteration 1 : 516/528 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107284 ms. Remains : 516/528 places, 956/968 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLFireability-14
Product exploration explored 100000 steps with 25000 reset in 231 ms.
Product exploration explored 100000 steps with 25000 reset in 232 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 124 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
RANDOM walk for 230 steps (0 resets) in 4 ms. (46 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 215 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
[2024-05-28 14:39:43] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:39:43] [INFO ] Invariant cache hit.
[2024-05-28 14:39:44] [INFO ] [Real]Absence check using 15 positive place invariants in 14 ms returned sat
[2024-05-28 14:39:44] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 99 ms returned sat
[2024-05-28 14:39:45] [INFO ] [Real]Absence check using state equation in 1156 ms returned sat
[2024-05-28 14:39:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:39:46] [INFO ] [Nat]Absence check using 15 positive place invariants in 14 ms returned sat
[2024-05-28 14:39:46] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 67 ms returned sat
[2024-05-28 14:39:47] [INFO ] [Nat]Absence check using state equation in 1157 ms returned sat
[2024-05-28 14:39:47] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:39:47] [INFO ] [Nat]Added 72 Read/Feed constraints in 244 ms returned sat
[2024-05-28 14:39:47] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 1 ms to minimize.
[2024-05-28 14:39:48] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 1 ms to minimize.
[2024-05-28 14:39:48] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 1 ms to minimize.
[2024-05-28 14:39:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1208 ms
[2024-05-28 14:39:48] [INFO ] Computed and/alt/rep : 618/2193/612 causal constraints (skipped 330 transitions) in 86 ms.
[2024-05-28 14:39:56] [INFO ] Added : 299 causal constraints over 61 iterations in 7551 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 13 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 956/956 transitions.
Applied a total of 0 rules in 9 ms. Remains 516 /516 variables (removed 0) and now considering 956/956 (removed 0) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-28 14:39:56] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:39:56] [INFO ] Invariant cache hit.
[2024-05-28 14:39:56] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:40:04] [INFO ] Deduced a trap composed of 72 places in 34 ms of which 1 ms to minimize.
[2024-05-28 14:40:04] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 1 ms to minimize.
[2024-05-28 14:40:04] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:40:04] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 0 ms to minimize.
[2024-05-28 14:40:04] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 2 ms to minimize.
[2024-05-28 14:40:05] [INFO ] Deduced a trap composed of 288 places in 296 ms of which 3 ms to minimize.
[2024-05-28 14:40:05] [INFO ] Deduced a trap composed of 276 places in 258 ms of which 4 ms to minimize.
[2024-05-28 14:40:05] [INFO ] Deduced a trap composed of 274 places in 266 ms of which 3 ms to minimize.
[2024-05-28 14:40:06] [INFO ] Deduced a trap composed of 294 places in 214 ms of which 2 ms to minimize.
[2024-05-28 14:40:06] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:40:06] [INFO ] Deduced a trap composed of 290 places in 178 ms of which 3 ms to minimize.
[2024-05-28 14:40:07] [INFO ] Deduced a trap composed of 289 places in 249 ms of which 4 ms to minimize.
[2024-05-28 14:40:07] [INFO ] Deduced a trap composed of 314 places in 183 ms of which 3 ms to minimize.
[2024-05-28 14:40:07] [INFO ] Deduced a trap composed of 294 places in 182 ms of which 2 ms to minimize.
[2024-05-28 14:40:07] [INFO ] Deduced a trap composed of 280 places in 239 ms of which 4 ms to minimize.
[2024-05-28 14:40:07] [INFO ] Deduced a trap composed of 42 places in 230 ms of which 2 ms to minimize.
[2024-05-28 14:40:08] [INFO ] Deduced a trap composed of 261 places in 176 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:40:16] [INFO ] Deduced a trap composed of 117 places in 212 ms of which 3 ms to minimize.
[2024-05-28 14:40:16] [INFO ] Deduced a trap composed of 149 places in 184 ms of which 3 ms to minimize.
[2024-05-28 14:40:17] [INFO ] Deduced a trap composed of 283 places in 199 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 60 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:40:25] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2024-05-28 14:40:32] [INFO ] Deduced a trap composed of 250 places in 284 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 62 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 22/22 constraints]
After SMT, in 40973ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40990ms
[2024-05-28 14:40:37] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:40:37] [INFO ] Invariant cache hit.
[2024-05-28 14:40:37] [INFO ] Implicit Places using invariants in 373 ms returned []
[2024-05-28 14:40:37] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:40:37] [INFO ] Invariant cache hit.
[2024-05-28 14:40:38] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:40:42] [INFO ] Implicit Places using invariants and state equation in 4612 ms returned []
Implicit Place search using SMT with State Equation took 4999 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2024-05-28 14:40:42] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:40:42] [INFO ] Invariant cache hit.
[2024-05-28 14:40:42] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:40:50] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 2 ms to minimize.
[2024-05-28 14:40:50] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:40:50] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:40:50] [INFO ] Deduced a trap composed of 72 places in 138 ms of which 1 ms to minimize.
[2024-05-28 14:40:50] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:40:50] [INFO ] Deduced a trap composed of 288 places in 226 ms of which 3 ms to minimize.
[2024-05-28 14:40:51] [INFO ] Deduced a trap composed of 276 places in 267 ms of which 4 ms to minimize.
[2024-05-28 14:40:51] [INFO ] Deduced a trap composed of 274 places in 215 ms of which 4 ms to minimize.
[2024-05-28 14:40:51] [INFO ] Deduced a trap composed of 294 places in 215 ms of which 3 ms to minimize.
[2024-05-28 14:40:51] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:40:52] [INFO ] Deduced a trap composed of 290 places in 242 ms of which 3 ms to minimize.
[2024-05-28 14:40:52] [INFO ] Deduced a trap composed of 289 places in 256 ms of which 4 ms to minimize.
[2024-05-28 14:40:53] [INFO ] Deduced a trap composed of 314 places in 262 ms of which 4 ms to minimize.
[2024-05-28 14:40:53] [INFO ] Deduced a trap composed of 294 places in 259 ms of which 3 ms to minimize.
[2024-05-28 14:40:53] [INFO ] Deduced a trap composed of 280 places in 218 ms of which 2 ms to minimize.
[2024-05-28 14:40:53] [INFO ] Deduced a trap composed of 42 places in 217 ms of which 3 ms to minimize.
[2024-05-28 14:40:54] [INFO ] Deduced a trap composed of 261 places in 216 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:41:03] [INFO ] Deduced a trap composed of 117 places in 154 ms of which 3 ms to minimize.
[2024-05-28 14:41:03] [INFO ] Deduced a trap composed of 149 places in 210 ms of which 3 ms to minimize.
[2024-05-28 14:41:03] [INFO ] Deduced a trap composed of 283 places in 250 ms of which 4 ms to minimize.
[2024-05-28 14:41:11] [INFO ] Deduced a trap composed of 247 places in 236 ms of which 4 ms to minimize.
[2024-05-28 14:41:11] [INFO ] Deduced a trap composed of 258 places in 208 ms of which 4 ms to minimize.
[2024-05-28 14:41:11] [INFO ] Deduced a trap composed of 266 places in 270 ms of which 4 ms to minimize.
[2024-05-28 14:41:11] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 2 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 514/1460 variables, and 64 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:41:19] [INFO ] Deduced a trap composed of 343 places in 252 ms of which 4 ms to minimize.
[2024-05-28 14:41:22] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 66 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 26/26 constraints]
After SMT, in 61267ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 61281ms
Finished structural reductions in LTL mode , in 1 iterations and 107289 ms. Remains : 516/516 places, 956/956 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) p0)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 163 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
RANDOM walk for 235 steps (0 resets) in 6 ms. (33 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 199 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
[2024-05-28 14:41:44] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:41:44] [INFO ] Invariant cache hit.
[2024-05-28 14:41:45] [INFO ] [Real]Absence check using 15 positive place invariants in 16 ms returned sat
[2024-05-28 14:41:45] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 101 ms returned sat
[2024-05-28 14:41:46] [INFO ] [Real]Absence check using state equation in 1172 ms returned sat
[2024-05-28 14:41:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:41:47] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-28 14:41:47] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 64 ms returned sat
[2024-05-28 14:41:48] [INFO ] [Nat]Absence check using state equation in 1333 ms returned sat
[2024-05-28 14:41:48] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:41:48] [INFO ] [Nat]Added 72 Read/Feed constraints in 342 ms returned sat
[2024-05-28 14:41:48] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 0 ms to minimize.
[2024-05-28 14:41:49] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 1 ms to minimize.
[2024-05-28 14:41:50] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 2 ms to minimize.
[2024-05-28 14:41:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1345 ms
[2024-05-28 14:41:50] [INFO ] Computed and/alt/rep : 618/2193/612 causal constraints (skipped 330 transitions) in 87 ms.
[2024-05-28 14:41:57] [INFO ] Added : 299 causal constraints over 61 iterations in 6945 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 328 ms.
Product exploration explored 100000 steps with 25000 reset in 462 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 13 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 956/956 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 516 transition count 956
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 66 Pre rules applied. Total rules applied 30 place count 516 transition count 1022
Deduced a syphon composed of 96 places in 1 ms
Iterating global reduction 1 with 66 rules applied. Total rules applied 96 place count 516 transition count 1022
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 102 place count 510 transition count 1016
Deduced a syphon composed of 90 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 108 place count 510 transition count 1016
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 120 places in 1 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 138 place count 510 transition count 1016
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 156 place count 492 transition count 998
Deduced a syphon composed of 108 places in 14 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 174 place count 492 transition count 998
Deduced a syphon composed of 108 places in 1 ms
Applied a total of 174 rules in 114 ms. Remains 492 /516 variables (removed 24) and now considering 998/956 (removed -42) transitions.
Running 996 sub problems to find dead transitions.
[2024-05-28 14:41:58] [INFO ] Flow matrix only has 986 transitions (discarded 12 similar events)
// Phase 1: matrix 986 rows 492 cols
[2024-05-28 14:41:58] [INFO ] Computed 42 invariants in 16 ms
[2024-05-28 14:41:58] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/490 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 996 unsolved
[2024-05-28 14:42:06] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 2 ms to minimize.
[2024-05-28 14:42:08] [INFO ] Deduced a trap composed of 50 places in 228 ms of which 4 ms to minimize.
[2024-05-28 14:42:09] [INFO ] Deduced a trap composed of 240 places in 236 ms of which 12 ms to minimize.
[2024-05-28 14:42:09] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2024-05-28 14:42:09] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 2 ms to minimize.
[2024-05-28 14:42:09] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:42:09] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 1 ms to minimize.
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
[2024-05-28 14:42:11] [INFO ] Deduced a trap composed of 137 places in 242 ms of which 4 ms to minimize.
[2024-05-28 14:42:12] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 3 ms to minimize.
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
[2024-05-28 14:42:12] [INFO ] Deduced a trap composed of 138 places in 294 ms of which 4 ms to minimize.
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
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 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 TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD928 is UNSAT
[2024-05-28 14:42:16] [INFO ] Deduced a trap composed of 145 places in 296 ms of which 4 ms to minimize.
Problem TDEAD932 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD997 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
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/490 variables, 11/51 constraints. Problems are: Problem set: 162 solved, 834 unsolved
[2024-05-28 14:42:17] [INFO ] Deduced a trap composed of 169 places in 168 ms of which 3 ms to minimize.
[2024-05-28 14:42:18] [INFO ] Deduced a trap composed of 188 places in 262 ms of which 3 ms to minimize.
[2024-05-28 14:42:18] [INFO ] Deduced a trap composed of 167 places in 231 ms of which 3 ms to minimize.
[2024-05-28 14:42:19] [INFO ] Deduced a trap composed of 171 places in 231 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 490/1478 variables, and 55 constraints, problems are : Problem set: 162 solved, 834 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/492 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 162 solved, 834 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 11/11 constraints. Problems are: Problem set: 162 solved, 834 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 11/22 constraints. Problems are: Problem set: 162 solved, 834 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 15/37 constraints. Problems are: Problem set: 162 solved, 834 unsolved
[2024-05-28 14:42:22] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 1/38 constraints. Problems are: Problem set: 162 solved, 834 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/38 constraints. Problems are: Problem set: 162 solved, 834 unsolved
At refinement iteration 5 (OVERLAPS) 30/424 variables, 5/43 constraints. Problems are: Problem set: 162 solved, 834 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 1/44 constraints. Problems are: Problem set: 162 solved, 834 unsolved
[2024-05-28 14:42:30] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 1 ms to minimize.
[2024-05-28 14:42:30] [INFO ] Deduced a trap composed of 129 places in 151 ms of which 2 ms to minimize.
[2024-05-28 14:42:30] [INFO ] Deduced a trap composed of 3 places in 193 ms of which 2 ms to minimize.
[2024-05-28 14:42:31] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 3 ms to minimize.
[2024-05-28 14:42:31] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 2 ms to minimize.
[2024-05-28 14:42:31] [INFO ] Deduced a trap composed of 22 places in 171 ms of which 2 ms to minimize.
[2024-05-28 14:42:31] [INFO ] Deduced a trap composed of 22 places in 186 ms of which 2 ms to minimize.
[2024-05-28 14:42:31] [INFO ] Deduced a trap composed of 3 places in 174 ms of which 3 ms to minimize.
[2024-05-28 14:42:32] [INFO ] Deduced a trap composed of 50 places in 148 ms of which 3 ms to minimize.
[2024-05-28 14:42:32] [INFO ] Deduced a trap composed of 119 places in 218 ms of which 3 ms to minimize.
[2024-05-28 14:42:32] [INFO ] Deduced a trap composed of 92 places in 230 ms of which 3 ms to minimize.
[2024-05-28 14:42:32] [INFO ] Deduced a trap composed of 113 places in 227 ms of which 3 ms to minimize.
[2024-05-28 14:42:33] [INFO ] Deduced a trap composed of 123 places in 227 ms of which 3 ms to minimize.
[2024-05-28 14:42:33] [INFO ] Deduced a trap composed of 187 places in 213 ms of which 3 ms to minimize.
[2024-05-28 14:42:33] [INFO ] Deduced a trap composed of 161 places in 170 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/1478 variables, and 59 constraints, problems are : Problem set: 162 solved, 834 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 12/26 constraints, State Equation: 0/492 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/996 constraints, Known Traps: 31/31 constraints]
After SMT, in 41178ms problems are : Problem set: 162 solved, 834 unsolved
Search for dead transitions found 162 dead transitions in 41192ms
Found 162 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 162 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 162 transitions.
[2024-05-28 14:42:39] [INFO ] Redundant transitions in 4 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 492/516 places, 836/956 transitions.
Graph (complete) has 2295 edges and 492 vertex of which 396 are kept as prefixes of interest. Removing 96 places using SCC suffix rule.4 ms
Discarding 96 places :
Also discarding 0 output transitions
Deduced a syphon composed of 12 places in 0 ms
Applied a total of 1 rules in 24 ms. Remains 396 /492 variables (removed 96) and now considering 836/836 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 396/516 places, 836/956 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41346 ms. Remains : 396/516 places, 836/956 transitions.
Built C files in :
/tmp/ltsmin17771345912361040295
[2024-05-28 14:42:39] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17771345912361040295
Running compilation step : cd /tmp/ltsmin17771345912361040295;'/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 2090 ms.
Running link step : cd /tmp/ltsmin17771345912361040295;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin17771345912361040295;'/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/stateBased15908314640604124356.hoa' '--buchi-type=spotba'
LTSmin run took 544 ms.
FORMULA PolyORBLF-COL-S02J06T06-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-COL-S02J06T06-LTLFireability-14 finished in 287835 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 6 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 522 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 516 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 516 transition count 956
Applied a total of 24 rules in 33 ms. Remains 516 /528 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-28 14:42:42] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 516 cols
[2024-05-28 14:42:42] [INFO ] Computed 42 invariants in 23 ms
[2024-05-28 14:42:42] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:42:50] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 2 ms to minimize.
[2024-05-28 14:42:50] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 0 ms to minimize.
[2024-05-28 14:42:50] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:42:50] [INFO ] Deduced a trap composed of 72 places in 38 ms of which 1 ms to minimize.
[2024-05-28 14:42:50] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 1 ms to minimize.
[2024-05-28 14:42:51] [INFO ] Deduced a trap composed of 293 places in 268 ms of which 3 ms to minimize.
[2024-05-28 14:42:51] [INFO ] Deduced a trap composed of 281 places in 224 ms of which 4 ms to minimize.
[2024-05-28 14:42:51] [INFO ] Deduced a trap composed of 272 places in 239 ms of which 3 ms to minimize.
[2024-05-28 14:42:52] [INFO ] Deduced a trap composed of 124 places in 213 ms of which 3 ms to minimize.
[2024-05-28 14:42:52] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-05-28 14:42:52] [INFO ] Deduced a trap composed of 289 places in 257 ms of which 4 ms to minimize.
[2024-05-28 14:42:53] [INFO ] Deduced a trap composed of 284 places in 235 ms of which 4 ms to minimize.
[2024-05-28 14:42:53] [INFO ] Deduced a trap composed of 15 places in 237 ms of which 4 ms to minimize.
[2024-05-28 14:42:53] [INFO ] Deduced a trap composed of 349 places in 251 ms of which 3 ms to minimize.
[2024-05-28 14:42:53] [INFO ] Deduced a trap composed of 273 places in 278 ms of which 4 ms to minimize.
[2024-05-28 14:42:54] [INFO ] Deduced a trap composed of 269 places in 275 ms of which 4 ms to minimize.
[2024-05-28 14:43:00] [INFO ] Deduced a trap composed of 268 places in 258 ms of which 4 ms to minimize.
[2024-05-28 14:43:00] [INFO ] Deduced a trap composed of 275 places in 272 ms of which 4 ms to minimize.
[2024-05-28 14:43:01] [INFO ] Deduced a trap composed of 260 places in 236 ms of which 3 ms to minimize.
[2024-05-28 14:43:01] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:43:03] [INFO ] Deduced a trap composed of 249 places in 281 ms of which 4 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 61 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 21/61 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:43:05] [INFO ] Deduced a trap composed of 292 places in 254 ms of which 4 ms to minimize.
[2024-05-28 14:43:14] [INFO ] Deduced a trap composed of 269 places in 196 ms of which 2 ms to minimize.
[2024-05-28 14:43:16] [INFO ] Deduced a trap composed of 95 places in 234 ms of which 3 ms to minimize.
[2024-05-28 14:43:16] [INFO ] Deduced a trap composed of 288 places in 149 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:43:23] [INFO ] Deduced a trap composed of 278 places in 240 ms of which 3 ms to minimize.
[2024-05-28 14:43:23] [INFO ] Deduced a trap composed of 348 places in 191 ms of which 3 ms to minimize.
[2024-05-28 14:43:24] [INFO ] Deduced a trap composed of 280 places in 218 ms of which 3 ms to minimize.
SMT process timed out in 41376ms, After SMT, problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 41386ms
[2024-05-28 14:43:24] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:43:24] [INFO ] Invariant cache hit.
[2024-05-28 14:43:24] [INFO ] Implicit Places using invariants in 409 ms returned []
[2024-05-28 14:43:24] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:43:24] [INFO ] Invariant cache hit.
[2024-05-28 14:43:24] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:43:29] [INFO ] Implicit Places using invariants and state equation in 4956 ms returned []
Implicit Place search using SMT with State Equation took 5367 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2024-05-28 14:43:29] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:43:29] [INFO ] Invariant cache hit.
[2024-05-28 14:43:29] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:43:37] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:43:37] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:43:37] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:43:38] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 2 ms to minimize.
[2024-05-28 14:43:38] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 2 ms to minimize.
[2024-05-28 14:43:38] [INFO ] Deduced a trap composed of 288 places in 248 ms of which 4 ms to minimize.
[2024-05-28 14:43:38] [INFO ] Deduced a trap composed of 276 places in 278 ms of which 4 ms to minimize.
[2024-05-28 14:43:39] [INFO ] Deduced a trap composed of 274 places in 270 ms of which 3 ms to minimize.
[2024-05-28 14:43:39] [INFO ] Deduced a trap composed of 294 places in 265 ms of which 4 ms to minimize.
[2024-05-28 14:43:39] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:43:40] [INFO ] Deduced a trap composed of 290 places in 246 ms of which 3 ms to minimize.
[2024-05-28 14:43:40] [INFO ] Deduced a trap composed of 289 places in 256 ms of which 4 ms to minimize.
[2024-05-28 14:43:40] [INFO ] Deduced a trap composed of 314 places in 184 ms of which 3 ms to minimize.
[2024-05-28 14:43:41] [INFO ] Deduced a trap composed of 294 places in 180 ms of which 3 ms to minimize.
[2024-05-28 14:43:41] [INFO ] Deduced a trap composed of 280 places in 202 ms of which 3 ms to minimize.
[2024-05-28 14:43:41] [INFO ] Deduced a trap composed of 42 places in 236 ms of which 4 ms to minimize.
[2024-05-28 14:43:41] [INFO ] Deduced a trap composed of 261 places in 179 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:43:49] [INFO ] Deduced a trap composed of 117 places in 246 ms of which 3 ms to minimize.
[2024-05-28 14:43:49] [INFO ] Deduced a trap composed of 149 places in 160 ms of which 3 ms to minimize.
[2024-05-28 14:43:50] [INFO ] Deduced a trap composed of 283 places in 168 ms of which 2 ms to minimize.
[2024-05-28 14:43:57] [INFO ] Deduced a trap composed of 247 places in 248 ms of which 4 ms to minimize.
[2024-05-28 14:43:57] [INFO ] Deduced a trap composed of 258 places in 181 ms of which 3 ms to minimize.
[2024-05-28 14:43:58] [INFO ] Deduced a trap composed of 266 places in 240 ms of which 3 ms to minimize.
[2024-05-28 14:43:58] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 64 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:44:06] [INFO ] Deduced a trap composed of 343 places in 187 ms of which 3 ms to minimize.
[2024-05-28 14:44:09] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 66 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 26/26 constraints]
After SMT, in 61044ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 61061ms
Starting structural reductions in LTL mode, iteration 1 : 516/528 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107854 ms. Remains : 516/528 places, 956/968 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLFireability-15
Product exploration explored 100000 steps with 1716 reset in 305 ms.
Product exploration explored 100000 steps with 1722 reset in 349 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 223 steps (0 resets) in 6 ms. (31 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 134 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 107 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
[2024-05-28 14:44:31] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:44:31] [INFO ] Invariant cache hit.
[2024-05-28 14:44:32] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2024-05-28 14:44:32] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 106 ms returned sat
[2024-05-28 14:44:34] [INFO ] [Real]Absence check using state equation in 2309 ms returned sat
[2024-05-28 14:44:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:44:35] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-05-28 14:44:35] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 64 ms returned sat
[2024-05-28 14:44:37] [INFO ] [Nat]Absence check using state equation in 2504 ms returned sat
[2024-05-28 14:44:37] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:44:38] [INFO ] [Nat]Added 72 Read/Feed constraints in 707 ms returned sat
[2024-05-28 14:44:38] [INFO ] Deduced a trap composed of 231 places in 301 ms of which 4 ms to minimize.
[2024-05-28 14:44:39] [INFO ] Deduced a trap composed of 83 places in 205 ms of which 3 ms to minimize.
[2024-05-28 14:44:40] [INFO ] Deduced a trap composed of 177 places in 196 ms of which 3 ms to minimize.
[2024-05-28 14:44:40] [INFO ] Deduced a trap composed of 72 places in 174 ms of which 3 ms to minimize.
[2024-05-28 14:44:40] [INFO ] Deduced a trap composed of 72 places in 136 ms of which 2 ms to minimize.
[2024-05-28 14:44:42] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 2 ms to minimize.
[2024-05-28 14:44:42] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 1 ms to minimize.
[2024-05-28 14:44:42] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
[2024-05-28 14:44:42] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4110 ms
[2024-05-28 14:44:42] [INFO ] Computed and/alt/rep : 618/2193/612 causal constraints (skipped 330 transitions) in 91 ms.
[2024-05-28 14:44:49] [INFO ] Added : 345 causal constraints over 69 iterations in 7204 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 6 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 956/956 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 516 transition count 926
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 486 transition count 920
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 480 transition count 920
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 72 place count 480 transition count 860
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 192 place count 420 transition count 860
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 276 place count 378 transition count 818
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 282 place count 372 transition count 812
Iterating global reduction 3 with 6 rules applied. Total rules applied 288 place count 372 transition count 812
Applied a total of 288 rules in 48 ms. Remains 372 /516 variables (removed 144) and now considering 812/956 (removed 144) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 14:44:49] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 372 cols
[2024-05-28 14:44:49] [INFO ] Computed 42 invariants in 20 ms
[2024-05-28 14:44:49] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 14:44:56] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 2 ms to minimize.
[2024-05-28 14:44:56] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 1 ms to minimize.
[2024-05-28 14:44:56] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:44:56] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 1 ms to minimize.
[2024-05-28 14:44:56] [INFO ] Deduced a trap composed of 48 places in 34 ms of which 1 ms to minimize.
[2024-05-28 14:44:56] [INFO ] Deduced a trap composed of 182 places in 148 ms of which 2 ms to minimize.
[2024-05-28 14:44:56] [INFO ] Deduced a trap composed of 205 places in 147 ms of which 2 ms to minimize.
[2024-05-28 14:44:56] [INFO ] Deduced a trap composed of 143 places in 158 ms of which 2 ms to minimize.
[2024-05-28 14:44:57] [INFO ] Deduced a trap composed of 149 places in 171 ms of which 3 ms to minimize.
[2024-05-28 14:44:57] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:44:57] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 1 ms to minimize.
[2024-05-28 14:45:03] [INFO ] Deduced a trap composed of 130 places in 142 ms of which 2 ms to minimize.
[2024-05-28 14:45:03] [INFO ] Deduced a trap composed of 161 places in 142 ms of which 2 ms to minimize.
[2024-05-28 14:45:03] [INFO ] Deduced a trap composed of 131 places in 198 ms of which 3 ms to minimize.
[2024-05-28 14:45:04] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 14:45:06] [INFO ] Deduced a trap composed of 228 places in 190 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/370 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/1172 variables, and 56 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/372 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 810 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
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/371 variables, 1/57 constraints. Problems are: Problem set: 36 solved, 774 unsolved
[2024-05-28 14:45:22] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 2 ms to minimize.
[2024-05-28 14:45:23] [INFO ] Deduced a trap composed of 132 places in 249 ms of which 3 ms to minimize.
[2024-05-28 14:45:27] [INFO ] Deduced a trap composed of 142 places in 125 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 371/1172 variables, and 60 constraints, problems are : Problem set: 36 solved, 774 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/372 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 19/19 constraints]
After SMT, in 41209ms problems are : Problem set: 36 solved, 774 unsolved
Search for dead transitions found 36 dead transitions in 41220ms
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:45:31] [INFO ] Flow matrix only has 764 transitions (discarded 12 similar events)
// Phase 1: matrix 764 rows 372 cols
[2024-05-28 14:45:31] [INFO ] Computed 42 invariants in 18 ms
[2024-05-28 14:45:31] [INFO ] Implicit Places using invariants in 433 ms returned []
[2024-05-28 14:45:31] [INFO ] Flow matrix only has 764 transitions (discarded 12 similar events)
[2024-05-28 14:45:31] [INFO ] Invariant cache hit.
[2024-05-28 14:45:31] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:45:35] [INFO ] Implicit Places using invariants and state equation in 3398 ms returned []
Implicit Place search using SMT with State Equation took 3835 ms to find 0 implicit places.
[2024-05-28 14:45:35] [INFO ] Redundant transitions in 9 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 372/516 places, 776/956 transitions.
Applied a total of 0 rules in 16 ms. Remains 372 /372 variables (removed 0) and now considering 776/776 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45141 ms. Remains : 372/516 places, 776/956 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 135 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 97 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 153 steps (0 resets) in 4 ms. (30 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 120 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 118 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
[2024-05-28 14:45:35] [INFO ] Flow matrix only has 764 transitions (discarded 12 similar events)
[2024-05-28 14:45:35] [INFO ] Invariant cache hit.
[2024-05-28 14:45:35] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-28 14:45:36] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 46 ms returned sat
[2024-05-28 14:45:36] [INFO ] [Real]Absence check using state equation in 541 ms returned sat
[2024-05-28 14:45:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:45:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-28 14:45:36] [INFO ] [Nat]Absence check using 14 positive and 28 generalized place invariants in 27 ms returned sat
[2024-05-28 14:45:37] [INFO ] [Nat]Absence check using state equation in 843 ms returned sat
[2024-05-28 14:45:37] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:45:38] [INFO ] [Nat]Added 72 Read/Feed constraints in 282 ms returned sat
[2024-05-28 14:45:38] [INFO ] Deduced a trap composed of 178 places in 222 ms of which 2 ms to minimize.
[2024-05-28 14:45:38] [INFO ] Deduced a trap composed of 118 places in 237 ms of which 3 ms to minimize.
[2024-05-28 14:45:38] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 2 ms to minimize.
[2024-05-28 14:45:39] [INFO ] Deduced a trap composed of 48 places in 119 ms of which 1 ms to minimize.
[2024-05-28 14:45:39] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 1 ms to minimize.
[2024-05-28 14:45:39] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:45:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1488 ms
[2024-05-28 14:45:39] [INFO ] Computed and/alt/rep : 474/2301/468 causal constraints (skipped 294 transitions) in 80 ms.
[2024-05-28 14:45:44] [INFO ] Added : 299 causal constraints over 60 iterations in 4703 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2442 reset in 353 ms.
Product exploration explored 100000 steps with 2440 reset in 368 ms.
Built C files in :
/tmp/ltsmin985124970086748551
[2024-05-28 14:45:45] [INFO ] Computing symmetric may disable matrix : 776 transitions.
[2024-05-28 14:45:45] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:45:45] [INFO ] Computing symmetric may enable matrix : 776 transitions.
[2024-05-28 14:45:45] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:45:45] [INFO ] Computing Do-Not-Accords matrix : 776 transitions.
[2024-05-28 14:45:45] [INFO ] Computation of Completed DNA matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:45:45] [INFO ] Built C files in 167ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin985124970086748551
Running compilation step : cd /tmp/ltsmin985124970086748551;'/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 2855 ms.
Running link step : cd /tmp/ltsmin985124970086748551;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 88 ms.
Running LTSmin : cd /tmp/ltsmin985124970086748551;'/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/stateBased18337099557131259897.hoa' '--buchi-type=spotba'
LTSmin run took 6722 ms.
FORMULA PolyORBLF-COL-S02J06T06-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-COL-S02J06T06-LTLFireability-15 finished in 192273 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((X(p1)&&p0))))'
Found a Shortening insensitive property : PolyORBLF-COL-S02J06T06-LTLFireability-03
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 19 out of 528 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 528 transition count 920
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 480 transition count 920
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 96 place count 480 transition count 872
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 192 place count 432 transition count 872
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 198 place count 426 transition count 866
Iterating global reduction 2 with 6 rules applied. Total rules applied 204 place count 426 transition count 866
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 288 place count 384 transition count 824
Applied a total of 288 rules in 54 ms. Remains 384 /528 variables (removed 144) and now considering 824/968 (removed 144) transitions.
Running 822 sub problems to find dead transitions.
[2024-05-28 14:45:55] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 384 cols
[2024-05-28 14:45:55] [INFO ] Computed 42 invariants in 19 ms
[2024-05-28 14:45:55] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-28 14:46:01] [INFO ] Deduced a trap composed of 50 places in 149 ms of which 2 ms to minimize.
[2024-05-28 14:46:01] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 2 ms to minimize.
[2024-05-28 14:46:01] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:46:01] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 1 ms to minimize.
[2024-05-28 14:46:01] [INFO ] Deduced a trap composed of 50 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:46:01] [INFO ] Deduced a trap composed of 144 places in 204 ms of which 2 ms to minimize.
[2024-05-28 14:46:02] [INFO ] Deduced a trap composed of 150 places in 177 ms of which 3 ms to minimize.
[2024-05-28 14:46:02] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:46:02] [INFO ] Deduced a trap composed of 144 places in 210 ms of which 3 ms to minimize.
[2024-05-28 14:46:04] [INFO ] Deduced a trap composed of 225 places in 199 ms of which 3 ms to minimize.
[2024-05-28 14:46:06] [INFO ] Deduced a trap composed of 153 places in 216 ms of which 3 ms to minimize.
[2024-05-28 14:46:07] [INFO ] Deduced a trap composed of 152 places in 183 ms of which 3 ms to minimize.
[2024-05-28 14:46:07] [INFO ] Deduced a trap composed of 147 places in 171 ms of which 3 ms to minimize.
[2024-05-28 14:46:09] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 3 ms to minimize.
[2024-05-28 14:46:09] [INFO ] Deduced a trap composed of 148 places in 147 ms of which 2 ms to minimize.
[2024-05-28 14:46:09] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 2 ms to minimize.
[2024-05-28 14:46:10] [INFO ] Deduced a trap composed of 142 places in 218 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-28 14:46:13] [INFO ] Deduced a trap composed of 154 places in 215 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 382/1196 variables, and 58 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/384 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-28 14:46:20] [INFO ] Deduced a trap composed of 228 places in 189 ms of which 2 ms to minimize.
[2024-05-28 14:46:28] [INFO ] Deduced a trap composed of 144 places in 199 ms of which 3 ms to minimize.
[2024-05-28 14:46:30] [INFO ] Deduced a trap composed of 69 places in 128 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 822 unsolved
(s21 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 4)
(s1 6)
(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 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 382/1196 variables, and 61 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/384 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 21/21 constraints]
After SMT, in 41162ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 41174ms
[2024-05-28 14:46:36] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2024-05-28 14:46:36] [INFO ] Invariant cache hit.
[2024-05-28 14:46:36] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-05-28 14:46:36] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2024-05-28 14:46:36] [INFO ] Invariant cache hit.
[2024-05-28 14:46:37] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:46:40] [INFO ] Implicit Places using invariants and state equation in 3265 ms returned []
Implicit Place search using SMT with State Equation took 3677 ms to find 0 implicit places.
Running 822 sub problems to find dead transitions.
[2024-05-28 14:46:40] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2024-05-28 14:46:40] [INFO ] Invariant cache hit.
[2024-05-28 14:46:40] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-28 14:46:45] [INFO ] Deduced a trap composed of 45 places in 158 ms of which 2 ms to minimize.
[2024-05-28 14:46:45] [INFO ] Deduced a trap composed of 50 places in 135 ms of which 2 ms to minimize.
[2024-05-28 14:46:45] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2024-05-28 14:46:45] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 2 ms to minimize.
[2024-05-28 14:46:45] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:46:45] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:46:46] [INFO ] Deduced a trap composed of 146 places in 226 ms of which 3 ms to minimize.
[2024-05-28 14:46:46] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:46:46] [INFO ] Deduced a trap composed of 144 places in 227 ms of which 3 ms to minimize.
[2024-05-28 14:46:47] [INFO ] Deduced a trap composed of 161 places in 200 ms of which 3 ms to minimize.
[2024-05-28 14:46:49] [INFO ] Deduced a trap composed of 225 places in 136 ms of which 2 ms to minimize.
[2024-05-28 14:46:49] [INFO ] Deduced a trap composed of 152 places in 198 ms of which 3 ms to minimize.
[2024-05-28 14:46:51] [INFO ] Deduced a trap composed of 144 places in 201 ms of which 3 ms to minimize.
[2024-05-28 14:46:51] [INFO ] Deduced a trap composed of 187 places in 164 ms of which 2 ms to minimize.
[2024-05-28 14:46:51] [INFO ] Deduced a trap composed of 159 places in 189 ms of which 2 ms to minimize.
[2024-05-28 14:46:51] [INFO ] Deduced a trap composed of 151 places in 164 ms of which 2 ms to minimize.
[2024-05-28 14:46:54] [INFO ] Deduced a trap composed of 157 places in 131 ms of which 2 ms to minimize.
[2024-05-28 14:46:54] [INFO ] Deduced a trap composed of 143 places in 125 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 822 unsolved
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 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 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
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/383 variables, 1/59 constraints. Problems are: Problem set: 36 solved, 786 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 383/1196 variables, and 59 constraints, problems are : Problem set: 36 solved, 786 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/384 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 36 solved, 786 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 14/14 constraints. Problems are: Problem set: 36 solved, 786 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 26/40 constraints. Problems are: Problem set: 36 solved, 786 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 18/58 constraints. Problems are: Problem set: 36 solved, 786 unsolved
[2024-05-28 14:47:12] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 1 ms to minimize.
[2024-05-28 14:47:13] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 2 ms to minimize.
[2024-05-28 14:47:18] [INFO ] Deduced a trap composed of 178 places in 215 ms of which 3 ms to minimize.
[2024-05-28 14:47:18] [INFO ] Deduced a trap composed of 144 places in 204 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 4/62 constraints. Problems are: Problem set: 36 solved, 786 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 0/62 constraints. Problems are: Problem set: 36 solved, 786 unsolved
At refinement iteration 5 (OVERLAPS) 1/383 variables, 1/63 constraints. Problems are: Problem set: 36 solved, 786 unsolved
[2024-05-28 14:47:39] [INFO ] Deduced a trap composed of 69 places in 211 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/1196 variables, and 64 constraints, problems are : Problem set: 36 solved, 786 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/384 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 23/23 constraints]
After SMT, in 61103ms problems are : Problem set: 36 solved, 786 unsolved
Search for dead transitions found 36 dead transitions in 61118ms
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 LI_LTL mode, iteration 1 : 384/528 places, 788/968 transitions.
Applied a total of 0 rules in 16 ms. Remains 384 /384 variables (removed 0) and now considering 788/788 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 106051 ms. Remains : 384/528 places, 788/968 transitions.
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLFireability-03
Product exploration explored 100000 steps with 5778 reset in 460 ms.
Product exploration explored 100000 steps with 5783 reset in 445 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 159 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 537 steps (1 resets) in 22 ms. (23 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 321 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-28 14:47:43] [INFO ] Flow matrix only has 776 transitions (discarded 12 similar events)
// Phase 1: matrix 776 rows 384 cols
[2024-05-28 14:47:43] [INFO ] Computed 42 invariants in 15 ms
[2024-05-28 14:47:43] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-28 14:47:43] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 74 ms returned sat
[2024-05-28 14:47:44] [INFO ] [Real]Absence check using state equation in 1051 ms returned sat
[2024-05-28 14:47:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:47:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-28 14:47:45] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 291 ms returned sat
[2024-05-28 14:47:46] [INFO ] [Nat]Absence check using state equation in 1054 ms returned sat
[2024-05-28 14:47:46] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:47:46] [INFO ] [Nat]Added 72 Read/Feed constraints in 163 ms returned sat
[2024-05-28 14:47:46] [INFO ] Computed and/alt/rep : 498/2397/492 causal constraints (skipped 282 transitions) in 74 ms.
[2024-05-28 14:47:48] [INFO ] Added : 121 causal constraints over 25 iterations in 2072 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 19 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 788/788 transitions.
Applied a total of 0 rules in 5 ms. Remains 384 /384 variables (removed 0) and now considering 788/788 (removed 0) transitions.
Running 786 sub problems to find dead transitions.
[2024-05-28 14:47:48] [INFO ] Flow matrix only has 776 transitions (discarded 12 similar events)
[2024-05-28 14:47:48] [INFO ] Invariant cache hit.
[2024-05-28 14:47:48] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 786 unsolved
[2024-05-28 14:47:53] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 3 ms to minimize.
[2024-05-28 14:47:54] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 2 ms to minimize.
[2024-05-28 14:47:54] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:47:54] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 1 ms to minimize.
[2024-05-28 14:47:54] [INFO ] Deduced a trap composed of 50 places in 35 ms of which 0 ms to minimize.
[2024-05-28 14:47:54] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:47:54] [INFO ] Deduced a trap composed of 50 places in 200 ms of which 3 ms to minimize.
[2024-05-28 14:47:54] [INFO ] Deduced a trap composed of 146 places in 172 ms of which 2 ms to minimize.
[2024-05-28 14:47:54] [INFO ] Deduced a trap composed of 151 places in 172 ms of which 2 ms to minimize.
[2024-05-28 14:47:55] [INFO ] Deduced a trap composed of 180 places in 238 ms of which 3 ms to minimize.
[2024-05-28 14:47:55] [INFO ] Deduced a trap composed of 162 places in 156 ms of which 2 ms to minimize.
[2024-05-28 14:47:55] [INFO ] Deduced a trap composed of 132 places in 146 ms of which 2 ms to minimize.
[2024-05-28 14:47:57] [INFO ] Deduced a trap composed of 142 places in 198 ms of which 2 ms to minimize.
[2024-05-28 14:47:57] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 3 ms to minimize.
[2024-05-28 14:47:58] [INFO ] Deduced a trap composed of 125 places in 203 ms of which 3 ms to minimize.
[2024-05-28 14:47:59] [INFO ] Deduced a trap composed of 133 places in 203 ms of which 3 ms to minimize.
[2024-05-28 14:47:59] [INFO ] Deduced a trap composed of 142 places in 180 ms of which 2 ms to minimize.
[2024-05-28 14:48:01] [INFO ] Deduced a trap composed of 144 places in 201 ms of which 3 ms to minimize.
[2024-05-28 14:48:01] [INFO ] Deduced a trap composed of 136 places in 152 ms of which 2 ms to minimize.
[2024-05-28 14:48:02] [INFO ] Deduced a trap composed of 144 places in 160 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 786 unsolved
[2024-05-28 14:48:04] [INFO ] Deduced a trap composed of 217 places in 179 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 0.0)
(s10 1.0)
(s11 2.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 382/1160 variables, and 61 constraints, problems are : Problem set: 0 solved, 786 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/384 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 786/786 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 786 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 21/61 constraints. Problems are: Problem set: 0 solved, 786 unsolved
[2024-05-28 14:48:11] [INFO ] Deduced a trap composed of 190 places in 220 ms of which 3 ms to minimize.
[2024-05-28 14:48:11] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 2 ms to minimize.
[2024-05-28 14:48:13] [INFO ] Deduced a trap composed of 161 places in 206 ms of which 3 ms to minimize.
[2024-05-28 14:48:14] [INFO ] Deduced a trap composed of 152 places in 179 ms of which 3 ms to minimize.
[2024-05-28 14:48:18] [INFO ] Deduced a trap composed of 69 places in 206 ms of which 5 ms to minimize.
[2024-05-28 14:48:18] [INFO ] Deduced a trap composed of 142 places in 237 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 382/1160 variables, and 67 constraints, problems are : Problem set: 0 solved, 786 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/384 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/786 constraints, Known Traps: 27/27 constraints]
After SMT, in 40968ms problems are : Problem set: 0 solved, 786 unsolved
Search for dead transitions found 0 dead transitions in 40981ms
[2024-05-28 14:48:29] [INFO ] Flow matrix only has 776 transitions (discarded 12 similar events)
[2024-05-28 14:48:29] [INFO ] Invariant cache hit.
[2024-05-28 14:48:30] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-05-28 14:48:30] [INFO ] Flow matrix only has 776 transitions (discarded 12 similar events)
[2024-05-28 14:48:30] [INFO ] Invariant cache hit.
[2024-05-28 14:48:30] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:48:35] [INFO ] Implicit Places using invariants and state equation in 5135 ms returned []
Implicit Place search using SMT with State Equation took 5484 ms to find 0 implicit places.
Running 786 sub problems to find dead transitions.
[2024-05-28 14:48:35] [INFO ] Flow matrix only has 776 transitions (discarded 12 similar events)
[2024-05-28 14:48:35] [INFO ] Invariant cache hit.
[2024-05-28 14:48:35] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 786 unsolved
[2024-05-28 14:48:40] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-05-28 14:48:40] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 1 ms to minimize.
[2024-05-28 14:48:40] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
[2024-05-28 14:48:40] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:48:40] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 0 ms to minimize.
[2024-05-28 14:48:40] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:48:40] [INFO ] Deduced a trap composed of 50 places in 209 ms of which 2 ms to minimize.
[2024-05-28 14:48:41] [INFO ] Deduced a trap composed of 146 places in 171 ms of which 3 ms to minimize.
[2024-05-28 14:48:41] [INFO ] Deduced a trap composed of 151 places in 121 ms of which 2 ms to minimize.
[2024-05-28 14:48:41] [INFO ] Deduced a trap composed of 180 places in 215 ms of which 3 ms to minimize.
[2024-05-28 14:48:41] [INFO ] Deduced a trap composed of 162 places in 237 ms of which 3 ms to minimize.
[2024-05-28 14:48:42] [INFO ] Deduced a trap composed of 132 places in 226 ms of which 3 ms to minimize.
[2024-05-28 14:48:44] [INFO ] Deduced a trap composed of 142 places in 228 ms of which 3 ms to minimize.
[2024-05-28 14:48:44] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 2 ms to minimize.
[2024-05-28 14:48:44] [INFO ] Deduced a trap composed of 125 places in 169 ms of which 3 ms to minimize.
[2024-05-28 14:48:45] [INFO ] Deduced a trap composed of 133 places in 155 ms of which 2 ms to minimize.
[2024-05-28 14:48:46] [INFO ] Deduced a trap composed of 142 places in 178 ms of which 3 ms to minimize.
[2024-05-28 14:48:48] [INFO ] Deduced a trap composed of 144 places in 139 ms of which 2 ms to minimize.
[2024-05-28 14:48:48] [INFO ] Deduced a trap composed of 136 places in 211 ms of which 3 ms to minimize.
[2024-05-28 14:48:48] [INFO ] Deduced a trap composed of 144 places in 139 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 786 unsolved
[2024-05-28 14:48:50] [INFO ] Deduced a trap composed of 217 places in 126 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 786 unsolved
[2024-05-28 14:49:02] [INFO ] Deduced a trap composed of 141 places in 225 ms of which 3 ms to minimize.
[2024-05-28 14:49:02] [INFO ] Deduced a trap composed of 102 places in 130 ms of which 2 ms to minimize.
[2024-05-28 14:49:03] [INFO ] Deduced a trap composed of 71 places in 212 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 382/1160 variables, and 64 constraints, problems are : Problem set: 0 solved, 786 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/384 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 786/786 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 786 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 4 (OVERLAPS) 1/383 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 786 unsolved
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 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
At refinement iteration 6 (OVERLAPS) 1/384 variables, 1/66 constraints. Problems are: Problem set: 30 solved, 756 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/1160 variables, and 66 constraints, problems are : Problem set: 30 solved, 756 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/384 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/786 constraints, Known Traps: 24/24 constraints]
After SMT, in 60840ms problems are : Problem set: 30 solved, 756 unsolved
Search for dead transitions found 30 dead transitions in 60848ms
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 LTL mode, iteration 1 : 384/384 places, 758/788 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 382 transition count 746
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 14 place count 370 transition count 734
Applied a total of 14 rules in 5 ms. Remains 370 /384 variables (removed 14) and now considering 734/758 (removed 24) transitions.
[2024-05-28 14:49:36] [INFO ] Flow matrix only has 722 transitions (discarded 12 similar events)
// Phase 1: matrix 722 rows 370 cols
[2024-05-28 14:49:36] [INFO ] Computed 42 invariants in 8 ms
[2024-05-28 14:49:36] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-28 14:49:36] [INFO ] Flow matrix only has 722 transitions (discarded 12 similar events)
[2024-05-28 14:49:36] [INFO ] Invariant cache hit.
[2024-05-28 14:49:36] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:49:39] [INFO ] Implicit Places using invariants and state equation in 3207 ms returned []
Implicit Place search using SMT with State Equation took 3551 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 370/384 places, 734/788 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110879 ms. Remains : 370/384 places, 734/788 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 104 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 164 steps (0 resets) in 6 ms. (23 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 210 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-28 14:49:40] [INFO ] Flow matrix only has 722 transitions (discarded 12 similar events)
[2024-05-28 14:49:40] [INFO ] Invariant cache hit.
[2024-05-28 14:49:40] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-28 14:49:40] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 90 ms returned sat
[2024-05-28 14:49:41] [INFO ] [Real]Absence check using state equation in 585 ms returned sat
[2024-05-28 14:49:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:49:41] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2024-05-28 14:49:41] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 28 ms returned sat
[2024-05-28 14:49:42] [INFO ] [Nat]Absence check using state equation in 628 ms returned sat
[2024-05-28 14:49:42] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:49:42] [INFO ] [Nat]Added 72 Read/Feed constraints in 101 ms returned sat
[2024-05-28 14:49:42] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 1 ms to minimize.
[2024-05-28 14:49:42] [INFO ] Deduced a trap composed of 130 places in 188 ms of which 3 ms to minimize.
[2024-05-28 14:49:42] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:49:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 504 ms
[2024-05-28 14:49:42] [INFO ] Computed and/alt/rep : 462/2049/456 causal constraints (skipped 264 transitions) in 49 ms.
[2024-05-28 14:49:46] [INFO ] Added : 255 causal constraints over 51 iterations in 3248 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 5760 reset in 391 ms.
Product exploration explored 100000 steps with 5753 reset in 359 ms.
Built C files in :
/tmp/ltsmin1166418321253549325
[2024-05-28 14:49:47] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1166418321253549325
Running compilation step : cd /tmp/ltsmin1166418321253549325;'/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 1311 ms.
Running link step : cd /tmp/ltsmin1166418321253549325;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin1166418321253549325;'/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/stateBased6929460928014153648.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 19 out of 370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 370/370 places, 734/734 transitions.
Applied a total of 0 rules in 4 ms. Remains 370 /370 variables (removed 0) and now considering 734/734 (removed 0) transitions.
Running 732 sub problems to find dead transitions.
[2024-05-28 14:50:02] [INFO ] Flow matrix only has 722 transitions (discarded 12 similar events)
[2024-05-28 14:50:02] [INFO ] Invariant cache hit.
[2024-05-28 14:50:02] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/368 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/368 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 732 unsolved
[2024-05-28 14:50:07] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 1 ms to minimize.
[2024-05-28 14:50:07] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 1 ms to minimize.
[2024-05-28 14:50:07] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:50:07] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 1 ms to minimize.
[2024-05-28 14:50:07] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 0 ms to minimize.
[2024-05-28 14:50:07] [INFO ] Deduced a trap composed of 160 places in 149 ms of which 2 ms to minimize.
[2024-05-28 14:50:07] [INFO ] Deduced a trap composed of 164 places in 154 ms of which 2 ms to minimize.
[2024-05-28 14:50:07] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:50:07] [INFO ] Deduced a trap composed of 148 places in 154 ms of which 2 ms to minimize.
[2024-05-28 14:50:08] [INFO ] Deduced a trap composed of 135 places in 157 ms of which 2 ms to minimize.
[2024-05-28 14:50:08] [INFO ] Deduced a trap composed of 144 places in 150 ms of which 2 ms to minimize.
[2024-05-28 14:50:08] [INFO ] Deduced a trap composed of 163 places in 214 ms of which 2 ms to minimize.
[2024-05-28 14:50:08] [INFO ] Deduced a trap composed of 150 places in 120 ms of which 2 ms to minimize.
[2024-05-28 14:50:09] [INFO ] Deduced a trap composed of 152 places in 167 ms of which 2 ms to minimize.
[2024-05-28 14:50:09] [INFO ] Deduced a trap composed of 152 places in 144 ms of which 2 ms to minimize.
[2024-05-28 14:50:09] [INFO ] Deduced a trap composed of 154 places in 130 ms of which 2 ms to minimize.
[2024-05-28 14:50:09] [INFO ] Deduced a trap composed of 156 places in 139 ms of which 2 ms to minimize.
[2024-05-28 14:50:09] [INFO ] Deduced a trap composed of 161 places in 138 ms of which 2 ms to minimize.
[2024-05-28 14:50:09] [INFO ] Deduced a trap composed of 164 places in 148 ms of which 2 ms to minimize.
[2024-05-28 14:50:11] [INFO ] Deduced a trap composed of 150 places in 140 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/368 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 732 unsolved
[2024-05-28 14:50:12] [INFO ] Deduced a trap composed of 160 places in 141 ms of which 2 ms to minimize.
[2024-05-28 14:50:12] [INFO ] Deduced a trap composed of 158 places in 149 ms of which 2 ms to minimize.
[2024-05-28 14:50:12] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2024-05-28 14:50:12] [INFO ] Deduced a trap composed of 159 places in 145 ms of which 2 ms to minimize.
[2024-05-28 14:50:12] [INFO ] Deduced a trap composed of 162 places in 148 ms of which 2 ms to minimize.
[2024-05-28 14:50:12] [INFO ] Deduced a trap composed of 152 places in 136 ms of which 2 ms to minimize.
[2024-05-28 14:50:12] [INFO ] Deduced a trap composed of 155 places in 143 ms of which 2 ms to minimize.
[2024-05-28 14:50:13] [INFO ] Deduced a trap composed of 140 places in 139 ms of which 2 ms to minimize.
[2024-05-28 14:50:13] [INFO ] Deduced a trap composed of 153 places in 163 ms of which 2 ms to minimize.
[2024-05-28 14:50:13] [INFO ] Deduced a trap composed of 154 places in 136 ms of which 2 ms to minimize.
[2024-05-28 14:50:13] [INFO ] Deduced a trap composed of 151 places in 143 ms of which 2 ms to minimize.
[2024-05-28 14:50:13] [INFO ] Deduced a trap composed of 153 places in 136 ms of which 3 ms to minimize.
[2024-05-28 14:50:13] [INFO ] Deduced a trap composed of 150 places in 148 ms of which 2 ms to minimize.
[2024-05-28 14:50:14] [INFO ] Deduced a trap composed of 158 places in 146 ms of which 2 ms to minimize.
[2024-05-28 14:50:14] [INFO ] Deduced a trap composed of 153 places in 137 ms of which 1 ms to minimize.
[2024-05-28 14:50:14] [INFO ] Deduced a trap composed of 161 places in 145 ms of which 2 ms to minimize.
[2024-05-28 14:50:14] [INFO ] Deduced a trap composed of 154 places in 131 ms of which 2 ms to minimize.
[2024-05-28 14:50:14] [INFO ] Deduced a trap composed of 166 places in 142 ms of which 2 ms to minimize.
[2024-05-28 14:50:14] [INFO ] Deduced a trap composed of 152 places in 143 ms of which 2 ms to minimize.
[2024-05-28 14:50:15] [INFO ] Deduced a trap composed of 151 places in 134 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/368 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 732 unsolved
[2024-05-28 14:50:19] [INFO ] Deduced a trap composed of 164 places in 143 ms of which 2 ms to minimize.
[2024-05-28 14:50:19] [INFO ] Deduced a trap composed of 147 places in 184 ms of which 3 ms to minimize.
[2024-05-28 14:50:19] [INFO ] Deduced a trap composed of 146 places in 174 ms of which 2 ms to minimize.
[2024-05-28 14:50:19] [INFO ] Deduced a trap composed of 202 places in 192 ms of which 3 ms to minimize.
[2024-05-28 14:50:19] [INFO ] Deduced a trap composed of 117 places in 119 ms of which 2 ms to minimize.
[2024-05-28 14:50:20] [INFO ] Deduced a trap composed of 180 places in 169 ms of which 3 ms to minimize.
[2024-05-28 14:50:20] [INFO ] Deduced a trap composed of 164 places in 156 ms of which 2 ms to minimize.
[2024-05-28 14:50:20] [INFO ] Deduced a trap composed of 163 places in 149 ms of which 3 ms to minimize.
[2024-05-28 14:50:20] [INFO ] Deduced a trap composed of 148 places in 151 ms of which 2 ms to minimize.
[2024-05-28 14:50:20] [INFO ] Deduced a trap composed of 145 places in 178 ms of which 3 ms to minimize.
[2024-05-28 14:50:21] [INFO ] Deduced a trap composed of 162 places in 193 ms of which 3 ms to minimize.
[2024-05-28 14:50:21] [INFO ] Deduced a trap composed of 147 places in 200 ms of which 3 ms to minimize.
[2024-05-28 14:50:21] [INFO ] Deduced a trap composed of 171 places in 121 ms of which 2 ms to minimize.
[2024-05-28 14:50:21] [INFO ] Deduced a trap composed of 161 places in 137 ms of which 2 ms to minimize.
[2024-05-28 14:50:22] [INFO ] Deduced a trap composed of 156 places in 188 ms of which 3 ms to minimize.
[2024-05-28 14:50:22] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 2 ms to minimize.
[2024-05-28 14:50:22] [INFO ] Deduced a trap composed of 182 places in 205 ms of which 3 ms to minimize.
[2024-05-28 14:50:22] [INFO ] Deduced a trap composed of 182 places in 180 ms of which 2 ms to minimize.
[2024-05-28 14:50:23] [INFO ] Deduced a trap composed of 171 places in 180 ms of which 3 ms to minimize.
SMT process timed out in 20883ms, After SMT, problems are : Problem set: 0 solved, 732 unsolved
Search for dead transitions found 0 dead transitions in 20894ms
[2024-05-28 14:50:23] [INFO ] Flow matrix only has 722 transitions (discarded 12 similar events)
[2024-05-28 14:50:23] [INFO ] Invariant cache hit.
[2024-05-28 14:50:23] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-28 14:50:23] [INFO ] Flow matrix only has 722 transitions (discarded 12 similar events)
[2024-05-28 14:50:23] [INFO ] Invariant cache hit.
[2024-05-28 14:50:23] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:50:26] [INFO ] Implicit Places using invariants and state equation in 3458 ms returned []
Implicit Place search using SMT with State Equation took 3759 ms to find 0 implicit places.
Running 732 sub problems to find dead transitions.
[2024-05-28 14:50:26] [INFO ] Flow matrix only has 722 transitions (discarded 12 similar events)
[2024-05-28 14:50:26] [INFO ] Invariant cache hit.
[2024-05-28 14:50:26] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/368 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/368 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 732 unsolved
[2024-05-28 14:50:31] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:50:31] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 1 ms to minimize.
[2024-05-28 14:50:31] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 0 ms to minimize.
[2024-05-28 14:50:31] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:50:31] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 0 ms to minimize.
[2024-05-28 14:50:31] [INFO ] Deduced a trap composed of 160 places in 170 ms of which 3 ms to minimize.
[2024-05-28 14:50:31] [INFO ] Deduced a trap composed of 164 places in 156 ms of which 2 ms to minimize.
[2024-05-28 14:50:31] [INFO ] Deduced a trap composed of 48 places in 31 ms of which 1 ms to minimize.
[2024-05-28 14:50:32] [INFO ] Deduced a trap composed of 148 places in 179 ms of which 2 ms to minimize.
[2024-05-28 14:50:32] [INFO ] Deduced a trap composed of 135 places in 133 ms of which 2 ms to minimize.
[2024-05-28 14:50:32] [INFO ] Deduced a trap composed of 144 places in 142 ms of which 2 ms to minimize.
[2024-05-28 14:50:32] [INFO ] Deduced a trap composed of 163 places in 132 ms of which 2 ms to minimize.
[2024-05-28 14:50:32] [INFO ] Deduced a trap composed of 150 places in 136 ms of which 1 ms to minimize.
[2024-05-28 14:50:33] [INFO ] Deduced a trap composed of 152 places in 132 ms of which 2 ms to minimize.
[2024-05-28 14:50:33] [INFO ] Deduced a trap composed of 152 places in 142 ms of which 2 ms to minimize.
[2024-05-28 14:50:33] [INFO ] Deduced a trap composed of 154 places in 131 ms of which 2 ms to minimize.
[2024-05-28 14:50:33] [INFO ] Deduced a trap composed of 156 places in 147 ms of which 2 ms to minimize.
[2024-05-28 14:50:33] [INFO ] Deduced a trap composed of 161 places in 142 ms of which 2 ms to minimize.
[2024-05-28 14:50:34] [INFO ] Deduced a trap composed of 164 places in 143 ms of which 2 ms to minimize.
[2024-05-28 14:50:35] [INFO ] Deduced a trap composed of 150 places in 196 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/368 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 732 unsolved
[2024-05-28 14:50:36] [INFO ] Deduced a trap composed of 160 places in 133 ms of which 2 ms to minimize.
[2024-05-28 14:50:36] [INFO ] Deduced a trap composed of 158 places in 152 ms of which 2 ms to minimize.
[2024-05-28 14:50:36] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-05-28 14:50:36] [INFO ] Deduced a trap composed of 159 places in 165 ms of which 2 ms to minimize.
[2024-05-28 14:50:36] [INFO ] Deduced a trap composed of 162 places in 148 ms of which 2 ms to minimize.
[2024-05-28 14:50:37] [INFO ] Deduced a trap composed of 152 places in 151 ms of which 2 ms to minimize.
[2024-05-28 14:50:37] [INFO ] Deduced a trap composed of 155 places in 141 ms of which 2 ms to minimize.
[2024-05-28 14:50:37] [INFO ] Deduced a trap composed of 140 places in 117 ms of which 2 ms to minimize.
[2024-05-28 14:50:37] [INFO ] Deduced a trap composed of 153 places in 117 ms of which 2 ms to minimize.
[2024-05-28 14:50:37] [INFO ] Deduced a trap composed of 154 places in 190 ms of which 2 ms to minimize.
[2024-05-28 14:50:37] [INFO ] Deduced a trap composed of 151 places in 130 ms of which 2 ms to minimize.
[2024-05-28 14:50:38] [INFO ] Deduced a trap composed of 153 places in 129 ms of which 2 ms to minimize.
[2024-05-28 14:50:38] [INFO ] Deduced a trap composed of 150 places in 127 ms of which 2 ms to minimize.
[2024-05-28 14:50:38] [INFO ] Deduced a trap composed of 158 places in 128 ms of which 2 ms to minimize.
[2024-05-28 14:50:38] [INFO ] Deduced a trap composed of 153 places in 129 ms of which 2 ms to minimize.
[2024-05-28 14:50:38] [INFO ] Deduced a trap composed of 161 places in 127 ms of which 2 ms to minimize.
[2024-05-28 14:50:38] [INFO ] Deduced a trap composed of 154 places in 131 ms of which 1 ms to minimize.
[2024-05-28 14:50:39] [INFO ] Deduced a trap composed of 166 places in 145 ms of which 2 ms to minimize.
[2024-05-28 14:50:39] [INFO ] Deduced a trap composed of 152 places in 188 ms of which 2 ms to minimize.
[2024-05-28 14:50:39] [INFO ] Deduced a trap composed of 151 places in 161 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/368 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 732 unsolved
[2024-05-28 14:50:43] [INFO ] Deduced a trap composed of 164 places in 146 ms of which 3 ms to minimize.
[2024-05-28 14:50:43] [INFO ] Deduced a trap composed of 147 places in 136 ms of which 2 ms to minimize.
[2024-05-28 14:50:44] [INFO ] Deduced a trap composed of 146 places in 187 ms of which 3 ms to minimize.
[2024-05-28 14:50:44] [INFO ] Deduced a trap composed of 202 places in 164 ms of which 3 ms to minimize.
[2024-05-28 14:50:44] [INFO ] Deduced a trap composed of 117 places in 70 ms of which 1 ms to minimize.
[2024-05-28 14:50:44] [INFO ] Deduced a trap composed of 180 places in 177 ms of which 3 ms to minimize.
[2024-05-28 14:50:44] [INFO ] Deduced a trap composed of 164 places in 160 ms of which 3 ms to minimize.
[2024-05-28 14:50:45] [INFO ] Deduced a trap composed of 163 places in 156 ms of which 3 ms to minimize.
[2024-05-28 14:50:45] [INFO ] Deduced a trap composed of 148 places in 170 ms of which 3 ms to minimize.
[2024-05-28 14:50:45] [INFO ] Deduced a trap composed of 145 places in 186 ms of which 3 ms to minimize.
[2024-05-28 14:50:45] [INFO ] Deduced a trap composed of 162 places in 158 ms of which 2 ms to minimize.
[2024-05-28 14:50:46] [INFO ] Deduced a trap composed of 147 places in 127 ms of which 3 ms to minimize.
[2024-05-28 14:50:46] [INFO ] Deduced a trap composed of 171 places in 173 ms of which 2 ms to minimize.
[2024-05-28 14:50:46] [INFO ] Deduced a trap composed of 161 places in 148 ms of which 2 ms to minimize.
[2024-05-28 14:50:46] [INFO ] Deduced a trap composed of 156 places in 185 ms of which 3 ms to minimize.
[2024-05-28 14:50:46] [INFO ] Deduced a trap composed of 158 places in 133 ms of which 2 ms to minimize.
[2024-05-28 14:50:46] [INFO ] Deduced a trap composed of 182 places in 119 ms of which 2 ms to minimize.
[2024-05-28 14:50:47] [INFO ] Deduced a trap composed of 182 places in 131 ms of which 2 ms to minimize.
[2024-05-28 14:50:47] [INFO ] Deduced a trap composed of 171 places in 157 ms of which 4 ms to minimize.
[2024-05-28 14:50:47] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 732 unsolved
[2024-05-28 14:50:48] [INFO ] Deduced a trap composed of 161 places in 195 ms of which 3 ms to minimize.
[2024-05-28 14:50:48] [INFO ] Deduced a trap composed of 136 places in 191 ms of which 2 ms to minimize.
[2024-05-28 14:50:49] [INFO ] Deduced a trap composed of 147 places in 165 ms of which 3 ms to minimize.
[2024-05-28 14:50:49] [INFO ] Deduced a trap composed of 125 places in 163 ms of which 2 ms to minimize.
[2024-05-28 14:50:49] [INFO ] Deduced a trap composed of 166 places in 199 ms of which 3 ms to minimize.
[2024-05-28 14:50:49] [INFO ] Deduced a trap composed of 122 places in 169 ms of which 3 ms to minimize.
[2024-05-28 14:50:50] [INFO ] Deduced a trap composed of 192 places in 179 ms of which 3 ms to minimize.
[2024-05-28 14:50:50] [INFO ] Deduced a trap composed of 165 places in 123 ms of which 2 ms to minimize.
[2024-05-28 14:50:50] [INFO ] Deduced a trap composed of 169 places in 117 ms of which 2 ms to minimize.
[2024-05-28 14:50:50] [INFO ] Deduced a trap composed of 182 places in 132 ms of which 2 ms to minimize.
[2024-05-28 14:50:50] [INFO ] Deduced a trap composed of 183 places in 138 ms of which 2 ms to minimize.
[2024-05-28 14:50:51] [INFO ] Deduced a trap composed of 171 places in 132 ms of which 2 ms to minimize.
[2024-05-28 14:50:51] [INFO ] Deduced a trap composed of 170 places in 132 ms of which 2 ms to minimize.
[2024-05-28 14:50:51] [INFO ] Deduced a trap composed of 159 places in 117 ms of which 2 ms to minimize.
[2024-05-28 14:50:51] [INFO ] Deduced a trap composed of 180 places in 130 ms of which 1 ms to minimize.
[2024-05-28 14:50:51] [INFO ] Deduced a trap composed of 160 places in 181 ms of which 3 ms to minimize.
[2024-05-28 14:50:51] [INFO ] Deduced a trap composed of 156 places in 182 ms of which 3 ms to minimize.
[2024-05-28 14:50:52] [INFO ] Deduced a trap composed of 165 places in 148 ms of which 2 ms to minimize.
[2024-05-28 14:50:52] [INFO ] Deduced a trap composed of 155 places in 144 ms of which 2 ms to minimize.
[2024-05-28 14:50:52] [INFO ] Deduced a trap composed of 161 places in 188 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 732 unsolved
[2024-05-28 14:50:54] [INFO ] Deduced a trap composed of 164 places in 228 ms of which 3 ms to minimize.
[2024-05-28 14:50:54] [INFO ] Deduced a trap composed of 162 places in 166 ms of which 3 ms to minimize.
[2024-05-28 14:50:55] [INFO ] Deduced a trap composed of 147 places in 170 ms of which 3 ms to minimize.
[2024-05-28 14:50:55] [INFO ] Deduced a trap composed of 176 places in 173 ms of which 3 ms to minimize.
[2024-05-28 14:50:55] [INFO ] Deduced a trap composed of 164 places in 188 ms of which 3 ms to minimize.
[2024-05-28 14:50:57] [INFO ] Deduced a trap composed of 147 places in 225 ms of which 3 ms to minimize.
[2024-05-28 14:50:57] [INFO ] Deduced a trap composed of 140 places in 226 ms of which 3 ms to minimize.
[2024-05-28 14:50:57] [INFO ] Deduced a trap composed of 160 places in 176 ms of which 3 ms to minimize.
SMT process timed out in 30865ms, After SMT, problems are : Problem set: 0 solved, 732 unsolved
Search for dead transitions found 0 dead transitions in 30871ms
Finished structural reductions in LTL mode , in 1 iterations and 55532 ms. Remains : 370/370 places, 734/734 transitions.
Built C files in :
/tmp/ltsmin2651111377912568614
[2024-05-28 14:50:57] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2651111377912568614
Running compilation step : cd /tmp/ltsmin2651111377912568614;'/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 1401 ms.
Running link step : cd /tmp/ltsmin2651111377912568614;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin2651111377912568614;'/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/stateBased3197233044655345991.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 14:51:12] [INFO ] Flatten gal took : 36 ms
[2024-05-28 14:51:12] [INFO ] Flatten gal took : 51 ms
[2024-05-28 14:51:12] [INFO ] Time to serialize gal into /tmp/LTL134488406281005580.gal : 6 ms
[2024-05-28 14:51:12] [INFO ] Time to serialize properties into /tmp/LTL12050725418552448403.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/LTL134488406281005580.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14621602523636845886.hoa' '-atoms' '/tmp/LTL12050725418552448403.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...318
Loading property file /tmp/LTL12050725418552448403.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14621602523636845886.hoa
Detected timeout of ITS tools.
[2024-05-28 14:51:28] [INFO ] Flatten gal took : 26 ms
[2024-05-28 14:51:28] [INFO ] Flatten gal took : 38 ms
[2024-05-28 14:51:28] [INFO ] Time to serialize gal into /tmp/LTL11925583211404850789.gal : 9 ms
[2024-05-28 14:51:28] [INFO ] Time to serialize properties into /tmp/LTL16394275023416577769.ltl : 2 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/LTL11925583211404850789.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16394275023416577769.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...277
Read 1 LTL properties
Checking formula 0 : !((G(F(((((X("((((Try_Check_Sources_E_5>=1)||(Try_Check_Sources_E_4>=1))||((Try_Check_Sources_E_3>=1)||(Try_Check_Sources_E_2>=1)))||(...795
Formula 0 simplified : FG(!"(((((cBlockedTasks<10)||(DisablePollingB_2<1))&&((cBlockedTasks<10)||(DisablePollingB_1<1)))&&(((cBlockedTasks<10)||(DisablePol...781
Detected timeout of ITS tools.
[2024-05-28 14:51:43] [INFO ] Flatten gal took : 42 ms
[2024-05-28 14:51:43] [INFO ] Applying decomposition
[2024-05-28 14:51:43] [INFO ] Flatten gal took : 38 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/graph2051139410549620794.txt' '-o' '/tmp/graph2051139410549620794.bin' '-w' '/tmp/graph2051139410549620794.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2051139410549620794.bin' '-l' '-1' '-v' '-w' '/tmp/graph2051139410549620794.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:51:43] [INFO ] Decomposing Gal with order
[2024-05-28 14:51:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:51:43] [INFO ] Removed a total of 630 redundant transitions.
[2024-05-28 14:51:43] [INFO ] Flatten gal took : 91 ms
[2024-05-28 14:51:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 358 labels/synchronizations in 22 ms.
[2024-05-28 14:51:43] [INFO ] Time to serialize gal into /tmp/LTL9864924374871466499.gal : 8 ms
[2024-05-28 14:51:43] [INFO ] Time to serialize properties into /tmp/LTL7046496848349184287.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/LTL9864924374871466499.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7046496848349184287.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...254
Read 1 LTL properties
Checking formula 0 : !((G(F(((((X("((((i4.i0.u25.Try_Check_Sources_E_5>=1)||(i4.i3.u31.Try_Check_Sources_E_4>=1))||((i4.i3.u30.Try_Check_Sources_E_3>=1)||(...1076
Formula 0 simplified : FG(!"(((((i4.i1.u12.cBlockedTasks<10)||(i4.i1.u6.DisablePollingB_2<1))&&((i4.i1.u12.cBlockedTasks<10)||(i4.i1.u1.DisablePollingB_1<1...1062
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J06T06-LTLFireability-03 finished in 363776 ms.
[2024-05-28 14:51:58] [INFO ] Flatten gal took : 54 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin664293592424888105
[2024-05-28 14:51:58] [INFO ] Computing symmetric may disable matrix : 968 transitions.
[2024-05-28 14:51:58] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:51:58] [INFO ] Computing symmetric may enable matrix : 968 transitions.
[2024-05-28 14:51:58] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:51:58] [INFO ] Applying decomposition
[2024-05-28 14:51:58] [INFO ] Flatten gal took : 70 ms
[2024-05-28 14:51:58] [INFO ] Computing Do-Not-Accords matrix : 968 transitions.
[2024-05-28 14:51:59] [INFO ] Computation of Completed DNA matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph13205161072176212911.txt' '-o' '/tmp/graph13205161072176212911.bin' '-w' '/tmp/graph13205161072176212911.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13205161072176212911.bin' '-l' '-1' '-v' '-w' '/tmp/graph13205161072176212911.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:51:59] [INFO ] Decomposing Gal with order
[2024-05-28 14:51:59] [INFO ] Built C files in 236ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin664293592424888105
Running compilation step : cd /tmp/ltsmin664293592424888105;'/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:51:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:51:59] [INFO ] Removed a total of 885 redundant transitions.
[2024-05-28 14:51:59] [INFO ] Flatten gal took : 115 ms
[2024-05-28 14:51:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 156 labels/synchronizations in 25 ms.
[2024-05-28 14:51:59] [INFO ] Time to serialize gal into /tmp/LTLFireability1386091322100582352.gal : 21 ms
[2024-05-28 14:51:59] [INFO ] Time to serialize properties into /tmp/LTLFireability5273272078729827278.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1386091322100582352.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5273272078729827278.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...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("(((((i1.i0.u14.cBlockedTasks<10)||(i8.u49.DisablePollingB_10<1))&&((i1.i0.u14.cBlockedTasks<10)||(i3.u48.DisablePollingB_9<1)...1053
Formula 0 simplified : FG(!"(((((i1.i0.u14.cBlockedTasks<10)||(i8.u49.DisablePollingB_10<1))&&((i1.i0.u14.cBlockedTasks<10)||(i3.u48.DisablePollingB_9<1)))...1043
Compilation finished in 3723 ms.
Running link step : cd /tmp/ltsmin664293592424888105;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin664293592424888105;'/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' '--ltl' '[](<>((X((LTLAPp1==true))&&(LTLAPp0==true))))' '--buchi-type=spotba'
LTSmin run took 438076 ms.
FORMULA PolyORBLF-COL-S02J06T06-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2781089 ms.

BK_STOP 1716908361046

--------------------
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-S02J06T06"
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-S02J06T06, 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-171654446400100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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