MCC'2024- Execution of r290-tajo-171654447000404

About the Execution of ITS-Tools for PolyORBNT-COL-S10J20

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
0.000	981373.00	0.00	0.00	FFF?FFFFTFFF?T?T	normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654447000404.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 PolyORBNT-COL-S10J20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654447000404
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 8.2K Apr 12 11:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 11:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 12 11:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 11:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 13:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 13:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 92K 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 PolyORBNT-COL-S10J20-LTLFireability-00
FORMULA_NAME PolyORBNT-COL-S10J20-LTLFireability-01
FORMULA_NAME PolyORBNT-COL-S10J20-LTLFireability-02
FORMULA_NAME PolyORBNT-COL-S10J20-LTLFireability-03
FORMULA_NAME PolyORBNT-COL-S10J20-LTLFireability-04
FORMULA_NAME PolyORBNT-COL-S10J20-LTLFireability-05
FORMULA_NAME PolyORBNT-COL-S10J20-LTLFireability-06
FORMULA_NAME PolyORBNT-COL-S10J20-LTLFireability-07
FORMULA_NAME PolyORBNT-COL-S10J20-LTLFireability-08
FORMULA_NAME PolyORBNT-COL-S10J20-LTLFireability-09
FORMULA_NAME PolyORBNT-COL-S10J20-LTLFireability-10
FORMULA_NAME PolyORBNT-COL-S10J20-LTLFireability-11
FORMULA_NAME PolyORBNT-COL-S10J20-LTLFireability-12
FORMULA_NAME PolyORBNT-COL-S10J20-LTLFireability-13
FORMULA_NAME PolyORBNT-COL-S10J20-LTLFireability-14
FORMULA_NAME PolyORBNT-COL-S10J20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716926534299

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-28 20:02:15] [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 20:02:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 20:02:16] [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 20:02:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 20:02:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 680 ms
[2024-05-28 20:02:16] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 494 PT places and 11822.0 transition bindings in 21 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 20:02:16] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2024-05-28 20:02:16] [INFO ] Skeletonized 16 HLPN properties in 10 ms.
Initial state reduction rules removed 5 formulas.
FORMULA PolyORBNT-COL-S10J20-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 7 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40007 steps (2277 resets) in 1165 ms. (34 steps per ms) remains 12/14 properties
BEST_FIRST walk for 40003 steps (798 resets) in 438 ms. (91 steps per ms) remains 3/12 properties
BEST_FIRST walk for 40004 steps (786 resets) in 265 ms. (150 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (776 resets) in 351 ms. (113 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (801 resets) in 246 ms. (161 steps per ms) remains 3/3 properties
// Phase 1: matrix 38 rows 48 cols
[2024-05-28 20:02:18] [INFO ] Computed 13 invariants in 4 ms
[2024-05-28 20:02:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp7 is UNSAT
At refinement iteration 3 (OVERLAPS) 19/34 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/41 variables, 4/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/42 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp10 is UNSAT
At refinement iteration 9 (OVERLAPS) 5/47 variables, 5/13 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-28 20:02:18] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 9 ms to minimize.
[2024-05-28 20:02:18] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:02:18] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/47 variables, 3/16 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/47 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 38/85 variables, 47/63 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/85 variables, 1/64 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/85 variables, 0/64 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/86 variables, 1/65 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/86 variables, 0/65 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/86 variables, 0/65 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 65 constraints, problems are : Problem set: 2 solved, 1 unsolved in 418 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/12 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/34 variables, 2/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/41 variables, 4/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/42 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/47 variables, 5/13 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/47 variables, 3/16 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/47 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 38/85 variables, 47/63 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/85 variables, 1/64 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/85 variables, 0/64 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/86 variables, 1/65 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/86 variables, 1/66 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/86 variables, 0/66 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/86 variables, 0/66 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 66 constraints, problems are : Problem set: 2 solved, 1 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 510ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 38/38 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 47 transition count 34
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 34
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 43 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 40 transition count 31
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 38 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 38 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 19 place count 38 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 37 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 35 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 34 transition count 28
Applied a total of 27 rules in 23 ms. Remains 34 /48 variables (removed 14) and now considering 28/38 (removed 10) transitions.
Running 25 sub problems to find dead transitions.
// Phase 1: matrix 28 rows 34 cols
[2024-05-28 20:02:18] [INFO ] Computed 12 invariants in 1 ms
[2024-05-28 20:02:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 1/34 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 28/62 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 0/62 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 47 constraints, problems are : Problem set: 0 solved, 25 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 34/34 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-28 20:02:18] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 1/34 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 28/62 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 25/73 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-28 20:02:19] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/62 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (OVERLAPS) 0/62 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 74 constraints, problems are : Problem set: 0 solved, 25 unsolved in 560 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 34/34 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 2/2 constraints]
After SMT, in 844ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 845ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 879 ms. Remains : 34/48 places, 28/38 transitions.
RANDOM walk for 40022 steps (2961 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (1140 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
Probably explored full state space saw : 521 states, properties seen :0
Probabilistic random walk after 1393 steps, saw 521 distinct states, run finished after 21 ms. (steps per millisecond=66 ) properties seen :0
Explored full state space saw : 521 states, properties seen :0
Exhaustive walk after 1393 steps, saw 521 distinct states, run finished after 4 ms. (steps per millisecond=348 ) properties seen :0
Successfully simplified 3 atomic propositions for a total of 7 simplifications.
[2024-05-28 20:02:19] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2024-05-28 20:02:19] [INFO ] Flatten gal took : 16 ms
FORMULA PolyORBNT-COL-S10J20-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 20:02:19] [INFO ] Flatten gal took : 6 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-28 20:02:19] [INFO ] Unfolded HLPN to a Petri net with 494 places and 11780 transitions 111159 arcs in 202 ms.
[2024-05-28 20:02:19] [INFO ] Unfolded 9 HLPN properties in 1 ms.
[2024-05-28 20:02:19] [INFO ] Reduced 780 identical enabling conditions.
[2024-05-28 20:02:19] [INFO ] Reduced 780 identical enabling conditions.
[2024-05-28 20:02:19] [INFO ] Reduced 780 identical enabling conditions.
Deduced a syphon composed of 20 places in 22 ms
Reduce places removed 20 places and 20 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 328 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Applied a total of 0 rules in 35 ms. Remains 474 /474 variables (removed 0) and now considering 1650/1650 (removed 0) transitions.
Running 1639 sub problems to find dead transitions.
[2024-05-28 20:02:20] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2024-05-28 20:02:20] [INFO ] Computed 72 invariants in 120 ms
[2024-05-28 20:02:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
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
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD392 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 TDEAD404 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD411 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 TDEAD425 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem 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
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD512 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 TDEAD524 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD531 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 TDEAD545 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD557 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 TDEAD573 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem 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 TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1146 is UNSAT
At refinement iteration 3 (OVERLAPS) 19/472 variables, 19/70 constraints. Problems are: Problem set: 558 solved, 1081 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/2115 variables, and 70 constraints, problems are : Problem set: 558 solved, 1081 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/474 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1639/639 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 558 solved, 1081 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 46/46 constraints. Problems are: Problem set: 558 solved, 1081 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 5/51 constraints. Problems are: Problem set: 558 solved, 1081 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 0/51 constraints. Problems are: Problem set: 558 solved, 1081 unsolved
At refinement iteration 3 (OVERLAPS) 19/472 variables, 19/70 constraints. Problems are: Problem set: 558 solved, 1081 unsolved
[2024-05-28 20:03:10] [INFO ] Deduced a trap composed of 12 places in 358 ms of which 6 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 472/2115 variables, and 71 constraints, problems are : Problem set: 558 solved, 1081 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/474 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 442/639 constraints, Known Traps: 1/1 constraints]
After SMT, in 58030ms problems are : Problem set: 558 solved, 1081 unsolved
Search for dead transitions found 558 dead transitions in 58071ms
Found 558 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 558 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 558 transitions.
[2024-05-28 20:03:18] [INFO ] Flow matrix only has 1083 transitions (discarded 9 similar events)
// Phase 1: matrix 1083 rows 474 cols
[2024-05-28 20:03:18] [INFO ] Computed 72 invariants in 67 ms
[2024-05-28 20:03:18] [INFO ] Implicit Places using invariants in 373 ms returned []
[2024-05-28 20:03:18] [INFO ] Flow matrix only has 1083 transitions (discarded 9 similar events)
[2024-05-28 20:03:18] [INFO ] Invariant cache hit.
[2024-05-28 20:03:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:03:19] [INFO ] Implicit Places using invariants and state equation in 1016 ms returned []
Implicit Place search using SMT with State Equation took 1403 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 474/474 places, 1092/1650 transitions.
Applied a total of 0 rules in 23 ms. Remains 474 /474 variables (removed 0) and now considering 1092/1092 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59542 ms. Remains : 474/474 places, 1092/1650 transitions.
Support contains 328 out of 474 places after structural reductions.
[2024-05-28 20:03:20] [INFO ] Flatten gal took : 356 ms
[2024-05-28 20:03:20] [INFO ] Flatten gal took : 118 ms
[2024-05-28 20:03:20] [INFO ] Input system was already deterministic with 1092 transitions.
Support contains 307 out of 474 places (down from 328) after GAL structural reductions.
RANDOM walk for 40000 steps (2237 resets) in 3496 ms. (11 steps per ms) remains 6/19 properties
BEST_FIRST walk for 40004 steps (480 resets) in 441 ms. (90 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (417 resets) in 296 ms. (134 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (402 resets) in 273 ms. (146 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (418 resets) in 139 ms. (285 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (136 resets) in 146 ms. (272 steps per ms) remains 4/6 properties
[2024-05-28 20:03:22] [INFO ] Flow matrix only has 1083 transitions (discarded 9 similar events)
[2024-05-28 20:03:22] [INFO ] Invariant cache hit.
[2024-05-28 20:03:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 1 (OVERLAPS) 361/399 variables, 20/20 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 65/464 variables, 44/64 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 5 (OVERLAPS) 9/473 variables, 7/71 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-28 20:03:22] [INFO ] Deduced a trap composed of 209 places in 323 ms of which 3 ms to minimize.
[2024-05-28 20:03:23] [INFO ] Deduced a trap composed of 217 places in 211 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 2/73 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-28 20:03:23] [INFO ] Deduced a trap composed of 207 places in 220 ms of which 18 ms to minimize.
[2024-05-28 20:03:23] [INFO ] Deduced a trap composed of 207 places in 182 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 2/75 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-28 20:03:23] [INFO ] Deduced a trap composed of 211 places in 191 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 1/76 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-28 20:03:24] [INFO ] Deduced a trap composed of 184 places in 179 ms of which 3 ms to minimize.
[2024-05-28 20:03:24] [INFO ] Deduced a trap composed of 211 places in 203 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 2/78 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/473 variables, 0/78 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/474 variables, 1/79 constraints. Problems are: Problem set: 2 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/474 variables, 0/79 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1083/1557 variables, 474/553 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1557 variables, 1/554 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-28 20:03:25] [INFO ] Deduced a trap composed of 123 places in 344 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1557 variables, 1/555 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1557 variables, 0/555 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1557 variables, 0/555 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1557/1557 variables, and 555 constraints, problems are : Problem set: 2 solved, 2 unsolved in 3108 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 474/474 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 168/170 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 44/214 variables, 23/25 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/25 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 210/424 variables, 21/46 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 0/46 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 36/460 variables, 18/64 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 0/64 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 12/472 variables, 7/71 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 8/79 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-28 20:03:25] [INFO ] Deduced a trap composed of 213 places in 225 ms of which 3 ms to minimize.
[2024-05-28 20:03:26] [INFO ] Deduced a trap composed of 241 places in 212 ms of which 3 ms to minimize.
[2024-05-28 20:03:26] [INFO ] Deduced a trap composed of 206 places in 211 ms of which 4 ms to minimize.
[2024-05-28 20:03:26] [INFO ] Deduced a trap composed of 205 places in 229 ms of which 4 ms to minimize.
[2024-05-28 20:03:26] [INFO ] Deduced a trap composed of 205 places in 178 ms of which 3 ms to minimize.
[2024-05-28 20:03:26] [INFO ] Deduced a trap composed of 206 places in 181 ms of which 2 ms to minimize.
[2024-05-28 20:03:27] [INFO ] Deduced a trap composed of 204 places in 202 ms of which 3 ms to minimize.
[2024-05-28 20:03:27] [INFO ] Deduced a trap composed of 206 places in 203 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 8/87 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 0/87 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/473 variables, 1/88 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/473 variables, 0/88 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1083/1556 variables, 473/561 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1556 variables, 1/562 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-28 20:03:28] [INFO ] Deduced a trap composed of 217 places in 266 ms of which 2 ms to minimize.
[2024-05-28 20:03:28] [INFO ] Deduced a trap composed of 229 places in 295 ms of which 3 ms to minimize.
[2024-05-28 20:03:28] [INFO ] Deduced a trap composed of 225 places in 270 ms of which 4 ms to minimize.
[2024-05-28 20:03:29] [INFO ] Deduced a trap composed of 229 places in 306 ms of which 4 ms to minimize.
[2024-05-28 20:03:29] [INFO ] Deduced a trap composed of 221 places in 320 ms of which 4 ms to minimize.
[2024-05-28 20:03:29] [INFO ] Deduced a trap composed of 233 places in 307 ms of which 4 ms to minimize.
[2024-05-28 20:03:30] [INFO ] Deduced a trap composed of 235 places in 333 ms of which 4 ms to minimize.
[2024-05-28 20:03:30] [INFO ] Deduced a trap composed of 233 places in 269 ms of which 4 ms to minimize.
SMT process timed out in 8288ms, After SMT, problems are : Problem set: 2 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 1092/1092 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 464 transition count 1066
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 62 place count 438 transition count 1066
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 62 place count 438 transition count 1041
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 112 place count 413 transition count 1041
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 412 transition count 1040
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 412 transition count 1040
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 118 place count 410 transition count 1038
Applied a total of 118 rules in 149 ms. Remains 410 /474 variables (removed 64) and now considering 1038/1092 (removed 54) transitions.
Running 1027 sub problems to find dead transitions.
[2024-05-28 20:03:30] [INFO ] Flow matrix only has 1029 transitions (discarded 9 similar events)
// Phase 1: matrix 1029 rows 410 cols
[2024-05-28 20:03:30] [INFO ] Computed 62 invariants in 53 ms
[2024-05-28 20:03:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-28 20:03:43] [INFO ] Deduced a trap composed of 131 places in 138 ms of which 3 ms to minimize.
[2024-05-28 20:03:43] [INFO ] Deduced a trap composed of 116 places in 153 ms of which 3 ms to minimize.
[2024-05-28 20:03:43] [INFO ] Deduced a trap composed of 126 places in 175 ms of which 3 ms to minimize.
[2024-05-28 20:03:44] [INFO ] Deduced a trap composed of 126 places in 140 ms of which 2 ms to minimize.
[2024-05-28 20:03:44] [INFO ] Deduced a trap composed of 121 places in 161 ms of which 2 ms to minimize.
[2024-05-28 20:03:44] [INFO ] Deduced a trap composed of 168 places in 218 ms of which 3 ms to minimize.
[2024-05-28 20:03:44] [INFO ] Deduced a trap composed of 131 places in 172 ms of which 3 ms to minimize.
[2024-05-28 20:03:44] [INFO ] Deduced a trap composed of 126 places in 212 ms of which 2 ms to minimize.
[2024-05-28 20:03:45] [INFO ] Deduced a trap composed of 126 places in 160 ms of which 3 ms to minimize.
[2024-05-28 20:03:45] [INFO ] Deduced a trap composed of 126 places in 205 ms of which 3 ms to minimize.
[2024-05-28 20:03:45] [INFO ] Deduced a trap composed of 126 places in 176 ms of which 2 ms to minimize.
[2024-05-28 20:03:45] [INFO ] Deduced a trap composed of 126 places in 132 ms of which 3 ms to minimize.
[2024-05-28 20:03:45] [INFO ] Deduced a trap composed of 126 places in 139 ms of which 2 ms to minimize.
[2024-05-28 20:03:45] [INFO ] Deduced a trap composed of 131 places in 141 ms of which 2 ms to minimize.
[2024-05-28 20:03:46] [INFO ] Deduced a trap composed of 126 places in 150 ms of which 2 ms to minimize.
[2024-05-28 20:03:46] [INFO ] Deduced a trap composed of 126 places in 156 ms of which 2 ms to minimize.
[2024-05-28 20:03:46] [INFO ] Deduced a trap composed of 121 places in 153 ms of which 2 ms to minimize.
[2024-05-28 20:03:46] [INFO ] Deduced a trap composed of 116 places in 142 ms of which 3 ms to minimize.
[2024-05-28 20:03:46] [INFO ] Deduced a trap composed of 166 places in 146 ms of which 2 ms to minimize.
[2024-05-28 20:03:46] [INFO ] Deduced a trap composed of 168 places in 142 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-28 20:03:51] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 2 ms to minimize.
[2024-05-28 20:03:52] [INFO ] Deduced a trap composed of 166 places in 178 ms of which 3 ms to minimize.
[2024-05-28 20:03:53] [INFO ] Deduced a trap composed of 164 places in 154 ms of which 3 ms to minimize.
[2024-05-28 20:03:53] [INFO ] Deduced a trap composed of 166 places in 181 ms of which 3 ms to minimize.
[2024-05-28 20:03:53] [INFO ] Deduced a trap composed of 166 places in 155 ms of which 3 ms to minimize.
[2024-05-28 20:03:53] [INFO ] Deduced a trap composed of 163 places in 161 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 6/78 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/1439 variables, and 78 constraints, problems are : Problem set: 0 solved, 1027 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1027/1027 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1027 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-28 20:03:58] [INFO ] Deduced a trap composed of 166 places in 136 ms of which 2 ms to minimize.
[2024-05-28 20:03:58] [INFO ] Deduced a trap composed of 168 places in 165 ms of which 2 ms to minimize.
[2024-05-28 20:03:58] [INFO ] Deduced a trap composed of 166 places in 155 ms of which 2 ms to minimize.
[2024-05-28 20:03:59] [INFO ] Deduced a trap composed of 166 places in 166 ms of which 2 ms to minimize.
[2024-05-28 20:03:59] [INFO ] Deduced a trap composed of 164 places in 134 ms of which 2 ms to minimize.
[2024-05-28 20:03:59] [INFO ] Deduced a trap composed of 168 places in 131 ms of which 2 ms to minimize.
[2024-05-28 20:03:59] [INFO ] Deduced a trap composed of 172 places in 131 ms of which 14 ms to minimize.
[2024-05-28 20:03:59] [INFO ] Deduced a trap composed of 106 places in 169 ms of which 15 ms to minimize.
[2024-05-28 20:04:00] [INFO ] Deduced a trap composed of 121 places in 151 ms of which 2 ms to minimize.
[2024-05-28 20:04:00] [INFO ] Deduced a trap composed of 116 places in 132 ms of which 2 ms to minimize.
[2024-05-28 20:04:00] [INFO ] Deduced a trap composed of 121 places in 157 ms of which 2 ms to minimize.
[2024-05-28 20:04:00] [INFO ] Deduced a trap composed of 121 places in 138 ms of which 2 ms to minimize.
[2024-05-28 20:04:00] [INFO ] Deduced a trap composed of 111 places in 155 ms of which 2 ms to minimize.
[2024-05-28 20:04:00] [INFO ] Deduced a trap composed of 126 places in 136 ms of which 2 ms to minimize.
[2024-05-28 20:04:00] [INFO ] Deduced a trap composed of 111 places in 143 ms of which 4 ms to minimize.
[2024-05-28 20:04:01] [INFO ] Deduced a trap composed of 116 places in 163 ms of which 2 ms to minimize.
[2024-05-28 20:04:01] [INFO ] Deduced a trap composed of 136 places in 132 ms of which 2 ms to minimize.
[2024-05-28 20:04:01] [INFO ] Deduced a trap composed of 136 places in 144 ms of which 3 ms to minimize.
[2024-05-28 20:04:01] [INFO ] Deduced a trap composed of 136 places in 139 ms of which 2 ms to minimize.
[2024-05-28 20:04:01] [INFO ] Deduced a trap composed of 168 places in 140 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-28 20:04:02] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 3 ms to minimize.
[2024-05-28 20:04:02] [INFO ] Deduced a trap composed of 173 places in 210 ms of which 2 ms to minimize.
[2024-05-28 20:04:03] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 2 ms to minimize.
[2024-05-28 20:04:03] [INFO ] Deduced a trap composed of 135 places in 228 ms of which 2 ms to minimize.
[2024-05-28 20:04:03] [INFO ] Deduced a trap composed of 126 places in 231 ms of which 2 ms to minimize.
[2024-05-28 20:04:03] [INFO ] Deduced a trap composed of 179 places in 223 ms of which 2 ms to minimize.
[2024-05-28 20:04:04] [INFO ] Deduced a trap composed of 170 places in 223 ms of which 2 ms to minimize.
[2024-05-28 20:04:04] [INFO ] Deduced a trap composed of 135 places in 230 ms of which 3 ms to minimize.
[2024-05-28 20:04:04] [INFO ] Deduced a trap composed of 121 places in 214 ms of which 2 ms to minimize.
[2024-05-28 20:04:04] [INFO ] Deduced a trap composed of 168 places in 210 ms of which 3 ms to minimize.
[2024-05-28 20:04:05] [INFO ] Deduced a trap composed of 135 places in 214 ms of which 2 ms to minimize.
[2024-05-28 20:04:05] [INFO ] Deduced a trap composed of 126 places in 207 ms of which 2 ms to minimize.
[2024-05-28 20:04:05] [INFO ] Deduced a trap composed of 185 places in 220 ms of which 2 ms to minimize.
[2024-05-28 20:04:05] [INFO ] Deduced a trap composed of 170 places in 247 ms of which 2 ms to minimize.
[2024-05-28 20:04:06] [INFO ] Deduced a trap composed of 131 places in 231 ms of which 2 ms to minimize.
[2024-05-28 20:04:06] [INFO ] Deduced a trap composed of 125 places in 231 ms of which 3 ms to minimize.
[2024-05-28 20:04:06] [INFO ] Deduced a trap composed of 121 places in 239 ms of which 2 ms to minimize.
[2024-05-28 20:04:06] [INFO ] Deduced a trap composed of 120 places in 242 ms of which 3 ms to minimize.
[2024-05-28 20:04:07] [INFO ] Deduced a trap composed of 116 places in 208 ms of which 2 ms to minimize.
[2024-05-28 20:04:07] [INFO ] Deduced a trap composed of 121 places in 213 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-28 20:04:08] [INFO ] Deduced a trap composed of 172 places in 166 ms of which 2 ms to minimize.
[2024-05-28 20:04:08] [INFO ] Deduced a trap composed of 172 places in 133 ms of which 2 ms to minimize.
[2024-05-28 20:04:08] [INFO ] Deduced a trap composed of 168 places in 142 ms of which 2 ms to minimize.
[2024-05-28 20:04:09] [INFO ] Deduced a trap composed of 166 places in 166 ms of which 3 ms to minimize.
[2024-05-28 20:04:09] [INFO ] Deduced a trap composed of 168 places in 140 ms of which 2 ms to minimize.
[2024-05-28 20:04:10] [INFO ] Deduced a trap composed of 170 places in 130 ms of which 2 ms to minimize.
[2024-05-28 20:04:10] [INFO ] Deduced a trap composed of 172 places in 131 ms of which 2 ms to minimize.
[2024-05-28 20:04:10] [INFO ] Deduced a trap composed of 111 places in 119 ms of which 3 ms to minimize.
[2024-05-28 20:04:10] [INFO ] Deduced a trap composed of 131 places in 170 ms of which 3 ms to minimize.
[2024-05-28 20:04:10] [INFO ] Deduced a trap composed of 116 places in 142 ms of which 2 ms to minimize.
[2024-05-28 20:04:10] [INFO ] Deduced a trap composed of 162 places in 138 ms of which 2 ms to minimize.
[2024-05-28 20:04:11] [INFO ] Deduced a trap composed of 164 places in 192 ms of which 3 ms to minimize.
[2024-05-28 20:04:11] [INFO ] Deduced a trap composed of 131 places in 197 ms of which 3 ms to minimize.
[2024-05-28 20:04:11] [INFO ] Deduced a trap composed of 116 places in 158 ms of which 2 ms to minimize.
[2024-05-28 20:04:11] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 2 ms to minimize.
[2024-05-28 20:04:11] [INFO ] Deduced a trap composed of 171 places in 189 ms of which 3 ms to minimize.
[2024-05-28 20:04:12] [INFO ] Deduced a trap composed of 132 places in 184 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 400/1439 variables, and 135 constraints, problems are : Problem set: 0 solved, 1027 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1027 constraints, Known Traps: 83/83 constraints]
After SMT, in 46778ms problems are : Problem set: 0 solved, 1027 unsolved
Search for dead transitions found 0 dead transitions in 46791ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46944 ms. Remains : 410/474 places, 1038/1092 transitions.
RANDOM walk for 40000 steps (2905 resets) in 703 ms. (56 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (394 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
[2024-05-28 20:04:17] [INFO ] Flow matrix only has 1029 transitions (discarded 9 similar events)
[2024-05-28 20:04:17] [INFO ] Invariant cache hit.
[2024-05-28 20:04:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/399 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/408 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/409 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1029/1438 variables, 409/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1438 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1438 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1439 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1439 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1439 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1439/1439 variables, and 473 constraints, problems are : Problem set: 0 solved, 1 unsolved in 546 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 410/410 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/399 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/408 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/409 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1029/1438 variables, 409/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1438 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 20:04:19] [INFO ] Deduced a trap composed of 168 places in 367 ms of which 2 ms to minimize.
[2024-05-28 20:04:19] [INFO ] Deduced a trap composed of 163 places in 219 ms of which 2 ms to minimize.
[2024-05-28 20:04:19] [INFO ] Deduced a trap composed of 164 places in 221 ms of which 3 ms to minimize.
[2024-05-28 20:04:19] [INFO ] Deduced a trap composed of 160 places in 264 ms of which 3 ms to minimize.
[2024-05-28 20:04:20] [INFO ] Deduced a trap composed of 160 places in 256 ms of which 3 ms to minimize.
[2024-05-28 20:04:20] [INFO ] Deduced a trap composed of 170 places in 248 ms of which 3 ms to minimize.
[2024-05-28 20:04:20] [INFO ] Deduced a trap composed of 156 places in 288 ms of which 3 ms to minimize.
[2024-05-28 20:04:21] [INFO ] Deduced a trap composed of 174 places in 247 ms of which 3 ms to minimize.
[2024-05-28 20:04:21] [INFO ] Deduced a trap composed of 164 places in 221 ms of which 5 ms to minimize.
[2024-05-28 20:04:21] [INFO ] Deduced a trap composed of 166 places in 308 ms of which 3 ms to minimize.
[2024-05-28 20:04:22] [INFO ] Deduced a trap composed of 156 places in 282 ms of which 3 ms to minimize.
[2024-05-28 20:04:22] [INFO ] Deduced a trap composed of 171 places in 285 ms of which 3 ms to minimize.
[2024-05-28 20:04:22] [INFO ] Deduced a trap composed of 158 places in 273 ms of which 3 ms to minimize.
[2024-05-28 20:04:22] [INFO ] Deduced a trap composed of 168 places in 253 ms of which 3 ms to minimize.
[2024-05-28 20:04:23] [INFO ] Deduced a trap composed of 168 places in 220 ms of which 3 ms to minimize.
[2024-05-28 20:04:23] [INFO ] Deduced a trap composed of 171 places in 260 ms of which 3 ms to minimize.
[2024-05-28 20:04:23] [INFO ] Deduced a trap composed of 164 places in 241 ms of which 3 ms to minimize.
[2024-05-28 20:04:24] [INFO ] Deduced a trap composed of 158 places in 250 ms of which 2 ms to minimize.
[2024-05-28 20:04:24] [INFO ] Deduced a trap composed of 164 places in 290 ms of which 3 ms to minimize.
[2024-05-28 20:04:24] [INFO ] Deduced a trap composed of 160 places in 294 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1438 variables, 20/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 20:04:25] [INFO ] Deduced a trap composed of 166 places in 314 ms of which 3 ms to minimize.
[2024-05-28 20:04:25] [INFO ] Deduced a trap composed of 158 places in 290 ms of which 3 ms to minimize.
[2024-05-28 20:04:26] [INFO ] Deduced a trap composed of 164 places in 283 ms of which 3 ms to minimize.
[2024-05-28 20:04:26] [INFO ] Deduced a trap composed of 164 places in 279 ms of which 3 ms to minimize.
[2024-05-28 20:04:27] [INFO ] Deduced a trap composed of 156 places in 312 ms of which 3 ms to minimize.
[2024-05-28 20:04:27] [INFO ] Deduced a trap composed of 160 places in 293 ms of which 3 ms to minimize.
[2024-05-28 20:04:28] [INFO ] Deduced a trap composed of 160 places in 272 ms of which 3 ms to minimize.
[2024-05-28 20:04:28] [INFO ] Deduced a trap composed of 156 places in 262 ms of which 3 ms to minimize.
[2024-05-28 20:04:28] [INFO ] Deduced a trap composed of 164 places in 230 ms of which 3 ms to minimize.
[2024-05-28 20:04:28] [INFO ] Deduced a trap composed of 162 places in 234 ms of which 4 ms to minimize.
[2024-05-28 20:04:29] [INFO ] Deduced a trap composed of 168 places in 226 ms of which 3 ms to minimize.
[2024-05-28 20:04:29] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 3 ms to minimize.
[2024-05-28 20:04:29] [INFO ] Deduced a trap composed of 154 places in 300 ms of which 3 ms to minimize.
[2024-05-28 20:04:30] [INFO ] Deduced a trap composed of 168 places in 335 ms of which 2 ms to minimize.
[2024-05-28 20:04:30] [INFO ] Deduced a trap composed of 164 places in 234 ms of which 3 ms to minimize.
[2024-05-28 20:04:31] [INFO ] Deduced a trap composed of 158 places in 321 ms of which 4 ms to minimize.
[2024-05-28 20:04:32] [INFO ] Deduced a trap composed of 166 places in 245 ms of which 4 ms to minimize.
[2024-05-28 20:04:32] [INFO ] Deduced a trap composed of 166 places in 279 ms of which 3 ms to minimize.
[2024-05-28 20:04:33] [INFO ] Deduced a trap composed of 166 places in 330 ms of which 2 ms to minimize.
[2024-05-28 20:04:33] [INFO ] Deduced a trap composed of 162 places in 515 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1438 variables, 20/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 20:04:34] [INFO ] Deduced a trap composed of 166 places in 452 ms of which 2 ms to minimize.
[2024-05-28 20:04:35] [INFO ] Deduced a trap composed of 164 places in 1019 ms of which 3 ms to minimize.
[2024-05-28 20:04:35] [INFO ] Deduced a trap composed of 178 places in 341 ms of which 3 ms to minimize.
[2024-05-28 20:04:36] [INFO ] Deduced a trap composed of 169 places in 367 ms of which 2 ms to minimize.
[2024-05-28 20:04:36] [INFO ] Deduced a trap composed of 166 places in 297 ms of which 2 ms to minimize.
[2024-05-28 20:04:36] [INFO ] Deduced a trap composed of 166 places in 269 ms of which 3 ms to minimize.
[2024-05-28 20:04:37] [INFO ] Deduced a trap composed of 173 places in 263 ms of which 4 ms to minimize.
[2024-05-28 20:04:37] [INFO ] Deduced a trap composed of 160 places in 276 ms of which 2 ms to minimize.
[2024-05-28 20:04:37] [INFO ] Deduced a trap composed of 171 places in 289 ms of which 3 ms to minimize.
[2024-05-28 20:04:38] [INFO ] Deduced a trap composed of 154 places in 298 ms of which 3 ms to minimize.
[2024-05-28 20:04:38] [INFO ] Deduced a trap composed of 164 places in 268 ms of which 3 ms to minimize.
[2024-05-28 20:04:38] [INFO ] Deduced a trap composed of 166 places in 326 ms of which 3 ms to minimize.
[2024-05-28 20:04:40] [INFO ] Deduced a trap composed of 166 places in 317 ms of which 3 ms to minimize.
[2024-05-28 20:04:40] [INFO ] Deduced a trap composed of 162 places in 342 ms of which 3 ms to minimize.
[2024-05-28 20:04:41] [INFO ] Deduced a trap composed of 162 places in 291 ms of which 2 ms to minimize.
[2024-05-28 20:04:41] [INFO ] Deduced a trap composed of 166 places in 356 ms of which 2 ms to minimize.
[2024-05-28 20:04:41] [INFO ] Deduced a trap composed of 171 places in 343 ms of which 2 ms to minimize.
[2024-05-28 20:04:42] [INFO ] Deduced a trap composed of 158 places in 336 ms of which 3 ms to minimize.
[2024-05-28 20:04:42] [INFO ] Deduced a trap composed of 158 places in 315 ms of which 2 ms to minimize.
[2024-05-28 20:04:43] [INFO ] Deduced a trap composed of 160 places in 349 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1438 variables, 20/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 20:04:43] [INFO ] Deduced a trap composed of 158 places in 377 ms of which 2 ms to minimize.
[2024-05-28 20:04:43] [INFO ] Deduced a trap composed of 162 places in 387 ms of which 3 ms to minimize.
[2024-05-28 20:04:44] [INFO ] Deduced a trap composed of 162 places in 337 ms of which 3 ms to minimize.
[2024-05-28 20:04:44] [INFO ] Deduced a trap composed of 158 places in 381 ms of which 3 ms to minimize.
[2024-05-28 20:04:45] [INFO ] Deduced a trap composed of 160 places in 318 ms of which 3 ms to minimize.
[2024-05-28 20:04:45] [INFO ] Deduced a trap composed of 169 places in 313 ms of which 3 ms to minimize.
[2024-05-28 20:04:45] [INFO ] Deduced a trap composed of 158 places in 282 ms of which 4 ms to minimize.
[2024-05-28 20:04:46] [INFO ] Deduced a trap composed of 158 places in 271 ms of which 3 ms to minimize.
[2024-05-28 20:04:46] [INFO ] Deduced a trap composed of 173 places in 250 ms of which 5 ms to minimize.
[2024-05-28 20:04:46] [INFO ] Deduced a trap composed of 160 places in 263 ms of which 3 ms to minimize.
[2024-05-28 20:04:47] [INFO ] Deduced a trap composed of 162 places in 268 ms of which 2 ms to minimize.
[2024-05-28 20:04:47] [INFO ] Deduced a trap composed of 177 places in 270 ms of which 2 ms to minimize.
[2024-05-28 20:04:47] [INFO ] Deduced a trap composed of 158 places in 239 ms of which 3 ms to minimize.
[2024-05-28 20:04:48] [INFO ] Deduced a trap composed of 166 places in 252 ms of which 2 ms to minimize.
[2024-05-28 20:04:48] [INFO ] Deduced a trap composed of 168 places in 217 ms of which 2 ms to minimize.
[2024-05-28 20:04:48] [INFO ] Deduced a trap composed of 164 places in 217 ms of which 2 ms to minimize.
[2024-05-28 20:04:48] [INFO ] Deduced a trap composed of 152 places in 205 ms of which 2 ms to minimize.
[2024-05-28 20:04:49] [INFO ] Deduced a trap composed of 164 places in 250 ms of which 2 ms to minimize.
[2024-05-28 20:04:49] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 3 ms to minimize.
[2024-05-28 20:04:49] [INFO ] Deduced a trap composed of 158 places in 188 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1438 variables, 20/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 20:04:49] [INFO ] Deduced a trap composed of 162 places in 177 ms of which 2 ms to minimize.
[2024-05-28 20:04:50] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 3 ms to minimize.
[2024-05-28 20:04:50] [INFO ] Deduced a trap composed of 162 places in 236 ms of which 3 ms to minimize.
[2024-05-28 20:04:50] [INFO ] Deduced a trap composed of 158 places in 200 ms of which 2 ms to minimize.
[2024-05-28 20:04:50] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 3 ms to minimize.
[2024-05-28 20:04:51] [INFO ] Deduced a trap composed of 171 places in 257 ms of which 2 ms to minimize.
[2024-05-28 20:04:51] [INFO ] Deduced a trap composed of 170 places in 192 ms of which 3 ms to minimize.
[2024-05-28 20:04:51] [INFO ] Deduced a trap composed of 173 places in 266 ms of which 2 ms to minimize.
[2024-05-28 20:04:52] [INFO ] Deduced a trap composed of 156 places in 221 ms of which 3 ms to minimize.
[2024-05-28 20:04:52] [INFO ] Deduced a trap composed of 164 places in 306 ms of which 2 ms to minimize.
[2024-05-28 20:04:53] [INFO ] Deduced a trap composed of 162 places in 287 ms of which 3 ms to minimize.
[2024-05-28 20:04:53] [INFO ] Deduced a trap composed of 162 places in 327 ms of which 3 ms to minimize.
[2024-05-28 20:04:54] [INFO ] Deduced a trap composed of 160 places in 317 ms of which 3 ms to minimize.
[2024-05-28 20:04:54] [INFO ] Deduced a trap composed of 158 places in 315 ms of which 3 ms to minimize.
[2024-05-28 20:04:55] [INFO ] Deduced a trap composed of 158 places in 303 ms of which 3 ms to minimize.
[2024-05-28 20:04:56] [INFO ] Deduced a trap composed of 162 places in 302 ms of which 3 ms to minimize.
[2024-05-28 20:04:56] [INFO ] Deduced a trap composed of 160 places in 321 ms of which 4 ms to minimize.
[2024-05-28 20:04:57] [INFO ] Deduced a trap composed of 160 places in 288 ms of which 3 ms to minimize.
[2024-05-28 20:04:58] [INFO ] Deduced a trap composed of 160 places in 247 ms of which 2 ms to minimize.
[2024-05-28 20:04:58] [INFO ] Deduced a trap composed of 158 places in 228 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1438 variables, 20/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 20:04:58] [INFO ] Deduced a trap composed of 156 places in 261 ms of which 2 ms to minimize.
[2024-05-28 20:04:59] [INFO ] Deduced a trap composed of 156 places in 287 ms of which 2 ms to minimize.
[2024-05-28 20:04:59] [INFO ] Deduced a trap composed of 160 places in 226 ms of which 2 ms to minimize.
[2024-05-28 20:04:59] [INFO ] Deduced a trap composed of 177 places in 220 ms of which 2 ms to minimize.
[2024-05-28 20:05:00] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 2 ms to minimize.
[2024-05-28 20:05:00] [INFO ] Deduced a trap composed of 166 places in 243 ms of which 2 ms to minimize.
[2024-05-28 20:05:00] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 3 ms to minimize.
[2024-05-28 20:05:00] [INFO ] Deduced a trap composed of 158 places in 211 ms of which 2 ms to minimize.
[2024-05-28 20:05:01] [INFO ] Deduced a trap composed of 169 places in 190 ms of which 3 ms to minimize.
[2024-05-28 20:05:01] [INFO ] Deduced a trap composed of 158 places in 202 ms of which 2 ms to minimize.
[2024-05-28 20:05:01] [INFO ] Deduced a trap composed of 160 places in 211 ms of which 2 ms to minimize.
[2024-05-28 20:05:01] [INFO ] Deduced a trap composed of 175 places in 210 ms of which 2 ms to minimize.
[2024-05-28 20:05:02] [INFO ] Deduced a trap composed of 160 places in 189 ms of which 2 ms to minimize.
[2024-05-28 20:05:02] [INFO ] Deduced a trap composed of 162 places in 191 ms of which 2 ms to minimize.
[2024-05-28 20:05:02] [INFO ] Deduced a trap composed of 160 places in 221 ms of which 3 ms to minimize.
[2024-05-28 20:05:02] [INFO ] Deduced a trap composed of 158 places in 202 ms of which 3 ms to minimize.
[2024-05-28 20:05:03] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 2 ms to minimize.
[2024-05-28 20:05:03] [INFO ] Deduced a trap composed of 160 places in 218 ms of which 3 ms to minimize.
SMT process timed out in 45595ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 1038/1038 transitions.
Applied a total of 0 rules in 73 ms. Remains 410 /410 variables (removed 0) and now considering 1038/1038 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 410/410 places, 1038/1038 transitions.
FORMULA PolyORBNT-COL-S10J20-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
FORMULA PolyORBNT-COL-S10J20-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||(p0&&F(G(p1)))))))'
Support contains 2 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1092/1092 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1092
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1091
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1091
Applied a total of 12 rules in 37 ms. Remains 463 /474 variables (removed 11) and now considering 1091/1092 (removed 1) transitions.
Running 1080 sub problems to find dead transitions.
[2024-05-28 20:05:03] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
// Phase 1: matrix 1082 rows 463 cols
[2024-05-28 20:05:03] [INFO ] Computed 62 invariants in 10 ms
[2024-05-28 20:05:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1080 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 462/1545 variables, and 61 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 20:05:32] [INFO ] Deduced a trap composed of 12 places in 387 ms of which 4 ms to minimize.
[2024-05-28 20:05:33] [INFO ] Deduced a trap composed of 20 places in 302 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 452/1545 variables, and 53 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 46/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 2/2 constraints]
After SMT, in 46140ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 46151ms
[2024-05-28 20:05:50] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 20:05:50] [INFO ] Invariant cache hit.
[2024-05-28 20:05:50] [INFO ] Implicit Places using invariants in 434 ms returned []
[2024-05-28 20:05:50] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 20:05:50] [INFO ] Invariant cache hit.
[2024-05-28 20:05:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:05:52] [INFO ] Implicit Places using invariants and state equation in 1728 ms returned []
Implicit Place search using SMT with State Equation took 2165 ms to find 0 implicit places.
Running 1080 sub problems to find dead transitions.
[2024-05-28 20:05:52] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 20:05:52] [INFO ] Invariant cache hit.
[2024-05-28 20:05:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD543 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/463 variables, 1/62 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/62 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
SMT process timed out in 36737ms, After SMT, problems are : Problem set: 57 solved, 1023 unsolved
Search for dead transitions found 57 dead transitions in 36762ms
Found 57 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 57 transitions
Dead transitions reduction (with SMT) removed 57 transitions
Starting structural reductions in LTL mode, iteration 1 : 463/474 places, 1034/1092 transitions.
Applied a total of 0 rules in 12 ms. Remains 463 /463 variables (removed 0) and now considering 1034/1034 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85139 ms. Remains : 463/474 places, 1034/1092 transitions.
Stuttering acceptance computed with spot in 298 ms :[(NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PolyORBNT-COL-S10J20-LTLFireability-02
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 2 ms.
FORMULA PolyORBNT-COL-S10J20-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J20-LTLFireability-02 finished in 85520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1092/1092 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1092
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1091
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1091
Applied a total of 12 rules in 16 ms. Remains 463 /474 variables (removed 11) and now considering 1091/1092 (removed 1) transitions.
Running 1080 sub problems to find dead transitions.
[2024-05-28 20:06:29] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 20:06:29] [INFO ] Invariant cache hit.
[2024-05-28 20:06:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1545 variables, and 61 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 20:07:05] [INFO ] Deduced a trap composed of 12 places in 269 ms of which 3 ms to minimize.
[2024-05-28 20:07:13] [INFO ] Deduced a trap composed of 24 places in 239 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/1545 variables, and 63 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 2/2 constraints]
After SMT, in 45437ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 45450ms
[2024-05-28 20:07:14] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 20:07:14] [INFO ] Invariant cache hit.
[2024-05-28 20:07:15] [INFO ] Implicit Places using invariants in 435 ms returned []
[2024-05-28 20:07:15] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 20:07:15] [INFO ] Invariant cache hit.
[2024-05-28 20:07:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:07:17] [INFO ] Implicit Places using invariants and state equation in 2000 ms returned []
Implicit Place search using SMT with State Equation took 2438 ms to find 0 implicit places.
Running 1080 sub problems to find dead transitions.
[2024-05-28 20:07:17] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 20:07:17] [INFO ] Invariant cache hit.
[2024-05-28 20:07:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD543 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/463 variables, 1/62 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/62 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
SMT process timed out in 36232ms, After SMT, problems are : Problem set: 57 solved, 1023 unsolved
Search for dead transitions found 57 dead transitions in 36255ms
Found 57 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 57 transitions
Dead transitions reduction (with SMT) removed 57 transitions
Starting structural reductions in LTL mode, iteration 1 : 463/474 places, 1034/1092 transitions.
Applied a total of 0 rules in 10 ms. Remains 463 /463 variables (removed 0) and now considering 1034/1034 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 84180 ms. Remains : 463/474 places, 1034/1092 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J20-LTLFireability-03
Product exploration explored 100000 steps with 32797 reset in 651 ms.
Product exploration explored 100000 steps with 32823 reset in 490 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 122 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 41 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 100 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 463 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 1034/1034 transitions.
Applied a total of 0 rules in 22 ms. Remains 463 /463 variables (removed 0) and now considering 1034/1034 (removed 0) transitions.
Running 1023 sub problems to find dead transitions.
[2024-05-28 20:07:55] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2024-05-28 20:07:55] [INFO ] Computed 62 invariants in 24 ms
[2024-05-28 20:07:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
[2024-05-28 20:08:19] [INFO ] Deduced a trap composed of 174 places in 275 ms of which 3 ms to minimize.
[2024-05-28 20:08:19] [INFO ] Deduced a trap composed of 221 places in 258 ms of which 2 ms to minimize.
[2024-05-28 20:08:19] [INFO ] Deduced a trap composed of 220 places in 226 ms of which 3 ms to minimize.
[2024-05-28 20:08:20] [INFO ] Deduced a trap composed of 220 places in 230 ms of which 3 ms to minimize.
[2024-05-28 20:08:20] [INFO ] Deduced a trap composed of 174 places in 222 ms of which 5 ms to minimize.
[2024-05-28 20:08:20] [INFO ] Deduced a trap composed of 174 places in 183 ms of which 3 ms to minimize.
SMT process timed out in 25235ms, After SMT, problems are : Problem set: 0 solved, 1023 unsolved
Search for dead transitions found 0 dead transitions in 25251ms
[2024-05-28 20:08:20] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2024-05-28 20:08:20] [INFO ] Invariant cache hit.
[2024-05-28 20:08:20] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-05-28 20:08:20] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2024-05-28 20:08:20] [INFO ] Invariant cache hit.
[2024-05-28 20:08:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:08:22] [INFO ] Implicit Places using invariants and state equation in 1743 ms returned []
Implicit Place search using SMT with State Equation took 2022 ms to find 0 implicit places.
Running 1023 sub problems to find dead transitions.
[2024-05-28 20:08:22] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2024-05-28 20:08:22] [INFO ] Invariant cache hit.
[2024-05-28 20:08:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
[2024-05-28 20:08:43] [INFO ] Deduced a trap composed of 215 places in 171 ms of which 2 ms to minimize.
[2024-05-28 20:08:43] [INFO ] Deduced a trap composed of 204 places in 165 ms of which 2 ms to minimize.
[2024-05-28 20:08:43] [INFO ] Deduced a trap composed of 178 places in 178 ms of which 3 ms to minimize.
[2024-05-28 20:08:44] [INFO ] Deduced a trap composed of 178 places in 184 ms of which 2 ms to minimize.
[2024-05-28 20:08:44] [INFO ] Deduced a trap composed of 213 places in 187 ms of which 3 ms to minimize.
[2024-05-28 20:08:44] [INFO ] Deduced a trap composed of 221 places in 259 ms of which 3 ms to minimize.
[2024-05-28 20:08:44] [INFO ] Deduced a trap composed of 203 places in 208 ms of which 3 ms to minimize.
[2024-05-28 20:08:45] [INFO ] Deduced a trap composed of 217 places in 252 ms of which 8 ms to minimize.
[2024-05-28 20:08:45] [INFO ] Deduced a trap composed of 198 places in 219 ms of which 3 ms to minimize.
[2024-05-28 20:08:45] [INFO ] Deduced a trap composed of 198 places in 238 ms of which 3 ms to minimize.
[2024-05-28 20:08:45] [INFO ] Deduced a trap composed of 214 places in 211 ms of which 3 ms to minimize.
[2024-05-28 20:08:46] [INFO ] Deduced a trap composed of 198 places in 256 ms of which 3 ms to minimize.
[2024-05-28 20:08:46] [INFO ] Deduced a trap composed of 218 places in 230 ms of which 3 ms to minimize.
[2024-05-28 20:08:46] [INFO ] Deduced a trap composed of 218 places in 278 ms of which 4 ms to minimize.
[2024-05-28 20:08:46] [INFO ] Deduced a trap composed of 220 places in 270 ms of which 4 ms to minimize.
[2024-05-28 20:08:47] [INFO ] Deduced a trap composed of 216 places in 209 ms of which 2 ms to minimize.
[2024-05-28 20:08:47] [INFO ] Deduced a trap composed of 158 places in 194 ms of which 3 ms to minimize.
[2024-05-28 20:08:47] [INFO ] Deduced a trap composed of 216 places in 178 ms of which 2 ms to minimize.
[2024-05-28 20:08:47] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 2 ms to minimize.
[2024-05-28 20:08:47] [INFO ] Deduced a trap composed of 209 places in 191 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
[2024-05-28 20:08:53] [INFO ] Deduced a trap composed of 24 places in 254 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
[2024-05-28 20:08:54] [INFO ] Deduced a trap composed of 178 places in 178 ms of which 2 ms to minimize.
[2024-05-28 20:08:54] [INFO ] Deduced a trap composed of 163 places in 189 ms of which 2 ms to minimize.
[2024-05-28 20:08:55] [INFO ] Deduced a trap composed of 168 places in 192 ms of which 3 ms to minimize.
[2024-05-28 20:08:55] [INFO ] Deduced a trap composed of 163 places in 201 ms of which 3 ms to minimize.
[2024-05-28 20:08:55] [INFO ] Deduced a trap composed of 158 places in 188 ms of which 2 ms to minimize.
[2024-05-28 20:08:55] [INFO ] Deduced a trap composed of 173 places in 188 ms of which 2 ms to minimize.
[2024-05-28 20:08:56] [INFO ] Deduced a trap composed of 215 places in 185 ms of which 2 ms to minimize.
[2024-05-28 20:08:56] [INFO ] Deduced a trap composed of 223 places in 185 ms of which 2 ms to minimize.
[2024-05-28 20:08:56] [INFO ] Deduced a trap composed of 202 places in 183 ms of which 3 ms to minimize.
[2024-05-28 20:08:56] [INFO ] Deduced a trap composed of 202 places in 180 ms of which 3 ms to minimize.
[2024-05-28 20:08:56] [INFO ] Deduced a trap composed of 159 places in 194 ms of which 2 ms to minimize.
[2024-05-28 20:08:56] [INFO ] Deduced a trap composed of 221 places in 181 ms of which 3 ms to minimize.
[2024-05-28 20:08:57] [INFO ] Deduced a trap composed of 219 places in 194 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1488 variables, and 95 constraints, problems are : Problem set: 0 solved, 1023 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1023/1023 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1023 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 34/95 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
[2024-05-28 20:09:07] [INFO ] Deduced a trap composed of 12 places in 218 ms of which 2 ms to minimize.
[2024-05-28 20:09:07] [INFO ] Deduced a trap composed of 213 places in 214 ms of which 2 ms to minimize.
[2024-05-28 20:09:07] [INFO ] Deduced a trap composed of 222 places in 238 ms of which 2 ms to minimize.
[2024-05-28 20:09:07] [INFO ] Deduced a trap composed of 213 places in 224 ms of which 2 ms to minimize.
[2024-05-28 20:09:08] [INFO ] Deduced a trap composed of 227 places in 211 ms of which 2 ms to minimize.
[2024-05-28 20:09:08] [INFO ] Deduced a trap composed of 233 places in 201 ms of which 3 ms to minimize.
[2024-05-28 20:09:08] [INFO ] Deduced a trap composed of 217 places in 203 ms of which 2 ms to minimize.
[2024-05-28 20:09:08] [INFO ] Deduced a trap composed of 225 places in 197 ms of which 2 ms to minimize.
[2024-05-28 20:09:09] [INFO ] Deduced a trap composed of 225 places in 210 ms of which 2 ms to minimize.
[2024-05-28 20:09:09] [INFO ] Deduced a trap composed of 215 places in 192 ms of which 2 ms to minimize.
[2024-05-28 20:09:09] [INFO ] Deduced a trap composed of 218 places in 198 ms of which 3 ms to minimize.
[2024-05-28 20:09:09] [INFO ] Deduced a trap composed of 214 places in 213 ms of which 2 ms to minimize.
[2024-05-28 20:09:09] [INFO ] Deduced a trap composed of 214 places in 214 ms of which 3 ms to minimize.
[2024-05-28 20:09:10] [INFO ] Deduced a trap composed of 208 places in 206 ms of which 2 ms to minimize.
[2024-05-28 20:09:10] [INFO ] Deduced a trap composed of 216 places in 223 ms of which 2 ms to minimize.
[2024-05-28 20:09:10] [INFO ] Deduced a trap composed of 216 places in 210 ms of which 3 ms to minimize.
[2024-05-28 20:09:10] [INFO ] Deduced a trap composed of 214 places in 193 ms of which 2 ms to minimize.
[2024-05-28 20:09:11] [INFO ] Deduced a trap composed of 212 places in 198 ms of which 2 ms to minimize.
[2024-05-28 20:09:11] [INFO ] Deduced a trap composed of 212 places in 206 ms of which 3 ms to minimize.
[2024-05-28 20:09:11] [INFO ] Deduced a trap composed of 214 places in 218 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
[2024-05-28 20:09:14] [INFO ] Deduced a trap composed of 220 places in 184 ms of which 2 ms to minimize.
[2024-05-28 20:09:14] [INFO ] Deduced a trap composed of 212 places in 205 ms of which 2 ms to minimize.
[2024-05-28 20:09:14] [INFO ] Deduced a trap composed of 208 places in 191 ms of which 2 ms to minimize.
[2024-05-28 20:09:15] [INFO ] Deduced a trap composed of 208 places in 186 ms of which 2 ms to minimize.
[2024-05-28 20:09:15] [INFO ] Deduced a trap composed of 210 places in 201 ms of which 2 ms to minimize.
[2024-05-28 20:09:15] [INFO ] Deduced a trap composed of 214 places in 192 ms of which 3 ms to minimize.
[2024-05-28 20:09:15] [INFO ] Deduced a trap composed of 210 places in 200 ms of which 2 ms to minimize.
[2024-05-28 20:09:15] [INFO ] Deduced a trap composed of 218 places in 211 ms of which 2 ms to minimize.
[2024-05-28 20:09:16] [INFO ] Deduced a trap composed of 212 places in 223 ms of which 2 ms to minimize.
[2024-05-28 20:09:16] [INFO ] Deduced a trap composed of 220 places in 257 ms of which 2 ms to minimize.
[2024-05-28 20:09:16] [INFO ] Deduced a trap composed of 216 places in 241 ms of which 2 ms to minimize.
[2024-05-28 20:09:17] [INFO ] Deduced a trap composed of 216 places in 252 ms of which 3 ms to minimize.
[2024-05-28 20:09:18] [INFO ] Deduced a trap composed of 214 places in 283 ms of which 3 ms to minimize.
[2024-05-28 20:09:19] [INFO ] Deduced a trap composed of 218 places in 288 ms of which 3 ms to minimize.
[2024-05-28 20:09:19] [INFO ] Deduced a trap composed of 210 places in 247 ms of which 2 ms to minimize.
[2024-05-28 20:09:20] [INFO ] Deduced a trap composed of 210 places in 263 ms of which 3 ms to minimize.
[2024-05-28 20:09:20] [INFO ] Deduced a trap composed of 208 places in 232 ms of which 3 ms to minimize.
[2024-05-28 20:09:20] [INFO ] Deduced a trap composed of 216 places in 221 ms of which 2 ms to minimize.
[2024-05-28 20:09:20] [INFO ] Deduced a trap composed of 208 places in 218 ms of which 2 ms to minimize.
[2024-05-28 20:09:20] [INFO ] Deduced a trap composed of 210 places in 234 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
[2024-05-28 20:09:25] [INFO ] Deduced a trap composed of 218 places in 277 ms of which 3 ms to minimize.
[2024-05-28 20:09:25] [INFO ] Deduced a trap composed of 212 places in 244 ms of which 2 ms to minimize.
[2024-05-28 20:09:26] [INFO ] Deduced a trap composed of 214 places in 224 ms of which 3 ms to minimize.
[2024-05-28 20:09:26] [INFO ] Deduced a trap composed of 216 places in 251 ms of which 2 ms to minimize.
[2024-05-28 20:09:26] [INFO ] Deduced a trap composed of 214 places in 230 ms of which 2 ms to minimize.
[2024-05-28 20:09:27] [INFO ] Deduced a trap composed of 218 places in 205 ms of which 2 ms to minimize.
[2024-05-28 20:09:27] [INFO ] Deduced a trap composed of 208 places in 277 ms of which 3 ms to minimize.
SMT process timed out in 64866ms, After SMT, problems are : Problem set: 0 solved, 1023 unsolved
Search for dead transitions found 0 dead transitions in 64886ms
Finished structural reductions in LTL mode , in 1 iterations and 92196 ms. Remains : 463/463 places, 1034/1034 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 133 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 177 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 32834 reset in 508 ms.
Product exploration explored 100000 steps with 32787 reset in 467 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 463 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 463/463 places, 1034/1034 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 463 transition count 1034
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 24 place count 463 transition count 1035
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 463 transition count 1035
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 52 places in 1 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 52 place count 463 transition count 1035
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 76 place count 439 transition count 1011
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 100 place count 439 transition count 1011
Deduced a syphon composed of 28 places in 0 ms
Applied a total of 100 rules in 105 ms. Remains 439 /463 variables (removed 24) and now considering 1011/1034 (removed 23) transitions.
Running 1000 sub problems to find dead transitions.
[2024-05-28 20:09:29] [INFO ] Flow matrix only has 1002 transitions (discarded 9 similar events)
// Phase 1: matrix 1002 rows 439 cols
[2024-05-28 20:09:29] [INFO ] Computed 62 invariants in 10 ms
[2024-05-28 20:09:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/429 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/429 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
[2024-05-28 20:09:42] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 2 ms to minimize.
Problem TDEAD633 is UNSAT
[2024-05-28 20:09:42] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 2 ms to minimize.
[2024-05-28 20:09:42] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 3 ms to minimize.
Problem TDEAD635 is UNSAT
[2024-05-28 20:09:43] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 2 ms to minimize.
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem 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 TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
[2024-05-28 20:09:44] [INFO ] Deduced a trap composed of 167 places in 787 ms of which 2 ms to minimize.
[2024-05-28 20:09:44] [INFO ] Deduced a trap composed of 123 places in 136 ms of which 3 ms to minimize.
[2024-05-28 20:09:44] [INFO ] Deduced a trap composed of 123 places in 165 ms of which 2 ms to minimize.
[2024-05-28 20:09:44] [INFO ] Deduced a trap composed of 123 places in 147 ms of which 2 ms to minimize.
[2024-05-28 20:09:45] [INFO ] Deduced a trap composed of 123 places in 146 ms of which 2 ms to minimize.
[2024-05-28 20:09:45] [INFO ] Deduced a trap composed of 118 places in 145 ms of which 3 ms to minimize.
[2024-05-28 20:09:45] [INFO ] Deduced a trap composed of 118 places in 149 ms of which 2 ms to minimize.
[2024-05-28 20:09:45] [INFO ] Deduced a trap composed of 171 places in 144 ms of which 2 ms to minimize.
[2024-05-28 20:09:45] [INFO ] Deduced a trap composed of 133 places in 149 ms of which 2 ms to minimize.
[2024-05-28 20:09:45] [INFO ] Deduced a trap composed of 118 places in 144 ms of which 2 ms to minimize.
[2024-05-28 20:09:45] [INFO ] Deduced a trap composed of 118 places in 144 ms of which 2 ms to minimize.
[2024-05-28 20:09:46] [INFO ] Deduced a trap composed of 128 places in 143 ms of which 2 ms to minimize.
[2024-05-28 20:09:46] [INFO ] Deduced a trap composed of 128 places in 137 ms of which 2 ms to minimize.
[2024-05-28 20:09:46] [INFO ] Deduced a trap composed of 128 places in 142 ms of which 2 ms to minimize.
[2024-05-28 20:09:46] [INFO ] Deduced a trap composed of 118 places in 150 ms of which 2 ms to minimize.
[2024-05-28 20:09:46] [INFO ] Deduced a trap composed of 128 places in 134 ms of which 2 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem 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 TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1009 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/429 variables, 20/72 constraints. Problems are: Problem set: 28 solved, 972 unsolved
[2024-05-28 20:09:47] [INFO ] Deduced a trap composed of 169 places in 139 ms of which 3 ms to minimize.
[2024-05-28 20:09:47] [INFO ] Deduced a trap composed of 173 places in 145 ms of which 2 ms to minimize.
[2024-05-28 20:09:47] [INFO ] Deduced a trap composed of 169 places in 154 ms of which 2 ms to minimize.
[2024-05-28 20:09:47] [INFO ] Deduced a trap composed of 169 places in 158 ms of which 2 ms to minimize.
[2024-05-28 20:09:47] [INFO ] Deduced a trap composed of 169 places in 151 ms of which 2 ms to minimize.
[2024-05-28 20:09:47] [INFO ] Deduced a trap composed of 169 places in 154 ms of which 2 ms to minimize.
[2024-05-28 20:09:48] [INFO ] Deduced a trap composed of 165 places in 136 ms of which 3 ms to minimize.
[2024-05-28 20:09:48] [INFO ] Deduced a trap composed of 167 places in 148 ms of which 2 ms to minimize.
[2024-05-28 20:09:48] [INFO ] Deduced a trap composed of 165 places in 170 ms of which 2 ms to minimize.
[2024-05-28 20:09:48] [INFO ] Deduced a trap composed of 165 places in 143 ms of which 3 ms to minimize.
[2024-05-28 20:09:48] [INFO ] Deduced a trap composed of 163 places in 168 ms of which 2 ms to minimize.
[2024-05-28 20:09:48] [INFO ] Deduced a trap composed of 165 places in 149 ms of which 2 ms to minimize.
[2024-05-28 20:09:49] [INFO ] Deduced a trap composed of 167 places in 150 ms of which 2 ms to minimize.
[2024-05-28 20:09:49] [INFO ] Deduced a trap composed of 165 places in 145 ms of which 2 ms to minimize.
[2024-05-28 20:09:49] [INFO ] Deduced a trap composed of 165 places in 172 ms of which 2 ms to minimize.
[2024-05-28 20:09:49] [INFO ] Deduced a trap composed of 165 places in 151 ms of which 2 ms to minimize.
[2024-05-28 20:09:49] [INFO ] Deduced a trap composed of 163 places in 159 ms of which 2 ms to minimize.
[2024-05-28 20:09:49] [INFO ] Deduced a trap composed of 165 places in 152 ms of which 2 ms to minimize.
[2024-05-28 20:09:50] [INFO ] Deduced a trap composed of 165 places in 146 ms of which 2 ms to minimize.
[2024-05-28 20:09:50] [INFO ] Deduced a trap composed of 165 places in 147 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/429 variables, 20/92 constraints. Problems are: Problem set: 28 solved, 972 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 429/1441 variables, and 92 constraints, problems are : Problem set: 28 solved, 972 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 47/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/439 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1000 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 28 solved, 972 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 24/24 constraints. Problems are: Problem set: 28 solved, 972 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 4/28 constraints. Problems are: Problem set: 28 solved, 972 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 40/68 constraints. Problems are: Problem set: 28 solved, 972 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/68 constraints. Problems are: Problem set: 28 solved, 972 unsolved
At refinement iteration 4 (OVERLAPS) 36/438 variables, 32/100 constraints. Problems are: Problem set: 28 solved, 972 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 1/101 constraints. Problems are: Problem set: 28 solved, 972 unsolved
[2024-05-28 20:10:00] [INFO ] Deduced a trap composed of 58 places in 324 ms of which 3 ms to minimize.
[2024-05-28 20:10:00] [INFO ] Deduced a trap composed of 174 places in 221 ms of which 2 ms to minimize.
[2024-05-28 20:10:00] [INFO ] Deduced a trap composed of 167 places in 228 ms of which 2 ms to minimize.
[2024-05-28 20:10:01] [INFO ] Deduced a trap composed of 159 places in 219 ms of which 2 ms to minimize.
[2024-05-28 20:10:01] [INFO ] Deduced a trap composed of 176 places in 222 ms of which 2 ms to minimize.
[2024-05-28 20:10:01] [INFO ] Deduced a trap composed of 185 places in 226 ms of which 3 ms to minimize.
[2024-05-28 20:10:01] [INFO ] Deduced a trap composed of 179 places in 216 ms of which 2 ms to minimize.
[2024-05-28 20:10:01] [INFO ] Deduced a trap composed of 182 places in 211 ms of which 2 ms to minimize.
[2024-05-28 20:10:02] [INFO ] Deduced a trap composed of 177 places in 217 ms of which 2 ms to minimize.
[2024-05-28 20:10:02] [INFO ] Deduced a trap composed of 174 places in 227 ms of which 2 ms to minimize.
[2024-05-28 20:10:02] [INFO ] Deduced a trap composed of 177 places in 244 ms of which 2 ms to minimize.
[2024-05-28 20:10:02] [INFO ] Deduced a trap composed of 176 places in 204 ms of which 2 ms to minimize.
[2024-05-28 20:10:03] [INFO ] Deduced a trap composed of 169 places in 250 ms of which 2 ms to minimize.
[2024-05-28 20:10:03] [INFO ] Deduced a trap composed of 176 places in 209 ms of which 2 ms to minimize.
[2024-05-28 20:10:03] [INFO ] Deduced a trap composed of 176 places in 214 ms of which 2 ms to minimize.
[2024-05-28 20:10:03] [INFO ] Deduced a trap composed of 116 places in 210 ms of which 3 ms to minimize.
[2024-05-28 20:10:04] [INFO ] Deduced a trap composed of 113 places in 206 ms of which 2 ms to minimize.
[2024-05-28 20:10:04] [INFO ] Deduced a trap composed of 122 places in 210 ms of which 2 ms to minimize.
[2024-05-28 20:10:04] [INFO ] Deduced a trap composed of 119 places in 229 ms of which 3 ms to minimize.
[2024-05-28 20:10:04] [INFO ] Deduced a trap composed of 161 places in 220 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 20/121 constraints. Problems are: Problem set: 28 solved, 972 unsolved
[2024-05-28 20:10:07] [INFO ] Deduced a trap composed of 113 places in 271 ms of which 3 ms to minimize.
[2024-05-28 20:10:07] [INFO ] Deduced a trap composed of 113 places in 257 ms of which 2 ms to minimize.
[2024-05-28 20:10:07] [INFO ] Deduced a trap composed of 108 places in 241 ms of which 3 ms to minimize.
[2024-05-28 20:10:07] [INFO ] Deduced a trap composed of 122 places in 213 ms of which 2 ms to minimize.
[2024-05-28 20:10:08] [INFO ] Deduced a trap composed of 123 places in 245 ms of which 2 ms to minimize.
[2024-05-28 20:10:08] [INFO ] Deduced a trap composed of 118 places in 251 ms of which 2 ms to minimize.
[2024-05-28 20:10:08] [INFO ] Deduced a trap composed of 133 places in 225 ms of which 2 ms to minimize.
[2024-05-28 20:10:08] [INFO ] Deduced a trap composed of 114 places in 204 ms of which 2 ms to minimize.
[2024-05-28 20:10:09] [INFO ] Deduced a trap composed of 136 places in 201 ms of which 2 ms to minimize.
[2024-05-28 20:10:09] [INFO ] Deduced a trap composed of 118 places in 205 ms of which 2 ms to minimize.
[2024-05-28 20:10:09] [INFO ] Deduced a trap composed of 136 places in 209 ms of which 3 ms to minimize.
[2024-05-28 20:10:09] [INFO ] Deduced a trap composed of 124 places in 235 ms of which 3 ms to minimize.
[2024-05-28 20:10:10] [INFO ] Deduced a trap composed of 123 places in 212 ms of which 2 ms to minimize.
[2024-05-28 20:10:10] [INFO ] Deduced a trap composed of 119 places in 220 ms of which 2 ms to minimize.
[2024-05-28 20:10:10] [INFO ] Deduced a trap composed of 122 places in 248 ms of which 2 ms to minimize.
[2024-05-28 20:10:10] [INFO ] Deduced a trap composed of 118 places in 215 ms of which 2 ms to minimize.
[2024-05-28 20:10:10] [INFO ] Deduced a trap composed of 108 places in 218 ms of which 2 ms to minimize.
[2024-05-28 20:10:11] [INFO ] Deduced a trap composed of 124 places in 224 ms of which 2 ms to minimize.
[2024-05-28 20:10:11] [INFO ] Deduced a trap composed of 133 places in 224 ms of which 2 ms to minimize.
[2024-05-28 20:10:11] [INFO ] Deduced a trap composed of 113 places in 208 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 20/141 constraints. Problems are: Problem set: 28 solved, 972 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/1441 variables, and 141 constraints, problems are : Problem set: 28 solved, 972 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/439 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1000 constraints, Known Traps: 80/80 constraints]
After SMT, in 44131ms problems are : Problem set: 28 solved, 972 unsolved
Search for dead transitions found 28 dead transitions in 44142ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 28 transitions.
[2024-05-28 20:10:13] [INFO ] Redundant transitions in 60 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 439/463 places, 983/1034 transitions.
Graph (complete) has 2435 edges and 439 vertex of which 412 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.4 ms
Discarding 27 places :
Also discarding 0 output transitions
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 64 ms. Remains 412 /439 variables (removed 27) and now considering 983/983 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 412/463 places, 983/1034 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 44412 ms. Remains : 412/463 places, 983/1034 transitions.
Built C files in :
/tmp/ltsmin12897842137172160974
[2024-05-28 20:10:13] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12897842137172160974
Running compilation step : cd /tmp/ltsmin12897842137172160974;'/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 2950 ms.
Running link step : cd /tmp/ltsmin12897842137172160974;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin12897842137172160974;'/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/stateBased1713263267875938469.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 463 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 1034/1034 transitions.
Applied a total of 0 rules in 6 ms. Remains 463 /463 variables (removed 0) and now considering 1034/1034 (removed 0) transitions.
Running 1023 sub problems to find dead transitions.
[2024-05-28 20:10:28] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2024-05-28 20:10:28] [INFO ] Computed 62 invariants in 11 ms
[2024-05-28 20:10:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
[2024-05-28 20:10:50] [INFO ] Deduced a trap composed of 174 places in 323 ms of which 7 ms to minimize.
[2024-05-28 20:10:50] [INFO ] Deduced a trap composed of 221 places in 341 ms of which 4 ms to minimize.
[2024-05-28 20:10:50] [INFO ] Deduced a trap composed of 220 places in 329 ms of which 4 ms to minimize.
[2024-05-28 20:10:51] [INFO ] Deduced a trap composed of 220 places in 268 ms of which 2 ms to minimize.
[2024-05-28 20:10:51] [INFO ] Deduced a trap composed of 174 places in 219 ms of which 2 ms to minimize.
[2024-05-28 20:10:51] [INFO ] Deduced a trap composed of 174 places in 222 ms of which 3 ms to minimize.
[2024-05-28 20:10:52] [INFO ] Deduced a trap composed of 164 places in 331 ms of which 10 ms to minimize.
[2024-05-28 20:10:52] [INFO ] Deduced a trap composed of 159 places in 311 ms of which 4 ms to minimize.
[2024-05-28 20:10:52] [INFO ] Deduced a trap composed of 221 places in 259 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1488 variables, and 70 constraints, problems are : Problem set: 0 solved, 1023 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1023/1023 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1023 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 9/70 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
[2024-05-28 20:11:00] [INFO ] Deduced a trap composed of 218 places in 221 ms of which 3 ms to minimize.
[2024-05-28 20:11:00] [INFO ] Deduced a trap composed of 218 places in 225 ms of which 3 ms to minimize.
[2024-05-28 20:11:01] [INFO ] Deduced a trap composed of 220 places in 205 ms of which 2 ms to minimize.
[2024-05-28 20:11:01] [INFO ] Deduced a trap composed of 212 places in 214 ms of which 3 ms to minimize.
[2024-05-28 20:11:01] [INFO ] Deduced a trap composed of 220 places in 196 ms of which 2 ms to minimize.
[2024-05-28 20:11:01] [INFO ] Deduced a trap composed of 216 places in 199 ms of which 3 ms to minimize.
[2024-05-28 20:11:01] [INFO ] Deduced a trap composed of 212 places in 213 ms of which 2 ms to minimize.
[2024-05-28 20:11:02] [INFO ] Deduced a trap composed of 218 places in 212 ms of which 2 ms to minimize.
[2024-05-28 20:11:02] [INFO ] Deduced a trap composed of 179 places in 279 ms of which 2 ms to minimize.
[2024-05-28 20:11:02] [INFO ] Deduced a trap composed of 153 places in 212 ms of which 2 ms to minimize.
[2024-05-28 20:11:02] [INFO ] Deduced a trap composed of 154 places in 202 ms of which 2 ms to minimize.
[2024-05-28 20:11:03] [INFO ] Deduced a trap composed of 158 places in 226 ms of which 2 ms to minimize.
[2024-05-28 20:11:03] [INFO ] Deduced a trap composed of 159 places in 286 ms of which 2 ms to minimize.
[2024-05-28 20:11:03] [INFO ] Deduced a trap composed of 169 places in 330 ms of which 4 ms to minimize.
[2024-05-28 20:11:04] [INFO ] Deduced a trap composed of 174 places in 360 ms of which 3 ms to minimize.
[2024-05-28 20:11:04] [INFO ] Deduced a trap composed of 154 places in 300 ms of which 4 ms to minimize.
[2024-05-28 20:11:04] [INFO ] Deduced a trap composed of 168 places in 320 ms of which 4 ms to minimize.
[2024-05-28 20:11:05] [INFO ] Deduced a trap composed of 159 places in 261 ms of which 3 ms to minimize.
[2024-05-28 20:11:05] [INFO ] Deduced a trap composed of 163 places in 263 ms of which 3 ms to minimize.
[2024-05-28 20:11:05] [INFO ] Deduced a trap composed of 149 places in 218 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
[2024-05-28 20:11:06] [INFO ] Deduced a trap composed of 149 places in 287 ms of which 3 ms to minimize.
[2024-05-28 20:11:06] [INFO ] Deduced a trap composed of 154 places in 233 ms of which 4 ms to minimize.
[2024-05-28 20:11:06] [INFO ] Deduced a trap composed of 159 places in 219 ms of which 3 ms to minimize.
[2024-05-28 20:11:07] [INFO ] Deduced a trap composed of 168 places in 273 ms of which 3 ms to minimize.
[2024-05-28 20:11:07] [INFO ] Deduced a trap composed of 178 places in 215 ms of which 3 ms to minimize.
[2024-05-28 20:11:07] [INFO ] Deduced a trap composed of 158 places in 297 ms of which 3 ms to minimize.
[2024-05-28 20:11:07] [INFO ] Deduced a trap composed of 158 places in 233 ms of which 3 ms to minimize.
[2024-05-28 20:11:08] [INFO ] Deduced a trap composed of 164 places in 231 ms of which 3 ms to minimize.
[2024-05-28 20:11:08] [INFO ] Deduced a trap composed of 164 places in 262 ms of which 2 ms to minimize.
[2024-05-28 20:11:08] [INFO ] Deduced a trap composed of 164 places in 270 ms of which 2 ms to minimize.
[2024-05-28 20:11:09] [INFO ] Deduced a trap composed of 174 places in 307 ms of which 32 ms to minimize.
[2024-05-28 20:11:09] [INFO ] Deduced a trap composed of 174 places in 210 ms of which 3 ms to minimize.
[2024-05-28 20:11:09] [INFO ] Deduced a trap composed of 188 places in 194 ms of which 2 ms to minimize.
[2024-05-28 20:11:09] [INFO ] Deduced a trap composed of 169 places in 195 ms of which 2 ms to minimize.
[2024-05-28 20:11:09] [INFO ] Deduced a trap composed of 173 places in 273 ms of which 14 ms to minimize.
[2024-05-28 20:11:10] [INFO ] Deduced a trap composed of 174 places in 272 ms of which 2 ms to minimize.
[2024-05-28 20:11:10] [INFO ] Deduced a trap composed of 159 places in 238 ms of which 2 ms to minimize.
[2024-05-28 20:11:10] [INFO ] Deduced a trap composed of 212 places in 212 ms of which 2 ms to minimize.
[2024-05-28 20:11:11] [INFO ] Deduced a trap composed of 159 places in 211 ms of which 2 ms to minimize.
[2024-05-28 20:11:11] [INFO ] Deduced a trap composed of 174 places in 195 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
[2024-05-28 20:11:11] [INFO ] Deduced a trap composed of 239 places in 187 ms of which 2 ms to minimize.
[2024-05-28 20:11:12] [INFO ] Deduced a trap composed of 164 places in 299 ms of which 8 ms to minimize.
[2024-05-28 20:11:12] [INFO ] Deduced a trap composed of 159 places in 278 ms of which 14 ms to minimize.
[2024-05-28 20:11:12] [INFO ] Deduced a trap composed of 164 places in 238 ms of which 2 ms to minimize.
[2024-05-28 20:11:13] [INFO ] Deduced a trap composed of 154 places in 228 ms of which 2 ms to minimize.
SMT process timed out in 44073ms, After SMT, problems are : Problem set: 0 solved, 1023 unsolved
Search for dead transitions found 0 dead transitions in 44082ms
[2024-05-28 20:11:13] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2024-05-28 20:11:13] [INFO ] Invariant cache hit.
[2024-05-28 20:11:13] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-05-28 20:11:13] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2024-05-28 20:11:13] [INFO ] Invariant cache hit.
[2024-05-28 20:11:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:11:15] [INFO ] Implicit Places using invariants and state equation in 1895 ms returned []
Implicit Place search using SMT with State Equation took 2284 ms to find 0 implicit places.
Running 1023 sub problems to find dead transitions.
[2024-05-28 20:11:15] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2024-05-28 20:11:15] [INFO ] Invariant cache hit.
[2024-05-28 20:11:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
[2024-05-28 20:11:38] [INFO ] Deduced a trap composed of 215 places in 232 ms of which 3 ms to minimize.
[2024-05-28 20:11:38] [INFO ] Deduced a trap composed of 204 places in 198 ms of which 2 ms to minimize.
[2024-05-28 20:11:39] [INFO ] Deduced a trap composed of 178 places in 190 ms of which 2 ms to minimize.
[2024-05-28 20:11:39] [INFO ] Deduced a trap composed of 178 places in 210 ms of which 2 ms to minimize.
[2024-05-28 20:11:39] [INFO ] Deduced a trap composed of 213 places in 231 ms of which 3 ms to minimize.
[2024-05-28 20:11:39] [INFO ] Deduced a trap composed of 221 places in 222 ms of which 3 ms to minimize.
[2024-05-28 20:11:39] [INFO ] Deduced a trap composed of 203 places in 230 ms of which 2 ms to minimize.
[2024-05-28 20:11:40] [INFO ] Deduced a trap composed of 217 places in 249 ms of which 3 ms to minimize.
[2024-05-28 20:11:40] [INFO ] Deduced a trap composed of 198 places in 246 ms of which 2 ms to minimize.
[2024-05-28 20:11:40] [INFO ] Deduced a trap composed of 198 places in 224 ms of which 3 ms to minimize.
[2024-05-28 20:11:40] [INFO ] Deduced a trap composed of 214 places in 204 ms of which 2 ms to minimize.
[2024-05-28 20:11:41] [INFO ] Deduced a trap composed of 198 places in 204 ms of which 3 ms to minimize.
[2024-05-28 20:11:41] [INFO ] Deduced a trap composed of 218 places in 228 ms of which 3 ms to minimize.
[2024-05-28 20:11:41] [INFO ] Deduced a trap composed of 218 places in 257 ms of which 2 ms to minimize.
[2024-05-28 20:11:41] [INFO ] Deduced a trap composed of 220 places in 211 ms of which 2 ms to minimize.
[2024-05-28 20:11:42] [INFO ] Deduced a trap composed of 216 places in 214 ms of which 2 ms to minimize.
[2024-05-28 20:11:42] [INFO ] Deduced a trap composed of 158 places in 230 ms of which 2 ms to minimize.
[2024-05-28 20:11:42] [INFO ] Deduced a trap composed of 216 places in 239 ms of which 3 ms to minimize.
[2024-05-28 20:11:42] [INFO ] Deduced a trap composed of 158 places in 258 ms of which 4 ms to minimize.
[2024-05-28 20:11:43] [INFO ] Deduced a trap composed of 209 places in 221 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
[2024-05-28 20:11:48] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1488 variables, and 82 constraints, problems are : Problem set: 0 solved, 1023 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1023/1023 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1023 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 21/82 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
[2024-05-28 20:11:59] [INFO ] Deduced a trap composed of 12 places in 217 ms of which 2 ms to minimize.
[2024-05-28 20:12:00] [INFO ] Deduced a trap composed of 210 places in 203 ms of which 2 ms to minimize.
[2024-05-28 20:12:00] [INFO ] Deduced a trap composed of 212 places in 197 ms of which 2 ms to minimize.
[2024-05-28 20:12:00] [INFO ] Deduced a trap composed of 216 places in 205 ms of which 2 ms to minimize.
[2024-05-28 20:12:00] [INFO ] Deduced a trap composed of 214 places in 203 ms of which 3 ms to minimize.
[2024-05-28 20:12:00] [INFO ] Deduced a trap composed of 208 places in 197 ms of which 2 ms to minimize.
[2024-05-28 20:12:01] [INFO ] Deduced a trap composed of 206 places in 211 ms of which 2 ms to minimize.
[2024-05-28 20:12:01] [INFO ] Deduced a trap composed of 212 places in 199 ms of which 3 ms to minimize.
[2024-05-28 20:12:01] [INFO ] Deduced a trap composed of 214 places in 229 ms of which 2 ms to minimize.
[2024-05-28 20:12:01] [INFO ] Deduced a trap composed of 212 places in 210 ms of which 3 ms to minimize.
[2024-05-28 20:12:02] [INFO ] Deduced a trap composed of 216 places in 212 ms of which 3 ms to minimize.
[2024-05-28 20:12:02] [INFO ] Deduced a trap composed of 218 places in 213 ms of which 2 ms to minimize.
[2024-05-28 20:12:02] [INFO ] Deduced a trap composed of 216 places in 227 ms of which 2 ms to minimize.
[2024-05-28 20:12:02] [INFO ] Deduced a trap composed of 212 places in 230 ms of which 2 ms to minimize.
[2024-05-28 20:12:03] [INFO ] Deduced a trap composed of 216 places in 212 ms of which 3 ms to minimize.
[2024-05-28 20:12:03] [INFO ] Deduced a trap composed of 216 places in 225 ms of which 3 ms to minimize.
[2024-05-28 20:12:03] [INFO ] Deduced a trap composed of 218 places in 223 ms of which 2 ms to minimize.
[2024-05-28 20:12:03] [INFO ] Deduced a trap composed of 216 places in 275 ms of which 2 ms to minimize.
[2024-05-28 20:12:04] [INFO ] Deduced a trap composed of 218 places in 235 ms of which 2 ms to minimize.
[2024-05-28 20:12:04] [INFO ] Deduced a trap composed of 220 places in 247 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
[2024-05-28 20:12:05] [INFO ] Deduced a trap composed of 168 places in 287 ms of which 3 ms to minimize.
[2024-05-28 20:12:06] [INFO ] Deduced a trap composed of 190 places in 215 ms of which 3 ms to minimize.
[2024-05-28 20:12:06] [INFO ] Deduced a trap composed of 182 places in 219 ms of which 2 ms to minimize.
[2024-05-28 20:12:06] [INFO ] Deduced a trap composed of 176 places in 243 ms of which 2 ms to minimize.
[2024-05-28 20:12:08] [INFO ] Deduced a trap composed of 176 places in 280 ms of which 2 ms to minimize.
[2024-05-28 20:12:08] [INFO ] Deduced a trap composed of 176 places in 227 ms of which 2 ms to minimize.
[2024-05-28 20:12:08] [INFO ] Deduced a trap composed of 182 places in 224 ms of which 2 ms to minimize.
[2024-05-28 20:12:08] [INFO ] Deduced a trap composed of 176 places in 223 ms of which 2 ms to minimize.
[2024-05-28 20:12:09] [INFO ] Deduced a trap composed of 211 places in 219 ms of which 2 ms to minimize.
[2024-05-28 20:12:09] [INFO ] Deduced a trap composed of 176 places in 201 ms of which 2 ms to minimize.
[2024-05-28 20:12:09] [INFO ] Deduced a trap composed of 170 places in 258 ms of which 3 ms to minimize.
[2024-05-28 20:12:09] [INFO ] Deduced a trap composed of 189 places in 214 ms of which 2 ms to minimize.
[2024-05-28 20:12:09] [INFO ] Deduced a trap composed of 176 places in 206 ms of which 3 ms to minimize.
[2024-05-28 20:12:10] [INFO ] Deduced a trap composed of 226 places in 216 ms of which 3 ms to minimize.
[2024-05-28 20:12:10] [INFO ] Deduced a trap composed of 182 places in 206 ms of which 3 ms to minimize.
[2024-05-28 20:12:10] [INFO ] Deduced a trap composed of 170 places in 187 ms of which 2 ms to minimize.
[2024-05-28 20:12:10] [INFO ] Deduced a trap composed of 183 places in 212 ms of which 3 ms to minimize.
[2024-05-28 20:12:11] [INFO ] Deduced a trap composed of 228 places in 195 ms of which 2 ms to minimize.
[2024-05-28 20:12:11] [INFO ] Deduced a trap composed of 189 places in 207 ms of which 2 ms to minimize.
[2024-05-28 20:12:11] [INFO ] Deduced a trap composed of 188 places in 290 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
[2024-05-28 20:12:16] [INFO ] Deduced a trap composed of 182 places in 222 ms of which 3 ms to minimize.
[2024-05-28 20:12:16] [INFO ] Deduced a trap composed of 164 places in 215 ms of which 2 ms to minimize.
[2024-05-28 20:12:16] [INFO ] Deduced a trap composed of 175 places in 239 ms of which 2 ms to minimize.
[2024-05-28 20:12:16] [INFO ] Deduced a trap composed of 188 places in 201 ms of which 2 ms to minimize.
[2024-05-28 20:12:17] [INFO ] Deduced a trap composed of 226 places in 231 ms of which 3 ms to minimize.
[2024-05-28 20:12:17] [INFO ] Deduced a trap composed of 226 places in 235 ms of which 2 ms to minimize.
[2024-05-28 20:12:17] [INFO ] Deduced a trap composed of 226 places in 204 ms of which 2 ms to minimize.
[2024-05-28 20:12:17] [INFO ] Deduced a trap composed of 223 places in 238 ms of which 2 ms to minimize.
[2024-05-28 20:12:18] [INFO ] Deduced a trap composed of 226 places in 201 ms of which 2 ms to minimize.
[2024-05-28 20:12:18] [INFO ] Deduced a trap composed of 229 places in 237 ms of which 3 ms to minimize.
[2024-05-28 20:12:18] [INFO ] Deduced a trap composed of 226 places in 207 ms of which 3 ms to minimize.
[2024-05-28 20:12:18] [INFO ] Deduced a trap composed of 226 places in 227 ms of which 2 ms to minimize.
[2024-05-28 20:12:18] [INFO ] Deduced a trap composed of 223 places in 220 ms of which 2 ms to minimize.
[2024-05-28 20:12:19] [INFO ] Deduced a trap composed of 229 places in 214 ms of which 2 ms to minimize.
[2024-05-28 20:12:19] [INFO ] Deduced a trap composed of 232 places in 215 ms of which 2 ms to minimize.
[2024-05-28 20:12:19] [INFO ] Deduced a trap composed of 219 places in 211 ms of which 2 ms to minimize.
[2024-05-28 20:12:19] [INFO ] Deduced a trap composed of 226 places in 195 ms of which 3 ms to minimize.
SMT process timed out in 64530ms, After SMT, problems are : Problem set: 0 solved, 1023 unsolved
Search for dead transitions found 0 dead transitions in 64539ms
Finished structural reductions in LTL mode , in 1 iterations and 110922 ms. Remains : 463/463 places, 1034/1034 transitions.
Built C files in :
/tmp/ltsmin14007780406107655346
[2024-05-28 20:12:19] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14007780406107655346
Running compilation step : cd /tmp/ltsmin14007780406107655346;'/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 2647 ms.
Running link step : cd /tmp/ltsmin14007780406107655346;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin14007780406107655346;'/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/stateBased17666527595471031698.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 20:12:35] [INFO ] Flatten gal took : 107 ms
[2024-05-28 20:12:35] [INFO ] Flatten gal took : 107 ms
[2024-05-28 20:12:35] [INFO ] Time to serialize gal into /tmp/LTL8890933225912175530.gal : 39 ms
[2024-05-28 20:12:35] [INFO ] Time to serialize properties into /tmp/LTL588094323392192131.prop : 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/LTL8890933225912175530.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13085129184712661527.hoa' '-atoms' '/tmp/LTL588094323392192131.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...317
Loading property file /tmp/LTL588094323392192131.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13085129184712661527.hoa
Detected timeout of ITS tools.
[2024-05-28 20:12:50] [INFO ] Flatten gal took : 59 ms
[2024-05-28 20:12:50] [INFO ] Flatten gal took : 130 ms
[2024-05-28 20:12:50] [INFO ] Time to serialize gal into /tmp/LTL8656741186871977526.gal : 22 ms
[2024-05-28 20:12:50] [INFO ] Time to serialize properties into /tmp/LTL9443661481771498684.ltl : 18 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/LTL8656741186871977526.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9443661481771498684.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(place_787<1)")))))
Formula 0 simplified : XXG!"(place_787<1)"
Detected timeout of ITS tools.
[2024-05-28 20:13:06] [INFO ] Flatten gal took : 92 ms
[2024-05-28 20:13:06] [INFO ] Applying decomposition
[2024-05-28 20:13:06] [INFO ] Flatten gal took : 94 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/graph4652467405334485796.txt' '-o' '/tmp/graph4652467405334485796.bin' '-w' '/tmp/graph4652467405334485796.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4652467405334485796.bin' '-l' '-1' '-v' '-w' '/tmp/graph4652467405334485796.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:13:06] [INFO ] Decomposing Gal with order
[2024-05-28 20:13:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:13:06] [INFO ] Removed a total of 671 redundant transitions.
[2024-05-28 20:13:07] [INFO ] Flatten gal took : 278 ms
[2024-05-28 20:13:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 220 labels/synchronizations in 77 ms.
[2024-05-28 20:13:07] [INFO ] Time to serialize gal into /tmp/LTL12325555453791061329.gal : 26 ms
[2024-05-28 20:13:07] [INFO ] Time to serialize properties into /tmp/LTL2996733915091564639.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/LTL12325555453791061329.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2996733915091564639.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 : !((X(X(F("(i11.u46.place_787<1)")))))
Formula 0 simplified : XXG!"(i11.u46.place_787<1)"
Detected timeout of ITS tools.
Treatment of property PolyORBNT-COL-S10J20-LTLFireability-03 finished in 412941 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 243 out of 474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 474/474 places, 1092/1092 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 464 transition count 1088
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 460 transition count 1088
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 8 place count 460 transition count 1064
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 56 place count 436 transition count 1064
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 435 transition count 1063
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 435 transition count 1063
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 433 transition count 1061
Applied a total of 62 rules in 87 ms. Remains 433 /474 variables (removed 41) and now considering 1061/1092 (removed 31) transitions.
Running 1050 sub problems to find dead transitions.
[2024-05-28 20:13:22] [INFO ] Flow matrix only has 1052 transitions (discarded 9 similar events)
// Phase 1: matrix 1052 rows 433 cols
[2024-05-28 20:13:22] [INFO ] Computed 62 invariants in 11 ms
[2024-05-28 20:13:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 1050 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 1050 unsolved
[2024-05-28 20:13:33] [INFO ] Deduced a trap composed of 193 places in 161 ms of which 9 ms to minimize.
[2024-05-28 20:13:33] [INFO ] Deduced a trap composed of 197 places in 145 ms of which 2 ms to minimize.
[2024-05-28 20:13:33] [INFO ] Deduced a trap composed of 195 places in 139 ms of which 2 ms to minimize.
[2024-05-28 20:13:34] [INFO ] Deduced a trap composed of 164 places in 148 ms of which 2 ms to minimize.
[2024-05-28 20:13:34] [INFO ] Deduced a trap composed of 154 places in 145 ms of which 2 ms to minimize.
[2024-05-28 20:13:34] [INFO ] Deduced a trap composed of 149 places in 143 ms of which 2 ms to minimize.
[2024-05-28 20:13:34] [INFO ] Deduced a trap composed of 189 places in 162 ms of which 2 ms to minimize.
[2024-05-28 20:13:34] [INFO ] Deduced a trap composed of 149 places in 143 ms of which 2 ms to minimize.
[2024-05-28 20:13:34] [INFO ] Deduced a trap composed of 195 places in 139 ms of which 2 ms to minimize.
[2024-05-28 20:13:35] [INFO ] Deduced a trap composed of 189 places in 138 ms of which 2 ms to minimize.
[2024-05-28 20:13:35] [INFO ] Deduced a trap composed of 189 places in 146 ms of which 2 ms to minimize.
[2024-05-28 20:13:35] [INFO ] Deduced a trap composed of 189 places in 147 ms of which 2 ms to minimize.
[2024-05-28 20:13:35] [INFO ] Deduced a trap composed of 189 places in 162 ms of which 2 ms to minimize.
[2024-05-28 20:13:35] [INFO ] Deduced a trap composed of 195 places in 140 ms of which 2 ms to minimize.
[2024-05-28 20:13:35] [INFO ] Deduced a trap composed of 195 places in 158 ms of which 2 ms to minimize.
[2024-05-28 20:13:36] [INFO ] Deduced a trap composed of 195 places in 150 ms of which 2 ms to minimize.
[2024-05-28 20:13:36] [INFO ] Deduced a trap composed of 195 places in 151 ms of which 2 ms to minimize.
[2024-05-28 20:13:36] [INFO ] Deduced a trap composed of 195 places in 143 ms of which 2 ms to minimize.
[2024-05-28 20:13:36] [INFO ] Deduced a trap composed of 197 places in 146 ms of which 2 ms to minimize.
[2024-05-28 20:13:36] [INFO ] Deduced a trap composed of 197 places in 145 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 1050 unsolved
[2024-05-28 20:13:37] [INFO ] Deduced a trap composed of 193 places in 138 ms of which 2 ms to minimize.
[2024-05-28 20:13:37] [INFO ] Deduced a trap composed of 195 places in 154 ms of which 2 ms to minimize.
[2024-05-28 20:13:37] [INFO ] Deduced a trap composed of 193 places in 151 ms of which 3 ms to minimize.
[2024-05-28 20:13:37] [INFO ] Deduced a trap composed of 187 places in 144 ms of which 2 ms to minimize.
[2024-05-28 20:13:37] [INFO ] Deduced a trap composed of 193 places in 156 ms of which 2 ms to minimize.
[2024-05-28 20:13:37] [INFO ] Deduced a trap composed of 154 places in 151 ms of which 2 ms to minimize.
[2024-05-28 20:13:38] [INFO ] Deduced a trap composed of 193 places in 147 ms of which 2 ms to minimize.
[2024-05-28 20:13:38] [INFO ] Deduced a trap composed of 191 places in 151 ms of which 2 ms to minimize.
[2024-05-28 20:13:38] [INFO ] Deduced a trap composed of 195 places in 140 ms of which 2 ms to minimize.
[2024-05-28 20:13:38] [INFO ] Deduced a trap composed of 189 places in 140 ms of which 2 ms to minimize.
[2024-05-28 20:13:38] [INFO ] Deduced a trap composed of 191 places in 156 ms of which 2 ms to minimize.
[2024-05-28 20:13:38] [INFO ] Deduced a trap composed of 199 places in 156 ms of which 2 ms to minimize.
[2024-05-28 20:13:39] [INFO ] Deduced a trap composed of 189 places in 146 ms of which 2 ms to minimize.
[2024-05-28 20:13:39] [INFO ] Deduced a trap composed of 189 places in 147 ms of which 2 ms to minimize.
[2024-05-28 20:13:40] [INFO ] Deduced a trap composed of 118 places in 151 ms of which 2 ms to minimize.
[2024-05-28 20:13:43] [INFO ] Deduced a trap composed of 80 places in 172 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/423 variables, 16/88 constraints. Problems are: Problem set: 0 solved, 1050 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 423/1485 variables, and 88 constraints, problems are : Problem set: 0 solved, 1050 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 47/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/433 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1050/1050 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1050 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 1050 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 1050 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 36/88 constraints. Problems are: Problem set: 0 solved, 1050 unsolved
[2024-05-28 20:13:48] [INFO ] Deduced a trap composed of 189 places in 140 ms of which 2 ms to minimize.
[2024-05-28 20:13:49] [INFO ] Deduced a trap composed of 160 places in 155 ms of which 2 ms to minimize.
[2024-05-28 20:13:49] [INFO ] Deduced a trap composed of 160 places in 158 ms of which 2 ms to minimize.
[2024-05-28 20:13:49] [INFO ] Deduced a trap composed of 160 places in 158 ms of which 2 ms to minimize.
[2024-05-28 20:13:49] [INFO ] Deduced a trap composed of 197 places in 163 ms of which 2 ms to minimize.
[2024-05-28 20:13:49] [INFO ] Deduced a trap composed of 193 places in 174 ms of which 2 ms to minimize.
[2024-05-28 20:13:49] [INFO ] Deduced a trap composed of 195 places in 162 ms of which 2 ms to minimize.
[2024-05-28 20:13:50] [INFO ] Deduced a trap composed of 209 places in 227 ms of which 4 ms to minimize.
[2024-05-28 20:13:50] [INFO ] Deduced a trap composed of 191 places in 185 ms of which 3 ms to minimize.
[2024-05-28 20:13:50] [INFO ] Deduced a trap composed of 197 places in 162 ms of which 2 ms to minimize.
[2024-05-28 20:13:50] [INFO ] Deduced a trap composed of 212 places in 220 ms of which 3 ms to minimize.
[2024-05-28 20:13:50] [INFO ] Deduced a trap composed of 189 places in 182 ms of which 2 ms to minimize.
[2024-05-28 20:13:51] [INFO ] Deduced a trap composed of 185 places in 231 ms of which 3 ms to minimize.
[2024-05-28 20:13:51] [INFO ] Deduced a trap composed of 195 places in 170 ms of which 2 ms to minimize.
[2024-05-28 20:13:51] [INFO ] Deduced a trap composed of 197 places in 286 ms of which 2 ms to minimize.
[2024-05-28 20:13:51] [INFO ] Deduced a trap composed of 197 places in 215 ms of which 2 ms to minimize.
[2024-05-28 20:13:52] [INFO ] Deduced a trap composed of 195 places in 199 ms of which 3 ms to minimize.
[2024-05-28 20:13:52] [INFO ] Deduced a trap composed of 189 places in 207 ms of which 3 ms to minimize.
[2024-05-28 20:13:52] [INFO ] Deduced a trap composed of 195 places in 198 ms of which 2 ms to minimize.
[2024-05-28 20:13:52] [INFO ] Deduced a trap composed of 193 places in 265 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/423 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 1050 unsolved
[2024-05-28 20:13:53] [INFO ] Deduced a trap composed of 195 places in 163 ms of which 2 ms to minimize.
[2024-05-28 20:13:53] [INFO ] Deduced a trap composed of 193 places in 204 ms of which 2 ms to minimize.
[2024-05-28 20:13:53] [INFO ] Deduced a trap composed of 149 places in 170 ms of which 2 ms to minimize.
[2024-05-28 20:13:54] [INFO ] Deduced a trap composed of 193 places in 152 ms of which 2 ms to minimize.
[2024-05-28 20:13:54] [INFO ] Deduced a trap composed of 193 places in 147 ms of which 2 ms to minimize.
[2024-05-28 20:13:54] [INFO ] Deduced a trap composed of 159 places in 157 ms of which 2 ms to minimize.
[2024-05-28 20:13:54] [INFO ] Deduced a trap composed of 159 places in 159 ms of which 2 ms to minimize.
[2024-05-28 20:13:54] [INFO ] Deduced a trap composed of 154 places in 166 ms of which 2 ms to minimize.
[2024-05-28 20:13:54] [INFO ] Deduced a trap composed of 154 places in 147 ms of which 2 ms to minimize.
[2024-05-28 20:13:55] [INFO ] Deduced a trap composed of 154 places in 150 ms of which 2 ms to minimize.
[2024-05-28 20:13:55] [INFO ] Deduced a trap composed of 159 places in 208 ms of which 2 ms to minimize.
[2024-05-28 20:13:55] [INFO ] Deduced a trap composed of 154 places in 151 ms of which 2 ms to minimize.
[2024-05-28 20:13:55] [INFO ] Deduced a trap composed of 159 places in 156 ms of which 2 ms to minimize.
[2024-05-28 20:13:55] [INFO ] Deduced a trap composed of 164 places in 143 ms of which 2 ms to minimize.
[2024-05-28 20:13:56] [INFO ] Deduced a trap composed of 149 places in 155 ms of which 2 ms to minimize.
[2024-05-28 20:13:56] [INFO ] Deduced a trap composed of 144 places in 144 ms of which 2 ms to minimize.
[2024-05-28 20:13:56] [INFO ] Deduced a trap composed of 149 places in 157 ms of which 2 ms to minimize.
[2024-05-28 20:13:56] [INFO ] Deduced a trap composed of 154 places in 145 ms of which 3 ms to minimize.
[2024-05-28 20:13:56] [INFO ] Deduced a trap composed of 149 places in 164 ms of which 2 ms to minimize.
[2024-05-28 20:13:56] [INFO ] Deduced a trap composed of 139 places in 157 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 1050 unsolved
[2024-05-28 20:13:57] [INFO ] Deduced a trap composed of 144 places in 156 ms of which 2 ms to minimize.
[2024-05-28 20:13:57] [INFO ] Deduced a trap composed of 134 places in 198 ms of which 3 ms to minimize.
[2024-05-28 20:13:58] [INFO ] Deduced a trap composed of 153 places in 320 ms of which 3 ms to minimize.
[2024-05-28 20:13:58] [INFO ] Deduced a trap composed of 144 places in 264 ms of which 3 ms to minimize.
[2024-05-28 20:13:58] [INFO ] Deduced a trap composed of 153 places in 263 ms of which 2 ms to minimize.
[2024-05-28 20:13:58] [INFO ] Deduced a trap composed of 154 places in 242 ms of which 2 ms to minimize.
[2024-05-28 20:13:59] [INFO ] Deduced a trap composed of 189 places in 308 ms of which 3 ms to minimize.
[2024-05-28 20:13:59] [INFO ] Deduced a trap composed of 129 places in 260 ms of which 3 ms to minimize.
[2024-05-28 20:13:59] [INFO ] Deduced a trap composed of 201 places in 248 ms of which 3 ms to minimize.
[2024-05-28 20:13:59] [INFO ] Deduced a trap composed of 155 places in 242 ms of which 3 ms to minimize.
[2024-05-28 20:14:00] [INFO ] Deduced a trap composed of 142 places in 217 ms of which 2 ms to minimize.
[2024-05-28 20:14:00] [INFO ] Deduced a trap composed of 145 places in 346 ms of which 3 ms to minimize.
[2024-05-28 20:14:00] [INFO ] Deduced a trap composed of 154 places in 220 ms of which 2 ms to minimize.
[2024-05-28 20:14:01] [INFO ] Deduced a trap composed of 155 places in 205 ms of which 3 ms to minimize.
[2024-05-28 20:14:01] [INFO ] Deduced a trap composed of 149 places in 331 ms of which 3 ms to minimize.
[2024-05-28 20:14:01] [INFO ] Deduced a trap composed of 144 places in 232 ms of which 3 ms to minimize.
[2024-05-28 20:14:01] [INFO ] Deduced a trap composed of 158 places in 313 ms of which 3 ms to minimize.
[2024-05-28 20:14:02] [INFO ] Deduced a trap composed of 165 places in 253 ms of which 3 ms to minimize.
[2024-05-28 20:14:02] [INFO ] Deduced a trap composed of 168 places in 246 ms of which 3 ms to minimize.
[2024-05-28 20:14:02] [INFO ] Deduced a trap composed of 145 places in 239 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 1050 unsolved
[2024-05-28 20:14:03] [INFO ] Deduced a trap composed of 195 places in 137 ms of which 2 ms to minimize.
[2024-05-28 20:14:03] [INFO ] Deduced a trap composed of 189 places in 157 ms of which 2 ms to minimize.
[2024-05-28 20:14:03] [INFO ] Deduced a trap composed of 189 places in 221 ms of which 4 ms to minimize.
[2024-05-28 20:14:03] [INFO ] Deduced a trap composed of 195 places in 170 ms of which 2 ms to minimize.
[2024-05-28 20:14:04] [INFO ] Deduced a trap composed of 195 places in 160 ms of which 2 ms to minimize.
[2024-05-28 20:14:04] [INFO ] Deduced a trap composed of 195 places in 155 ms of which 2 ms to minimize.
[2024-05-28 20:14:04] [INFO ] Deduced a trap composed of 135 places in 153 ms of which 2 ms to minimize.
[2024-05-28 20:14:04] [INFO ] Deduced a trap composed of 150 places in 154 ms of which 2 ms to minimize.
[2024-05-28 20:14:04] [INFO ] Deduced a trap composed of 129 places in 155 ms of which 2 ms to minimize.
[2024-05-28 20:14:04] [INFO ] Deduced a trap composed of 140 places in 218 ms of which 3 ms to minimize.
[2024-05-28 20:14:05] [INFO ] Deduced a trap composed of 150 places in 149 ms of which 2 ms to minimize.
[2024-05-28 20:14:05] [INFO ] Deduced a trap composed of 155 places in 201 ms of which 4 ms to minimize.
[2024-05-28 20:14:05] [INFO ] Deduced a trap composed of 155 places in 147 ms of which 2 ms to minimize.
[2024-05-28 20:14:05] [INFO ] Deduced a trap composed of 140 places in 155 ms of which 2 ms to minimize.
[2024-05-28 20:14:05] [INFO ] Deduced a trap composed of 150 places in 157 ms of which 2 ms to minimize.
[2024-05-28 20:14:06] [INFO ] Deduced a trap composed of 160 places in 237 ms of which 3 ms to minimize.
[2024-05-28 20:14:06] [INFO ] Deduced a trap composed of 196 places in 240 ms of which 2 ms to minimize.
[2024-05-28 20:14:06] [INFO ] Deduced a trap composed of 190 places in 313 ms of which 4 ms to minimize.
[2024-05-28 20:14:07] [INFO ] Deduced a trap composed of 135 places in 238 ms of which 2 ms to minimize.
[2024-05-28 20:14:07] [INFO ] Deduced a trap composed of 148 places in 278 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 20/168 constraints. Problems are: Problem set: 0 solved, 1050 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/1485 variables, and 168 constraints, problems are : Problem set: 0 solved, 1050 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 47/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/433 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1050 constraints, Known Traps: 116/116 constraints]
After SMT, in 45319ms problems are : Problem set: 0 solved, 1050 unsolved
Search for dead transitions found 0 dead transitions in 45331ms
[2024-05-28 20:14:07] [INFO ] Flow matrix only has 1052 transitions (discarded 9 similar events)
[2024-05-28 20:14:07] [INFO ] Invariant cache hit.
[2024-05-28 20:14:07] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-28 20:14:07] [INFO ] Flow matrix only has 1052 transitions (discarded 9 similar events)
[2024-05-28 20:14:07] [INFO ] Invariant cache hit.
[2024-05-28 20:14:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:14:09] [INFO ] Implicit Places using invariants and state equation in 1439 ms returned []
Implicit Place search using SMT with State Equation took 1670 ms to find 0 implicit places.
[2024-05-28 20:14:09] [INFO ] Redundant transitions in 34 ms returned []
Running 1050 sub problems to find dead transitions.
[2024-05-28 20:14:09] [INFO ] Flow matrix only has 1052 transitions (discarded 9 similar events)
[2024-05-28 20:14:09] [INFO ] Invariant cache hit.
[2024-05-28 20:14:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 1050 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 1050 unsolved
[2024-05-28 20:14:20] [INFO ] Deduced a trap composed of 154 places in 210 ms of which 3 ms to minimize.
[2024-05-28 20:14:20] [INFO ] Deduced a trap composed of 189 places in 194 ms of which 3 ms to minimize.
[2024-05-28 20:14:20] [INFO ] Deduced a trap composed of 193 places in 208 ms of which 3 ms to minimize.
[2024-05-28 20:14:21] [INFO ] Deduced a trap composed of 189 places in 147 ms of which 2 ms to minimize.
[2024-05-28 20:14:21] [INFO ] Deduced a trap composed of 191 places in 204 ms of which 3 ms to minimize.
[2024-05-28 20:14:21] [INFO ] Deduced a trap composed of 189 places in 154 ms of which 2 ms to minimize.
[2024-05-28 20:14:21] [INFO ] Deduced a trap composed of 185 places in 184 ms of which 2 ms to minimize.
[2024-05-28 20:14:21] [INFO ] Deduced a trap composed of 191 places in 160 ms of which 2 ms to minimize.
[2024-05-28 20:14:21] [INFO ] Deduced a trap composed of 191 places in 148 ms of which 3 ms to minimize.
[2024-05-28 20:14:22] [INFO ] Deduced a trap composed of 191 places in 154 ms of which 3 ms to minimize.
[2024-05-28 20:14:22] [INFO ] Deduced a trap composed of 193 places in 146 ms of which 3 ms to minimize.
[2024-05-28 20:14:22] [INFO ] Deduced a trap composed of 195 places in 156 ms of which 3 ms to minimize.
[2024-05-28 20:14:22] [INFO ] Deduced a trap composed of 193 places in 158 ms of which 2 ms to minimize.
[2024-05-28 20:14:22] [INFO ] Deduced a trap composed of 189 places in 156 ms of which 3 ms to minimize.
[2024-05-28 20:14:23] [INFO ] Deduced a trap composed of 144 places in 169 ms of which 2 ms to minimize.
[2024-05-28 20:14:23] [INFO ] Deduced a trap composed of 139 places in 156 ms of which 2 ms to minimize.
[2024-05-28 20:14:23] [INFO ] Deduced a trap composed of 134 places in 141 ms of which 2 ms to minimize.
[2024-05-28 20:14:23] [INFO ] Deduced a trap composed of 154 places in 166 ms of which 2 ms to minimize.
[2024-05-28 20:14:23] [INFO ] Deduced a trap composed of 144 places in 146 ms of which 2 ms to minimize.
[2024-05-28 20:14:23] [INFO ] Deduced a trap composed of 144 places in 138 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 1050 unsolved
[2024-05-28 20:14:24] [INFO ] Deduced a trap composed of 139 places in 128 ms of which 2 ms to minimize.
[2024-05-28 20:14:24] [INFO ] Deduced a trap composed of 134 places in 156 ms of which 3 ms to minimize.
[2024-05-28 20:14:24] [INFO ] Deduced a trap composed of 187 places in 129 ms of which 2 ms to minimize.
[2024-05-28 20:14:24] [INFO ] Deduced a trap composed of 139 places in 141 ms of which 2 ms to minimize.
[2024-05-28 20:14:25] [INFO ] Deduced a trap composed of 139 places in 143 ms of which 2 ms to minimize.
[2024-05-28 20:14:25] [INFO ] Deduced a trap composed of 139 places in 149 ms of which 2 ms to minimize.
[2024-05-28 20:14:25] [INFO ] Deduced a trap composed of 134 places in 140 ms of which 3 ms to minimize.
[2024-05-28 20:14:25] [INFO ] Deduced a trap composed of 193 places in 142 ms of which 2 ms to minimize.
[2024-05-28 20:14:25] [INFO ] Deduced a trap composed of 149 places in 140 ms of which 2 ms to minimize.
[2024-05-28 20:14:25] [INFO ] Deduced a trap composed of 149 places in 183 ms of which 2 ms to minimize.
[2024-05-28 20:14:26] [INFO ] Deduced a trap composed of 144 places in 186 ms of which 2 ms to minimize.
[2024-05-28 20:14:26] [INFO ] Deduced a trap composed of 149 places in 134 ms of which 2 ms to minimize.
[2024-05-28 20:14:26] [INFO ] Deduced a trap composed of 139 places in 130 ms of which 2 ms to minimize.
[2024-05-28 20:14:26] [INFO ] Deduced a trap composed of 144 places in 145 ms of which 2 ms to minimize.
[2024-05-28 20:14:26] [INFO ] Deduced a trap composed of 144 places in 163 ms of which 2 ms to minimize.
[2024-05-28 20:14:26] [INFO ] Deduced a trap composed of 154 places in 150 ms of which 2 ms to minimize.
[2024-05-28 20:14:27] [INFO ] Deduced a trap composed of 154 places in 180 ms of which 2 ms to minimize.
[2024-05-28 20:14:27] [INFO ] Deduced a trap composed of 149 places in 180 ms of which 2 ms to minimize.
[2024-05-28 20:14:27] [INFO ] Deduced a trap composed of 144 places in 127 ms of which 2 ms to minimize.
[2024-05-28 20:14:27] [INFO ] Deduced a trap composed of 144 places in 142 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/423 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1050 unsolved
[2024-05-28 20:14:34] [INFO ] Deduced a trap composed of 199 places in 182 ms of which 3 ms to minimize.
[2024-05-28 20:14:34] [INFO ] Deduced a trap composed of 185 places in 164 ms of which 11 ms to minimize.
[2024-05-28 20:14:34] [INFO ] Deduced a trap composed of 189 places in 166 ms of which 3 ms to minimize.
[2024-05-28 20:14:34] [INFO ] Deduced a trap composed of 189 places in 167 ms of which 2 ms to minimize.
[2024-05-28 20:14:35] [INFO ] Deduced a trap composed of 187 places in 145 ms of which 2 ms to minimize.
[2024-05-28 20:14:35] [INFO ] Deduced a trap composed of 195 places in 139 ms of which 2 ms to minimize.
[2024-05-28 20:14:35] [INFO ] Deduced a trap composed of 187 places in 137 ms of which 2 ms to minimize.
[2024-05-28 20:14:35] [INFO ] Deduced a trap composed of 149 places in 157 ms of which 2 ms to minimize.
[2024-05-28 20:14:35] [INFO ] Deduced a trap composed of 144 places in 138 ms of which 2 ms to minimize.
[2024-05-28 20:14:35] [INFO ] Deduced a trap composed of 193 places in 136 ms of which 2 ms to minimize.
[2024-05-28 20:14:36] [INFO ] Deduced a trap composed of 197 places in 158 ms of which 2 ms to minimize.
[2024-05-28 20:14:36] [INFO ] Deduced a trap composed of 193 places in 125 ms of which 2 ms to minimize.
[2024-05-28 20:14:36] [INFO ] Deduced a trap composed of 185 places in 124 ms of which 2 ms to minimize.
[2024-05-28 20:14:36] [INFO ] Deduced a trap composed of 187 places in 136 ms of which 2 ms to minimize.
[2024-05-28 20:14:36] [INFO ] Deduced a trap composed of 193 places in 171 ms of which 3 ms to minimize.
[2024-05-28 20:14:36] [INFO ] Deduced a trap composed of 193 places in 162 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 16/108 constraints. Problems are: Problem set: 0 solved, 1050 unsolved
[2024-05-28 20:14:39] [INFO ] Deduced a trap composed of 149 places in 151 ms of which 3 ms to minimize.
[2024-05-28 20:14:39] [INFO ] Deduced a trap composed of 159 places in 172 ms of which 3 ms to minimize.
[2024-05-28 20:14:39] [INFO ] Deduced a trap composed of 134 places in 254 ms of which 2 ms to minimize.
[2024-05-28 20:14:39] [INFO ] Deduced a trap composed of 149 places in 176 ms of which 2 ms to minimize.
[2024-05-28 20:14:39] [INFO ] Deduced a trap composed of 144 places in 177 ms of which 3 ms to minimize.
[2024-05-28 20:14:40] [INFO ] Deduced a trap composed of 139 places in 175 ms of which 3 ms to minimize.
[2024-05-28 20:14:40] [INFO ] Deduced a trap composed of 139 places in 186 ms of which 3 ms to minimize.
[2024-05-28 20:14:40] [INFO ] Deduced a trap composed of 139 places in 184 ms of which 2 ms to minimize.
[2024-05-28 20:14:40] [INFO ] Deduced a trap composed of 139 places in 162 ms of which 2 ms to minimize.
[2024-05-28 20:14:41] [INFO ] Deduced a trap composed of 154 places in 211 ms of which 3 ms to minimize.
[2024-05-28 20:14:41] [INFO ] Deduced a trap composed of 149 places in 153 ms of which 2 ms to minimize.
[2024-05-28 20:14:41] [INFO ] Deduced a trap composed of 144 places in 157 ms of which 3 ms to minimize.
[2024-05-28 20:14:41] [INFO ] Deduced a trap composed of 164 places in 160 ms of which 3 ms to minimize.
[2024-05-28 20:14:41] [INFO ] Deduced a trap composed of 154 places in 164 ms of which 3 ms to minimize.
[2024-05-28 20:14:41] [INFO ] Deduced a trap composed of 169 places in 152 ms of which 3 ms to minimize.
[2024-05-28 20:14:42] [INFO ] Deduced a trap composed of 154 places in 147 ms of which 3 ms to minimize.
[2024-05-28 20:14:42] [INFO ] Deduced a trap composed of 164 places in 133 ms of which 2 ms to minimize.
[2024-05-28 20:14:42] [INFO ] Deduced a trap composed of 154 places in 144 ms of which 3 ms to minimize.
[2024-05-28 20:14:42] [INFO ] Deduced a trap composed of 144 places in 158 ms of which 2 ms to minimize.
[2024-05-28 20:14:42] [INFO ] Deduced a trap composed of 144 places in 148 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 1050 unsolved
[2024-05-28 20:14:43] [INFO ] Deduced a trap composed of 144 places in 145 ms of which 2 ms to minimize.
[2024-05-28 20:14:43] [INFO ] Deduced a trap composed of 139 places in 149 ms of which 2 ms to minimize.
[2024-05-28 20:14:43] [INFO ] Deduced a trap composed of 134 places in 143 ms of which 3 ms to minimize.
[2024-05-28 20:14:43] [INFO ] Deduced a trap composed of 189 places in 149 ms of which 2 ms to minimize.
[2024-05-28 20:14:44] [INFO ] Deduced a trap composed of 144 places in 145 ms of which 2 ms to minimize.
[2024-05-28 20:14:44] [INFO ] Deduced a trap composed of 195 places in 145 ms of which 2 ms to minimize.
[2024-05-28 20:14:44] [INFO ] Deduced a trap composed of 149 places in 144 ms of which 2 ms to minimize.
[2024-05-28 20:14:44] [INFO ] Deduced a trap composed of 139 places in 231 ms of which 2 ms to minimize.
SMT process timed out in 35247ms, After SMT, problems are : Problem set: 0 solved, 1050 unsolved
Search for dead transitions found 0 dead transitions in 35264ms
Starting structural reductions in SI_LTL mode, iteration 1 : 433/474 places, 1061/1092 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82412 ms. Remains : 433/474 places, 1061/1092 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBNT-COL-S10J20-LTLFireability-07
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J20-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J20-LTLFireability-07 finished in 82620 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Support contains 253 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1092/1092 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 473 transition count 1091
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 473 transition count 1091
Applied a total of 2 rules in 8 ms. Remains 473 /474 variables (removed 1) and now considering 1091/1092 (removed 1) transitions.
Running 1080 sub problems to find dead transitions.
[2024-05-28 20:14:44] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
// Phase 1: matrix 1082 rows 473 cols
[2024-05-28 20:14:44] [INFO ] Computed 72 invariants in 10 ms
[2024-05-28 20:14:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 3 (OVERLAPS) 19/471 variables, 19/70 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 471/1555 variables, and 70 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/473 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 20:15:15] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 1 ms to minimize.
[2024-05-28 20:15:15] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 20:15:19] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 2 ms to minimize.
[2024-05-28 20:15:20] [INFO ] Deduced a trap composed of 20 places in 220 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/452 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1080 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 452/1555 variables, and 55 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 46/65 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/473 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 4/4 constraints]
After SMT, in 45617ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 45627ms
[2024-05-28 20:15:30] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 20:15:30] [INFO ] Invariant cache hit.
[2024-05-28 20:15:30] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-05-28 20:15:30] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 20:15:30] [INFO ] Invariant cache hit.
[2024-05-28 20:15:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:15:32] [INFO ] Implicit Places using invariants and state equation in 1450 ms returned []
Implicit Place search using SMT with State Equation took 1783 ms to find 0 implicit places.
Running 1080 sub problems to find dead transitions.
[2024-05-28 20:15:32] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 20:15:32] [INFO ] Invariant cache hit.
[2024-05-28 20:15:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 3 (OVERLAPS) 19/471 variables, 19/70 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/471 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD543 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/473 variables, 2/72 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 0/72 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
SMT process timed out in 35522ms, After SMT, problems are : Problem set: 57 solved, 1023 unsolved
Search for dead transitions found 57 dead transitions in 35541ms
Found 57 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 57 transitions
Dead transitions reduction (with SMT) removed 57 transitions
Starting structural reductions in LTL mode, iteration 1 : 473/474 places, 1034/1092 transitions.
Applied a total of 0 rules in 6 ms. Remains 473 /473 variables (removed 0) and now considering 1034/1034 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 82985 ms. Remains : 473/474 places, 1034/1092 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S10J20-LTLFireability-10
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J20-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J20-LTLFireability-10 finished in 83096 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||((!p1&&F(!p2)) U p3))&&(((!p1&&F(!p2)) U p3)||G(!p2))))))'
Support contains 34 out of 474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 474/474 places, 1092/1092 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 464 transition count 1068
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 440 transition count 1067
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 439 transition count 1067
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 50 place count 439 transition count 1042
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 100 place count 414 transition count 1042
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 413 transition count 1041
Applied a total of 102 rules in 54 ms. Remains 413 /474 variables (removed 61) and now considering 1041/1092 (removed 51) transitions.
Running 1030 sub problems to find dead transitions.
[2024-05-28 20:16:08] [INFO ] Flow matrix only has 1032 transitions (discarded 9 similar events)
// Phase 1: matrix 1032 rows 413 cols
[2024-05-28 20:16:08] [INFO ] Computed 62 invariants in 13 ms
[2024-05-28 20:16:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
[2024-05-28 20:16:18] [INFO ] Deduced a trap composed of 119 places in 136 ms of which 3 ms to minimize.
[2024-05-28 20:16:19] [INFO ] Deduced a trap composed of 114 places in 141 ms of which 2 ms to minimize.
[2024-05-28 20:16:19] [INFO ] Deduced a trap composed of 114 places in 146 ms of which 2 ms to minimize.
[2024-05-28 20:16:19] [INFO ] Deduced a trap composed of 119 places in 142 ms of which 2 ms to minimize.
[2024-05-28 20:16:19] [INFO ] Deduced a trap composed of 129 places in 158 ms of which 2 ms to minimize.
[2024-05-28 20:16:19] [INFO ] Deduced a trap composed of 134 places in 146 ms of which 2 ms to minimize.
[2024-05-28 20:16:19] [INFO ] Deduced a trap composed of 129 places in 183 ms of which 2 ms to minimize.
[2024-05-28 20:16:20] [INFO ] Deduced a trap composed of 109 places in 154 ms of which 3 ms to minimize.
[2024-05-28 20:16:20] [INFO ] Deduced a trap composed of 109 places in 166 ms of which 3 ms to minimize.
[2024-05-28 20:16:20] [INFO ] Deduced a trap composed of 109 places in 158 ms of which 2 ms to minimize.
[2024-05-28 20:16:20] [INFO ] Deduced a trap composed of 114 places in 162 ms of which 2 ms to minimize.
[2024-05-28 20:16:20] [INFO ] Deduced a trap composed of 114 places in 153 ms of which 3 ms to minimize.
[2024-05-28 20:16:20] [INFO ] Deduced a trap composed of 134 places in 157 ms of which 2 ms to minimize.
[2024-05-28 20:16:21] [INFO ] Deduced a trap composed of 129 places in 145 ms of which 3 ms to minimize.
[2024-05-28 20:16:21] [INFO ] Deduced a trap composed of 124 places in 162 ms of which 2 ms to minimize.
[2024-05-28 20:16:21] [INFO ] Deduced a trap composed of 124 places in 155 ms of which 2 ms to minimize.
[2024-05-28 20:16:21] [INFO ] Deduced a trap composed of 124 places in 153 ms of which 3 ms to minimize.
[2024-05-28 20:16:21] [INFO ] Deduced a trap composed of 114 places in 177 ms of which 2 ms to minimize.
[2024-05-28 20:16:21] [INFO ] Deduced a trap composed of 109 places in 172 ms of which 3 ms to minimize.
[2024-05-28 20:16:22] [INFO ] Deduced a trap composed of 109 places in 166 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
[2024-05-28 20:16:22] [INFO ] Deduced a trap composed of 119 places in 132 ms of which 2 ms to minimize.
[2024-05-28 20:16:22] [INFO ] Deduced a trap composed of 114 places in 174 ms of which 2 ms to minimize.
[2024-05-28 20:16:22] [INFO ] Deduced a trap composed of 114 places in 157 ms of which 2 ms to minimize.
[2024-05-28 20:16:23] [INFO ] Deduced a trap composed of 114 places in 166 ms of which 2 ms to minimize.
[2024-05-28 20:16:23] [INFO ] Deduced a trap composed of 114 places in 136 ms of which 2 ms to minimize.
[2024-05-28 20:16:23] [INFO ] Deduced a trap composed of 114 places in 149 ms of which 2 ms to minimize.
[2024-05-28 20:16:23] [INFO ] Deduced a trap composed of 119 places in 147 ms of which 2 ms to minimize.
[2024-05-28 20:16:23] [INFO ] Deduced a trap composed of 139 places in 131 ms of which 2 ms to minimize.
[2024-05-28 20:16:23] [INFO ] Deduced a trap composed of 139 places in 135 ms of which 2 ms to minimize.
[2024-05-28 20:16:23] [INFO ] Deduced a trap composed of 149 places in 133 ms of which 2 ms to minimize.
[2024-05-28 20:16:24] [INFO ] Deduced a trap composed of 129 places in 138 ms of which 2 ms to minimize.
[2024-05-28 20:16:24] [INFO ] Deduced a trap composed of 134 places in 146 ms of which 2 ms to minimize.
[2024-05-28 20:16:24] [INFO ] Deduced a trap composed of 139 places in 166 ms of which 2 ms to minimize.
[2024-05-28 20:16:24] [INFO ] Deduced a trap composed of 144 places in 164 ms of which 2 ms to minimize.
[2024-05-28 20:16:24] [INFO ] Deduced a trap composed of 134 places in 167 ms of which 2 ms to minimize.
[2024-05-28 20:16:24] [INFO ] Deduced a trap composed of 134 places in 138 ms of which 2 ms to minimize.
[2024-05-28 20:16:25] [INFO ] Deduced a trap composed of 124 places in 148 ms of which 2 ms to minimize.
[2024-05-28 20:16:25] [INFO ] Deduced a trap composed of 124 places in 132 ms of which 2 ms to minimize.
[2024-05-28 20:16:25] [INFO ] Deduced a trap composed of 119 places in 130 ms of which 2 ms to minimize.
[2024-05-28 20:16:25] [INFO ] Deduced a trap composed of 119 places in 140 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
[2024-05-28 20:16:31] [INFO ] Deduced a trap composed of 124 places in 127 ms of which 2 ms to minimize.
[2024-05-28 20:16:31] [INFO ] Deduced a trap composed of 167 places in 132 ms of which 2 ms to minimize.
[2024-05-28 20:16:31] [INFO ] Deduced a trap composed of 114 places in 167 ms of which 2 ms to minimize.
[2024-05-28 20:16:31] [INFO ] Deduced a trap composed of 114 places in 162 ms of which 2 ms to minimize.
[2024-05-28 20:16:31] [INFO ] Deduced a trap composed of 124 places in 136 ms of which 2 ms to minimize.
[2024-05-28 20:16:32] [INFO ] Deduced a trap composed of 173 places in 137 ms of which 2 ms to minimize.
[2024-05-28 20:16:32] [INFO ] Deduced a trap composed of 119 places in 144 ms of which 2 ms to minimize.
[2024-05-28 20:16:32] [INFO ] Deduced a trap composed of 171 places in 132 ms of which 2 ms to minimize.
[2024-05-28 20:16:32] [INFO ] Deduced a trap composed of 124 places in 143 ms of which 2 ms to minimize.
[2024-05-28 20:16:32] [INFO ] Deduced a trap composed of 124 places in 154 ms of which 2 ms to minimize.
[2024-05-28 20:16:32] [INFO ] Deduced a trap composed of 124 places in 138 ms of which 2 ms to minimize.
[2024-05-28 20:16:33] [INFO ] Deduced a trap composed of 169 places in 134 ms of which 2 ms to minimize.
[2024-05-28 20:16:33] [INFO ] Deduced a trap composed of 165 places in 134 ms of which 2 ms to minimize.
[2024-05-28 20:16:33] [INFO ] Deduced a trap composed of 171 places in 185 ms of which 2 ms to minimize.
[2024-05-28 20:16:33] [INFO ] Deduced a trap composed of 139 places in 135 ms of which 2 ms to minimize.
[2024-05-28 20:16:33] [INFO ] Deduced a trap composed of 139 places in 138 ms of which 2 ms to minimize.
SMT process timed out in 25604ms, After SMT, problems are : Problem set: 0 solved, 1030 unsolved
Search for dead transitions found 0 dead transitions in 25613ms
[2024-05-28 20:16:33] [INFO ] Flow matrix only has 1032 transitions (discarded 9 similar events)
[2024-05-28 20:16:33] [INFO ] Invariant cache hit.
[2024-05-28 20:16:33] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-28 20:16:33] [INFO ] Flow matrix only has 1032 transitions (discarded 9 similar events)
[2024-05-28 20:16:33] [INFO ] Invariant cache hit.
[2024-05-28 20:16:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:16:35] [INFO ] Implicit Places using invariants and state equation in 1417 ms returned []
Implicit Place search using SMT with State Equation took 1662 ms to find 0 implicit places.
[2024-05-28 20:16:35] [INFO ] Redundant transitions in 22 ms returned []
Running 1030 sub problems to find dead transitions.
[2024-05-28 20:16:35] [INFO ] Flow matrix only has 1032 transitions (discarded 9 similar events)
[2024-05-28 20:16:35] [INFO ] Invariant cache hit.
[2024-05-28 20:16:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
[2024-05-28 20:16:48] [INFO ] Deduced a trap composed of 134 places in 145 ms of which 2 ms to minimize.
[2024-05-28 20:16:48] [INFO ] Deduced a trap composed of 134 places in 133 ms of which 2 ms to minimize.
[2024-05-28 20:16:48] [INFO ] Deduced a trap composed of 139 places in 177 ms of which 2 ms to minimize.
[2024-05-28 20:16:48] [INFO ] Deduced a trap composed of 144 places in 450 ms of which 3 ms to minimize.
[2024-05-28 20:16:49] [INFO ] Deduced a trap composed of 134 places in 196 ms of which 3 ms to minimize.
[2024-05-28 20:16:49] [INFO ] Deduced a trap composed of 139 places in 168 ms of which 3 ms to minimize.
[2024-05-28 20:16:49] [INFO ] Deduced a trap composed of 114 places in 170 ms of which 3 ms to minimize.
[2024-05-28 20:16:49] [INFO ] Deduced a trap composed of 129 places in 170 ms of which 3 ms to minimize.
[2024-05-28 20:16:50] [INFO ] Deduced a trap composed of 109 places in 331 ms of which 3 ms to minimize.
[2024-05-28 20:16:50] [INFO ] Deduced a trap composed of 109 places in 186 ms of which 2 ms to minimize.
[2024-05-28 20:16:50] [INFO ] Deduced a trap composed of 109 places in 199 ms of which 3 ms to minimize.
[2024-05-28 20:16:50] [INFO ] Deduced a trap composed of 109 places in 222 ms of which 3 ms to minimize.
[2024-05-28 20:16:50] [INFO ] Deduced a trap composed of 114 places in 183 ms of which 3 ms to minimize.
[2024-05-28 20:16:51] [INFO ] Deduced a trap composed of 129 places in 183 ms of which 3 ms to minimize.
[2024-05-28 20:16:51] [INFO ] Deduced a trap composed of 124 places in 161 ms of which 2 ms to minimize.
[2024-05-28 20:16:51] [INFO ] Deduced a trap composed of 119 places in 147 ms of which 2 ms to minimize.
[2024-05-28 20:16:51] [INFO ] Deduced a trap composed of 124 places in 183 ms of which 3 ms to minimize.
[2024-05-28 20:16:51] [INFO ] Deduced a trap composed of 109 places in 155 ms of which 3 ms to minimize.
[2024-05-28 20:16:51] [INFO ] Deduced a trap composed of 114 places in 144 ms of which 2 ms to minimize.
[2024-05-28 20:16:52] [INFO ] Deduced a trap composed of 109 places in 147 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
[2024-05-28 20:16:52] [INFO ] Deduced a trap composed of 129 places in 195 ms of which 3 ms to minimize.
[2024-05-28 20:16:52] [INFO ] Deduced a trap composed of 129 places in 166 ms of which 3 ms to minimize.
[2024-05-28 20:16:53] [INFO ] Deduced a trap composed of 124 places in 177 ms of which 10 ms to minimize.
[2024-05-28 20:16:53] [INFO ] Deduced a trap composed of 124 places in 173 ms of which 3 ms to minimize.
[2024-05-28 20:16:53] [INFO ] Deduced a trap composed of 124 places in 166 ms of which 3 ms to minimize.
[2024-05-28 20:16:53] [INFO ] Deduced a trap composed of 167 places in 172 ms of which 3 ms to minimize.
[2024-05-28 20:16:53] [INFO ] Deduced a trap composed of 177 places in 203 ms of which 3 ms to minimize.
[2024-05-28 20:16:54] [INFO ] Deduced a trap composed of 129 places in 179 ms of which 3 ms to minimize.
[2024-05-28 20:16:54] [INFO ] Deduced a trap composed of 124 places in 168 ms of which 3 ms to minimize.
[2024-05-28 20:16:54] [INFO ] Deduced a trap composed of 124 places in 171 ms of which 3 ms to minimize.
[2024-05-28 20:16:54] [INFO ] Deduced a trap composed of 139 places in 166 ms of which 3 ms to minimize.
[2024-05-28 20:16:54] [INFO ] Deduced a trap composed of 129 places in 171 ms of which 2 ms to minimize.
[2024-05-28 20:16:54] [INFO ] Deduced a trap composed of 134 places in 169 ms of which 3 ms to minimize.
[2024-05-28 20:16:55] [INFO ] Deduced a trap composed of 119 places in 171 ms of which 3 ms to minimize.
[2024-05-28 20:16:55] [INFO ] Deduced a trap composed of 134 places in 167 ms of which 3 ms to minimize.
[2024-05-28 20:16:55] [INFO ] Deduced a trap composed of 114 places in 178 ms of which 3 ms to minimize.
[2024-05-28 20:16:55] [INFO ] Deduced a trap composed of 114 places in 165 ms of which 3 ms to minimize.
[2024-05-28 20:16:55] [INFO ] Deduced a trap composed of 114 places in 184 ms of which 3 ms to minimize.
[2024-05-28 20:16:56] [INFO ] Deduced a trap composed of 119 places in 178 ms of which 3 ms to minimize.
[2024-05-28 20:16:56] [INFO ] Deduced a trap composed of 167 places in 175 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
At refinement iteration 5 (OVERLAPS) 9/412 variables, 9/101 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
[2024-05-28 20:17:08] [INFO ] Deduced a trap composed of 16 places in 214 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 412/1445 variables, and 102 constraints, problems are : Problem set: 0 solved, 1030 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/413 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1030/1030 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1030 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 41/93 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
[2024-05-28 20:17:13] [INFO ] Deduced a trap composed of 109 places in 217 ms of which 3 ms to minimize.
[2024-05-28 20:17:13] [INFO ] Deduced a trap composed of 114 places in 168 ms of which 3 ms to minimize.
[2024-05-28 20:17:13] [INFO ] Deduced a trap composed of 119 places in 158 ms of which 2 ms to minimize.
[2024-05-28 20:17:13] [INFO ] Deduced a trap composed of 173 places in 162 ms of which 3 ms to minimize.
[2024-05-28 20:17:14] [INFO ] Deduced a trap composed of 175 places in 167 ms of which 3 ms to minimize.
[2024-05-28 20:17:14] [INFO ] Deduced a trap composed of 124 places in 164 ms of which 3 ms to minimize.
[2024-05-28 20:17:14] [INFO ] Deduced a trap composed of 171 places in 243 ms of which 2 ms to minimize.
[2024-05-28 20:17:14] [INFO ] Deduced a trap composed of 129 places in 140 ms of which 3 ms to minimize.
[2024-05-28 20:17:14] [INFO ] Deduced a trap composed of 139 places in 130 ms of which 2 ms to minimize.
[2024-05-28 20:17:14] [INFO ] Deduced a trap composed of 134 places in 126 ms of which 2 ms to minimize.
[2024-05-28 20:17:15] [INFO ] Deduced a trap composed of 171 places in 142 ms of which 2 ms to minimize.
[2024-05-28 20:17:15] [INFO ] Deduced a trap composed of 171 places in 141 ms of which 2 ms to minimize.
[2024-05-28 20:17:15] [INFO ] Deduced a trap composed of 171 places in 143 ms of which 2 ms to minimize.
[2024-05-28 20:17:15] [INFO ] Deduced a trap composed of 173 places in 126 ms of which 2 ms to minimize.
[2024-05-28 20:17:15] [INFO ] Deduced a trap composed of 139 places in 184 ms of which 5 ms to minimize.
[2024-05-28 20:17:15] [INFO ] Deduced a trap composed of 129 places in 166 ms of which 3 ms to minimize.
[2024-05-28 20:17:16] [INFO ] Deduced a trap composed of 124 places in 128 ms of which 2 ms to minimize.
[2024-05-28 20:17:16] [INFO ] Deduced a trap composed of 171 places in 156 ms of which 2 ms to minimize.
[2024-05-28 20:17:16] [INFO ] Deduced a trap composed of 19 places in 272 ms of which 2 ms to minimize.
[2024-05-28 20:17:17] [INFO ] Deduced a trap composed of 143 places in 344 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
[2024-05-28 20:17:18] [INFO ] Deduced a trap composed of 134 places in 208 ms of which 3 ms to minimize.
[2024-05-28 20:17:18] [INFO ] Deduced a trap composed of 129 places in 173 ms of which 3 ms to minimize.
[2024-05-28 20:17:18] [INFO ] Deduced a trap composed of 124 places in 201 ms of which 3 ms to minimize.
[2024-05-28 20:17:19] [INFO ] Deduced a trap composed of 167 places in 189 ms of which 3 ms to minimize.
[2024-05-28 20:17:19] [INFO ] Deduced a trap composed of 119 places in 176 ms of which 3 ms to minimize.
[2024-05-28 20:17:19] [INFO ] Deduced a trap composed of 114 places in 199 ms of which 3 ms to minimize.
[2024-05-28 20:17:20] [INFO ] Deduced a trap composed of 133 places in 360 ms of which 3 ms to minimize.
[2024-05-28 20:17:21] [INFO ] Deduced a trap composed of 124 places in 276 ms of which 3 ms to minimize.
[2024-05-28 20:17:21] [INFO ] Deduced a trap composed of 128 places in 261 ms of which 2 ms to minimize.
[2024-05-28 20:17:21] [INFO ] Deduced a trap composed of 114 places in 224 ms of which 2 ms to minimize.
[2024-05-28 20:17:21] [INFO ] Deduced a trap composed of 114 places in 231 ms of which 2 ms to minimize.
[2024-05-28 20:17:22] [INFO ] Deduced a trap composed of 133 places in 222 ms of which 3 ms to minimize.
[2024-05-28 20:17:22] [INFO ] Deduced a trap composed of 124 places in 190 ms of which 2 ms to minimize.
[2024-05-28 20:17:22] [INFO ] Deduced a trap composed of 128 places in 267 ms of which 2 ms to minimize.
[2024-05-28 20:17:22] [INFO ] Deduced a trap composed of 118 places in 226 ms of which 2 ms to minimize.
[2024-05-28 20:17:23] [INFO ] Deduced a trap composed of 119 places in 227 ms of which 3 ms to minimize.
[2024-05-28 20:17:23] [INFO ] Deduced a trap composed of 124 places in 218 ms of which 2 ms to minimize.
[2024-05-28 20:17:23] [INFO ] Deduced a trap composed of 114 places in 199 ms of which 2 ms to minimize.
[2024-05-28 20:17:23] [INFO ] Deduced a trap composed of 114 places in 258 ms of which 3 ms to minimize.
[2024-05-28 20:17:24] [INFO ] Deduced a trap composed of 119 places in 231 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
[2024-05-28 20:17:24] [INFO ] Deduced a trap composed of 122 places in 282 ms of which 3 ms to minimize.
[2024-05-28 20:17:25] [INFO ] Deduced a trap composed of 114 places in 233 ms of which 3 ms to minimize.
[2024-05-28 20:17:25] [INFO ] Deduced a trap composed of 117 places in 256 ms of which 2 ms to minimize.
[2024-05-28 20:17:25] [INFO ] Deduced a trap composed of 109 places in 215 ms of which 3 ms to minimize.
[2024-05-28 20:17:25] [INFO ] Deduced a trap composed of 119 places in 212 ms of which 2 ms to minimize.
[2024-05-28 20:17:26] [INFO ] Deduced a trap composed of 119 places in 196 ms of which 3 ms to minimize.
[2024-05-28 20:17:26] [INFO ] Deduced a trap composed of 114 places in 205 ms of which 2 ms to minimize.
[2024-05-28 20:17:26] [INFO ] Deduced a trap composed of 114 places in 196 ms of which 2 ms to minimize.
[2024-05-28 20:17:26] [INFO ] Deduced a trap composed of 109 places in 211 ms of which 2 ms to minimize.
[2024-05-28 20:17:26] [INFO ] Deduced a trap composed of 109 places in 195 ms of which 2 ms to minimize.
[2024-05-28 20:17:27] [INFO ] Deduced a trap composed of 119 places in 202 ms of which 2 ms to minimize.
[2024-05-28 20:17:27] [INFO ] Deduced a trap composed of 124 places in 202 ms of which 2 ms to minimize.
[2024-05-28 20:17:27] [INFO ] Deduced a trap composed of 127 places in 216 ms of which 12 ms to minimize.
[2024-05-28 20:17:27] [INFO ] Deduced a trap composed of 119 places in 205 ms of which 2 ms to minimize.
[2024-05-28 20:17:28] [INFO ] Deduced a trap composed of 128 places in 198 ms of which 2 ms to minimize.
[2024-05-28 20:17:28] [INFO ] Deduced a trap composed of 114 places in 185 ms of which 2 ms to minimize.
[2024-05-28 20:17:28] [INFO ] Deduced a trap composed of 123 places in 182 ms of which 3 ms to minimize.
[2024-05-28 20:17:28] [INFO ] Deduced a trap composed of 129 places in 180 ms of which 2 ms to minimize.
[2024-05-28 20:17:28] [INFO ] Deduced a trap composed of 123 places in 192 ms of which 2 ms to minimize.
[2024-05-28 20:17:29] [INFO ] Deduced a trap composed of 109 places in 202 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
[2024-05-28 20:17:30] [INFO ] Deduced a trap composed of 128 places in 335 ms of which 3 ms to minimize.
[2024-05-28 20:17:30] [INFO ] Deduced a trap composed of 114 places in 296 ms of which 3 ms to minimize.
[2024-05-28 20:17:30] [INFO ] Deduced a trap composed of 114 places in 326 ms of which 3 ms to minimize.
[2024-05-28 20:17:31] [INFO ] Deduced a trap composed of 129 places in 227 ms of which 3 ms to minimize.
[2024-05-28 20:17:31] [INFO ] Deduced a trap composed of 124 places in 213 ms of which 3 ms to minimize.
[2024-05-28 20:17:31] [INFO ] Deduced a trap composed of 124 places in 198 ms of which 2 ms to minimize.
[2024-05-28 20:17:31] [INFO ] Deduced a trap composed of 123 places in 197 ms of which 3 ms to minimize.
[2024-05-28 20:17:31] [INFO ] Deduced a trap composed of 114 places in 175 ms of which 2 ms to minimize.
[2024-05-28 20:17:32] [INFO ] Deduced a trap composed of 173 places in 231 ms of which 3 ms to minimize.
[2024-05-28 20:17:32] [INFO ] Deduced a trap composed of 123 places in 232 ms of which 2 ms to minimize.
[2024-05-28 20:17:32] [INFO ] Deduced a trap composed of 109 places in 277 ms of which 3 ms to minimize.
[2024-05-28 20:17:34] [INFO ] Deduced a trap composed of 123 places in 351 ms of which 3 ms to minimize.
[2024-05-28 20:17:34] [INFO ] Deduced a trap composed of 115 places in 303 ms of which 3 ms to minimize.
[2024-05-28 20:17:34] [INFO ] Deduced a trap composed of 119 places in 315 ms of which 3 ms to minimize.
[2024-05-28 20:17:35] [INFO ] Deduced a trap composed of 176 places in 286 ms of which 2 ms to minimize.
[2024-05-28 20:17:35] [INFO ] Deduced a trap composed of 122 places in 239 ms of which 2 ms to minimize.
[2024-05-28 20:17:35] [INFO ] Deduced a trap composed of 129 places in 212 ms of which 2 ms to minimize.
[2024-05-28 20:17:35] [INFO ] Deduced a trap composed of 110 places in 220 ms of which 2 ms to minimize.
[2024-05-28 20:17:36] [INFO ] Deduced a trap composed of 128 places in 207 ms of which 3 ms to minimize.
[2024-05-28 20:17:36] [INFO ] Deduced a trap composed of 105 places in 212 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 20/173 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
[2024-05-28 20:17:37] [INFO ] Deduced a trap composed of 139 places in 219 ms of which 16 ms to minimize.
[2024-05-28 20:17:37] [INFO ] Deduced a trap composed of 119 places in 186 ms of which 3 ms to minimize.
[2024-05-28 20:17:37] [INFO ] Deduced a trap composed of 134 places in 198 ms of which 2 ms to minimize.
[2024-05-28 20:17:38] [INFO ] Deduced a trap composed of 119 places in 222 ms of which 4 ms to minimize.
[2024-05-28 20:17:38] [INFO ] Deduced a trap composed of 114 places in 193 ms of which 3 ms to minimize.
[2024-05-28 20:17:38] [INFO ] Deduced a trap composed of 109 places in 187 ms of which 3 ms to minimize.
[2024-05-28 20:17:38] [INFO ] Deduced a trap composed of 129 places in 214 ms of which 3 ms to minimize.
[2024-05-28 20:17:39] [INFO ] Deduced a trap composed of 183 places in 360 ms of which 3 ms to minimize.
[2024-05-28 20:17:39] [INFO ] Deduced a trap composed of 181 places in 320 ms of which 3 ms to minimize.
[2024-05-28 20:17:39] [INFO ] Deduced a trap composed of 179 places in 314 ms of which 2 ms to minimize.
[2024-05-28 20:17:40] [INFO ] Deduced a trap composed of 173 places in 300 ms of which 2 ms to minimize.
[2024-05-28 20:17:40] [INFO ] Deduced a trap composed of 169 places in 292 ms of which 2 ms to minimize.
[2024-05-28 20:17:40] [INFO ] Deduced a trap composed of 175 places in 284 ms of which 3 ms to minimize.
[2024-05-28 20:17:41] [INFO ] Deduced a trap composed of 171 places in 269 ms of which 3 ms to minimize.
[2024-05-28 20:17:41] [INFO ] Deduced a trap composed of 129 places in 270 ms of which 2 ms to minimize.
[2024-05-28 20:17:41] [INFO ] Deduced a trap composed of 167 places in 267 ms of which 2 ms to minimize.
[2024-05-28 20:17:41] [INFO ] Deduced a trap composed of 175 places in 265 ms of which 3 ms to minimize.
[2024-05-28 20:17:42] [INFO ] Deduced a trap composed of 171 places in 262 ms of which 2 ms to minimize.
SMT process timed out in 66823ms, After SMT, problems are : Problem set: 0 solved, 1030 unsolved
Search for dead transitions found 0 dead transitions in 66834ms
Starting structural reductions in SI_LTL mode, iteration 1 : 413/474 places, 1041/1092 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 94205 ms. Remains : 413/474 places, 1041/1092 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))), (AND (NOT p3) p2), (AND p2 (NOT p3)), (AND p2 (NOT p3))]
Running random walk in product with property : PolyORBNT-COL-S10J20-LTLFireability-11
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 6 ms.
FORMULA PolyORBNT-COL-S10J20-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J20-LTLFireability-11 finished in 94495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 474/474 places, 1092/1092 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 464 transition count 1068
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 440 transition count 1067
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 439 transition count 1067
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 50 place count 439 transition count 1042
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 100 place count 414 transition count 1042
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 104 place count 412 transition count 1040
Applied a total of 104 rules in 87 ms. Remains 412 /474 variables (removed 62) and now considering 1040/1092 (removed 52) transitions.
Running 1029 sub problems to find dead transitions.
[2024-05-28 20:17:42] [INFO ] Flow matrix only has 1031 transitions (discarded 9 similar events)
// Phase 1: matrix 1031 rows 412 cols
[2024-05-28 20:17:42] [INFO ] Computed 62 invariants in 28 ms
[2024-05-28 20:17:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 20:17:53] [INFO ] Deduced a trap composed of 163 places in 201 ms of which 2 ms to minimize.
[2024-05-28 20:17:53] [INFO ] Deduced a trap composed of 165 places in 119 ms of which 2 ms to minimize.
[2024-05-28 20:17:53] [INFO ] Deduced a trap composed of 122 places in 173 ms of which 3 ms to minimize.
[2024-05-28 20:17:54] [INFO ] Deduced a trap composed of 122 places in 160 ms of which 3 ms to minimize.
[2024-05-28 20:17:54] [INFO ] Deduced a trap composed of 127 places in 142 ms of which 2 ms to minimize.
[2024-05-28 20:17:54] [INFO ] Deduced a trap composed of 122 places in 172 ms of which 3 ms to minimize.
[2024-05-28 20:17:54] [INFO ] Deduced a trap composed of 122 places in 161 ms of which 2 ms to minimize.
[2024-05-28 20:17:54] [INFO ] Deduced a trap composed of 127 places in 131 ms of which 2 ms to minimize.
[2024-05-28 20:17:54] [INFO ] Deduced a trap composed of 132 places in 160 ms of which 2 ms to minimize.
[2024-05-28 20:17:55] [INFO ] Deduced a trap composed of 117 places in 135 ms of which 2 ms to minimize.
[2024-05-28 20:17:55] [INFO ] Deduced a trap composed of 132 places in 132 ms of which 2 ms to minimize.
[2024-05-28 20:17:55] [INFO ] Deduced a trap composed of 117 places in 134 ms of which 2 ms to minimize.
[2024-05-28 20:17:55] [INFO ] Deduced a trap composed of 122 places in 132 ms of which 2 ms to minimize.
[2024-05-28 20:17:55] [INFO ] Deduced a trap composed of 122 places in 149 ms of which 2 ms to minimize.
[2024-05-28 20:17:55] [INFO ] Deduced a trap composed of 117 places in 133 ms of which 2 ms to minimize.
[2024-05-28 20:17:56] [INFO ] Deduced a trap composed of 117 places in 133 ms of which 2 ms to minimize.
[2024-05-28 20:17:56] [INFO ] Deduced a trap composed of 122 places in 179 ms of which 3 ms to minimize.
[2024-05-28 20:17:56] [INFO ] Deduced a trap composed of 117 places in 147 ms of which 2 ms to minimize.
[2024-05-28 20:17:56] [INFO ] Deduced a trap composed of 117 places in 132 ms of which 2 ms to minimize.
[2024-05-28 20:17:56] [INFO ] Deduced a trap composed of 117 places in 132 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 20:17:57] [INFO ] Deduced a trap composed of 169 places in 166 ms of which 2 ms to minimize.
[2024-05-28 20:17:57] [INFO ] Deduced a trap composed of 127 places in 155 ms of which 2 ms to minimize.
[2024-05-28 20:17:57] [INFO ] Deduced a trap composed of 167 places in 177 ms of which 3 ms to minimize.
[2024-05-28 20:17:57] [INFO ] Deduced a trap composed of 127 places in 159 ms of which 2 ms to minimize.
[2024-05-28 20:17:57] [INFO ] Deduced a trap composed of 122 places in 123 ms of which 2 ms to minimize.
[2024-05-28 20:17:57] [INFO ] Deduced a trap composed of 167 places in 179 ms of which 2 ms to minimize.
[2024-05-28 20:17:58] [INFO ] Deduced a trap composed of 165 places in 167 ms of which 2 ms to minimize.
[2024-05-28 20:17:58] [INFO ] Deduced a trap composed of 122 places in 204 ms of which 3 ms to minimize.
[2024-05-28 20:17:58] [INFO ] Deduced a trap composed of 127 places in 164 ms of which 2 ms to minimize.
[2024-05-28 20:17:58] [INFO ] Deduced a trap composed of 127 places in 159 ms of which 3 ms to minimize.
[2024-05-28 20:17:58] [INFO ] Deduced a trap composed of 122 places in 173 ms of which 3 ms to minimize.
[2024-05-28 20:17:59] [INFO ] Deduced a trap composed of 122 places in 200 ms of which 2 ms to minimize.
[2024-05-28 20:17:59] [INFO ] Deduced a trap composed of 117 places in 187 ms of which 3 ms to minimize.
[2024-05-28 20:17:59] [INFO ] Deduced a trap composed of 117 places in 186 ms of which 3 ms to minimize.
[2024-05-28 20:17:59] [INFO ] Deduced a trap composed of 112 places in 190 ms of which 3 ms to minimize.
[2024-05-28 20:17:59] [INFO ] Deduced a trap composed of 122 places in 176 ms of which 3 ms to minimize.
[2024-05-28 20:18:00] [INFO ] Deduced a trap composed of 117 places in 186 ms of which 3 ms to minimize.
[2024-05-28 20:18:00] [INFO ] Deduced a trap composed of 112 places in 193 ms of which 3 ms to minimize.
[2024-05-28 20:18:00] [INFO ] Deduced a trap composed of 163 places in 187 ms of which 3 ms to minimize.
[2024-05-28 20:18:00] [INFO ] Deduced a trap composed of 117 places in 181 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 20:18:07] [INFO ] Deduced a trap composed of 66 places in 201 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 402/1443 variables, and 93 constraints, problems are : Problem set: 0 solved, 1029 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/412 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1029/1029 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1029 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 41/93 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 20:18:08] [INFO ] Deduced a trap composed of 107 places in 160 ms of which 2 ms to minimize.
[2024-05-28 20:18:08] [INFO ] Deduced a trap composed of 123 places in 193 ms of which 2 ms to minimize.
[2024-05-28 20:18:09] [INFO ] Deduced a trap composed of 127 places in 154 ms of which 2 ms to minimize.
[2024-05-28 20:18:09] [INFO ] Deduced a trap composed of 123 places in 141 ms of which 2 ms to minimize.
[2024-05-28 20:18:09] [INFO ] Deduced a trap composed of 122 places in 149 ms of which 2 ms to minimize.
[2024-05-28 20:18:09] [INFO ] Deduced a trap composed of 112 places in 193 ms of which 3 ms to minimize.
[2024-05-28 20:18:10] [INFO ] Deduced a trap composed of 121 places in 290 ms of which 3 ms to minimize.
[2024-05-28 20:18:10] [INFO ] Deduced a trap composed of 112 places in 286 ms of which 3 ms to minimize.
[2024-05-28 20:18:10] [INFO ] Deduced a trap composed of 136 places in 301 ms of which 3 ms to minimize.
[2024-05-28 20:18:10] [INFO ] Deduced a trap composed of 112 places in 284 ms of which 3 ms to minimize.
[2024-05-28 20:18:11] [INFO ] Deduced a trap composed of 163 places in 293 ms of which 3 ms to minimize.
[2024-05-28 20:18:11] [INFO ] Deduced a trap composed of 126 places in 277 ms of which 2 ms to minimize.
[2024-05-28 20:18:11] [INFO ] Deduced a trap composed of 122 places in 244 ms of which 2 ms to minimize.
[2024-05-28 20:18:12] [INFO ] Deduced a trap composed of 167 places in 250 ms of which 2 ms to minimize.
[2024-05-28 20:18:12] [INFO ] Deduced a trap composed of 127 places in 294 ms of which 3 ms to minimize.
[2024-05-28 20:18:12] [INFO ] Deduced a trap composed of 18 places in 207 ms of which 2 ms to minimize.
[2024-05-28 20:18:13] [INFO ] Deduced a trap composed of 165 places in 281 ms of which 2 ms to minimize.
[2024-05-28 20:18:13] [INFO ] Deduced a trap composed of 153 places in 291 ms of which 3 ms to minimize.
[2024-05-28 20:18:14] [INFO ] Deduced a trap composed of 163 places in 271 ms of which 3 ms to minimize.
[2024-05-28 20:18:14] [INFO ] Deduced a trap composed of 155 places in 258 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 20:18:15] [INFO ] Deduced a trap composed of 112 places in 197 ms of which 2 ms to minimize.
[2024-05-28 20:18:15] [INFO ] Deduced a trap composed of 117 places in 167 ms of which 3 ms to minimize.
[2024-05-28 20:18:15] [INFO ] Deduced a trap composed of 107 places in 160 ms of which 3 ms to minimize.
[2024-05-28 20:18:15] [INFO ] Deduced a trap composed of 112 places in 209 ms of which 3 ms to minimize.
[2024-05-28 20:18:15] [INFO ] Deduced a trap composed of 117 places in 179 ms of which 3 ms to minimize.
[2024-05-28 20:18:16] [INFO ] Deduced a trap composed of 112 places in 199 ms of which 3 ms to minimize.
[2024-05-28 20:18:16] [INFO ] Deduced a trap composed of 132 places in 202 ms of which 3 ms to minimize.
[2024-05-28 20:18:16] [INFO ] Deduced a trap composed of 132 places in 188 ms of which 3 ms to minimize.
[2024-05-28 20:18:16] [INFO ] Deduced a trap composed of 132 places in 200 ms of which 3 ms to minimize.
[2024-05-28 20:18:16] [INFO ] Deduced a trap composed of 117 places in 188 ms of which 3 ms to minimize.
[2024-05-28 20:18:17] [INFO ] Deduced a trap composed of 122 places in 166 ms of which 2 ms to minimize.
[2024-05-28 20:18:17] [INFO ] Deduced a trap composed of 117 places in 159 ms of which 2 ms to minimize.
[2024-05-28 20:18:17] [INFO ] Deduced a trap composed of 122 places in 193 ms of which 3 ms to minimize.
[2024-05-28 20:18:17] [INFO ] Deduced a trap composed of 117 places in 156 ms of which 2 ms to minimize.
[2024-05-28 20:18:17] [INFO ] Deduced a trap composed of 142 places in 134 ms of which 2 ms to minimize.
[2024-05-28 20:18:18] [INFO ] Deduced a trap composed of 142 places in 133 ms of which 2 ms to minimize.
[2024-05-28 20:18:18] [INFO ] Deduced a trap composed of 137 places in 188 ms of which 3 ms to minimize.
[2024-05-28 20:18:18] [INFO ] Deduced a trap composed of 107 places in 184 ms of which 3 ms to minimize.
[2024-05-28 20:18:18] [INFO ] Deduced a trap composed of 117 places in 171 ms of which 3 ms to minimize.
[2024-05-28 20:18:19] [INFO ] Deduced a trap composed of 136 places in 311 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 20:18:20] [INFO ] Deduced a trap composed of 112 places in 196 ms of which 3 ms to minimize.
[2024-05-28 20:18:20] [INFO ] Deduced a trap composed of 107 places in 170 ms of which 3 ms to minimize.
[2024-05-28 20:18:20] [INFO ] Deduced a trap composed of 127 places in 169 ms of which 4 ms to minimize.
[2024-05-28 20:18:20] [INFO ] Deduced a trap composed of 122 places in 175 ms of which 2 ms to minimize.
[2024-05-28 20:18:21] [INFO ] Deduced a trap composed of 122 places in 193 ms of which 3 ms to minimize.
[2024-05-28 20:18:21] [INFO ] Deduced a trap composed of 117 places in 171 ms of which 3 ms to minimize.
[2024-05-28 20:18:21] [INFO ] Deduced a trap composed of 122 places in 168 ms of which 3 ms to minimize.
[2024-05-28 20:18:21] [INFO ] Deduced a trap composed of 122 places in 209 ms of which 3 ms to minimize.
[2024-05-28 20:18:21] [INFO ] Deduced a trap composed of 108 places in 180 ms of which 2 ms to minimize.
[2024-05-28 20:18:22] [INFO ] Deduced a trap composed of 122 places in 172 ms of which 2 ms to minimize.
[2024-05-28 20:18:22] [INFO ] Deduced a trap composed of 122 places in 177 ms of which 2 ms to minimize.
[2024-05-28 20:18:22] [INFO ] Deduced a trap composed of 161 places in 214 ms of which 3 ms to minimize.
[2024-05-28 20:18:22] [INFO ] Deduced a trap composed of 117 places in 208 ms of which 3 ms to minimize.
[2024-05-28 20:18:23] [INFO ] Deduced a trap composed of 126 places in 354 ms of which 3 ms to minimize.
[2024-05-28 20:18:23] [INFO ] Deduced a trap composed of 122 places in 317 ms of which 3 ms to minimize.
[2024-05-28 20:18:23] [INFO ] Deduced a trap composed of 141 places in 313 ms of which 3 ms to minimize.
[2024-05-28 20:18:24] [INFO ] Deduced a trap composed of 127 places in 287 ms of which 3 ms to minimize.
[2024-05-28 20:18:24] [INFO ] Deduced a trap composed of 136 places in 270 ms of which 2 ms to minimize.
[2024-05-28 20:18:24] [INFO ] Deduced a trap composed of 117 places in 201 ms of which 2 ms to minimize.
[2024-05-28 20:18:24] [INFO ] Deduced a trap composed of 136 places in 208 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 20:18:26] [INFO ] Deduced a trap composed of 116 places in 199 ms of which 2 ms to minimize.
[2024-05-28 20:18:26] [INFO ] Deduced a trap composed of 133 places in 193 ms of which 2 ms to minimize.
[2024-05-28 20:18:26] [INFO ] Deduced a trap composed of 107 places in 226 ms of which 2 ms to minimize.
[2024-05-28 20:18:26] [INFO ] Deduced a trap composed of 107 places in 203 ms of which 2 ms to minimize.
[2024-05-28 20:18:27] [INFO ] Deduced a trap composed of 117 places in 210 ms of which 2 ms to minimize.
[2024-05-28 20:18:27] [INFO ] Deduced a trap composed of 142 places in 217 ms of which 2 ms to minimize.
[2024-05-28 20:18:27] [INFO ] Deduced a trap composed of 123 places in 291 ms of which 3 ms to minimize.
SMT process timed out in 45080ms, After SMT, problems are : Problem set: 0 solved, 1029 unsolved
Search for dead transitions found 0 dead transitions in 45136ms
[2024-05-28 20:18:27] [INFO ] Flow matrix only has 1031 transitions (discarded 9 similar events)
[2024-05-28 20:18:27] [INFO ] Invariant cache hit.
[2024-05-28 20:18:28] [INFO ] Implicit Places using invariants in 410 ms returned []
[2024-05-28 20:18:28] [INFO ] Flow matrix only has 1031 transitions (discarded 9 similar events)
[2024-05-28 20:18:28] [INFO ] Invariant cache hit.
[2024-05-28 20:18:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:18:29] [INFO ] Implicit Places using invariants and state equation in 1456 ms returned []
Implicit Place search using SMT with State Equation took 1868 ms to find 0 implicit places.
[2024-05-28 20:18:29] [INFO ] Redundant transitions in 24 ms returned []
Running 1029 sub problems to find dead transitions.
[2024-05-28 20:18:29] [INFO ] Flow matrix only has 1031 transitions (discarded 9 similar events)
[2024-05-28 20:18:29] [INFO ] Invariant cache hit.
[2024-05-28 20:18:29] [INFO ] State equation strengthened by 1 read => feed constraints.

BK_STOP 1716927515672

--------------------
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="PolyORBNT-COL-S10J20"
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 PolyORBNT-COL-S10J20, 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-171654447000404"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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