Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.7K Apr 12 09:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 09:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 09:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 12 09:51 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.2K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 10:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 12 10:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 10:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 10:01 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 93K 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-S05J40-LTLFireability-00
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-01
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-02
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-03
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-04
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-05
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-06
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-07
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-08
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-09
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-10
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-11
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-12
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-13
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-14
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716877639291

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J40
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 06:27:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 06:27:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:27:20] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 06:27:21] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 06:27:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 776 ms
[2024-05-28 06:27:21] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 669 PT places and 1712.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 06:27:21] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2024-05-28 06:27:21] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PolyORBNT-COL-S05J40-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 10 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 40008 steps (3185 resets) in 1391 ms. (28 steps per ms) remains 6/14 properties
BEST_FIRST walk for 40004 steps (968 resets) in 233 ms. (170 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40001 steps (1027 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
// Phase 1: matrix 38 rows 48 cols
[2024-05-28 06:27:22] [INFO ] Computed 13 invariants in 5 ms
[2024-05-28 06:27:22] [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) 11/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/34 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/41 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/42 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/47 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 06:27:22] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 28 ms to minimize.
[2024-05-28 06:27:23] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 06:27:23] [INFO ] Deduced a trap composed of 13 places in 268 ms of which 2 ms to minimize.
[2024-05-28 06:27:23] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/47 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/47 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 38/85 variables, 47/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/85 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/85 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/86 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/86 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/86 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 66 constraints, problems are : Problem set: 0 solved, 1 unsolved in 918 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/1 constraints, Known Traps: 4/4 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) 11/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/34 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/41 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/42 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/47 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/47 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/47 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 38/85 variables, 47/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/85 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/85 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/86 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/86 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/86 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/86 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 67 constraints, problems are : Problem set: 0 solved, 1 unsolved in 79 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/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1043ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 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 33 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 06:27:23] [INFO ] Computed 12 invariants in 2 ms
[2024-05-28 06:27:23] [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 274 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 06:27:23] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 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 06:27:24] [INFO ] Deduced a trap composed of 8 places in 30 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 605 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 897ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 898ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 946 ms. Remains : 34/48 places, 28/38 transitions.
RANDOM walk for 40003 steps (4683 resets) in 457 ms. (87 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (1377 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
Probably explored full state space saw : 335 states, properties seen :0
Probabilistic random walk after 889 steps, saw 335 distinct states, run finished after 26 ms. (steps per millisecond=34 ) properties seen :0
Explored full state space saw : 335 states, properties seen :0
Exhaustive walk after 889 steps, saw 335 distinct states, run finished after 3 ms. (steps per millisecond=296 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA PolyORBNT-COL-S05J40-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 06:27:24] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-28 06:27:24] [INFO ] Flatten gal took : 22 ms
FORMULA PolyORBNT-COL-S05J40-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 06:27:24] [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 06:27:24] [INFO ] Unfolded HLPN to a Petri net with 669 places and 1630 transitions 10784 arcs in 49 ms.
[2024-05-28 06:27:24] [INFO ] Unfolded 11 HLPN properties in 1 ms.
[2024-05-28 06:27:24] [INFO ] Reduced 10 identical enabling conditions.
Deduced a syphon composed of 40 places in 7 ms
Reduce places removed 40 places and 40 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 190 out of 629 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 935/935 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 935
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 934
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 934
Applied a total of 7 rules in 67 ms. Remains 623 /629 variables (removed 6) and now considering 934/935 (removed 1) transitions.
Running 928 sub problems to find dead transitions.
[2024-05-28 06:27:24] [INFO ] Flow matrix only has 930 transitions (discarded 4 similar events)
// Phase 1: matrix 930 rows 623 cols
[2024-05-28 06:27:24] [INFO ] Computed 97 invariants in 42 ms
[2024-05-28 06:27:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 928 unsolved
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 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
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 (/ 2.0 3.0))
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 (/ 1.0 3.0))
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 (/ 1.0 3.0))
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 (/ 2.0 3.0))
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 (/ 1.0 4.0))
(s264 4.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 1.0)
(s269 9.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 1.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 1.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 78 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1553 variables, and 96 constraints, problems are : Problem set: 78 solved, 850 unsolved in 20061 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 78 solved, 850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 78 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 78 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 78 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 78 solved, 850 unsolved
[2024-05-28 06:28:01] [INFO ] Deduced a trap composed of 204 places in 300 ms of which 5 ms to minimize.
[2024-05-28 06:28:01] [INFO ] Deduced a trap composed of 14 places in 327 ms of which 8 ms to minimize.
[2024-05-28 06:28:01] [INFO ] Deduced a trap composed of 15 places in 265 ms of which 6 ms to minimize.
[2024-05-28 06:28:06] [INFO ] Deduced a trap composed of 24 places in 293 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1553 variables, and 100 constraints, problems are : Problem set: 78 solved, 850 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/928 constraints, Known Traps: 4/4 constraints]
After SMT, in 42019ms problems are : Problem set: 78 solved, 850 unsolved
Search for dead transitions found 78 dead transitions in 42036ms
Found 78 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 78 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 78 transitions.
[2024-05-28 06:28:06] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
// Phase 1: matrix 852 rows 623 cols
[2024-05-28 06:28:06] [INFO ] Computed 97 invariants in 25 ms
[2024-05-28 06:28:07] [INFO ] Implicit Places using invariants in 460 ms returned []
[2024-05-28 06:28:07] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-05-28 06:28:07] [INFO ] Invariant cache hit.
[2024-05-28 06:28:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:28:10] [INFO ] Implicit Places using invariants and state equation in 2609 ms returned []
Implicit Place search using SMT with State Equation took 3104 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 623/629 places, 856/935 transitions.
Applied a total of 0 rules in 26 ms. Remains 623 /623 variables (removed 0) and now considering 856/856 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45245 ms. Remains : 623/629 places, 856/935 transitions.
Support contains 190 out of 623 places after structural reductions.
[2024-05-28 06:28:10] [INFO ] Flatten gal took : 96 ms
[2024-05-28 06:28:10] [INFO ] Flatten gal took : 96 ms
[2024-05-28 06:28:10] [INFO ] Input system was already deterministic with 856 transitions.
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 40000 steps (2773 resets) in 1097 ms. (36 steps per ms) remains 1/13 properties
BEST_FIRST walk for 40003 steps (618 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
[2024-05-28 06:28:11] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-05-28 06:28:11] [INFO ] Invariant cache hit.
[2024-05-28 06:28:11] [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) 308/309 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 84/393 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 205/598 variables, 41/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/598 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/610 variables, 4/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/610 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/621 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 06:28:11] [INFO ] Deduced a trap composed of 265 places in 349 ms of which 4 ms to minimize.
[2024-05-28 06:28:11] [INFO ] Deduced a trap composed of 321 places in 252 ms of which 4 ms to minimize.
[2024-05-28 06:28:12] [INFO ] Deduced a trap composed of 323 places in 297 ms of which 4 ms to minimize.
[2024-05-28 06:28:12] [INFO ] Deduced a trap composed of 262 places in 270 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/621 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/621 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/622 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/622 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 852/1474 variables, 622/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1474 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1474 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/1475 variables, 1/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1475 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1475 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1475/1475 variables, and 725 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1977 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 623/623 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 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) 308/309 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 84/393 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 205/598 variables, 41/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/598 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/610 variables, 4/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/610 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/621 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/621 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/621 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/622 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/622 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 852/1474 variables, 622/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1474 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1474 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/1475 variables, 1/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1475 variables, 1/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1475 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1475 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1475/1475 variables, and 726 constraints, problems are : Problem set: 0 solved, 1 unsolved in 763 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 623/623 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 2770ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 1 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 856/856 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 623 transition count 811
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 578 transition count 811
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 90 place count 578 transition count 766
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 180 place count 533 transition count 766
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 186 place count 530 transition count 763
Applied a total of 186 rules in 129 ms. Remains 530 /623 variables (removed 93) and now considering 763/856 (removed 93) transitions.
Running 757 sub problems to find dead transitions.
[2024-05-28 06:28:13] [INFO ] Flow matrix only has 759 transitions (discarded 4 similar events)
// Phase 1: matrix 759 rows 530 cols
[2024-05-28 06:28:14] [INFO ] Computed 97 invariants in 40 ms
[2024-05-28 06:28:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 757 unsolved
[2024-05-28 06:28:21] [INFO ] Deduced a trap composed of 136 places in 202 ms of which 3 ms to minimize.
[2024-05-28 06:28:21] [INFO ] Deduced a trap composed of 136 places in 221 ms of which 3 ms to minimize.
[2024-05-28 06:28:21] [INFO ] Deduced a trap composed of 136 places in 192 ms of which 3 ms to minimize.
[2024-05-28 06:28:22] [INFO ] Deduced a trap composed of 136 places in 189 ms of which 4 ms to minimize.
[2024-05-28 06:28:22] [INFO ] Deduced a trap composed of 136 places in 197 ms of which 4 ms to minimize.
[2024-05-28 06:28:22] [INFO ] Deduced a trap composed of 136 places in 183 ms of which 3 ms to minimize.
[2024-05-28 06:28:22] [INFO ] Deduced a trap composed of 136 places in 188 ms of which 3 ms to minimize.
[2024-05-28 06:28:22] [INFO ] Deduced a trap composed of 136 places in 172 ms of which 3 ms to minimize.
[2024-05-28 06:28:23] [INFO ] Deduced a trap composed of 136 places in 189 ms of which 4 ms to minimize.
[2024-05-28 06:28:23] [INFO ] Deduced a trap composed of 136 places in 166 ms of which 3 ms to minimize.
[2024-05-28 06:28:23] [INFO ] Deduced a trap composed of 136 places in 187 ms of which 3 ms to minimize.
[2024-05-28 06:28:23] [INFO ] Deduced a trap composed of 136 places in 166 ms of which 2 ms to minimize.
[2024-05-28 06:28:24] [INFO ] Deduced a trap composed of 136 places in 209 ms of which 3 ms to minimize.
[2024-05-28 06:28:24] [INFO ] Deduced a trap composed of 136 places in 190 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 14/106 constraints. Problems are: Problem set: 0 solved, 757 unsolved
[2024-05-28 06:28:29] [INFO ] Deduced a trap composed of 149 places in 216 ms of which 4 ms to minimize.
[2024-05-28 06:28:29] [INFO ] Deduced a trap composed of 136 places in 150 ms of which 3 ms to minimize.
[2024-05-28 06:28:29] [INFO ] Deduced a trap composed of 167 places in 180 ms of which 2 ms to minimize.
[2024-05-28 06:28:29] [INFO ] Deduced a trap composed of 136 places in 211 ms of which 3 ms to minimize.
[2024-05-28 06:28:30] [INFO ] Deduced a trap composed of 136 places in 207 ms of which 4 ms to minimize.
[2024-05-28 06:28:30] [INFO ] Deduced a trap composed of 136 places in 156 ms of which 3 ms to minimize.
[2024-05-28 06:28:30] [INFO ] Deduced a trap composed of 136 places in 141 ms of which 4 ms to minimize.
[2024-05-28 06:28:30] [INFO ] Deduced a trap composed of 136 places in 209 ms of which 4 ms to minimize.
[2024-05-28 06:28:30] [INFO ] Deduced a trap composed of 136 places in 152 ms of which 3 ms to minimize.
[2024-05-28 06:28:30] [INFO ] Deduced a trap composed of 136 places in 152 ms of which 3 ms to minimize.
[2024-05-28 06:28:31] [INFO ] Deduced a trap composed of 136 places in 153 ms of which 3 ms to minimize.
[2024-05-28 06:28:31] [INFO ] Deduced a trap composed of 136 places in 199 ms of which 4 ms to minimize.
[2024-05-28 06:28:35] [INFO ] Deduced a trap composed of 13 places in 224 ms of which 7 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 525/1289 variables, and 119 constraints, problems are : Problem set: 0 solved, 757 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/530 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 757/757 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 757 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 27/119 constraints. Problems are: Problem set: 0 solved, 757 unsolved
[2024-05-28 06:28:37] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-05-28 06:28:38] [INFO ] Deduced a trap composed of 140 places in 227 ms of which 4 ms to minimize.
[2024-05-28 06:28:38] [INFO ] Deduced a trap composed of 170 places in 201 ms of which 4 ms to minimize.
[2024-05-28 06:28:38] [INFO ] Deduced a trap composed of 140 places in 198 ms of which 3 ms to minimize.
[2024-05-28 06:28:38] [INFO ] Deduced a trap composed of 136 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:28:38] [INFO ] Deduced a trap composed of 136 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:28:39] [INFO ] Deduced a trap composed of 136 places in 165 ms of which 3 ms to minimize.
[2024-05-28 06:28:39] [INFO ] Deduced a trap composed of 140 places in 180 ms of which 3 ms to minimize.
[2024-05-28 06:28:39] [INFO ] Deduced a trap composed of 136 places in 198 ms of which 3 ms to minimize.
[2024-05-28 06:28:39] [INFO ] Deduced a trap composed of 140 places in 169 ms of which 4 ms to minimize.
[2024-05-28 06:28:39] [INFO ] Deduced a trap composed of 136 places in 164 ms of which 3 ms to minimize.
[2024-05-28 06:28:40] [INFO ] Deduced a trap composed of 136 places in 166 ms of which 3 ms to minimize.
[2024-05-28 06:28:40] [INFO ] Deduced a trap composed of 170 places in 216 ms of which 4 ms to minimize.
[2024-05-28 06:28:40] [INFO ] Deduced a trap composed of 136 places in 188 ms of which 3 ms to minimize.
[2024-05-28 06:28:40] [INFO ] Deduced a trap composed of 136 places in 187 ms of which 3 ms to minimize.
[2024-05-28 06:28:40] [INFO ] Deduced a trap composed of 136 places in 193 ms of which 11 ms to minimize.
[2024-05-28 06:28:41] [INFO ] Deduced a trap composed of 136 places in 159 ms of which 3 ms to minimize.
[2024-05-28 06:28:41] [INFO ] Deduced a trap composed of 179 places in 171 ms of which 3 ms to minimize.
[2024-05-28 06:28:41] [INFO ] Deduced a trap composed of 136 places in 152 ms of which 3 ms to minimize.
[2024-05-28 06:28:41] [INFO ] Deduced a trap composed of 173 places in 168 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 757 unsolved
[2024-05-28 06:28:43] [INFO ] Deduced a trap composed of 140 places in 212 ms of which 3 ms to minimize.
[2024-05-28 06:28:43] [INFO ] Deduced a trap composed of 136 places in 179 ms of which 3 ms to minimize.
[2024-05-28 06:28:43] [INFO ] Deduced a trap composed of 140 places in 170 ms of which 15 ms to minimize.
[2024-05-28 06:28:44] [INFO ] Deduced a trap composed of 136 places in 166 ms of which 3 ms to minimize.
[2024-05-28 06:28:44] [INFO ] Deduced a trap composed of 136 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:28:44] [INFO ] Deduced a trap composed of 140 places in 219 ms of which 3 ms to minimize.
[2024-05-28 06:28:44] [INFO ] Deduced a trap composed of 136 places in 200 ms of which 4 ms to minimize.
[2024-05-28 06:28:44] [INFO ] Deduced a trap composed of 136 places in 206 ms of which 3 ms to minimize.
[2024-05-28 06:28:45] [INFO ] Deduced a trap composed of 140 places in 205 ms of which 4 ms to minimize.
[2024-05-28 06:28:45] [INFO ] Deduced a trap composed of 136 places in 158 ms of which 2 ms to minimize.
[2024-05-28 06:28:45] [INFO ] Deduced a trap composed of 136 places in 210 ms of which 4 ms to minimize.
[2024-05-28 06:28:45] [INFO ] Deduced a trap composed of 140 places in 173 ms of which 2 ms to minimize.
[2024-05-28 06:28:45] [INFO ] Deduced a trap composed of 136 places in 168 ms of which 3 ms to minimize.
[2024-05-28 06:28:46] [INFO ] Deduced a trap composed of 136 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:28:46] [INFO ] Deduced a trap composed of 136 places in 162 ms of which 4 ms to minimize.
[2024-05-28 06:28:46] [INFO ] Deduced a trap composed of 136 places in 204 ms of which 3 ms to minimize.
[2024-05-28 06:28:46] [INFO ] Deduced a trap composed of 136 places in 166 ms of which 3 ms to minimize.
[2024-05-28 06:28:46] [INFO ] Deduced a trap composed of 136 places in 212 ms of which 4 ms to minimize.
[2024-05-28 06:28:47] [INFO ] Deduced a trap composed of 136 places in 202 ms of which 3 ms to minimize.
[2024-05-28 06:28:47] [INFO ] Deduced a trap composed of 140 places in 207 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 757 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/1289 variables, and 159 constraints, problems are : Problem set: 0 solved, 757 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/530 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/757 constraints, Known Traps: 67/67 constraints]
After SMT, in 41835ms problems are : Problem set: 0 solved, 757 unsolved
Search for dead transitions found 0 dead transitions in 41847ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41979 ms. Remains : 530/623 places, 763/856 transitions.
RANDOM walk for 40000 steps (2056 resets) in 404 ms. (98 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (210 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 427108 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :0 out of 1
Probabilistic random walk after 427108 steps, saw 129385 distinct states, run finished after 3007 ms. (steps per millisecond=142 ) properties seen :0
[2024-05-28 06:28:58] [INFO ] Flow matrix only has 759 transitions (discarded 4 similar events)
[2024-05-28 06:28:58] [INFO ] Invariant cache hit.
[2024-05-28 06:28:58] [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) 132/141 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 378/519 variables, 87/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/520 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/528 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 06:28:59] [INFO ] Deduced a trap composed of 161 places in 210 ms of which 3 ms to minimize.
[2024-05-28 06:28:59] [INFO ] Deduced a trap composed of 170 places in 194 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/528 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/528 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/529 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/529 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 759/1288 variables, 529/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1288 variables, 1/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1288 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/1289 variables, 1/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1289 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1289 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1289/1289 variables, and 630 constraints, problems are : Problem set: 0 solved, 1 unsolved in 898 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 530/530 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 132/141 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 378/519 variables, 87/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/520 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/528 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/528 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 06:29:00] [INFO ] Deduced a trap composed of 164 places in 164 ms of which 3 ms to minimize.
[2024-05-28 06:29:00] [INFO ] Deduced a trap composed of 185 places in 162 ms of which 3 ms to minimize.
[2024-05-28 06:29:00] [INFO ] Deduced a trap composed of 176 places in 144 ms of which 3 ms to minimize.
[2024-05-28 06:29:00] [INFO ] Deduced a trap composed of 176 places in 142 ms of which 3 ms to minimize.
[2024-05-28 06:29:00] [INFO ] Deduced a trap composed of 158 places in 140 ms of which 3 ms to minimize.
[2024-05-28 06:29:01] [INFO ] Deduced a trap composed of 161 places in 181 ms of which 3 ms to minimize.
[2024-05-28 06:29:01] [INFO ] Deduced a trap composed of 173 places in 172 ms of which 3 ms to minimize.
[2024-05-28 06:29:01] [INFO ] Deduced a trap composed of 161 places in 148 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/528 variables, 8/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/528 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/529 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/529 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 759/1288 variables, 529/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1288 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1288 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/1289 variables, 1/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1289 variables, 1/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1289 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1289 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1289/1289 variables, and 639 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1908 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 530/530 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 2817ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 763/763 transitions.
Applied a total of 0 rules in 36 ms. Remains 530 /530 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 530/530 places, 763/763 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 763/763 transitions.
Applied a total of 0 rules in 35 ms. Remains 530 /530 variables (removed 0) and now considering 763/763 (removed 0) transitions.
[2024-05-28 06:29:01] [INFO ] Flow matrix only has 759 transitions (discarded 4 similar events)
[2024-05-28 06:29:01] [INFO ] Invariant cache hit.
[2024-05-28 06:29:02] [INFO ] Implicit Places using invariants in 448 ms returned []
[2024-05-28 06:29:02] [INFO ] Flow matrix only has 759 transitions (discarded 4 similar events)
[2024-05-28 06:29:02] [INFO ] Invariant cache hit.
[2024-05-28 06:29:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:29:04] [INFO ] Implicit Places using invariants and state equation in 1951 ms returned []
Implicit Place search using SMT with State Equation took 2403 ms to find 0 implicit places.
[2024-05-28 06:29:04] [INFO ] Redundant transitions in 34 ms returned []
Running 757 sub problems to find dead transitions.
[2024-05-28 06:29:04] [INFO ] Flow matrix only has 759 transitions (discarded 4 similar events)
[2024-05-28 06:29:04] [INFO ] Invariant cache hit.
[2024-05-28 06:29:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 757 unsolved
[2024-05-28 06:29:12] [INFO ] Deduced a trap composed of 136 places in 234 ms of which 3 ms to minimize.
[2024-05-28 06:29:12] [INFO ] Deduced a trap composed of 136 places in 148 ms of which 3 ms to minimize.
[2024-05-28 06:29:13] [INFO ] Deduced a trap composed of 136 places in 180 ms of which 3 ms to minimize.
[2024-05-28 06:29:13] [INFO ] Deduced a trap composed of 136 places in 159 ms of which 3 ms to minimize.
[2024-05-28 06:29:13] [INFO ] Deduced a trap composed of 136 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:29:13] [INFO ] Deduced a trap composed of 136 places in 159 ms of which 2 ms to minimize.
[2024-05-28 06:29:13] [INFO ] Deduced a trap composed of 136 places in 192 ms of which 3 ms to minimize.
[2024-05-28 06:29:14] [INFO ] Deduced a trap composed of 136 places in 157 ms of which 2 ms to minimize.
[2024-05-28 06:29:14] [INFO ] Deduced a trap composed of 136 places in 187 ms of which 3 ms to minimize.
[2024-05-28 06:29:14] [INFO ] Deduced a trap composed of 136 places in 150 ms of which 2 ms to minimize.
[2024-05-28 06:29:14] [INFO ] Deduced a trap composed of 136 places in 179 ms of which 3 ms to minimize.
[2024-05-28 06:29:15] [INFO ] Deduced a trap composed of 136 places in 190 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 12/104 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 4 (OVERLAPS) 4/529 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 757 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 529/1289 variables, and 108 constraints, problems are : Problem set: 0 solved, 757 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/530 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 757/757 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 757 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 12/104 constraints. Problems are: Problem set: 0 solved, 757 unsolved
[2024-05-28 06:29:38] [INFO ] Deduced a trap composed of 176 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:29:38] [INFO ] Deduced a trap composed of 155 places in 215 ms of which 4 ms to minimize.
[2024-05-28 06:29:38] [INFO ] Deduced a trap composed of 136 places in 161 ms of which 2 ms to minimize.
[2024-05-28 06:29:38] [INFO ] Deduced a trap composed of 164 places in 170 ms of which 2 ms to minimize.
[2024-05-28 06:29:39] [INFO ] Deduced a trap composed of 182 places in 157 ms of which 3 ms to minimize.
[2024-05-28 06:29:39] [INFO ] Deduced a trap composed of 136 places in 159 ms of which 4 ms to minimize.
[2024-05-28 06:29:39] [INFO ] Deduced a trap composed of 136 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:29:39] [INFO ] Deduced a trap composed of 136 places in 173 ms of which 2 ms to minimize.
[2024-05-28 06:29:39] [INFO ] Deduced a trap composed of 136 places in 171 ms of which 3 ms to minimize.
[2024-05-28 06:29:40] [INFO ] Deduced a trap composed of 136 places in 165 ms of which 3 ms to minimize.
[2024-05-28 06:29:40] [INFO ] Deduced a trap composed of 189 places in 165 ms of which 3 ms to minimize.
[2024-05-28 06:29:40] [INFO ] Deduced a trap composed of 164 places in 171 ms of which 3 ms to minimize.
[2024-05-28 06:29:40] [INFO ] Deduced a trap composed of 176 places in 184 ms of which 3 ms to minimize.
[2024-05-28 06:29:40] [INFO ] Deduced a trap composed of 171 places in 181 ms of which 3 ms to minimize.
[2024-05-28 06:29:41] [INFO ] Deduced a trap composed of 176 places in 185 ms of which 3 ms to minimize.
[2024-05-28 06:29:41] [INFO ] Deduced a trap composed of 161 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:29:41] [INFO ] Deduced a trap composed of 195 places in 181 ms of which 2 ms to minimize.
[2024-05-28 06:29:41] [INFO ] Deduced a trap composed of 170 places in 177 ms of which 3 ms to minimize.
[2024-05-28 06:29:41] [INFO ] Deduced a trap composed of 136 places in 179 ms of which 2 ms to minimize.
[2024-05-28 06:29:42] [INFO ] Deduced a trap composed of 136 places in 193 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 757 unsolved
[2024-05-28 06:29:42] [INFO ] Deduced a trap composed of 140 places in 186 ms of which 3 ms to minimize.
[2024-05-28 06:29:42] [INFO ] Deduced a trap composed of 136 places in 168 ms of which 3 ms to minimize.
[2024-05-28 06:29:42] [INFO ] Deduced a trap composed of 140 places in 158 ms of which 2 ms to minimize.
[2024-05-28 06:29:43] [INFO ] Deduced a trap composed of 136 places in 166 ms of which 3 ms to minimize.
[2024-05-28 06:29:43] [INFO ] Deduced a trap composed of 140 places in 187 ms of which 4 ms to minimize.
[2024-05-28 06:29:43] [INFO ] Deduced a trap composed of 136 places in 179 ms of which 3 ms to minimize.
[2024-05-28 06:29:43] [INFO ] Deduced a trap composed of 136 places in 166 ms of which 3 ms to minimize.
[2024-05-28 06:29:43] [INFO ] Deduced a trap composed of 136 places in 166 ms of which 3 ms to minimize.
[2024-05-28 06:29:44] [INFO ] Deduced a trap composed of 136 places in 164 ms of which 2 ms to minimize.
[2024-05-28 06:29:44] [INFO ] Deduced a trap composed of 136 places in 190 ms of which 3 ms to minimize.
[2024-05-28 06:29:44] [INFO ] Deduced a trap composed of 136 places in 203 ms of which 3 ms to minimize.
[2024-05-28 06:29:44] [INFO ] Deduced a trap composed of 136 places in 202 ms of which 3 ms to minimize.
[2024-05-28 06:29:44] [INFO ] Deduced a trap composed of 140 places in 220 ms of which 3 ms to minimize.
[2024-05-28 06:29:45] [INFO ] Deduced a trap composed of 136 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:29:45] [INFO ] Deduced a trap composed of 140 places in 226 ms of which 3 ms to minimize.
[2024-05-28 06:29:45] [INFO ] Deduced a trap composed of 136 places in 179 ms of which 3 ms to minimize.
[2024-05-28 06:29:45] [INFO ] Deduced a trap composed of 180 places in 192 ms of which 3 ms to minimize.
[2024-05-28 06:29:45] [INFO ] Deduced a trap composed of 136 places in 183 ms of which 3 ms to minimize.
[2024-05-28 06:29:46] [INFO ] Deduced a trap composed of 136 places in 175 ms of which 3 ms to minimize.
[2024-05-28 06:29:46] [INFO ] Deduced a trap composed of 136 places in 184 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 757 unsolved
[2024-05-28 06:29:47] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 2 ms to minimize.
[2024-05-28 06:29:48] [INFO ] Deduced a trap composed of 136 places in 172 ms of which 3 ms to minimize.
[2024-05-28 06:29:48] [INFO ] Deduced a trap composed of 136 places in 231 ms of which 3 ms to minimize.
[2024-05-28 06:29:48] [INFO ] Deduced a trap composed of 140 places in 179 ms of which 3 ms to minimize.
[2024-05-28 06:29:49] [INFO ] Deduced a trap composed of 136 places in 171 ms of which 3 ms to minimize.
[2024-05-28 06:29:49] [INFO ] Deduced a trap composed of 136 places in 208 ms of which 3 ms to minimize.
[2024-05-28 06:29:49] [INFO ] Deduced a trap composed of 140 places in 196 ms of which 3 ms to minimize.
[2024-05-28 06:29:49] [INFO ] Deduced a trap composed of 136 places in 185 ms of which 2 ms to minimize.
[2024-05-28 06:29:49] [INFO ] Deduced a trap composed of 136 places in 177 ms of which 3 ms to minimize.
[2024-05-28 06:29:50] [INFO ] Deduced a trap composed of 140 places in 181 ms of which 3 ms to minimize.
[2024-05-28 06:29:50] [INFO ] Deduced a trap composed of 136 places in 200 ms of which 3 ms to minimize.
[2024-05-28 06:29:50] [INFO ] Deduced a trap composed of 140 places in 180 ms of which 3 ms to minimize.
[2024-05-28 06:29:50] [INFO ] Deduced a trap composed of 136 places in 177 ms of which 3 ms to minimize.
[2024-05-28 06:29:51] [INFO ] Deduced a trap composed of 136 places in 212 ms of which 3 ms to minimize.
[2024-05-28 06:29:51] [INFO ] Deduced a trap composed of 140 places in 167 ms of which 4 ms to minimize.
[2024-05-28 06:29:51] [INFO ] Deduced a trap composed of 136 places in 196 ms of which 3 ms to minimize.
[2024-05-28 06:29:51] [INFO ] Deduced a trap composed of 136 places in 165 ms of which 3 ms to minimize.
[2024-05-28 06:29:51] [INFO ] Deduced a trap composed of 136 places in 172 ms of which 3 ms to minimize.
[2024-05-28 06:29:51] [INFO ] Deduced a trap composed of 140 places in 172 ms of which 3 ms to minimize.
[2024-05-28 06:29:52] [INFO ] Deduced a trap composed of 136 places in 161 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 7 (OVERLAPS) 4/529 variables, 4/168 constraints. Problems are: Problem set: 0 solved, 757 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 529/1289 variables, and 168 constraints, problems are : Problem set: 0 solved, 757 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/530 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/757 constraints, Known Traps: 72/72 constraints]
After SMT, in 61679ms problems are : Problem set: 0 solved, 757 unsolved
Search for dead transitions found 0 dead transitions in 61690ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64176 ms. Remains : 530/530 places, 763/763 transitions.
FORMULA PolyORBNT-COL-S05J40-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA PolyORBNT-COL-S05J40-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 623/623 places, 856/856 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 623 transition count 811
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 578 transition count 811
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 90 place count 578 transition count 767
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 178 place count 534 transition count 767
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 182 place count 532 transition count 765
Applied a total of 182 rules in 51 ms. Remains 532 /623 variables (removed 91) and now considering 765/856 (removed 91) transitions.
Running 759 sub problems to find dead transitions.
[2024-05-28 06:30:06] [INFO ] Flow matrix only has 761 transitions (discarded 4 similar events)
// Phase 1: matrix 761 rows 532 cols
[2024-05-28 06:30:06] [INFO ] Computed 97 invariants in 12 ms
[2024-05-28 06:30:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 3 (OVERLAPS) 4/530 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/530 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 759 unsolved
Problem TDEAD508 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD548 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/532 variables, 2/97 constraints. Problems are: Problem set: 17 solved, 742 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1293 variables, and 97 constraints, problems are : Problem set: 17 solved, 742 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 759/759 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 17 solved, 742 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 86/86 constraints. Problems are: Problem set: 17 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 5/91 constraints. Problems are: Problem set: 17 solved, 742 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 0/91 constraints. Problems are: Problem set: 17 solved, 742 unsolved
At refinement iteration 3 (OVERLAPS) 4/530 variables, 4/95 constraints. Problems are: Problem set: 17 solved, 742 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/530 variables, 0/95 constraints. Problems are: Problem set: 17 solved, 742 unsolved
At refinement iteration 5 (OVERLAPS) 2/532 variables, 2/97 constraints. Problems are: Problem set: 17 solved, 742 unsolved
[2024-05-28 06:30:44] [INFO ] Deduced a trap composed of 196 places in 201 ms of which 3 ms to minimize.
[2024-05-28 06:30:44] [INFO ] Deduced a trap composed of 98 places in 186 ms of which 4 ms to minimize.
[2024-05-28 06:30:46] [INFO ] Deduced a trap composed of 169 places in 171 ms of which 3 ms to minimize.
[2024-05-28 06:30:46] [INFO ] Deduced a trap composed of 202 places in 178 ms of which 3 ms to minimize.
[2024-05-28 06:30:46] [INFO ] Deduced a trap composed of 233 places in 161 ms of which 3 ms to minimize.
[2024-05-28 06:30:46] [INFO ] Deduced a trap composed of 235 places in 164 ms of which 2 ms to minimize.
[2024-05-28 06:30:47] [INFO ] Deduced a trap composed of 234 places in 163 ms of which 3 ms to minimize.
[2024-05-28 06:30:47] [INFO ] Deduced a trap composed of 258 places in 190 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 8/105 constraints. Problems are: Problem set: 17 solved, 742 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 532/1293 variables, and 105 constraints, problems are : Problem set: 17 solved, 742 unsolved in 20012 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/759 constraints, Known Traps: 8/8 constraints]
After SMT, in 41597ms problems are : Problem set: 17 solved, 742 unsolved
Search for dead transitions found 17 dead transitions in 41605ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 17 transitions.
[2024-05-28 06:30:47] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
// Phase 1: matrix 744 rows 532 cols
[2024-05-28 06:30:48] [INFO ] Computed 97 invariants in 12 ms
[2024-05-28 06:30:48] [INFO ] Implicit Places using invariants in 560 ms returned []
[2024-05-28 06:30:48] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2024-05-28 06:30:48] [INFO ] Invariant cache hit.
[2024-05-28 06:30:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:30:51] [INFO ] Implicit Places using invariants and state equation in 2477 ms returned []
Implicit Place search using SMT with State Equation took 3055 ms to find 0 implicit places.
[2024-05-28 06:30:51] [INFO ] Redundant transitions in 15 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 532/623 places, 748/856 transitions.
Applied a total of 0 rules in 38 ms. Remains 532 /532 variables (removed 0) and now considering 748/748 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44809 ms. Remains : 532/623 places, 748/856 transitions.
Stuttering acceptance computed with spot in 298 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLFireability-03
Stuttering criterion allowed to conclude after 51 steps with 2 reset in 3 ms.
FORMULA PolyORBNT-COL-S05J40-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J40-LTLFireability-03 finished in 45179 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(F(!p0))||(p1&&X(F(!p0)))))&&X(p2)))'
Support contains 4 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 856/856 transitions.
Applied a total of 0 rules in 10 ms. Remains 623 /623 variables (removed 0) and now considering 856/856 (removed 0) transitions.
Running 850 sub problems to find dead transitions.
[2024-05-28 06:30:51] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
// Phase 1: matrix 852 rows 623 cols
[2024-05-28 06:30:51] [INFO ] Computed 97 invariants in 10 ms
[2024-05-28 06:30:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 3.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1475 variables, and 96 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
[2024-05-28 06:31:24] [INFO ] Deduced a trap composed of 204 places in 214 ms of which 4 ms to minimize.
[2024-05-28 06:31:25] [INFO ] Deduced a trap composed of 14 places in 216 ms of which 3 ms to minimize.
[2024-05-28 06:31:25] [INFO ] Deduced a trap composed of 15 places in 220 ms of which 4 ms to minimize.
[2024-05-28 06:31:29] [INFO ] Deduced a trap composed of 24 places in 243 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1475 variables, and 100 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 4/4 constraints]
After SMT, in 41274ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 41284ms
[2024-05-28 06:31:32] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-05-28 06:31:32] [INFO ] Invariant cache hit.
[2024-05-28 06:31:33] [INFO ] Implicit Places using invariants in 465 ms returned []
[2024-05-28 06:31:33] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-05-28 06:31:33] [INFO ] Invariant cache hit.
[2024-05-28 06:31:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:31:35] [INFO ] Implicit Places using invariants and state equation in 2516 ms returned []
Implicit Place search using SMT with State Equation took 2993 ms to find 0 implicit places.
Running 850 sub problems to find dead transitions.
[2024-05-28 06:31:35] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-05-28 06:31:35] [INFO ] Invariant cache hit.
[2024-05-28 06:31:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD328 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/623 variables, 1/97 constraints. Problems are: Problem set: 17 solved, 833 unsolved
[2024-05-28 06:32:03] [INFO ] Deduced a trap composed of 259 places in 266 ms of which 5 ms to minimize.
[2024-05-28 06:32:03] [INFO ] Deduced a trap composed of 271 places in 206 ms of which 3 ms to minimize.
[2024-05-28 06:32:03] [INFO ] Deduced a trap composed of 253 places in 250 ms of which 5 ms to minimize.
[2024-05-28 06:32:03] [INFO ] Deduced a trap composed of 256 places in 218 ms of which 4 ms to minimize.
[2024-05-28 06:32:04] [INFO ] Deduced a trap composed of 262 places in 203 ms of which 4 ms to minimize.
[2024-05-28 06:32:04] [INFO ] Deduced a trap composed of 259 places in 204 ms of which 3 ms to minimize.
[2024-05-28 06:32:04] [INFO ] Deduced a trap composed of 247 places in 195 ms of which 3 ms to minimize.
[2024-05-28 06:32:04] [INFO ] Deduced a trap composed of 259 places in 198 ms of which 3 ms to minimize.
[2024-05-28 06:32:05] [INFO ] Deduced a trap composed of 256 places in 193 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 623/1475 variables, and 106 constraints, problems are : Problem set: 17 solved, 833 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 17 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 17 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 17 solved, 833 unsolved
[2024-05-28 06:32:10] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 2 ms to minimize.
[2024-05-28 06:32:10] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 2/93 constraints. Problems are: Problem set: 17 solved, 833 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 0/93 constraints. Problems are: Problem set: 17 solved, 833 unsolved
At refinement iteration 4 (OVERLAPS) 5/622 variables, 5/98 constraints. Problems are: Problem set: 17 solved, 833 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/622 variables, 9/107 constraints. Problems are: Problem set: 17 solved, 833 unsolved
[2024-05-28 06:32:25] [INFO ] Deduced a trap composed of 268 places in 192 ms of which 3 ms to minimize.
[2024-05-28 06:32:27] [INFO ] Deduced a trap composed of 298 places in 260 ms of which 4 ms to minimize.
[2024-05-28 06:32:27] [INFO ] Deduced a trap composed of 294 places in 202 ms of which 3 ms to minimize.
[2024-05-28 06:32:27] [INFO ] Deduced a trap composed of 304 places in 252 ms of which 3 ms to minimize.
[2024-05-28 06:32:28] [INFO ] Deduced a trap composed of 292 places in 203 ms of which 4 ms to minimize.
[2024-05-28 06:32:28] [INFO ] Deduced a trap composed of 290 places in 211 ms of which 4 ms to minimize.
[2024-05-28 06:32:28] [INFO ] Deduced a trap composed of 300 places in 219 ms of which 4 ms to minimize.
[2024-05-28 06:32:28] [INFO ] Deduced a trap composed of 300 places in 223 ms of which 3 ms to minimize.
[2024-05-28 06:32:29] [INFO ] Deduced a trap composed of 299 places in 220 ms of which 3 ms to minimize.
[2024-05-28 06:32:29] [INFO ] Deduced a trap composed of 284 places in 211 ms of which 4 ms to minimize.
[2024-05-28 06:32:29] [INFO ] Deduced a trap composed of 292 places in 211 ms of which 3 ms to minimize.
[2024-05-28 06:32:29] [INFO ] Deduced a trap composed of 297 places in 235 ms of which 19 ms to minimize.
[2024-05-28 06:32:29] [INFO ] Deduced a trap composed of 296 places in 209 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/622 variables, 13/120 constraints. Problems are: Problem set: 17 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1475 variables, and 120 constraints, problems are : Problem set: 17 solved, 833 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 24/24 constraints]
After SMT, in 61321ms problems are : Problem set: 17 solved, 833 unsolved
Search for dead transitions found 17 dead transitions in 61331ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 623/623 places, 839/856 transitions.
Applied a total of 0 rules in 9 ms. Remains 623 /623 variables (removed 0) and now considering 839/839 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 105632 ms. Remains : 623/623 places, 839/856 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p2) p0), p0, (NOT p2), p0, true]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J40-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J40-LTLFireability-05 finished in 105829 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!p0||X(G(p1))))))'
Support contains 3 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 856/856 transitions.
Applied a total of 0 rules in 8 ms. Remains 623 /623 variables (removed 0) and now considering 856/856 (removed 0) transitions.
Running 850 sub problems to find dead transitions.
[2024-05-28 06:32:37] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-05-28 06:32:37] [INFO ] Invariant cache hit.
[2024-05-28 06:32:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 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 622/1475 variables, and 96 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20057 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
[2024-05-28 06:33:02] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 3 ms to minimize.
[2024-05-28 06:33:02] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 4 (OVERLAPS) 5/622 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 850 unsolved
[2024-05-28 06:33:17] [INFO ] Deduced a trap composed of 204 places in 196 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1475 variables, and 99 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 3/3 constraints]
After SMT, in 41281ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 41291ms
[2024-05-28 06:33:18] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-05-28 06:33:18] [INFO ] Invariant cache hit.
[2024-05-28 06:33:19] [INFO ] Implicit Places using invariants in 463 ms returned []
[2024-05-28 06:33:19] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-05-28 06:33:19] [INFO ] Invariant cache hit.
[2024-05-28 06:33:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:33:21] [INFO ] Implicit Places using invariants and state equation in 2658 ms returned []
Implicit Place search using SMT with State Equation took 3157 ms to find 0 implicit places.
Running 850 sub problems to find dead transitions.
[2024-05-28 06:33:21] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-05-28 06:33:21] [INFO ] Invariant cache hit.
[2024-05-28 06:33:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD328 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/623 variables, 1/97 constraints. Problems are: Problem set: 17 solved, 833 unsolved
[2024-05-28 06:33:48] [INFO ] Deduced a trap composed of 259 places in 200 ms of which 4 ms to minimize.
[2024-05-28 06:33:48] [INFO ] Deduced a trap composed of 271 places in 206 ms of which 3 ms to minimize.
[2024-05-28 06:33:49] [INFO ] Deduced a trap composed of 253 places in 206 ms of which 3 ms to minimize.
[2024-05-28 06:33:49] [INFO ] Deduced a trap composed of 256 places in 209 ms of which 4 ms to minimize.
[2024-05-28 06:33:49] [INFO ] Deduced a trap composed of 262 places in 195 ms of which 3 ms to minimize.
[2024-05-28 06:33:49] [INFO ] Deduced a trap composed of 259 places in 206 ms of which 3 ms to minimize.
[2024-05-28 06:33:50] [INFO ] Deduced a trap composed of 247 places in 195 ms of which 3 ms to minimize.
[2024-05-28 06:33:50] [INFO ] Deduced a trap composed of 259 places in 201 ms of which 3 ms to minimize.
[2024-05-28 06:33:50] [INFO ] Deduced a trap composed of 256 places in 208 ms of which 3 ms to minimize.
[2024-05-28 06:33:53] [INFO ] Deduced a trap composed of 96 places in 220 ms of which 4 ms to minimize.
SMT process timed out in 31395ms, After SMT, problems are : Problem set: 17 solved, 833 unsolved
Search for dead transitions found 17 dead transitions in 31406ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 623/623 places, 839/856 transitions.
Applied a total of 0 rules in 21 ms. Remains 623 /623 variables (removed 0) and now considering 839/839 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 75889 ms. Remains : 623/623 places, 839/856 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p1), (AND (NOT p1) p0), (AND p0 (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLFireability-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J40-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J40-LTLFireability-06 finished in 76001 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((G(p2)||F(G(p3))||p1)))))'
Support contains 88 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 856/856 transitions.
Applied a total of 0 rules in 8 ms. Remains 623 /623 variables (removed 0) and now considering 856/856 (removed 0) transitions.
Running 850 sub problems to find dead transitions.
[2024-05-28 06:33:53] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-05-28 06:33:53] [INFO ] Invariant cache hit.
[2024-05-28 06:33:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1475 variables, and 96 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
[2024-05-28 06:34:18] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 2 ms to minimize.
[2024-05-28 06:34:18] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 4 (OVERLAPS) 5/622 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 850 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 622/1475 variables, and 98 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 2/2 constraints]
After SMT, in 41125ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 41134ms
[2024-05-28 06:34:34] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-05-28 06:34:34] [INFO ] Invariant cache hit.
[2024-05-28 06:34:34] [INFO ] Implicit Places using invariants in 470 ms returned []
[2024-05-28 06:34:34] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-05-28 06:34:34] [INFO ] Invariant cache hit.
[2024-05-28 06:34:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:34:37] [INFO ] Implicit Places using invariants and state equation in 2930 ms returned []
Implicit Place search using SMT with State Equation took 3413 ms to find 0 implicit places.
Running 850 sub problems to find dead transitions.
[2024-05-28 06:34:37] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-05-28 06:34:37] [INFO ] Invariant cache hit.
[2024-05-28 06:34:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD328 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/623 variables, 1/97 constraints. Problems are: Problem set: 17 solved, 833 unsolved
[2024-05-28 06:35:04] [INFO ] Deduced a trap composed of 259 places in 206 ms of which 4 ms to minimize.
[2024-05-28 06:35:04] [INFO ] Deduced a trap composed of 271 places in 210 ms of which 3 ms to minimize.
[2024-05-28 06:35:04] [INFO ] Deduced a trap composed of 253 places in 203 ms of which 3 ms to minimize.
[2024-05-28 06:35:04] [INFO ] Deduced a trap composed of 256 places in 191 ms of which 4 ms to minimize.
[2024-05-28 06:35:05] [INFO ] Deduced a trap composed of 262 places in 195 ms of which 3 ms to minimize.
[2024-05-28 06:35:05] [INFO ] Deduced a trap composed of 259 places in 191 ms of which 3 ms to minimize.
[2024-05-28 06:35:05] [INFO ] Deduced a trap composed of 247 places in 201 ms of which 3 ms to minimize.
[2024-05-28 06:35:05] [INFO ] Deduced a trap composed of 259 places in 261 ms of which 3 ms to minimize.
[2024-05-28 06:35:06] [INFO ] Deduced a trap composed of 256 places in 216 ms of which 4 ms to minimize.
[2024-05-28 06:35:08] [INFO ] Deduced a trap composed of 96 places in 217 ms of which 3 ms to minimize.
[2024-05-28 06:35:08] [INFO ] Deduced a trap composed of 241 places in 212 ms of which 3 ms to minimize.
[2024-05-28 06:35:09] [INFO ] Deduced a trap composed of 96 places in 213 ms of which 3 ms to minimize.
[2024-05-28 06:35:09] [INFO ] Deduced a trap composed of 204 places in 208 ms of which 3 ms to minimize.
SMT process timed out in 31387ms, After SMT, problems are : Problem set: 17 solved, 833 unsolved
Search for dead transitions found 17 dead transitions in 31396ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 623/623 places, 839/856 transitions.
Applied a total of 0 rules in 8 ms. Remains 623 /623 variables (removed 0) and now considering 839/839 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 75965 ms. Remains : 623/623 places, 839/856 transitions.
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 576 ms.
Product exploration explored 100000 steps with 50000 reset in 478 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 43 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-COL-S05J40-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S05J40-LTLFireability-08 finished in 77297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 623/623 places, 856/856 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 623 transition count 813
Reduce places removed 43 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 44 rules applied. Total rules applied 87 place count 580 transition count 812
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 579 transition count 812
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 88 place count 579 transition count 769
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 174 place count 536 transition count 769
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 180 place count 533 transition count 766
Applied a total of 180 rules in 117 ms. Remains 533 /623 variables (removed 90) and now considering 766/856 (removed 90) transitions.
Running 760 sub problems to find dead transitions.
[2024-05-28 06:35:10] [INFO ] Flow matrix only has 762 transitions (discarded 4 similar events)
// Phase 1: matrix 762 rows 533 cols
[2024-05-28 06:35:10] [INFO ] Computed 97 invariants in 14 ms
[2024-05-28 06:35:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 3 (OVERLAPS) 4/531 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 760 unsolved
Problem TDEAD514 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD554 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/533 variables, 2/97 constraints. Problems are: Problem set: 17 solved, 743 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 533/1295 variables, and 97 constraints, problems are : Problem set: 17 solved, 743 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/533 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 760/760 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 17 solved, 743 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 86/86 constraints. Problems are: Problem set: 17 solved, 743 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 5/91 constraints. Problems are: Problem set: 17 solved, 743 unsolved
[2024-05-28 06:35:36] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 1/92 constraints. Problems are: Problem set: 17 solved, 743 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 0/92 constraints. Problems are: Problem set: 17 solved, 743 unsolved
At refinement iteration 4 (OVERLAPS) 4/531 variables, 4/96 constraints. Problems are: Problem set: 17 solved, 743 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 0/96 constraints. Problems are: Problem set: 17 solved, 743 unsolved
At refinement iteration 6 (OVERLAPS) 2/533 variables, 2/98 constraints. Problems are: Problem set: 17 solved, 743 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 2)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 533/1295 variables, and 98 constraints, problems are : Problem set: 17 solved, 743 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/533 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/760 constraints, Known Traps: 1/1 constraints]
After SMT, in 41329ms problems are : Problem set: 17 solved, 743 unsolved
Search for dead transitions found 17 dead transitions in 41344ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 17 transitions.
[2024-05-28 06:35:52] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
// Phase 1: matrix 745 rows 533 cols
[2024-05-28 06:35:52] [INFO ] Computed 97 invariants in 12 ms
[2024-05-28 06:35:52] [INFO ] Implicit Places using invariants in 453 ms returned []
[2024-05-28 06:35:52] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
[2024-05-28 06:35:52] [INFO ] Invariant cache hit.
[2024-05-28 06:35:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:35:54] [INFO ] Implicit Places using invariants and state equation in 1803 ms returned []
Implicit Place search using SMT with State Equation took 2266 ms to find 0 implicit places.
[2024-05-28 06:35:54] [INFO ] Redundant transitions in 5 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 533/623 places, 749/856 transitions.
Applied a total of 0 rules in 29 ms. Remains 533 /533 variables (removed 0) and now considering 749/749 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43781 ms. Remains : 533/623 places, 749/856 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLFireability-11
Product exploration explored 100000 steps with 11928 reset in 331 ms.
Product exploration explored 100000 steps with 11945 reset in 302 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
RANDOM walk for 29 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
[2024-05-28 06:35:55] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
[2024-05-28 06:35:55] [INFO ] Invariant cache hit.
[2024-05-28 06:35:55] [INFO ] [Real]Absence check using 90 positive place invariants in 43 ms returned sat
[2024-05-28 06:35:55] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 53 ms returned sat
[2024-05-28 06:35:56] [INFO ] [Real]Absence check using state equation in 785 ms returned sat
[2024-05-28 06:35:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:35:56] [INFO ] [Nat]Absence check using 90 positive place invariants in 52 ms returned sat
[2024-05-28 06:35:57] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 36 ms returned sat
[2024-05-28 06:35:57] [INFO ] [Nat]Absence check using state equation in 921 ms returned sat
[2024-05-28 06:35:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:35:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 40 ms returned sat
[2024-05-28 06:35:58] [INFO ] Computed and/alt/rep : 364/1259/364 causal constraints (skipped 375 transitions) in 67 ms.
[2024-05-28 06:35:58] [INFO ] Added : 15 causal constraints over 3 iterations in 598 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 533/533 places, 749/749 transitions.
Applied a total of 0 rules in 16 ms. Remains 533 /533 variables (removed 0) and now considering 749/749 (removed 0) transitions.
Running 743 sub problems to find dead transitions.
[2024-05-28 06:35:58] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
[2024-05-28 06:35:58] [INFO ] Invariant cache hit.
[2024-05-28 06:35:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 3 (OVERLAPS) 4/531 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 743 unsolved
[2024-05-28 06:36:15] [INFO ] Deduced a trap composed of 122 places in 121 ms of which 2 ms to minimize.
[2024-05-28 06:36:15] [INFO ] Deduced a trap composed of 155 places in 116 ms of which 2 ms to minimize.
[2024-05-28 06:36:15] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 2 ms to minimize.
[2024-05-28 06:36:15] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 3 ms to minimize.
[2024-05-28 06:36:15] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 2 ms to minimize.
[2024-05-28 06:36:16] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 2 ms to minimize.
[2024-05-28 06:36:16] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 2 ms to minimize.
[2024-05-28 06:36:16] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 2 ms to minimize.
[2024-05-28 06:36:16] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
[2024-05-28 06:36:16] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 2 ms to minimize.
[2024-05-28 06:36:16] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
[2024-05-28 06:36:16] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 2 ms to minimize.
[2024-05-28 06:36:16] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 3 ms to minimize.
[2024-05-28 06:36:17] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 2 ms to minimize.
[2024-05-28 06:36:17] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 2 ms to minimize.
[2024-05-28 06:36:17] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 2 ms to minimize.
[2024-05-28 06:36:17] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 2 ms to minimize.
[2024-05-28 06:36:17] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 2 ms to minimize.
[2024-05-28 06:36:17] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 2 ms to minimize.
[2024-05-28 06:36:17] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 743 unsolved
[2024-05-28 06:36:18] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 3 ms to minimize.
[2024-05-28 06:36:18] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 2 ms to minimize.
[2024-05-28 06:36:18] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
[2024-05-28 06:36:18] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-05-28 06:36:18] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 2 ms to minimize.
[2024-05-28 06:36:18] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 2 ms to minimize.
[2024-05-28 06:36:19] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 15 ms to minimize.
[2024-05-28 06:36:19] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 5 ms to minimize.
[2024-05-28 06:36:19] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 2 ms to minimize.
[2024-05-28 06:36:19] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 2 ms to minimize.
[2024-05-28 06:36:19] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 2 ms to minimize.
[2024-05-28 06:36:19] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 2 ms to minimize.
SMT process timed out in 21104ms, After SMT, problems are : Problem set: 0 solved, 743 unsolved
Search for dead transitions found 0 dead transitions in 21112ms
[2024-05-28 06:36:19] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
[2024-05-28 06:36:19] [INFO ] Invariant cache hit.
[2024-05-28 06:36:20] [INFO ] Implicit Places using invariants in 487 ms returned []
[2024-05-28 06:36:20] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
[2024-05-28 06:36:20] [INFO ] Invariant cache hit.
[2024-05-28 06:36:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:36:22] [INFO ] Implicit Places using invariants and state equation in 1899 ms returned []
Implicit Place search using SMT with State Equation took 2389 ms to find 0 implicit places.
[2024-05-28 06:36:22] [INFO ] Redundant transitions in 11 ms returned []
Running 743 sub problems to find dead transitions.
[2024-05-28 06:36:22] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
[2024-05-28 06:36:22] [INFO ] Invariant cache hit.
[2024-05-28 06:36:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 3 (OVERLAPS) 4/531 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 743 unsolved
[2024-05-28 06:36:37] [INFO ] Deduced a trap composed of 122 places in 110 ms of which 2 ms to minimize.
[2024-05-28 06:36:38] [INFO ] Deduced a trap composed of 155 places in 140 ms of which 3 ms to minimize.
[2024-05-28 06:36:38] [INFO ] Deduced a trap composed of 95 places in 160 ms of which 2 ms to minimize.
[2024-05-28 06:36:38] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 3 ms to minimize.
[2024-05-28 06:36:38] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 2 ms to minimize.
[2024-05-28 06:36:38] [INFO ] Deduced a trap composed of 95 places in 127 ms of which 3 ms to minimize.
[2024-05-28 06:36:38] [INFO ] Deduced a trap composed of 95 places in 136 ms of which 3 ms to minimize.
[2024-05-28 06:36:38] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 2 ms to minimize.
[2024-05-28 06:36:39] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 2 ms to minimize.
[2024-05-28 06:36:39] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-05-28 06:36:39] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 3 ms to minimize.
[2024-05-28 06:36:39] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 2 ms to minimize.
[2024-05-28 06:36:39] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
[2024-05-28 06:36:39] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 2 ms to minimize.
[2024-05-28 06:36:39] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-05-28 06:36:39] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 2 ms to minimize.
[2024-05-28 06:36:40] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
[2024-05-28 06:36:40] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 2 ms to minimize.
[2024-05-28 06:36:40] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 2 ms to minimize.
[2024-05-28 06:36:40] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 743 unsolved
[2024-05-28 06:36:40] [INFO ] Deduced a trap composed of 95 places in 161 ms of which 3 ms to minimize.
[2024-05-28 06:36:40] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-05-28 06:36:41] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-05-28 06:36:41] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-05-28 06:36:41] [INFO ] Deduced a trap composed of 95 places in 144 ms of which 2 ms to minimize.
[2024-05-28 06:36:41] [INFO ] Deduced a trap composed of 95 places in 134 ms of which 3 ms to minimize.
[2024-05-28 06:36:41] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 3 ms to minimize.
[2024-05-28 06:36:41] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 2 ms to minimize.
[2024-05-28 06:36:41] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 3 ms to minimize.
[2024-05-28 06:36:42] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 2 ms to minimize.
[2024-05-28 06:36:42] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 2 ms to minimize.
[2024-05-28 06:36:42] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 2 ms to minimize.
[2024-05-28 06:36:42] [INFO ] Deduced a trap composed of 95 places in 155 ms of which 2 ms to minimize.
[2024-05-28 06:36:42] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 2 ms to minimize.
[2024-05-28 06:36:42] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 2 ms to minimize.
[2024-05-28 06:36:42] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-05-28 06:36:43] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 2 ms to minimize.
[2024-05-28 06:36:43] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 2 ms to minimize.
[2024-05-28 06:36:43] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
[2024-05-28 06:36:43] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 743 unsolved
SMT process timed out in 31116ms, After SMT, problems are : Problem set: 0 solved, 743 unsolved
Search for dead transitions found 0 dead transitions in 31133ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54673 ms. Remains : 533/533 places, 749/749 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
RANDOM walk for 25 steps (0 resets) in 6 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2024-05-28 06:36:53] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
[2024-05-28 06:36:53] [INFO ] Invariant cache hit.
[2024-05-28 06:36:53] [INFO ] [Real]Absence check using 90 positive place invariants in 43 ms returned sat
[2024-05-28 06:36:54] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 53 ms returned sat
[2024-05-28 06:36:55] [INFO ] [Real]Absence check using state equation in 986 ms returned sat
[2024-05-28 06:36:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:36:55] [INFO ] [Nat]Absence check using 90 positive place invariants in 51 ms returned sat
[2024-05-28 06:36:55] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 36 ms returned sat
[2024-05-28 06:36:56] [INFO ] [Nat]Absence check using state equation in 1043 ms returned sat
[2024-05-28 06:36:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:36:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 58 ms returned sat
[2024-05-28 06:36:56] [INFO ] Computed and/alt/rep : 364/1259/364 causal constraints (skipped 375 transitions) in 72 ms.
[2024-05-28 06:36:57] [INFO ] Added : 15 causal constraints over 3 iterations in 698 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11937 reset in 244 ms.
Product exploration explored 100000 steps with 11940 reset in 264 ms.
Support contains 3 out of 533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 533/533 places, 749/749 transitions.
Applied a total of 0 rules in 15 ms. Remains 533 /533 variables (removed 0) and now considering 749/749 (removed 0) transitions.
Running 743 sub problems to find dead transitions.
[2024-05-28 06:36:57] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
[2024-05-28 06:36:57] [INFO ] Invariant cache hit.
[2024-05-28 06:36:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 3 (OVERLAPS) 4/531 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 743 unsolved
[2024-05-28 06:37:13] [INFO ] Deduced a trap composed of 122 places in 121 ms of which 3 ms to minimize.
[2024-05-28 06:37:14] [INFO ] Deduced a trap composed of 155 places in 120 ms of which 2 ms to minimize.
[2024-05-28 06:37:14] [INFO ] Deduced a trap composed of 95 places in 149 ms of which 2 ms to minimize.
[2024-05-28 06:37:14] [INFO ] Deduced a trap composed of 95 places in 127 ms of which 1 ms to minimize.
[2024-05-28 06:37:14] [INFO ] Deduced a trap composed of 95 places in 138 ms of which 2 ms to minimize.
[2024-05-28 06:37:14] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 2 ms to minimize.
[2024-05-28 06:37:14] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 2 ms to minimize.
[2024-05-28 06:37:14] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 2 ms to minimize.
[2024-05-28 06:37:15] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 2 ms to minimize.
[2024-05-28 06:37:15] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-05-28 06:37:15] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 2 ms to minimize.
[2024-05-28 06:37:15] [INFO ] Deduced a trap composed of 95 places in 106 ms of which 2 ms to minimize.
[2024-05-28 06:37:15] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 2 ms to minimize.
[2024-05-28 06:37:15] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
[2024-05-28 06:37:15] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
[2024-05-28 06:37:15] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
[2024-05-28 06:37:16] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 2 ms to minimize.
[2024-05-28 06:37:16] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 2 ms to minimize.
[2024-05-28 06:37:16] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 2 ms to minimize.
[2024-05-28 06:37:16] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 743 unsolved
[2024-05-28 06:37:16] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-05-28 06:37:16] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 2 ms to minimize.
[2024-05-28 06:37:16] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 2 ms to minimize.
[2024-05-28 06:37:17] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
[2024-05-28 06:37:17] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 2 ms to minimize.
[2024-05-28 06:37:17] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 2 ms to minimize.
[2024-05-28 06:37:17] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 2 ms to minimize.
[2024-05-28 06:37:17] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 2 ms to minimize.
[2024-05-28 06:37:17] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 2 ms to minimize.
[2024-05-28 06:37:17] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 2 ms to minimize.
[2024-05-28 06:37:18] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 2 ms to minimize.
[2024-05-28 06:37:18] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 2 ms to minimize.
[2024-05-28 06:37:18] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 2 ms to minimize.
[2024-05-28 06:37:18] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 2 ms to minimize.
[2024-05-28 06:37:18] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 2 ms to minimize.
[2024-05-28 06:37:18] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
[2024-05-28 06:37:18] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
[2024-05-28 06:37:18] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 2 ms to minimize.
[2024-05-28 06:37:19] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 2 ms to minimize.
SMT process timed out in 21137ms, After SMT, problems are : Problem set: 0 solved, 743 unsolved
Search for dead transitions found 0 dead transitions in 21144ms
[2024-05-28 06:37:19] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
[2024-05-28 06:37:19] [INFO ] Invariant cache hit.
[2024-05-28 06:37:19] [INFO ] Implicit Places using invariants in 431 ms returned []
[2024-05-28 06:37:19] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
[2024-05-28 06:37:19] [INFO ] Invariant cache hit.
[2024-05-28 06:37:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:37:21] [INFO ] Implicit Places using invariants and state equation in 1847 ms returned []
Implicit Place search using SMT with State Equation took 2294 ms to find 0 implicit places.
[2024-05-28 06:37:21] [INFO ] Redundant transitions in 12 ms returned []
Running 743 sub problems to find dead transitions.
[2024-05-28 06:37:21] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
[2024-05-28 06:37:21] [INFO ] Invariant cache hit.
[2024-05-28 06:37:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 3 (OVERLAPS) 4/531 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 743 unsolved
[2024-05-28 06:37:37] [INFO ] Deduced a trap composed of 122 places in 121 ms of which 2 ms to minimize.
[2024-05-28 06:37:37] [INFO ] Deduced a trap composed of 155 places in 106 ms of which 2 ms to minimize.
[2024-05-28 06:37:37] [INFO ] Deduced a trap composed of 95 places in 191 ms of which 3 ms to minimize.
[2024-05-28 06:37:37] [INFO ] Deduced a trap composed of 95 places in 171 ms of which 3 ms to minimize.
[2024-05-28 06:37:37] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 2 ms to minimize.
[2024-05-28 06:37:38] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
[2024-05-28 06:37:38] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 2 ms to minimize.
[2024-05-28 06:37:38] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 2 ms to minimize.
[2024-05-28 06:37:38] [INFO ] Deduced a trap composed of 95 places in 141 ms of which 2 ms to minimize.
[2024-05-28 06:37:38] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
[2024-05-28 06:37:38] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-05-28 06:37:38] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 2 ms to minimize.
[2024-05-28 06:37:38] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 2 ms to minimize.
[2024-05-28 06:37:39] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
[2024-05-28 06:37:39] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 3 ms to minimize.
[2024-05-28 06:37:39] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 2 ms to minimize.
[2024-05-28 06:37:39] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 2 ms to minimize.
[2024-05-28 06:37:39] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 2 ms to minimize.
[2024-05-28 06:37:39] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 2 ms to minimize.
[2024-05-28 06:37:39] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 743 unsolved
[2024-05-28 06:37:40] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 3 ms to minimize.
[2024-05-28 06:37:40] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-05-28 06:37:40] [INFO ] Deduced a trap composed of 95 places in 137 ms of which 3 ms to minimize.
[2024-05-28 06:37:40] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-05-28 06:37:40] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 2 ms to minimize.
[2024-05-28 06:37:40] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 2 ms to minimize.
[2024-05-28 06:37:40] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 2 ms to minimize.
[2024-05-28 06:37:41] [INFO ] Deduced a trap composed of 95 places in 94 ms of which 2 ms to minimize.
[2024-05-28 06:37:41] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 2 ms to minimize.
[2024-05-28 06:37:41] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 2 ms to minimize.
[2024-05-28 06:37:41] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 2 ms to minimize.
[2024-05-28 06:37:41] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 2 ms to minimize.
[2024-05-28 06:37:41] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 1 ms to minimize.
[2024-05-28 06:37:41] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 2 ms to minimize.
[2024-05-28 06:37:41] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 2 ms to minimize.
[2024-05-28 06:37:42] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 2 ms to minimize.
[2024-05-28 06:37:42] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 2 ms to minimize.
[2024-05-28 06:37:42] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 14 ms to minimize.
[2024-05-28 06:37:42] [INFO ] Deduced a trap composed of 95 places in 137 ms of which 2 ms to minimize.
[2024-05-28 06:37:42] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 743 unsolved
SMT process timed out in 31043ms, After SMT, problems are : Problem set: 0 solved, 743 unsolved
Search for dead transitions found 0 dead transitions in 31060ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54538 ms. Remains : 533/533 places, 749/749 transitions.
Treatment of property PolyORBNT-COL-S05J40-LTLFireability-11 finished in 161947 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 41 out of 623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 623/623 places, 856/856 transitions.
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 623 transition count 852
Reduce places removed 4 places and 0 transitions.
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Iterating post reduction 1 with 45 rules applied. Total rules applied 49 place count 619 transition count 811
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 90 place count 578 transition count 811
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 90 place count 578 transition count 807
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 98 place count 574 transition count 807
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 104 place count 571 transition count 804
Applied a total of 104 rules in 48 ms. Remains 571 /623 variables (removed 52) and now considering 804/856 (removed 52) transitions.
Running 798 sub problems to find dead transitions.
[2024-05-28 06:37:52] [INFO ] Flow matrix only has 800 transitions (discarded 4 similar events)
// Phase 1: matrix 800 rows 571 cols
[2024-05-28 06:37:52] [INFO ] Computed 97 invariants in 10 ms
[2024-05-28 06:37:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2024-05-28 06:38:00] [INFO ] Deduced a trap composed of 178 places in 172 ms of which 3 ms to minimize.
[2024-05-28 06:38:00] [INFO ] Deduced a trap composed of 178 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:38:00] [INFO ] Deduced a trap composed of 178 places in 171 ms of which 3 ms to minimize.
[2024-05-28 06:38:01] [INFO ] Deduced a trap composed of 178 places in 232 ms of which 4 ms to minimize.
[2024-05-28 06:38:01] [INFO ] Deduced a trap composed of 178 places in 244 ms of which 4 ms to minimize.
[2024-05-28 06:38:01] [INFO ] Deduced a trap composed of 178 places in 203 ms of which 3 ms to minimize.
[2024-05-28 06:38:01] [INFO ] Deduced a trap composed of 177 places in 194 ms of which 3 ms to minimize.
[2024-05-28 06:38:02] [INFO ] Deduced a trap composed of 177 places in 208 ms of which 4 ms to minimize.
[2024-05-28 06:38:02] [INFO ] Deduced a trap composed of 177 places in 211 ms of which 4 ms to minimize.
[2024-05-28 06:38:02] [INFO ] Deduced a trap composed of 205 places in 189 ms of which 3 ms to minimize.
[2024-05-28 06:38:02] [INFO ] Deduced a trap composed of 177 places in 180 ms of which 3 ms to minimize.
[2024-05-28 06:38:02] [INFO ] Deduced a trap composed of 177 places in 181 ms of which 3 ms to minimize.
[2024-05-28 06:38:03] [INFO ] Deduced a trap composed of 178 places in 181 ms of which 4 ms to minimize.
[2024-05-28 06:38:03] [INFO ] Deduced a trap composed of 178 places in 195 ms of which 4 ms to minimize.
[2024-05-28 06:38:03] [INFO ] Deduced a trap composed of 178 places in 185 ms of which 3 ms to minimize.
[2024-05-28 06:38:03] [INFO ] Deduced a trap composed of 178 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:38:03] [INFO ] Deduced a trap composed of 178 places in 169 ms of which 4 ms to minimize.
[2024-05-28 06:38:04] [INFO ] Deduced a trap composed of 178 places in 211 ms of which 3 ms to minimize.
[2024-05-28 06:38:04] [INFO ] Deduced a trap composed of 178 places in 202 ms of which 3 ms to minimize.
[2024-05-28 06:38:04] [INFO ] Deduced a trap composed of 178 places in 191 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2024-05-28 06:38:05] [INFO ] Deduced a trap composed of 212 places in 149 ms of which 4 ms to minimize.
[2024-05-28 06:38:05] [INFO ] Deduced a trap composed of 203 places in 207 ms of which 5 ms to minimize.
[2024-05-28 06:38:05] [INFO ] Deduced a trap composed of 200 places in 187 ms of which 3 ms to minimize.
[2024-05-28 06:38:05] [INFO ] Deduced a trap composed of 194 places in 170 ms of which 3 ms to minimize.
[2024-05-28 06:38:06] [INFO ] Deduced a trap composed of 177 places in 164 ms of which 3 ms to minimize.
[2024-05-28 06:38:06] [INFO ] Deduced a trap composed of 178 places in 193 ms of which 6 ms to minimize.
[2024-05-28 06:38:06] [INFO ] Deduced a trap composed of 178 places in 228 ms of which 4 ms to minimize.
[2024-05-28 06:38:07] [INFO ] Deduced a trap composed of 178 places in 423 ms of which 18 ms to minimize.
[2024-05-28 06:38:07] [INFO ] Deduced a trap composed of 178 places in 231 ms of which 4 ms to minimize.
[2024-05-28 06:38:07] [INFO ] Deduced a trap composed of 178 places in 191 ms of which 3 ms to minimize.
[2024-05-28 06:38:07] [INFO ] Deduced a trap composed of 178 places in 211 ms of which 3 ms to minimize.
[2024-05-28 06:38:08] [INFO ] Deduced a trap composed of 178 places in 206 ms of which 3 ms to minimize.
[2024-05-28 06:38:08] [INFO ] Deduced a trap composed of 178 places in 201 ms of which 3 ms to minimize.
[2024-05-28 06:38:08] [INFO ] Deduced a trap composed of 178 places in 219 ms of which 4 ms to minimize.
[2024-05-28 06:38:08] [INFO ] Deduced a trap composed of 178 places in 183 ms of which 3 ms to minimize.
[2024-05-28 06:38:08] [INFO ] Deduced a trap composed of 178 places in 187 ms of which 3 ms to minimize.
[2024-05-28 06:38:09] [INFO ] Deduced a trap composed of 178 places in 177 ms of which 3 ms to minimize.
[2024-05-28 06:38:09] [INFO ] Deduced a trap composed of 203 places in 224 ms of which 3 ms to minimize.
[2024-05-28 06:38:09] [INFO ] Deduced a trap composed of 203 places in 179 ms of which 3 ms to minimize.
[2024-05-28 06:38:09] [INFO ] Deduced a trap composed of 178 places in 184 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 566/1371 variables, and 132 constraints, problems are : Problem set: 0 solved, 798 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 87/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/571 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 798/798 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 798 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2024-05-28 06:38:15] [INFO ] Deduced a trap composed of 203 places in 218 ms of which 4 ms to minimize.
[2024-05-28 06:38:15] [INFO ] Deduced a trap composed of 200 places in 203 ms of which 4 ms to minimize.
[2024-05-28 06:38:15] [INFO ] Deduced a trap composed of 206 places in 235 ms of which 4 ms to minimize.
[2024-05-28 06:38:15] [INFO ] Deduced a trap composed of 178 places in 190 ms of which 3 ms to minimize.
[2024-05-28 06:38:16] [INFO ] Deduced a trap composed of 178 places in 177 ms of which 3 ms to minimize.
[2024-05-28 06:38:16] [INFO ] Deduced a trap composed of 203 places in 181 ms of which 3 ms to minimize.
[2024-05-28 06:38:16] [INFO ] Deduced a trap composed of 178 places in 201 ms of which 4 ms to minimize.
[2024-05-28 06:38:16] [INFO ] Deduced a trap composed of 178 places in 218 ms of which 3 ms to minimize.
[2024-05-28 06:38:16] [INFO ] Deduced a trap composed of 178 places in 179 ms of which 3 ms to minimize.
[2024-05-28 06:38:17] [INFO ] Deduced a trap composed of 178 places in 232 ms of which 4 ms to minimize.
[2024-05-28 06:38:17] [INFO ] Deduced a trap composed of 206 places in 233 ms of which 3 ms to minimize.
[2024-05-28 06:38:17] [INFO ] Deduced a trap composed of 178 places in 204 ms of which 3 ms to minimize.
[2024-05-28 06:38:18] [INFO ] Deduced a trap composed of 178 places in 181 ms of which 3 ms to minimize.
[2024-05-28 06:38:18] [INFO ] Deduced a trap composed of 178 places in 193 ms of which 3 ms to minimize.
[2024-05-28 06:38:18] [INFO ] Deduced a trap composed of 178 places in 198 ms of which 4 ms to minimize.
[2024-05-28 06:38:18] [INFO ] Deduced a trap composed of 178 places in 210 ms of which 4 ms to minimize.
[2024-05-28 06:38:18] [INFO ] Deduced a trap composed of 178 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:38:19] [INFO ] Deduced a trap composed of 178 places in 176 ms of which 3 ms to minimize.
[2024-05-28 06:38:19] [INFO ] Deduced a trap composed of 178 places in 161 ms of which 4 ms to minimize.
[2024-05-28 06:38:19] [INFO ] Deduced a trap composed of 178 places in 211 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2024-05-28 06:38:20] [INFO ] Deduced a trap composed of 274 places in 231 ms of which 4 ms to minimize.
[2024-05-28 06:38:20] [INFO ] Deduced a trap composed of 278 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:38:20] [INFO ] Deduced a trap composed of 271 places in 205 ms of which 3 ms to minimize.
[2024-05-28 06:38:20] [INFO ] Deduced a trap composed of 272 places in 194 ms of which 4 ms to minimize.
[2024-05-28 06:38:21] [INFO ] Deduced a trap composed of 270 places in 191 ms of which 3 ms to minimize.
[2024-05-28 06:38:21] [INFO ] Deduced a trap composed of 268 places in 242 ms of which 4 ms to minimize.
[2024-05-28 06:38:21] [INFO ] Deduced a trap composed of 268 places in 222 ms of which 4 ms to minimize.
[2024-05-28 06:38:22] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 2 ms to minimize.
[2024-05-28 06:38:23] [INFO ] Deduced a trap composed of 278 places in 213 ms of which 4 ms to minimize.
[2024-05-28 06:38:24] [INFO ] Deduced a trap composed of 272 places in 193 ms of which 4 ms to minimize.
[2024-05-28 06:38:24] [INFO ] Deduced a trap composed of 275 places in 186 ms of which 3 ms to minimize.
[2024-05-28 06:38:24] [INFO ] Deduced a trap composed of 274 places in 232 ms of which 4 ms to minimize.
[2024-05-28 06:38:24] [INFO ] Deduced a trap composed of 275 places in 183 ms of which 3 ms to minimize.
[2024-05-28 06:38:24] [INFO ] Deduced a trap composed of 273 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:38:25] [INFO ] Deduced a trap composed of 277 places in 170 ms of which 3 ms to minimize.
[2024-05-28 06:38:25] [INFO ] Deduced a trap composed of 276 places in 195 ms of which 4 ms to minimize.
[2024-05-28 06:38:25] [INFO ] Deduced a trap composed of 276 places in 217 ms of which 4 ms to minimize.
[2024-05-28 06:38:25] [INFO ] Deduced a trap composed of 276 places in 180 ms of which 3 ms to minimize.
[2024-05-28 06:38:26] [INFO ] Deduced a trap composed of 196 places in 242 ms of which 5 ms to minimize.
[2024-05-28 06:38:26] [INFO ] Deduced a trap composed of 178 places in 191 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2024-05-28 06:38:29] [INFO ] Deduced a trap composed of 206 places in 263 ms of which 4 ms to minimize.
[2024-05-28 06:38:29] [INFO ] Deduced a trap composed of 210 places in 197 ms of which 3 ms to minimize.
[2024-05-28 06:38:29] [INFO ] Deduced a trap composed of 206 places in 187 ms of which 3 ms to minimize.
[2024-05-28 06:38:30] [INFO ] Deduced a trap composed of 222 places in 187 ms of which 3 ms to minimize.
[2024-05-28 06:38:30] [INFO ] Deduced a trap composed of 204 places in 182 ms of which 3 ms to minimize.
[2024-05-28 06:38:30] [INFO ] Deduced a trap composed of 210 places in 232 ms of which 3 ms to minimize.
[2024-05-28 06:38:30] [INFO ] Deduced a trap composed of 212 places in 220 ms of which 3 ms to minimize.
[2024-05-28 06:38:31] [INFO ] Deduced a trap composed of 210 places in 219 ms of which 3 ms to minimize.
[2024-05-28 06:38:31] [INFO ] Deduced a trap composed of 214 places in 191 ms of which 4 ms to minimize.
[2024-05-28 06:38:31] [INFO ] Deduced a trap composed of 206 places in 207 ms of which 3 ms to minimize.
[2024-05-28 06:38:31] [INFO ] Deduced a trap composed of 216 places in 189 ms of which 3 ms to minimize.
[2024-05-28 06:38:31] [INFO ] Deduced a trap composed of 204 places in 193 ms of which 3 ms to minimize.
[2024-05-28 06:38:32] [INFO ] Deduced a trap composed of 210 places in 197 ms of which 3 ms to minimize.
[2024-05-28 06:38:32] [INFO ] Deduced a trap composed of 210 places in 195 ms of which 3 ms to minimize.
[2024-05-28 06:38:32] [INFO ] Deduced a trap composed of 202 places in 217 ms of which 4 ms to minimize.
[2024-05-28 06:38:32] [INFO ] Deduced a trap composed of 214 places in 214 ms of which 4 ms to minimize.
[2024-05-28 06:38:33] [INFO ] Deduced a trap composed of 210 places in 197 ms of which 3 ms to minimize.
[2024-05-28 06:38:33] [INFO ] Deduced a trap composed of 212 places in 198 ms of which 3 ms to minimize.
[2024-05-28 06:38:33] [INFO ] Deduced a trap composed of 208 places in 201 ms of which 4 ms to minimize.
[2024-05-28 06:38:33] [INFO ] Deduced a trap composed of 216 places in 198 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/566 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/1371 variables, and 192 constraints, problems are : Problem set: 0 solved, 798 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 87/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/571 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/798 constraints, Known Traps: 100/100 constraints]
After SMT, in 41227ms problems are : Problem set: 0 solved, 798 unsolved
Search for dead transitions found 0 dead transitions in 41236ms
[2024-05-28 06:38:33] [INFO ] Flow matrix only has 800 transitions (discarded 4 similar events)
[2024-05-28 06:38:33] [INFO ] Invariant cache hit.
[2024-05-28 06:38:34] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-05-28 06:38:34] [INFO ] Flow matrix only has 800 transitions (discarded 4 similar events)
[2024-05-28 06:38:34] [INFO ] Invariant cache hit.
[2024-05-28 06:38:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:38:37] [INFO ] Implicit Places using invariants and state equation in 3182 ms returned []
Implicit Place search using SMT with State Equation took 3615 ms to find 0 implicit places.
[2024-05-28 06:38:37] [INFO ] Redundant transitions in 5 ms returned []
Running 798 sub problems to find dead transitions.
[2024-05-28 06:38:37] [INFO ] Flow matrix only has 800 transitions (discarded 4 similar events)
[2024-05-28 06:38:37] [INFO ] Invariant cache hit.
[2024-05-28 06:38:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2024-05-28 06:38:44] [INFO ] Deduced a trap composed of 178 places in 161 ms of which 3 ms to minimize.
[2024-05-28 06:38:45] [INFO ] Deduced a trap composed of 200 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:38:45] [INFO ] Deduced a trap composed of 206 places in 167 ms of which 3 ms to minimize.
[2024-05-28 06:38:45] [INFO ] Deduced a trap composed of 178 places in 211 ms of which 4 ms to minimize.
[2024-05-28 06:38:45] [INFO ] Deduced a trap composed of 178 places in 178 ms of which 3 ms to minimize.
[2024-05-28 06:38:45] [INFO ] Deduced a trap composed of 178 places in 171 ms of which 4 ms to minimize.
[2024-05-28 06:38:46] [INFO ] Deduced a trap composed of 178 places in 212 ms of which 4 ms to minimize.
[2024-05-28 06:38:46] [INFO ] Deduced a trap composed of 178 places in 193 ms of which 3 ms to minimize.
[2024-05-28 06:38:46] [INFO ] Deduced a trap composed of 178 places in 228 ms of which 4 ms to minimize.
[2024-05-28 06:38:46] [INFO ] Deduced a trap composed of 178 places in 175 ms of which 3 ms to minimize.
[2024-05-28 06:38:47] [INFO ] Deduced a trap composed of 178 places in 228 ms of which 4 ms to minimize.
[2024-05-28 06:38:47] [INFO ] Deduced a trap composed of 178 places in 209 ms of which 4 ms to minimize.
[2024-05-28 06:38:47] [INFO ] Deduced a trap composed of 178 places in 209 ms of which 3 ms to minimize.
[2024-05-28 06:38:47] [INFO ] Deduced a trap composed of 178 places in 202 ms of which 3 ms to minimize.
[2024-05-28 06:38:47] [INFO ] Deduced a trap composed of 178 places in 178 ms of which 3 ms to minimize.
[2024-05-28 06:38:48] [INFO ] Deduced a trap composed of 178 places in 177 ms of which 3 ms to minimize.
[2024-05-28 06:38:48] [INFO ] Deduced a trap composed of 178 places in 172 ms of which 3 ms to minimize.
[2024-05-28 06:38:48] [INFO ] Deduced a trap composed of 178 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:38:48] [INFO ] Deduced a trap composed of 178 places in 177 ms of which 3 ms to minimize.
[2024-05-28 06:38:48] [INFO ] Deduced a trap composed of 178 places in 173 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2024-05-28 06:38:49] [INFO ] Deduced a trap composed of 178 places in 178 ms of which 5 ms to minimize.
[2024-05-28 06:38:49] [INFO ] Deduced a trap composed of 178 places in 212 ms of which 4 ms to minimize.
[2024-05-28 06:38:49] [INFO ] Deduced a trap composed of 178 places in 210 ms of which 4 ms to minimize.
[2024-05-28 06:38:50] [INFO ] Deduced a trap composed of 178 places in 215 ms of which 4 ms to minimize.
[2024-05-28 06:38:50] [INFO ] Deduced a trap composed of 178 places in 185 ms of which 3 ms to minimize.
[2024-05-28 06:38:50] [INFO ] Deduced a trap composed of 178 places in 176 ms of which 4 ms to minimize.
[2024-05-28 06:38:50] [INFO ] Deduced a trap composed of 178 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:38:50] [INFO ] Deduced a trap composed of 178 places in 176 ms of which 3 ms to minimize.
[2024-05-28 06:38:51] [INFO ] Deduced a trap composed of 177 places in 220 ms of which 3 ms to minimize.
[2024-05-28 06:38:51] [INFO ] Deduced a trap composed of 177 places in 174 ms of which 4 ms to minimize.
[2024-05-28 06:38:51] [INFO ] Deduced a trap composed of 177 places in 172 ms of which 3 ms to minimize.
[2024-05-28 06:38:51] [INFO ] Deduced a trap composed of 177 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:38:51] [INFO ] Deduced a trap composed of 178 places in 178 ms of which 20 ms to minimize.
[2024-05-28 06:38:52] [INFO ] Deduced a trap composed of 178 places in 232 ms of which 4 ms to minimize.
[2024-05-28 06:38:52] [INFO ] Deduced a trap composed of 178 places in 206 ms of which 4 ms to minimize.
[2024-05-28 06:38:52] [INFO ] Deduced a trap composed of 178 places in 177 ms of which 3 ms to minimize.
[2024-05-28 06:38:52] [INFO ] Deduced a trap composed of 178 places in 172 ms of which 3 ms to minimize.
[2024-05-28 06:38:52] [INFO ] Deduced a trap composed of 178 places in 199 ms of which 3 ms to minimize.
[2024-05-28 06:38:53] [INFO ] Deduced a trap composed of 178 places in 196 ms of which 3 ms to minimize.
[2024-05-28 06:38:53] [INFO ] Deduced a trap composed of 178 places in 202 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2024-05-28 06:39:00] [INFO ] Deduced a trap composed of 191 places in 186 ms of which 4 ms to minimize.
[2024-05-28 06:39:00] [INFO ] Deduced a trap composed of 209 places in 187 ms of which 3 ms to minimize.
[2024-05-28 06:39:00] [INFO ] Deduced a trap composed of 178 places in 239 ms of which 4 ms to minimize.
[2024-05-28 06:39:01] [INFO ] Deduced a trap composed of 178 places in 213 ms of which 4 ms to minimize.
[2024-05-28 06:39:01] [INFO ] Deduced a trap composed of 178 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:39:01] [INFO ] Deduced a trap composed of 178 places in 189 ms of which 3 ms to minimize.
[2024-05-28 06:39:01] [INFO ] Deduced a trap composed of 178 places in 227 ms of which 4 ms to minimize.
[2024-05-28 06:39:02] [INFO ] Deduced a trap composed of 178 places in 171 ms of which 3 ms to minimize.
[2024-05-28 06:39:02] [INFO ] Deduced a trap composed of 178 places in 166 ms of which 4 ms to minimize.
[2024-05-28 06:39:02] [INFO ] Deduced a trap composed of 178 places in 163 ms of which 3 ms to minimize.
[2024-05-28 06:39:02] [INFO ] Deduced a trap composed of 178 places in 162 ms of which 3 ms to minimize.
[2024-05-28 06:39:02] [INFO ] Deduced a trap composed of 178 places in 209 ms of which 3 ms to minimize.
[2024-05-28 06:39:02] [INFO ] Deduced a trap composed of 178 places in 178 ms of which 3 ms to minimize.
[2024-05-28 06:39:03] [INFO ] Deduced a trap composed of 178 places in 225 ms of which 4 ms to minimize.
[2024-05-28 06:39:03] [INFO ] Deduced a trap composed of 178 places in 178 ms of which 4 ms to minimize.
[2024-05-28 06:39:03] [INFO ] Deduced a trap composed of 178 places in 224 ms of which 3 ms to minimize.
[2024-05-28 06:39:03] [INFO ] Deduced a trap composed of 178 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:39:04] [INFO ] Deduced a trap composed of 178 places in 177 ms of which 3 ms to minimize.
[2024-05-28 06:39:04] [INFO ] Deduced a trap composed of 178 places in 165 ms of which 3 ms to minimize.
[2024-05-28 06:39:04] [INFO ] Deduced a trap composed of 178 places in 214 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2024-05-28 06:39:07] [INFO ] Deduced a trap composed of 178 places in 188 ms of which 9 ms to minimize.
[2024-05-28 06:39:07] [INFO ] Deduced a trap composed of 178 places in 212 ms of which 3 ms to minimize.
[2024-05-28 06:39:07] [INFO ] Deduced a trap composed of 178 places in 184 ms of which 3 ms to minimize.
[2024-05-28 06:39:07] [INFO ] Deduced a trap composed of 178 places in 186 ms of which 3 ms to minimize.
[2024-05-28 06:39:08] [INFO ] Deduced a trap composed of 178 places in 192 ms of which 3 ms to minimize.
[2024-05-28 06:39:08] [INFO ] Deduced a trap composed of 178 places in 188 ms of which 3 ms to minimize.
[2024-05-28 06:39:08] [INFO ] Deduced a trap composed of 178 places in 177 ms of which 3 ms to minimize.
[2024-05-28 06:39:08] [INFO ] Deduced a trap composed of 178 places in 216 ms of which 3 ms to minimize.
[2024-05-28 06:39:08] [INFO ] Deduced a trap composed of 178 places in 192 ms of which 3 ms to minimize.
SMT process timed out in 31432ms, After SMT, problems are : Problem set: 0 solved, 798 unsolved
Search for dead transitions found 0 dead transitions in 31440ms
Starting structural reductions in SI_LTL mode, iteration 1 : 571/623 places, 804/856 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76366 ms. Remains : 571/623 places, 804/856 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLFireability-12
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J40-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J40-LTLFireability-12 finished in 76431 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||G(p1)))))'
Support contains 8 out of 623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 623/623 places, 856/856 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 623 transition count 812
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 579 transition count 812
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 88 place count 579 transition count 768
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 176 place count 535 transition count 768
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 182 place count 532 transition count 765
Applied a total of 182 rules in 34 ms. Remains 532 /623 variables (removed 91) and now considering 765/856 (removed 91) transitions.
Running 759 sub problems to find dead transitions.
[2024-05-28 06:39:09] [INFO ] Flow matrix only has 761 transitions (discarded 4 similar events)
// Phase 1: matrix 761 rows 532 cols
[2024-05-28 06:39:09] [INFO ] Computed 97 invariants in 11 ms
[2024-05-28 06:39:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 3 (OVERLAPS) 4/531 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 759 unsolved
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD319 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/532 variables, 1/97 constraints. Problems are: Problem set: 17 solved, 742 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1293 variables, and 97 constraints, problems are : Problem set: 17 solved, 742 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 759/759 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 17 solved, 742 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 86/86 constraints. Problems are: Problem set: 17 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 6/92 constraints. Problems are: Problem set: 17 solved, 742 unsolved
[2024-05-28 06:39:30] [INFO ] Deduced a trap composed of 172 places in 171 ms of which 3 ms to minimize.
[2024-05-28 06:39:31] [INFO ] Deduced a trap composed of 163 places in 158 ms of which 3 ms to minimize.
[2024-05-28 06:39:31] [INFO ] Deduced a trap composed of 160 places in 185 ms of which 3 ms to minimize.
[2024-05-28 06:39:31] [INFO ] Deduced a trap composed of 172 places in 171 ms of which 2 ms to minimize.
[2024-05-28 06:39:31] [INFO ] Deduced a trap composed of 163 places in 163 ms of which 2 ms to minimize.
[2024-05-28 06:39:32] [INFO ] Deduced a trap composed of 166 places in 167 ms of which 2 ms to minimize.
[2024-05-28 06:39:32] [INFO ] Deduced a trap composed of 181 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:39:32] [INFO ] Deduced a trap composed of 169 places in 216 ms of which 4 ms to minimize.
[2024-05-28 06:39:32] [INFO ] Deduced a trap composed of 175 places in 178 ms of which 3 ms to minimize.
[2024-05-28 06:39:32] [INFO ] Deduced a trap composed of 166 places in 170 ms of which 3 ms to minimize.
[2024-05-28 06:39:33] [INFO ] Deduced a trap composed of 172 places in 209 ms of which 3 ms to minimize.
[2024-05-28 06:39:33] [INFO ] Deduced a trap composed of 163 places in 164 ms of which 2 ms to minimize.
[2024-05-28 06:39:33] [INFO ] Deduced a trap composed of 157 places in 164 ms of which 3 ms to minimize.
[2024-05-28 06:39:33] [INFO ] Deduced a trap composed of 157 places in 163 ms of which 3 ms to minimize.
[2024-05-28 06:39:33] [INFO ] Deduced a trap composed of 163 places in 180 ms of which 2 ms to minimize.
[2024-05-28 06:39:34] [INFO ] Deduced a trap composed of 139 places in 169 ms of which 2 ms to minimize.
[2024-05-28 06:39:34] [INFO ] Deduced a trap composed of 166 places in 186 ms of which 3 ms to minimize.
[2024-05-28 06:39:34] [INFO ] Deduced a trap composed of 163 places in 181 ms of which 3 ms to minimize.
[2024-05-28 06:39:34] [INFO ] Deduced a trap composed of 151 places in 176 ms of which 3 ms to minimize.
[2024-05-28 06:39:34] [INFO ] Deduced a trap composed of 160 places in 174 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 20/112 constraints. Problems are: Problem set: 17 solved, 742 unsolved
[2024-05-28 06:39:35] [INFO ] Deduced a trap composed of 166 places in 167 ms of which 3 ms to minimize.
[2024-05-28 06:39:35] [INFO ] Deduced a trap composed of 149 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:39:35] [INFO ] Deduced a trap composed of 138 places in 147 ms of which 3 ms to minimize.
[2024-05-28 06:39:35] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 3 ms to minimize.
[2024-05-28 06:39:36] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 3 ms to minimize.
[2024-05-28 06:39:36] [INFO ] Deduced a trap composed of 138 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:39:36] [INFO ] Deduced a trap composed of 138 places in 172 ms of which 3 ms to minimize.
[2024-05-28 06:39:36] [INFO ] Deduced a trap composed of 138 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:39:36] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 2 ms to minimize.
[2024-05-28 06:39:36] [INFO ] Deduced a trap composed of 138 places in 175 ms of which 3 ms to minimize.
[2024-05-28 06:39:37] [INFO ] Deduced a trap composed of 138 places in 206 ms of which 3 ms to minimize.
[2024-05-28 06:39:37] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 3 ms to minimize.
[2024-05-28 06:39:37] [INFO ] Deduced a trap composed of 138 places in 176 ms of which 3 ms to minimize.
[2024-05-28 06:39:37] [INFO ] Deduced a trap composed of 138 places in 198 ms of which 2 ms to minimize.
[2024-05-28 06:39:37] [INFO ] Deduced a trap composed of 138 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:39:38] [INFO ] Deduced a trap composed of 138 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:39:38] [INFO ] Deduced a trap composed of 138 places in 192 ms of which 3 ms to minimize.
[2024-05-28 06:39:38] [INFO ] Deduced a trap composed of 141 places in 170 ms of which 3 ms to minimize.
[2024-05-28 06:39:38] [INFO ] Deduced a trap composed of 138 places in 187 ms of which 2 ms to minimize.
[2024-05-28 06:39:38] [INFO ] Deduced a trap composed of 138 places in 172 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/132 constraints. Problems are: Problem set: 17 solved, 742 unsolved
[2024-05-28 06:39:40] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 2 ms to minimize.
[2024-05-28 06:39:41] [INFO ] Deduced a trap composed of 172 places in 197 ms of which 2 ms to minimize.
[2024-05-28 06:39:41] [INFO ] Deduced a trap composed of 141 places in 246 ms of which 3 ms to minimize.
[2024-05-28 06:39:41] [INFO ] Deduced a trap composed of 138 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:39:42] [INFO ] Deduced a trap composed of 141 places in 180 ms of which 3 ms to minimize.
[2024-05-28 06:39:42] [INFO ] Deduced a trap composed of 138 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:39:42] [INFO ] Deduced a trap composed of 141 places in 175 ms of which 3 ms to minimize.
[2024-05-28 06:39:42] [INFO ] Deduced a trap composed of 138 places in 180 ms of which 3 ms to minimize.
[2024-05-28 06:39:42] [INFO ] Deduced a trap composed of 142 places in 177 ms of which 3 ms to minimize.
[2024-05-28 06:39:43] [INFO ] Deduced a trap composed of 138 places in 168 ms of which 3 ms to minimize.
[2024-05-28 06:39:43] [INFO ] Deduced a trap composed of 138 places in 181 ms of which 3 ms to minimize.
[2024-05-28 06:39:43] [INFO ] Deduced a trap composed of 138 places in 172 ms of which 3 ms to minimize.
[2024-05-28 06:39:43] [INFO ] Deduced a trap composed of 138 places in 180 ms of which 3 ms to minimize.
[2024-05-28 06:39:43] [INFO ] Deduced a trap composed of 138 places in 187 ms of which 3 ms to minimize.
[2024-05-28 06:39:44] [INFO ] Deduced a trap composed of 138 places in 177 ms of which 3 ms to minimize.
[2024-05-28 06:39:44] [INFO ] Deduced a trap composed of 138 places in 197 ms of which 2 ms to minimize.
[2024-05-28 06:39:44] [INFO ] Deduced a trap composed of 138 places in 185 ms of which 2 ms to minimize.
[2024-05-28 06:39:44] [INFO ] Deduced a trap composed of 138 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:39:44] [INFO ] Deduced a trap composed of 138 places in 173 ms of which 2 ms to minimize.
[2024-05-28 06:39:45] [INFO ] Deduced a trap composed of 141 places in 194 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 20/152 constraints. Problems are: Problem set: 17 solved, 742 unsolved
[2024-05-28 06:39:50] [INFO ] Deduced a trap composed of 206 places in 251 ms of which 3 ms to minimize.
SMT process timed out in 41446ms, After SMT, problems are : Problem set: 17 solved, 742 unsolved
Search for dead transitions found 17 dead transitions in 41454ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 17 transitions.
[2024-05-28 06:39:50] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
// Phase 1: matrix 744 rows 532 cols
[2024-05-28 06:39:50] [INFO ] Computed 97 invariants in 18 ms
[2024-05-28 06:39:50] [INFO ] Implicit Places using invariants in 414 ms returned []
[2024-05-28 06:39:50] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2024-05-28 06:39:50] [INFO ] Invariant cache hit.
[2024-05-28 06:39:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:39:53] [INFO ] Implicit Places using invariants and state equation in 2560 ms returned []
Implicit Place search using SMT with State Equation took 2989 ms to find 0 implicit places.
[2024-05-28 06:39:53] [INFO ] Redundant transitions in 7 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 532/623 places, 748/856 transitions.
Applied a total of 0 rules in 19 ms. Remains 532 /532 variables (removed 0) and now considering 748/748 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44518 ms. Remains : 532/623 places, 748/856 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLFireability-13
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J40-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J40-LTLFireability-13 finished in 44604 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(F(p0))||G(p1))))'
Support contains 42 out of 623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 623/623 places, 856/856 transitions.
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 623 transition count 852
Reduce places removed 4 places and 0 transitions.
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Iterating post reduction 1 with 45 rules applied. Total rules applied 49 place count 619 transition count 811
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 90 place count 578 transition count 811
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 90 place count 578 transition count 807
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 98 place count 574 transition count 807
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 104 place count 571 transition count 804
Applied a total of 104 rules in 37 ms. Remains 571 /623 variables (removed 52) and now considering 804/856 (removed 52) transitions.
Running 798 sub problems to find dead transitions.
[2024-05-28 06:39:53] [INFO ] Flow matrix only has 800 transitions (discarded 4 similar events)
// Phase 1: matrix 800 rows 571 cols
[2024-05-28 06:39:53] [INFO ] Computed 97 invariants in 10 ms
[2024-05-28 06:39:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2024-05-28 06:40:01] [INFO ] Deduced a trap composed of 178 places in 171 ms of which 3 ms to minimize.
[2024-05-28 06:40:01] [INFO ] Deduced a trap composed of 178 places in 183 ms of which 3 ms to minimize.
[2024-05-28 06:40:01] [INFO ] Deduced a trap composed of 178 places in 189 ms of which 3 ms to minimize.
[2024-05-28 06:40:01] [INFO ] Deduced a trap composed of 178 places in 185 ms of which 3 ms to minimize.
[2024-05-28 06:40:02] [INFO ] Deduced a trap composed of 178 places in 176 ms of which 3 ms to minimize.
[2024-05-28 06:40:02] [INFO ] Deduced a trap composed of 178 places in 181 ms of which 3 ms to minimize.
[2024-05-28 06:40:02] [INFO ] Deduced a trap composed of 177 places in 173 ms of which 2 ms to minimize.
[2024-05-28 06:40:02] [INFO ] Deduced a trap composed of 177 places in 175 ms of which 3 ms to minimize.
[2024-05-28 06:40:02] [INFO ] Deduced a trap composed of 177 places in 175 ms of which 3 ms to minimize.
[2024-05-28 06:40:03] [INFO ] Deduced a trap composed of 205 places in 200 ms of which 3 ms to minimize.
[2024-05-28 06:40:03] [INFO ] Deduced a trap composed of 177 places in 183 ms of which 3 ms to minimize.
[2024-05-28 06:40:03] [INFO ] Deduced a trap composed of 177 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:40:03] [INFO ] Deduced a trap composed of 178 places in 186 ms of which 3 ms to minimize.
[2024-05-28 06:40:03] [INFO ] Deduced a trap composed of 178 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:40:04] [INFO ] Deduced a trap composed of 178 places in 186 ms of which 3 ms to minimize.
[2024-05-28 06:40:04] [INFO ] Deduced a trap composed of 178 places in 168 ms of which 3 ms to minimize.
[2024-05-28 06:40:04] [INFO ] Deduced a trap composed of 178 places in 180 ms of which 3 ms to minimize.
[2024-05-28 06:40:04] [INFO ] Deduced a trap composed of 178 places in 193 ms of which 3 ms to minimize.
[2024-05-28 06:40:05] [INFO ] Deduced a trap composed of 178 places in 336 ms of which 4 ms to minimize.
[2024-05-28 06:40:05] [INFO ] Deduced a trap composed of 178 places in 179 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2024-05-28 06:40:05] [INFO ] Deduced a trap composed of 212 places in 219 ms of which 4 ms to minimize.
[2024-05-28 06:40:06] [INFO ] Deduced a trap composed of 203 places in 162 ms of which 3 ms to minimize.
[2024-05-28 06:40:06] [INFO ] Deduced a trap composed of 200 places in 196 ms of which 4 ms to minimize.
[2024-05-28 06:40:06] [INFO ] Deduced a trap composed of 194 places in 211 ms of which 3 ms to minimize.
[2024-05-28 06:40:06] [INFO ] Deduced a trap composed of 177 places in 234 ms of which 3 ms to minimize.
[2024-05-28 06:40:07] [INFO ] Deduced a trap composed of 178 places in 187 ms of which 4 ms to minimize.
[2024-05-28 06:40:07] [INFO ] Deduced a trap composed of 178 places in 172 ms of which 3 ms to minimize.
[2024-05-28 06:40:07] [INFO ] Deduced a trap composed of 178 places in 178 ms of which 3 ms to minimize.
[2024-05-28 06:40:07] [INFO ] Deduced a trap composed of 178 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:40:07] [INFO ] Deduced a trap composed of 178 places in 176 ms of which 3 ms to minimize.
[2024-05-28 06:40:08] [INFO ] Deduced a trap composed of 178 places in 179 ms of which 3 ms to minimize.
[2024-05-28 06:40:08] [INFO ] Deduced a trap composed of 178 places in 231 ms of which 3 ms to minimize.
[2024-05-28 06:40:08] [INFO ] Deduced a trap composed of 178 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:40:08] [INFO ] Deduced a trap composed of 178 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:40:09] [INFO ] Deduced a trap composed of 178 places in 183 ms of which 3 ms to minimize.
[2024-05-28 06:40:09] [INFO ] Deduced a trap composed of 178 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:40:09] [INFO ] Deduced a trap composed of 178 places in 183 ms of which 3 ms to minimize.
[2024-05-28 06:40:09] [INFO ] Deduced a trap composed of 203 places in 183 ms of which 3 ms to minimize.
[2024-05-28 06:40:09] [INFO ] Deduced a trap composed of 203 places in 187 ms of which 2 ms to minimize.
[2024-05-28 06:40:10] [INFO ] Deduced a trap composed of 178 places in 182 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 566/1371 variables, and 132 constraints, problems are : Problem set: 0 solved, 798 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 87/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/571 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 798/798 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 798 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2024-05-28 06:40:16] [INFO ] Deduced a trap composed of 203 places in 201 ms of which 4 ms to minimize.
[2024-05-28 06:40:16] [INFO ] Deduced a trap composed of 200 places in 222 ms of which 4 ms to minimize.
[2024-05-28 06:40:16] [INFO ] Deduced a trap composed of 206 places in 177 ms of which 3 ms to minimize.
[2024-05-28 06:40:17] [INFO ] Deduced a trap composed of 178 places in 185 ms of which 3 ms to minimize.
[2024-05-28 06:40:17] [INFO ] Deduced a trap composed of 178 places in 178 ms of which 3 ms to minimize.
[2024-05-28 06:40:17] [INFO ] Deduced a trap composed of 203 places in 222 ms of which 4 ms to minimize.
[2024-05-28 06:40:17] [INFO ] Deduced a trap composed of 178 places in 206 ms of which 4 ms to minimize.
[2024-05-28 06:40:17] [INFO ] Deduced a trap composed of 178 places in 206 ms of which 4 ms to minimize.
[2024-05-28 06:40:18] [INFO ] Deduced a trap composed of 178 places in 220 ms of which 4 ms to minimize.
[2024-05-28 06:40:18] [INFO ] Deduced a trap composed of 178 places in 195 ms of which 3 ms to minimize.
[2024-05-28 06:40:18] [INFO ] Deduced a trap composed of 206 places in 178 ms of which 3 ms to minimize.
[2024-05-28 06:40:18] [INFO ] Deduced a trap composed of 178 places in 198 ms of which 3 ms to minimize.
[2024-05-28 06:40:19] [INFO ] Deduced a trap composed of 178 places in 196 ms of which 3 ms to minimize.
[2024-05-28 06:40:19] [INFO ] Deduced a trap composed of 178 places in 192 ms of which 3 ms to minimize.
[2024-05-28 06:40:19] [INFO ] Deduced a trap composed of 178 places in 170 ms of which 3 ms to minimize.
[2024-05-28 06:40:19] [INFO ] Deduced a trap composed of 178 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:40:19] [INFO ] Deduced a trap composed of 178 places in 170 ms of which 3 ms to minimize.
[2024-05-28 06:40:20] [INFO ] Deduced a trap composed of 178 places in 168 ms of which 2 ms to minimize.
[2024-05-28 06:40:20] [INFO ] Deduced a trap composed of 178 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:40:20] [INFO ] Deduced a trap composed of 178 places in 173 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2024-05-28 06:40:21] [INFO ] Deduced a trap composed of 274 places in 225 ms of which 3 ms to minimize.
[2024-05-28 06:40:21] [INFO ] Deduced a trap composed of 278 places in 207 ms of which 4 ms to minimize.
[2024-05-28 06:40:21] [INFO ] Deduced a trap composed of 271 places in 202 ms of which 4 ms to minimize.
[2024-05-28 06:40:22] [INFO ] Deduced a trap composed of 272 places in 206 ms of which 4 ms to minimize.
[2024-05-28 06:40:22] [INFO ] Deduced a trap composed of 270 places in 175 ms of which 3 ms to minimize.
[2024-05-28 06:40:22] [INFO ] Deduced a trap composed of 268 places in 233 ms of which 4 ms to minimize.
[2024-05-28 06:40:22] [INFO ] Deduced a trap composed of 268 places in 166 ms of which 2 ms to minimize.
[2024-05-28 06:40:23] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 2 ms to minimize.
[2024-05-28 06:40:24] [INFO ] Deduced a trap composed of 278 places in 162 ms of which 3 ms to minimize.
[2024-05-28 06:40:24] [INFO ] Deduced a trap composed of 272 places in 214 ms of which 4 ms to minimize.
[2024-05-28 06:40:24] [INFO ] Deduced a trap composed of 275 places in 224 ms of which 4 ms to minimize.
[2024-05-28 06:40:25] [INFO ] Deduced a trap composed of 274 places in 204 ms of which 3 ms to minimize.
[2024-05-28 06:40:25] [INFO ] Deduced a trap composed of 275 places in 202 ms of which 3 ms to minimize.
[2024-05-28 06:40:25] [INFO ] Deduced a trap composed of 273 places in 203 ms of which 3 ms to minimize.
[2024-05-28 06:40:25] [INFO ] Deduced a trap composed of 277 places in 184 ms of which 3 ms to minimize.
[2024-05-28 06:40:26] [INFO ] Deduced a trap composed of 276 places in 247 ms of which 4 ms to minimize.
[2024-05-28 06:40:26] [INFO ] Deduced a trap composed of 276 places in 191 ms of which 3 ms to minimize.
[2024-05-28 06:40:26] [INFO ] Deduced a trap composed of 276 places in 161 ms of which 3 ms to minimize.
[2024-05-28 06:40:26] [INFO ] Deduced a trap composed of 196 places in 179 ms of which 3 ms to minimize.
[2024-05-28 06:40:27] [INFO ] Deduced a trap composed of 178 places in 226 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2024-05-28 06:40:29] [INFO ] Deduced a trap composed of 206 places in 167 ms of which 3 ms to minimize.
[2024-05-28 06:40:30] [INFO ] Deduced a trap composed of 210 places in 243 ms of which 4 ms to minimize.
[2024-05-28 06:40:30] [INFO ] Deduced a trap composed of 206 places in 223 ms of which 4 ms to minimize.
[2024-05-28 06:40:30] [INFO ] Deduced a trap composed of 222 places in 236 ms of which 4 ms to minimize.
[2024-05-28 06:40:30] [INFO ] Deduced a trap composed of 204 places in 221 ms of which 4 ms to minimize.
[2024-05-28 06:40:31] [INFO ] Deduced a trap composed of 210 places in 185 ms of which 2 ms to minimize.
[2024-05-28 06:40:31] [INFO ] Deduced a trap composed of 212 places in 190 ms of which 3 ms to minimize.
[2024-05-28 06:40:31] [INFO ] Deduced a trap composed of 210 places in 179 ms of which 3 ms to minimize.
[2024-05-28 06:40:31] [INFO ] Deduced a trap composed of 214 places in 252 ms of which 4 ms to minimize.
[2024-05-28 06:40:31] [INFO ] Deduced a trap composed of 206 places in 188 ms of which 3 ms to minimize.
[2024-05-28 06:40:32] [INFO ] Deduced a trap composed of 216 places in 190 ms of which 3 ms to minimize.
[2024-05-28 06:40:32] [INFO ] Deduced a trap composed of 204 places in 257 ms of which 4 ms to minimize.
[2024-05-28 06:40:32] [INFO ] Deduced a trap composed of 210 places in 231 ms of which 4 ms to minimize.
[2024-05-28 06:40:32] [INFO ] Deduced a trap composed of 210 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:40:33] [INFO ] Deduced a trap composed of 202 places in 225 ms of which 4 ms to minimize.
[2024-05-28 06:40:33] [INFO ] Deduced a trap composed of 214 places in 245 ms of which 4 ms to minimize.
[2024-05-28 06:40:33] [INFO ] Deduced a trap composed of 210 places in 201 ms of which 3 ms to minimize.
[2024-05-28 06:40:33] [INFO ] Deduced a trap composed of 212 places in 187 ms of which 3 ms to minimize.
[2024-05-28 06:40:34] [INFO ] Deduced a trap composed of 208 places in 186 ms of which 3 ms to minimize.
[2024-05-28 06:40:34] [INFO ] Deduced a trap composed of 216 places in 195 ms of which 14 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/566 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/1371 variables, and 192 constraints, problems are : Problem set: 0 solved, 798 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 87/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/571 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/798 constraints, Known Traps: 100/100 constraints]
After SMT, in 41304ms problems are : Problem set: 0 solved, 798 unsolved
Search for dead transitions found 0 dead transitions in 41313ms
[2024-05-28 06:40:34] [INFO ] Flow matrix only has 800 transitions (discarded 4 similar events)
[2024-05-28 06:40:34] [INFO ] Invariant cache hit.
[2024-05-28 06:40:35] [INFO ] Implicit Places using invariants in 462 ms returned []
[2024-05-28 06:40:35] [INFO ] Flow matrix only has 800 transitions (discarded 4 similar events)
[2024-05-28 06:40:35] [INFO ] Invariant cache hit.
[2024-05-28 06:40:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:40:38] [INFO ] Implicit Places using invariants and state equation in 3325 ms returned []
Implicit Place search using SMT with State Equation took 3790 ms to find 0 implicit places.
[2024-05-28 06:40:38] [INFO ] Redundant transitions in 14 ms returned []
Running 798 sub problems to find dead transitions.
[2024-05-28 06:40:38] [INFO ] Flow matrix only has 800 transitions (discarded 4 similar events)
[2024-05-28 06:40:38] [INFO ] Invariant cache hit.
[2024-05-28 06:40:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2024-05-28 06:40:46] [INFO ] Deduced a trap composed of 178 places in 166 ms of which 3 ms to minimize.
[2024-05-28 06:40:46] [INFO ] Deduced a trap composed of 200 places in 215 ms of which 4 ms to minimize.
[2024-05-28 06:40:46] [INFO ] Deduced a trap composed of 206 places in 179 ms of which 3 ms to minimize.
[2024-05-28 06:40:46] [INFO ] Deduced a trap composed of 178 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:40:47] [INFO ] Deduced a trap composed of 178 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:40:47] [INFO ] Deduced a trap composed of 178 places in 171 ms of which 3 ms to minimize.
[2024-05-28 06:40:47] [INFO ] Deduced a trap composed of 178 places in 171 ms of which 3 ms to minimize.
[2024-05-28 06:40:47] [INFO ] Deduced a trap composed of 178 places in 244 ms of which 4 ms to minimize.
[2024-05-28 06:40:47] [INFO ] Deduced a trap composed of 178 places in 175 ms of which 3 ms to minimize.
[2024-05-28 06:40:48] [INFO ] Deduced a trap composed of 178 places in 175 ms of which 3 ms to minimize.
[2024-05-28 06:40:48] [INFO ] Deduced a trap composed of 178 places in 178 ms of which 3 ms to minimize.
[2024-05-28 06:40:48] [INFO ] Deduced a trap composed of 178 places in 295 ms of which 3 ms to minimize.
[2024-05-28 06:40:48] [INFO ] Deduced a trap composed of 178 places in 231 ms of which 4 ms to minimize.
[2024-05-28 06:40:49] [INFO ] Deduced a trap composed of 178 places in 176 ms of which 3 ms to minimize.
[2024-05-28 06:40:49] [INFO ] Deduced a trap composed of 178 places in 175 ms of which 3 ms to minimize.
[2024-05-28 06:40:49] [INFO ] Deduced a trap composed of 178 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:40:49] [INFO ] Deduced a trap composed of 178 places in 218 ms of which 3 ms to minimize.
[2024-05-28 06:40:49] [INFO ] Deduced a trap composed of 178 places in 180 ms of which 3 ms to minimize.
[2024-05-28 06:40:50] [INFO ] Deduced a trap composed of 178 places in 234 ms of which 4 ms to minimize.
[2024-05-28 06:40:50] [INFO ] Deduced a trap composed of 178 places in 175 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2024-05-28 06:40:50] [INFO ] Deduced a trap composed of 178 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:40:51] [INFO ] Deduced a trap composed of 178 places in 187 ms of which 3 ms to minimize.
[2024-05-28 06:40:51] [INFO ] Deduced a trap composed of 178 places in 172 ms of which 3 ms to minimize.
[2024-05-28 06:40:51] [INFO ] Deduced a trap composed of 178 places in 180 ms of which 3 ms to minimize.
[2024-05-28 06:40:51] [INFO ] Deduced a trap composed of 178 places in 178 ms of which 3 ms to minimize.
[2024-05-28 06:40:51] [INFO ] Deduced a trap composed of 178 places in 177 ms of which 3 ms to minimize.
[2024-05-28 06:40:51] [INFO ] Deduced a trap composed of 178 places in 176 ms of which 3 ms to minimize.
[2024-05-28 06:40:52] [INFO ] Deduced a trap composed of 178 places in 171 ms of which 3 ms to minimize.
[2024-05-28 06:40:52] [INFO ] Deduced a trap composed of 177 places in 181 ms of which 3 ms to minimize.
[2024-05-28 06:40:52] [INFO ] Deduced a trap composed of 177 places in 168 ms of which 3 ms to minimize.
[2024-05-28 06:40:52] [INFO ] Deduced a trap composed of 177 places in 180 ms of which 3 ms to minimize.
[2024-05-28 06:40:52] [INFO ] Deduced a trap composed of 177 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:40:53] [INFO ] Deduced a trap composed of 178 places in 162 ms of which 3 ms to minimize.
[2024-05-28 06:40:53] [INFO ] Deduced a trap composed of 178 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:40:53] [INFO ] Deduced a trap composed of 178 places in 175 ms of which 3 ms to minimize.
[2024-05-28 06:40:53] [INFO ] Deduced a trap composed of 178 places in 234 ms of which 4 ms to minimize.
[2024-05-28 06:40:53] [INFO ] Deduced a trap composed of 178 places in 218 ms of which 4 ms to minimize.
[2024-05-28 06:40:54] [INFO ] Deduced a trap composed of 178 places in 217 ms of which 4 ms to minimize.
[2024-05-28 06:40:54] [INFO ] Deduced a trap composed of 178 places in 176 ms of which 4 ms to minimize.
[2024-05-28 06:40:54] [INFO ] Deduced a trap composed of 178 places in 176 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2024-05-28 06:41:00] [INFO ] Deduced a trap composed of 191 places in 150 ms of which 3 ms to minimize.
[2024-05-28 06:41:01] [INFO ] Deduced a trap composed of 209 places in 160 ms of which 3 ms to minimize.
[2024-05-28 06:41:01] [INFO ] Deduced a trap composed of 178 places in 170 ms of which 2 ms to minimize.
[2024-05-28 06:41:01] [INFO ] Deduced a trap composed of 178 places in 157 ms of which 3 ms to minimize.
[2024-05-28 06:41:01] [INFO ] Deduced a trap composed of 178 places in 171 ms of which 3 ms to minimize.
[2024-05-28 06:41:01] [INFO ] Deduced a trap composed of 178 places in 171 ms of which 3 ms to minimize.
[2024-05-28 06:41:02] [INFO ] Deduced a trap composed of 178 places in 226 ms of which 4 ms to minimize.
[2024-05-28 06:41:02] [INFO ] Deduced a trap composed of 178 places in 179 ms of which 3 ms to minimize.
[2024-05-28 06:41:02] [INFO ] Deduced a trap composed of 178 places in 181 ms of which 3 ms to minimize.
[2024-05-28 06:41:02] [INFO ] Deduced a trap composed of 178 places in 172 ms of which 3 ms to minimize.
[2024-05-28 06:41:02] [INFO ] Deduced a trap composed of 178 places in 182 ms of which 3 ms to minimize.
[2024-05-28 06:41:03] [INFO ] Deduced a trap composed of 178 places in 192 ms of which 3 ms to minimize.
[2024-05-28 06:41:03] [INFO ] Deduced a trap composed of 178 places in 183 ms of which 3 ms to minimize.
[2024-05-28 06:41:03] [INFO ] Deduced a trap composed of 178 places in 185 ms of which 3 ms to minimize.
[2024-05-28 06:41:03] [INFO ] Deduced a trap composed of 178 places in 182 ms of which 3 ms to minimize.
[2024-05-28 06:41:03] [INFO ] Deduced a trap composed of 178 places in 181 ms of which 3 ms to minimize.
[2024-05-28 06:41:04] [INFO ] Deduced a trap composed of 178 places in 204 ms of which 3 ms to minimize.
[2024-05-28 06:41:04] [INFO ] Deduced a trap composed of 178 places in 208 ms of which 3 ms to minimize.
[2024-05-28 06:41:04] [INFO ] Deduced a trap composed of 178 places in 313 ms of which 3 ms to minimize.
[2024-05-28 06:41:04] [INFO ] Deduced a trap composed of 178 places in 182 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2024-05-28 06:41:07] [INFO ] Deduced a trap composed of 178 places in 205 ms of which 3 ms to minimize.
[2024-05-28 06:41:07] [INFO ] Deduced a trap composed of 178 places in 184 ms of which 3 ms to minimize.
[2024-05-28 06:41:07] [INFO ] Deduced a trap composed of 178 places in 187 ms of which 3 ms to minimize.
[2024-05-28 06:41:08] [INFO ] Deduced a trap composed of 178 places in 188 ms of which 2 ms to minimize.
[2024-05-28 06:41:08] [INFO ] Deduced a trap composed of 178 places in 186 ms of which 3 ms to minimize.
[2024-05-28 06:41:08] [INFO ] Deduced a trap composed of 178 places in 185 ms of which 3 ms to minimize.
[2024-05-28 06:41:08] [INFO ] Deduced a trap composed of 178 places in 230 ms of which 4 ms to minimize.
[2024-05-28 06:41:08] [INFO ] Deduced a trap composed of 178 places in 180 ms of which 3 ms to minimize.
[2024-05-28 06:41:09] [INFO ] Deduced a trap composed of 178 places in 232 ms of which 4 ms to minimize.
[2024-05-28 06:41:09] [INFO ] Deduced a trap composed of 178 places in 184 ms of which 3 ms to minimize.
[2024-05-28 06:41:09] [INFO ] Deduced a trap composed of 178 places in 194 ms of which 3 ms to minimize.
[2024-05-28 06:41:09] [INFO ] Deduced a trap composed of 178 places in 233 ms of which 3 ms to minimize.
[2024-05-28 06:41:10] [INFO ] Deduced a trap composed of 178 places in 195 ms of which 3 ms to minimize.
[2024-05-28 06:41:10] [INFO ] Deduced a trap composed of 178 places in 212 ms of which 3 ms to minimize.
SMT process timed out in 31544ms, After SMT, problems are : Problem set: 0 solved, 798 unsolved
Search for dead transitions found 0 dead transitions in 31559ms
Starting structural reductions in SI_LTL mode, iteration 1 : 571/623 places, 804/856 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76729 ms. Remains : 571/623 places, 804/856 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLFireability-14
Stuttering criterion allowed to conclude after 26 steps with 1 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J40-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J40-LTLFireability-14 finished in 76828 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 623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 623/623 places, 856/856 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 623 transition count 811
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 578 transition count 811
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 90 place count 578 transition count 766
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 180 place count 533 transition count 766
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 186 place count 530 transition count 763
Applied a total of 186 rules in 35 ms. Remains 530 /623 variables (removed 93) and now considering 763/856 (removed 93) transitions.
Running 757 sub problems to find dead transitions.
[2024-05-28 06:41:10] [INFO ] Flow matrix only has 759 transitions (discarded 4 similar events)
// Phase 1: matrix 759 rows 530 cols
[2024-05-28 06:41:10] [INFO ] Computed 97 invariants in 14 ms
[2024-05-28 06:41:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 757 unsolved
[2024-05-28 06:41:17] [INFO ] Deduced a trap composed of 136 places in 167 ms of which 3 ms to minimize.
[2024-05-28 06:41:18] [INFO ] Deduced a trap composed of 136 places in 168 ms of which 3 ms to minimize.
[2024-05-28 06:41:18] [INFO ] Deduced a trap composed of 136 places in 165 ms of which 2 ms to minimize.
[2024-05-28 06:41:18] [INFO ] Deduced a trap composed of 136 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:41:18] [INFO ] Deduced a trap composed of 136 places in 170 ms of which 3 ms to minimize.
[2024-05-28 06:41:18] [INFO ] Deduced a trap composed of 136 places in 167 ms of which 3 ms to minimize.
[2024-05-28 06:41:18] [INFO ] Deduced a trap composed of 136 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:41:19] [INFO ] Deduced a trap composed of 136 places in 167 ms of which 3 ms to minimize.
[2024-05-28 06:41:19] [INFO ] Deduced a trap composed of 136 places in 181 ms of which 3 ms to minimize.
[2024-05-28 06:41:19] [INFO ] Deduced a trap composed of 136 places in 203 ms of which 3 ms to minimize.
[2024-05-28 06:41:19] [INFO ] Deduced a trap composed of 136 places in 177 ms of which 3 ms to minimize.
[2024-05-28 06:41:19] [INFO ] Deduced a trap composed of 136 places in 165 ms of which 3 ms to minimize.
[2024-05-28 06:41:20] [INFO ] Deduced a trap composed of 136 places in 192 ms of which 3 ms to minimize.
[2024-05-28 06:41:20] [INFO ] Deduced a trap composed of 136 places in 163 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 14/106 constraints. Problems are: Problem set: 0 solved, 757 unsolved
[2024-05-28 06:41:25] [INFO ] Deduced a trap composed of 149 places in 148 ms of which 3 ms to minimize.
[2024-05-28 06:41:25] [INFO ] Deduced a trap composed of 136 places in 184 ms of which 3 ms to minimize.
[2024-05-28 06:41:25] [INFO ] Deduced a trap composed of 167 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:41:25] [INFO ] Deduced a trap composed of 136 places in 159 ms of which 2 ms to minimize.
[2024-05-28 06:41:26] [INFO ] Deduced a trap composed of 136 places in 164 ms of which 3 ms to minimize.
[2024-05-28 06:41:26] [INFO ] Deduced a trap composed of 136 places in 163 ms of which 3 ms to minimize.
[2024-05-28 06:41:26] [INFO ] Deduced a trap composed of 136 places in 161 ms of which 3 ms to minimize.
[2024-05-28 06:41:26] [INFO ] Deduced a trap composed of 136 places in 163 ms of which 3 ms to minimize.
[2024-05-28 06:41:26] [INFO ] Deduced a trap composed of 136 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:41:27] [INFO ] Deduced a trap composed of 136 places in 163 ms of which 3 ms to minimize.
[2024-05-28 06:41:27] [INFO ] Deduced a trap composed of 136 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:41:27] [INFO ] Deduced a trap composed of 136 places in 178 ms of which 3 ms to minimize.
[2024-05-28 06:41:31] [INFO ] Deduced a trap composed of 13 places in 184 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 525/1289 variables, and 119 constraints, problems are : Problem set: 0 solved, 757 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/530 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 757/757 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 757 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 27/119 constraints. Problems are: Problem set: 0 solved, 757 unsolved
[2024-05-28 06:41:33] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 1 ms to minimize.
[2024-05-28 06:41:34] [INFO ] Deduced a trap composed of 140 places in 183 ms of which 3 ms to minimize.
[2024-05-28 06:41:34] [INFO ] Deduced a trap composed of 170 places in 185 ms of which 3 ms to minimize.
[2024-05-28 06:41:34] [INFO ] Deduced a trap composed of 140 places in 190 ms of which 3 ms to minimize.
[2024-05-28 06:41:34] [INFO ] Deduced a trap composed of 136 places in 191 ms of which 3 ms to minimize.
[2024-05-28 06:41:34] [INFO ] Deduced a trap composed of 136 places in 199 ms of which 3 ms to minimize.
[2024-05-28 06:41:35] [INFO ] Deduced a trap composed of 136 places in 187 ms of which 3 ms to minimize.
[2024-05-28 06:41:35] [INFO ] Deduced a trap composed of 140 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:41:35] [INFO ] Deduced a trap composed of 136 places in 187 ms of which 2 ms to minimize.
[2024-05-28 06:41:35] [INFO ] Deduced a trap composed of 140 places in 180 ms of which 3 ms to minimize.
[2024-05-28 06:41:35] [INFO ] Deduced a trap composed of 136 places in 168 ms of which 3 ms to minimize.
[2024-05-28 06:41:36] [INFO ] Deduced a trap composed of 136 places in 199 ms of which 2 ms to minimize.
[2024-05-28 06:41:36] [INFO ] Deduced a trap composed of 170 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:41:36] [INFO ] Deduced a trap composed of 136 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:41:36] [INFO ] Deduced a trap composed of 136 places in 167 ms of which 2 ms to minimize.
[2024-05-28 06:41:36] [INFO ] Deduced a trap composed of 136 places in 163 ms of which 3 ms to minimize.
[2024-05-28 06:41:37] [INFO ] Deduced a trap composed of 136 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:41:37] [INFO ] Deduced a trap composed of 179 places in 165 ms of which 3 ms to minimize.
[2024-05-28 06:41:37] [INFO ] Deduced a trap composed of 136 places in 188 ms of which 2 ms to minimize.
[2024-05-28 06:41:37] [INFO ] Deduced a trap composed of 173 places in 206 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 757 unsolved
[2024-05-28 06:41:39] [INFO ] Deduced a trap composed of 140 places in 231 ms of which 4 ms to minimize.
[2024-05-28 06:41:39] [INFO ] Deduced a trap composed of 136 places in 175 ms of which 3 ms to minimize.
[2024-05-28 06:41:40] [INFO ] Deduced a trap composed of 140 places in 228 ms of which 4 ms to minimize.
[2024-05-28 06:41:40] [INFO ] Deduced a trap composed of 136 places in 182 ms of which 3 ms to minimize.
[2024-05-28 06:41:40] [INFO ] Deduced a trap composed of 136 places in 186 ms of which 3 ms to minimize.
[2024-05-28 06:41:40] [INFO ] Deduced a trap composed of 140 places in 199 ms of which 3 ms to minimize.
[2024-05-28 06:41:40] [INFO ] Deduced a trap composed of 136 places in 184 ms of which 3 ms to minimize.
[2024-05-28 06:41:41] [INFO ] Deduced a trap composed of 136 places in 234 ms of which 3 ms to minimize.
[2024-05-28 06:41:41] [INFO ] Deduced a trap composed of 140 places in 188 ms of which 3 ms to minimize.
[2024-05-28 06:41:41] [INFO ] Deduced a trap composed of 136 places in 186 ms of which 3 ms to minimize.
[2024-05-28 06:41:41] [INFO ] Deduced a trap composed of 136 places in 191 ms of which 3 ms to minimize.
[2024-05-28 06:41:42] [INFO ] Deduced a trap composed of 140 places in 203 ms of which 3 ms to minimize.
[2024-05-28 06:41:42] [INFO ] Deduced a trap composed of 136 places in 217 ms of which 3 ms to minimize.
[2024-05-28 06:41:42] [INFO ] Deduced a trap composed of 136 places in 159 ms of which 4 ms to minimize.
[2024-05-28 06:41:42] [INFO ] Deduced a trap composed of 136 places in 214 ms of which 4 ms to minimize.
[2024-05-28 06:41:42] [INFO ] Deduced a trap composed of 136 places in 192 ms of which 3 ms to minimize.
[2024-05-28 06:41:43] [INFO ] Deduced a trap composed of 136 places in 165 ms of which 3 ms to minimize.
[2024-05-28 06:41:43] [INFO ] Deduced a trap composed of 136 places in 178 ms of which 3 ms to minimize.
[2024-05-28 06:41:43] [INFO ] Deduced a trap composed of 136 places in 170 ms of which 3 ms to minimize.
[2024-05-28 06:41:43] [INFO ] Deduced a trap composed of 140 places in 177 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 757 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/1289 variables, and 159 constraints, problems are : Problem set: 0 solved, 757 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/530 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/757 constraints, Known Traps: 67/67 constraints]
After SMT, in 41253ms problems are : Problem set: 0 solved, 757 unsolved
Search for dead transitions found 0 dead transitions in 41260ms
[2024-05-28 06:41:51] [INFO ] Flow matrix only has 759 transitions (discarded 4 similar events)
[2024-05-28 06:41:51] [INFO ] Invariant cache hit.
[2024-05-28 06:41:52] [INFO ] Implicit Places using invariants in 516 ms returned []
[2024-05-28 06:41:52] [INFO ] Flow matrix only has 759 transitions (discarded 4 similar events)
[2024-05-28 06:41:52] [INFO ] Invariant cache hit.
[2024-05-28 06:41:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:41:54] [INFO ] Implicit Places using invariants and state equation in 2024 ms returned []
Implicit Place search using SMT with State Equation took 2566 ms to find 0 implicit places.
[2024-05-28 06:41:54] [INFO ] Redundant transitions in 4 ms returned []
Running 757 sub problems to find dead transitions.
[2024-05-28 06:41:54] [INFO ] Flow matrix only has 759 transitions (discarded 4 similar events)
[2024-05-28 06:41:54] [INFO ] Invariant cache hit.
[2024-05-28 06:41:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 757 unsolved
[2024-05-28 06:42:01] [INFO ] Deduced a trap composed of 136 places in 165 ms of which 3 ms to minimize.
[2024-05-28 06:42:01] [INFO ] Deduced a trap composed of 136 places in 165 ms of which 3 ms to minimize.
[2024-05-28 06:42:01] [INFO ] Deduced a trap composed of 136 places in 165 ms of which 3 ms to minimize.
[2024-05-28 06:42:01] [INFO ] Deduced a trap composed of 136 places in 163 ms of which 3 ms to minimize.
[2024-05-28 06:42:01] [INFO ] Deduced a trap composed of 136 places in 166 ms of which 2 ms to minimize.
[2024-05-28 06:42:02] [INFO ] Deduced a trap composed of 136 places in 166 ms of which 3 ms to minimize.
[2024-05-28 06:42:02] [INFO ] Deduced a trap composed of 136 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:42:02] [INFO ] Deduced a trap composed of 136 places in 172 ms of which 3 ms to minimize.
[2024-05-28 06:42:02] [INFO ] Deduced a trap composed of 136 places in 172 ms of which 2 ms to minimize.
[2024-05-28 06:42:02] [INFO ] Deduced a trap composed of 136 places in 172 ms of which 2 ms to minimize.
[2024-05-28 06:42:03] [INFO ] Deduced a trap composed of 136 places in 167 ms of which 3 ms to minimize.
[2024-05-28 06:42:03] [INFO ] Deduced a trap composed of 136 places in 196 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 12/104 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 4 (OVERLAPS) 4/529 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/529 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 757 unsolved
Problem TDEAD504 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD544 is UNSAT
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 (/ 2.0 3.0))
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 (/ 1.0 3.0))
(s169 (/ 1.0 3.0))
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 (/ 2.0 3.0))
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 9.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 1/530 variables, 1/109 constraints. Problems are: Problem set: 17 solved, 740 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1289 variables, and 109 constraints, problems are : Problem set: 17 solved, 740 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/530 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 757/757 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 17 solved, 740 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 86/86 constraints. Problems are: Problem set: 17 solved, 740 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 6/92 constraints. Problems are: Problem set: 17 solved, 740 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 12/104 constraints. Problems are: Problem set: 17 solved, 740 unsolved
[2024-05-28 06:42:26] [INFO ] Deduced a trap composed of 136 places in 223 ms of which 3 ms to minimize.
[2024-05-28 06:42:26] [INFO ] Deduced a trap composed of 136 places in 183 ms of which 3 ms to minimize.
[2024-05-28 06:42:26] [INFO ] Deduced a trap composed of 136 places in 165 ms of which 3 ms to minimize.
[2024-05-28 06:42:27] [INFO ] Deduced a trap composed of 136 places in 198 ms of which 3 ms to minimize.
[2024-05-28 06:42:27] [INFO ] Deduced a trap composed of 136 places in 160 ms of which 3 ms to minimize.
[2024-05-28 06:42:27] [INFO ] Deduced a trap composed of 136 places in 165 ms of which 3 ms to minimize.
[2024-05-28 06:42:27] [INFO ] Deduced a trap composed of 136 places in 214 ms of which 3 ms to minimize.
[2024-05-28 06:42:28] [INFO ] Deduced a trap composed of 136 places in 203 ms of which 4 ms to minimize.
[2024-05-28 06:42:28] [INFO ] Deduced a trap composed of 136 places in 190 ms of which 3 ms to minimize.
[2024-05-28 06:42:28] [INFO ] Deduced a trap composed of 136 places in 184 ms of which 3 ms to minimize.
[2024-05-28 06:42:28] [INFO ] Deduced a trap composed of 136 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:42:28] [INFO ] Deduced a trap composed of 136 places in 164 ms of which 3 ms to minimize.
[2024-05-28 06:42:29] [INFO ] Deduced a trap composed of 136 places in 165 ms of which 3 ms to minimize.
[2024-05-28 06:42:29] [INFO ] Deduced a trap composed of 173 places in 188 ms of which 3 ms to minimize.
[2024-05-28 06:42:29] [INFO ] Deduced a trap composed of 136 places in 170 ms of which 3 ms to minimize.
[2024-05-28 06:42:29] [INFO ] Deduced a trap composed of 136 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:42:29] [INFO ] Deduced a trap composed of 136 places in 164 ms of which 3 ms to minimize.
[2024-05-28 06:42:29] [INFO ] Deduced a trap composed of 136 places in 158 ms of which 3 ms to minimize.
[2024-05-28 06:42:30] [INFO ] Deduced a trap composed of 136 places in 164 ms of which 3 ms to minimize.
[2024-05-28 06:42:30] [INFO ] Deduced a trap composed of 136 places in 208 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/124 constraints. Problems are: Problem set: 17 solved, 740 unsolved
[2024-05-28 06:42:30] [INFO ] Deduced a trap composed of 167 places in 140 ms of which 3 ms to minimize.
[2024-05-28 06:42:31] [INFO ] Deduced a trap composed of 179 places in 208 ms of which 3 ms to minimize.
[2024-05-28 06:42:31] [INFO ] Deduced a trap composed of 182 places in 198 ms of which 4 ms to minimize.
[2024-05-28 06:42:31] [INFO ] Deduced a trap composed of 167 places in 221 ms of which 3 ms to minimize.
[2024-05-28 06:42:31] [INFO ] Deduced a trap composed of 176 places in 209 ms of which 4 ms to minimize.
[2024-05-28 06:42:32] [INFO ] Deduced a trap composed of 170 places in 181 ms of which 3 ms to minimize.
[2024-05-28 06:42:32] [INFO ] Deduced a trap composed of 173 places in 201 ms of which 6 ms to minimize.
[2024-05-28 06:42:32] [INFO ] Deduced a trap composed of 136 places in 189 ms of which 3 ms to minimize.
[2024-05-28 06:42:32] [INFO ] Deduced a trap composed of 136 places in 212 ms of which 3 ms to minimize.
[2024-05-28 06:42:32] [INFO ] Deduced a trap composed of 136 places in 203 ms of which 4 ms to minimize.
[2024-05-28 06:42:33] [INFO ] Deduced a trap composed of 136 places in 203 ms of which 4 ms to minimize.
[2024-05-28 06:42:33] [INFO ] Deduced a trap composed of 136 places in 194 ms of which 3 ms to minimize.
[2024-05-28 06:42:33] [INFO ] Deduced a trap composed of 136 places in 175 ms of which 3 ms to minimize.
[2024-05-28 06:42:33] [INFO ] Deduced a trap composed of 136 places in 165 ms of which 3 ms to minimize.
[2024-05-28 06:42:33] [INFO ] Deduced a trap composed of 136 places in 168 ms of which 3 ms to minimize.
[2024-05-28 06:42:34] [INFO ] Deduced a trap composed of 136 places in 163 ms of which 3 ms to minimize.
[2024-05-28 06:42:34] [INFO ] Deduced a trap composed of 136 places in 173 ms of which 2 ms to minimize.
[2024-05-28 06:42:34] [INFO ] Deduced a trap composed of 136 places in 180 ms of which 3 ms to minimize.
[2024-05-28 06:42:34] [INFO ] Deduced a trap composed of 136 places in 166 ms of which 2 ms to minimize.
[2024-05-28 06:42:34] [INFO ] Deduced a trap composed of 136 places in 178 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 20/144 constraints. Problems are: Problem set: 17 solved, 740 unsolved
[2024-05-28 06:42:36] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 1 ms to minimize.
[2024-05-28 06:42:40] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 2/146 constraints. Problems are: Problem set: 17 solved, 740 unsolved
[2024-05-28 06:42:49] [INFO ] Deduced a trap composed of 228 places in 172 ms of which 2 ms to minimize.
[2024-05-28 06:42:50] [INFO ] Deduced a trap composed of 239 places in 172 ms of which 2 ms to minimize.
[2024-05-28 06:42:50] [INFO ] Deduced a trap composed of 234 places in 243 ms of which 3 ms to minimize.
[2024-05-28 06:42:50] [INFO ] Deduced a trap composed of 231 places in 182 ms of which 2 ms to minimize.
[2024-05-28 06:42:50] [INFO ] Deduced a trap composed of 231 places in 168 ms of which 3 ms to minimize.
[2024-05-28 06:42:50] [INFO ] Deduced a trap composed of 237 places in 182 ms of which 3 ms to minimize.
[2024-05-28 06:42:51] [INFO ] Deduced a trap composed of 233 places in 183 ms of which 3 ms to minimize.
[2024-05-28 06:42:51] [INFO ] Deduced a trap composed of 233 places in 166 ms of which 2 ms to minimize.
[2024-05-28 06:42:51] [INFO ] Deduced a trap composed of 233 places in 197 ms of which 3 ms to minimize.
[2024-05-28 06:42:51] [INFO ] Deduced a trap composed of 241 places in 176 ms of which 3 ms to minimize.
[2024-05-28 06:42:51] [INFO ] Deduced a trap composed of 231 places in 184 ms of which 3 ms to minimize.
[2024-05-28 06:42:52] [INFO ] Deduced a trap composed of 238 places in 176 ms of which 3 ms to minimize.
[2024-05-28 06:42:52] [INFO ] Deduced a trap composed of 234 places in 180 ms of which 2 ms to minimize.
[2024-05-28 06:42:52] [INFO ] Deduced a trap composed of 235 places in 177 ms of which 2 ms to minimize.
[2024-05-28 06:42:52] [INFO ] Deduced a trap composed of 234 places in 171 ms of which 3 ms to minimize.
[2024-05-28 06:42:52] [INFO ] Deduced a trap composed of 235 places in 174 ms of which 2 ms to minimize.
[2024-05-28 06:42:53] [INFO ] Deduced a trap composed of 236 places in 167 ms of which 3 ms to minimize.
[2024-05-28 06:42:53] [INFO ] Deduced a trap composed of 231 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:42:53] [INFO ] Deduced a trap composed of 204 places in 223 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/1289 variables, and 165 constraints, problems are : Problem set: 17 solved, 740 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/530 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/757 constraints, Known Traps: 73/73 constraints]
After SMT, in 61261ms problems are : Problem set: 17 solved, 740 unsolved
Search for dead transitions found 17 dead transitions in 61279ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 530/623 places, 746/856 transitions.
Applied a total of 0 rules in 17 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2024-05-28 06:42:55] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 105188 ms. Remains : 530/623 places, 746/856 transitions.
Stuttering acceptance computed with spot in 63 ms :[p0]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLFireability-15
Product exploration explored 100000 steps with 5229 reset in 508 ms.
Product exploration explored 100000 steps with 5299 reset in 554 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[p0]
RANDOM walk for 627 steps (34 resets) in 10 ms. (57 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[p0]
Stuttering acceptance computed with spot in 30 ms :[p0]
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 14 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
Running 740 sub problems to find dead transitions.
[2024-05-28 06:42:57] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2024-05-28 06:42:57] [INFO ] Computed 97 invariants in 11 ms
[2024-05-28 06:42:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 740 unsolved
[2024-05-28 06:43:03] [INFO ] Deduced a trap composed of 167 places in 155 ms of which 3 ms to minimize.
[2024-05-28 06:43:03] [INFO ] Deduced a trap composed of 161 places in 169 ms of which 2 ms to minimize.
[2024-05-28 06:43:03] [INFO ] Deduced a trap composed of 167 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:43:03] [INFO ] Deduced a trap composed of 136 places in 172 ms of which 3 ms to minimize.
[2024-05-28 06:43:04] [INFO ] Deduced a trap composed of 136 places in 163 ms of which 2 ms to minimize.
[2024-05-28 06:43:04] [INFO ] Deduced a trap composed of 179 places in 163 ms of which 3 ms to minimize.
[2024-05-28 06:43:04] [INFO ] Deduced a trap composed of 164 places in 183 ms of which 3 ms to minimize.
[2024-05-28 06:43:04] [INFO ] Deduced a trap composed of 136 places in 166 ms of which 2 ms to minimize.
[2024-05-28 06:43:04] [INFO ] Deduced a trap composed of 136 places in 164 ms of which 3 ms to minimize.
[2024-05-28 06:43:05] [INFO ] Deduced a trap composed of 136 places in 170 ms of which 3 ms to minimize.
[2024-05-28 06:43:05] [INFO ] Deduced a trap composed of 161 places in 163 ms of which 3 ms to minimize.
[2024-05-28 06:43:05] [INFO ] Deduced a trap composed of 143 places in 164 ms of which 3 ms to minimize.
[2024-05-28 06:43:05] [INFO ] Deduced a trap composed of 155 places in 163 ms of which 3 ms to minimize.
[2024-05-28 06:43:05] [INFO ] Deduced a trap composed of 136 places in 160 ms of which 3 ms to minimize.
[2024-05-28 06:43:05] [INFO ] Deduced a trap composed of 167 places in 171 ms of which 2 ms to minimize.
[2024-05-28 06:43:06] [INFO ] Deduced a trap composed of 136 places in 175 ms of which 3 ms to minimize.
[2024-05-28 06:43:06] [INFO ] Deduced a trap composed of 136 places in 174 ms of which 2 ms to minimize.
[2024-05-28 06:43:06] [INFO ] Deduced a trap composed of 136 places in 167 ms of which 3 ms to minimize.
[2024-05-28 06:43:06] [INFO ] Deduced a trap composed of 136 places in 163 ms of which 3 ms to minimize.
[2024-05-28 06:43:06] [INFO ] Deduced a trap composed of 136 places in 170 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 740 unsolved
[2024-05-28 06:43:11] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:43:12] [INFO ] Deduced a trap composed of 170 places in 160 ms of which 3 ms to minimize.
[2024-05-28 06:43:12] [INFO ] Deduced a trap composed of 161 places in 164 ms of which 3 ms to minimize.
[2024-05-28 06:43:12] [INFO ] Deduced a trap composed of 158 places in 168 ms of which 3 ms to minimize.
[2024-05-28 06:43:12] [INFO ] Deduced a trap composed of 170 places in 157 ms of which 3 ms to minimize.
[2024-05-28 06:43:13] [INFO ] Deduced a trap composed of 167 places in 167 ms of which 2 ms to minimize.
[2024-05-28 06:43:13] [INFO ] Deduced a trap composed of 176 places in 170 ms of which 3 ms to minimize.
[2024-05-28 06:43:13] [INFO ] Deduced a trap composed of 176 places in 180 ms of which 3 ms to minimize.
[2024-05-28 06:43:13] [INFO ] Deduced a trap composed of 232 places in 162 ms of which 3 ms to minimize.
[2024-05-28 06:43:13] [INFO ] Deduced a trap composed of 210 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:43:14] [INFO ] Deduced a trap composed of 206 places in 170 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 11/123 constraints. Problems are: Problem set: 0 solved, 740 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 525/1272 variables, and 123 constraints, problems are : Problem set: 0 solved, 740 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/530 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 740/740 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 740 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 31/123 constraints. Problems are: Problem set: 0 solved, 740 unsolved
[2024-05-28 06:43:19] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2024-05-28 06:43:20] [INFO ] Deduced a trap composed of 136 places in 170 ms of which 3 ms to minimize.
[2024-05-28 06:43:20] [INFO ] Deduced a trap composed of 136 places in 183 ms of which 3 ms to minimize.
[2024-05-28 06:43:21] [INFO ] Deduced a trap composed of 140 places in 176 ms of which 3 ms to minimize.
[2024-05-28 06:43:21] [INFO ] Deduced a trap composed of 136 places in 177 ms of which 3 ms to minimize.
[2024-05-28 06:43:21] [INFO ] Deduced a trap composed of 180 places in 170 ms of which 2 ms to minimize.
[2024-05-28 06:43:21] [INFO ] Deduced a trap composed of 164 places in 188 ms of which 3 ms to minimize.
[2024-05-28 06:43:21] [INFO ] Deduced a trap composed of 170 places in 153 ms of which 3 ms to minimize.
[2024-05-28 06:43:22] [INFO ] Deduced a trap composed of 155 places in 176 ms of which 3 ms to minimize.
[2024-05-28 06:43:22] [INFO ] Deduced a trap composed of 158 places in 167 ms of which 2 ms to minimize.
[2024-05-28 06:43:22] [INFO ] Deduced a trap composed of 167 places in 165 ms of which 3 ms to minimize.
[2024-05-28 06:43:22] [INFO ] Deduced a trap composed of 162 places in 166 ms of which 3 ms to minimize.
[2024-05-28 06:43:22] [INFO ] Deduced a trap composed of 182 places in 168 ms of which 3 ms to minimize.
[2024-05-28 06:43:23] [INFO ] Deduced a trap composed of 150 places in 166 ms of which 2 ms to minimize.
[2024-05-28 06:43:23] [INFO ] Deduced a trap composed of 155 places in 181 ms of which 3 ms to minimize.
[2024-05-28 06:43:23] [INFO ] Deduced a trap composed of 171 places in 186 ms of which 3 ms to minimize.
[2024-05-28 06:43:23] [INFO ] Deduced a trap composed of 155 places in 180 ms of which 3 ms to minimize.
[2024-05-28 06:43:23] [INFO ] Deduced a trap composed of 164 places in 170 ms of which 3 ms to minimize.
[2024-05-28 06:43:23] [INFO ] Deduced a trap composed of 204 places in 163 ms of which 3 ms to minimize.
[2024-05-28 06:43:24] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 740 unsolved
[2024-05-28 06:43:26] [INFO ] Deduced a trap composed of 164 places in 147 ms of which 3 ms to minimize.
[2024-05-28 06:43:26] [INFO ] Deduced a trap composed of 152 places in 209 ms of which 4 ms to minimize.
[2024-05-28 06:43:26] [INFO ] Deduced a trap composed of 229 places in 205 ms of which 4 ms to minimize.
[2024-05-28 06:43:26] [INFO ] Deduced a trap composed of 167 places in 163 ms of which 3 ms to minimize.
[2024-05-28 06:43:27] [INFO ] Deduced a trap composed of 167 places in 208 ms of which 4 ms to minimize.
[2024-05-28 06:43:27] [INFO ] Deduced a trap composed of 155 places in 196 ms of which 3 ms to minimize.
[2024-05-28 06:43:27] [INFO ] Deduced a trap composed of 161 places in 186 ms of which 3 ms to minimize.
[2024-05-28 06:43:27] [INFO ] Deduced a trap composed of 161 places in 197 ms of which 3 ms to minimize.
[2024-05-28 06:43:28] [INFO ] Deduced a trap composed of 140 places in 206 ms of which 3 ms to minimize.
[2024-05-28 06:43:28] [INFO ] Deduced a trap composed of 136 places in 192 ms of which 4 ms to minimize.
[2024-05-28 06:43:28] [INFO ] Deduced a trap composed of 170 places in 170 ms of which 3 ms to minimize.
[2024-05-28 06:43:28] [INFO ] Deduced a trap composed of 136 places in 211 ms of which 4 ms to minimize.
[2024-05-28 06:43:28] [INFO ] Deduced a trap composed of 156 places in 197 ms of which 4 ms to minimize.
[2024-05-28 06:43:29] [INFO ] Deduced a trap composed of 170 places in 181 ms of which 3 ms to minimize.
[2024-05-28 06:43:29] [INFO ] Deduced a trap composed of 155 places in 163 ms of which 3 ms to minimize.
[2024-05-28 06:43:29] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 3 ms to minimize.
[2024-05-28 06:43:29] [INFO ] Deduced a trap composed of 161 places in 176 ms of which 3 ms to minimize.
[2024-05-28 06:43:30] [INFO ] Deduced a trap composed of 158 places in 166 ms of which 3 ms to minimize.
[2024-05-28 06:43:30] [INFO ] Deduced a trap composed of 158 places in 163 ms of which 2 ms to minimize.
[2024-05-28 06:43:30] [INFO ] Deduced a trap composed of 136 places in 170 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 20/163 constraints. Problems are: Problem set: 0 solved, 740 unsolved
[2024-05-28 06:43:31] [INFO ] Deduced a trap composed of 179 places in 183 ms of which 3 ms to minimize.
[2024-05-28 06:43:31] [INFO ] Deduced a trap composed of 164 places in 152 ms of which 3 ms to minimize.
[2024-05-28 06:43:32] [INFO ] Deduced a trap composed of 154 places in 198 ms of which 3 ms to minimize.
[2024-05-28 06:43:32] [INFO ] Deduced a trap composed of 140 places in 156 ms of which 3 ms to minimize.
[2024-05-28 06:43:32] [INFO ] Deduced a trap composed of 140 places in 195 ms of which 3 ms to minimize.
[2024-05-28 06:43:32] [INFO ] Deduced a trap composed of 136 places in 305 ms of which 8 ms to minimize.
[2024-05-28 06:43:32] [INFO ] Deduced a trap composed of 136 places in 196 ms of which 3 ms to minimize.
[2024-05-28 06:43:33] [INFO ] Deduced a trap composed of 140 places in 312 ms of which 21 ms to minimize.
[2024-05-28 06:43:33] [INFO ] Deduced a trap composed of 140 places in 223 ms of which 3 ms to minimize.
[2024-05-28 06:43:33] [INFO ] Deduced a trap composed of 140 places in 324 ms of which 8 ms to minimize.
[2024-05-28 06:43:34] [INFO ] Deduced a trap composed of 136 places in 214 ms of which 3 ms to minimize.
[2024-05-28 06:43:34] [INFO ] Deduced a trap composed of 136 places in 196 ms of which 3 ms to minimize.
[2024-05-28 06:43:34] [INFO ] Deduced a trap composed of 174 places in 263 ms of which 6 ms to minimize.
[2024-05-28 06:43:34] [INFO ] Deduced a trap composed of 140 places in 191 ms of which 2 ms to minimize.
[2024-05-28 06:43:35] [INFO ] Deduced a trap composed of 168 places in 194 ms of which 3 ms to minimize.
[2024-05-28 06:43:35] [INFO ] Deduced a trap composed of 136 places in 187 ms of which 3 ms to minimize.
[2024-05-28 06:43:35] [INFO ] Deduced a trap composed of 140 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:43:35] [INFO ] Deduced a trap composed of 140 places in 180 ms of which 3 ms to minimize.
[2024-05-28 06:43:35] [INFO ] Deduced a trap composed of 140 places in 176 ms of which 3 ms to minimize.
[2024-05-28 06:43:35] [INFO ] Deduced a trap composed of 140 places in 179 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 20/183 constraints. Problems are: Problem set: 0 solved, 740 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/1272 variables, and 183 constraints, problems are : Problem set: 0 solved, 740 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/530 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/740 constraints, Known Traps: 91/91 constraints]
After SMT, in 41132ms problems are : Problem set: 0 solved, 740 unsolved
Search for dead transitions found 0 dead transitions in 41140ms
[2024-05-28 06:43:38] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2024-05-28 06:43:38] [INFO ] Invariant cache hit.
[2024-05-28 06:43:38] [INFO ] Implicit Places using invariants in 438 ms returned []
[2024-05-28 06:43:38] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2024-05-28 06:43:38] [INFO ] Invariant cache hit.
[2024-05-28 06:43:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:43:40] [INFO ] Implicit Places using invariants and state equation in 1757 ms returned []
Implicit Place search using SMT with State Equation took 2198 ms to find 0 implicit places.
[2024-05-28 06:43:40] [INFO ] Redundant transitions in 8 ms returned []
Running 740 sub problems to find dead transitions.
[2024-05-28 06:43:40] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2024-05-28 06:43:40] [INFO ] Invariant cache hit.
[2024-05-28 06:43:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 740 unsolved
[2024-05-28 06:43:46] [INFO ] Deduced a trap composed of 176 places in 221 ms of which 4 ms to minimize.
[2024-05-28 06:43:47] [INFO ] Deduced a trap composed of 176 places in 211 ms of which 3 ms to minimize.
[2024-05-28 06:43:47] [INFO ] Deduced a trap composed of 136 places in 190 ms of which 4 ms to minimize.
[2024-05-28 06:43:47] [INFO ] Deduced a trap composed of 136 places in 179 ms of which 3 ms to minimize.
[2024-05-28 06:43:47] [INFO ] Deduced a trap composed of 167 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:43:47] [INFO ] Deduced a trap composed of 170 places in 162 ms of which 3 ms to minimize.
[2024-05-28 06:43:48] [INFO ] Deduced a trap composed of 136 places in 165 ms of which 2 ms to minimize.
[2024-05-28 06:43:48] [INFO ] Deduced a trap composed of 164 places in 147 ms of which 2 ms to minimize.
[2024-05-28 06:43:48] [INFO ] Deduced a trap composed of 136 places in 147 ms of which 3 ms to minimize.
[2024-05-28 06:43:48] [INFO ] Deduced a trap composed of 136 places in 147 ms of which 2 ms to minimize.
[2024-05-28 06:43:48] [INFO ] Deduced a trap composed of 136 places in 157 ms of which 3 ms to minimize.
[2024-05-28 06:43:48] [INFO ] Deduced a trap composed of 167 places in 151 ms of which 3 ms to minimize.
[2024-05-28 06:43:49] [INFO ] Deduced a trap composed of 161 places in 149 ms of which 3 ms to minimize.
[2024-05-28 06:43:49] [INFO ] Deduced a trap composed of 170 places in 156 ms of which 3 ms to minimize.
[2024-05-28 06:43:49] [INFO ] Deduced a trap composed of 167 places in 153 ms of which 3 ms to minimize.
[2024-05-28 06:43:49] [INFO ] Deduced a trap composed of 136 places in 157 ms of which 3 ms to minimize.
[2024-05-28 06:43:49] [INFO ] Deduced a trap composed of 136 places in 158 ms of which 2 ms to minimize.
[2024-05-28 06:43:49] [INFO ] Deduced a trap composed of 155 places in 158 ms of which 3 ms to minimize.
[2024-05-28 06:43:50] [INFO ] Deduced a trap composed of 164 places in 146 ms of which 3 ms to minimize.
[2024-05-28 06:43:50] [INFO ] Deduced a trap composed of 136 places in 162 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 740 unsolved
[2024-05-28 06:43:54] [INFO ] Deduced a trap composed of 13 places in 211 ms of which 4 ms to minimize.
[2024-05-28 06:43:56] [INFO ] Deduced a trap composed of 173 places in 149 ms of which 3 ms to minimize.
[2024-05-28 06:43:56] [INFO ] Deduced a trap composed of 164 places in 150 ms of which 3 ms to minimize.
[2024-05-28 06:43:56] [INFO ] Deduced a trap composed of 170 places in 157 ms of which 3 ms to minimize.
[2024-05-28 06:43:56] [INFO ] Deduced a trap composed of 167 places in 154 ms of which 2 ms to minimize.
[2024-05-28 06:43:56] [INFO ] Deduced a trap composed of 164 places in 148 ms of which 2 ms to minimize.
[2024-05-28 06:43:57] [INFO ] Deduced a trap composed of 167 places in 141 ms of which 3 ms to minimize.
[2024-05-28 06:43:57] [INFO ] Deduced a trap composed of 167 places in 151 ms of which 3 ms to minimize.
[2024-05-28 06:43:57] [INFO ] Deduced a trap composed of 179 places in 152 ms of which 3 ms to minimize.
[2024-05-28 06:43:57] [INFO ] Deduced a trap composed of 170 places in 155 ms of which 3 ms to minimize.
[2024-05-28 06:43:57] [INFO ] Deduced a trap composed of 170 places in 168 ms of which 3 ms to minimize.
[2024-05-28 06:43:57] [INFO ] Deduced a trap composed of 161 places in 160 ms of which 3 ms to minimize.
[2024-05-28 06:43:58] [INFO ] Deduced a trap composed of 179 places in 154 ms of which 2 ms to minimize.
[2024-05-28 06:43:58] [INFO ] Deduced a trap composed of 173 places in 146 ms of which 2 ms to minimize.
[2024-05-28 06:43:58] [INFO ] Deduced a trap composed of 179 places in 159 ms of which 2 ms to minimize.
[2024-05-28 06:43:58] [INFO ] Deduced a trap composed of 158 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:43:58] [INFO ] Deduced a trap composed of 208 places in 137 ms of which 3 ms to minimize.
[2024-05-28 06:43:59] [INFO ] Deduced a trap composed of 208 places in 150 ms of which 3 ms to minimize.
[2024-05-28 06:43:59] [INFO ] Deduced a trap composed of 202 places in 161 ms of which 3 ms to minimize.
[2024-05-28 06:43:59] [INFO ] Deduced a trap composed of 204 places in 177 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 5 (OVERLAPS) 4/529 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 740 unsolved
[2024-05-28 06:44:09] [INFO ] Deduced a trap composed of 95 places in 196 ms of which 3 ms to minimize.
[2024-05-28 06:44:09] [INFO ] Deduced a trap composed of 136 places in 153 ms of which 3 ms to minimize.
[2024-05-28 06:44:09] [INFO ] Deduced a trap composed of 95 places in 176 ms of which 3 ms to minimize.
[2024-05-28 06:44:09] [INFO ] Deduced a trap composed of 95 places in 176 ms of which 3 ms to minimize.
[2024-05-28 06:44:10] [INFO ] Deduced a trap composed of 95 places in 176 ms of which 2 ms to minimize.
[2024-05-28 06:44:10] [INFO ] Deduced a trap composed of 95 places in 175 ms of which 3 ms to minimize.
[2024-05-28 06:44:10] [INFO ] Deduced a trap composed of 95 places in 193 ms of which 3 ms to minimize.
[2024-05-28 06:44:10] [INFO ] Deduced a trap composed of 95 places in 191 ms of which 3 ms to minimize.
[2024-05-28 06:44:10] [INFO ] Deduced a trap composed of 95 places in 195 ms of which 2 ms to minimize.
[2024-05-28 06:44:11] [INFO ] Deduced a trap composed of 95 places in 191 ms of which 3 ms to minimize.
[2024-05-28 06:44:11] [INFO ] Deduced a trap composed of 95 places in 152 ms of which 3 ms to minimize.
[2024-05-28 06:44:11] [INFO ] Deduced a trap composed of 95 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:44:11] [INFO ] Deduced a trap composed of 95 places in 192 ms of which 3 ms to minimize.
SMT process timed out in 31305ms, After SMT, problems are : Problem set: 0 solved, 740 unsolved
Search for dead transitions found 0 dead transitions in 31317ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 74688 ms. Remains : 530/530 places, 746/746 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[p0]
RANDOM walk for 656 steps (38 resets) in 8 ms. (72 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[p0]
Stuttering acceptance computed with spot in 34 ms :[p0]
Stuttering acceptance computed with spot in 26 ms :[p0]
Product exploration explored 100000 steps with 5320 reset in 425 ms.
Product exploration explored 100000 steps with 5287 reset in 429 ms.
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 13 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
Running 740 sub problems to find dead transitions.
[2024-05-28 06:44:12] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2024-05-28 06:44:12] [INFO ] Invariant cache hit.
[2024-05-28 06:44:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 740 unsolved
[2024-05-28 06:44:19] [INFO ] Deduced a trap composed of 176 places in 215 ms of which 3 ms to minimize.
[2024-05-28 06:44:19] [INFO ] Deduced a trap composed of 176 places in 162 ms of which 3 ms to minimize.
[2024-05-28 06:44:19] [INFO ] Deduced a trap composed of 136 places in 170 ms of which 3 ms to minimize.
[2024-05-28 06:44:19] [INFO ] Deduced a trap composed of 136 places in 313 ms of which 3 ms to minimize.
[2024-05-28 06:44:20] [INFO ] Deduced a trap composed of 167 places in 178 ms of which 3 ms to minimize.
[2024-05-28 06:44:20] [INFO ] Deduced a trap composed of 170 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:44:20] [INFO ] Deduced a trap composed of 136 places in 188 ms of which 2 ms to minimize.
[2024-05-28 06:44:20] [INFO ] Deduced a trap composed of 164 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:44:20] [INFO ] Deduced a trap composed of 136 places in 172 ms of which 3 ms to minimize.
[2024-05-28 06:44:21] [INFO ] Deduced a trap composed of 136 places in 180 ms of which 3 ms to minimize.
[2024-05-28 06:44:21] [INFO ] Deduced a trap composed of 136 places in 172 ms of which 3 ms to minimize.
[2024-05-28 06:44:21] [INFO ] Deduced a trap composed of 167 places in 171 ms of which 3 ms to minimize.
[2024-05-28 06:44:21] [INFO ] Deduced a trap composed of 161 places in 165 ms of which 3 ms to minimize.
[2024-05-28 06:44:21] [INFO ] Deduced a trap composed of 170 places in 168 ms of which 3 ms to minimize.
[2024-05-28 06:44:22] [INFO ] Deduced a trap composed of 167 places in 178 ms of which 3 ms to minimize.
[2024-05-28 06:44:22] [INFO ] Deduced a trap composed of 136 places in 193 ms of which 3 ms to minimize.
[2024-05-28 06:44:22] [INFO ] Deduced a trap composed of 136 places in 187 ms of which 3 ms to minimize.
[2024-05-28 06:44:22] [INFO ] Deduced a trap composed of 155 places in 202 ms of which 3 ms to minimize.
[2024-05-28 06:44:22] [INFO ] Deduced a trap composed of 164 places in 167 ms of which 3 ms to minimize.
[2024-05-28 06:44:23] [INFO ] Deduced a trap composed of 136 places in 163 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 740 unsolved
[2024-05-28 06:44:27] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 3 ms to minimize.
[2024-05-28 06:44:28] [INFO ] Deduced a trap composed of 173 places in 173 ms of which 2 ms to minimize.
[2024-05-28 06:44:28] [INFO ] Deduced a trap composed of 164 places in 168 ms of which 3 ms to minimize.
[2024-05-28 06:44:29] [INFO ] Deduced a trap composed of 170 places in 163 ms of which 3 ms to minimize.
[2024-05-28 06:44:29] [INFO ] Deduced a trap composed of 167 places in 187 ms of which 3 ms to minimize.
[2024-05-28 06:44:29] [INFO ] Deduced a trap composed of 164 places in 171 ms of which 3 ms to minimize.
[2024-05-28 06:44:29] [INFO ] Deduced a trap composed of 167 places in 163 ms of which 3 ms to minimize.
[2024-05-28 06:44:29] [INFO ] Deduced a trap composed of 167 places in 168 ms of which 2 ms to minimize.
[2024-05-28 06:44:30] [INFO ] Deduced a trap composed of 179 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:44:30] [INFO ] Deduced a trap composed of 170 places in 171 ms of which 3 ms to minimize.
[2024-05-28 06:44:30] [INFO ] Deduced a trap composed of 170 places in 170 ms of which 3 ms to minimize.
[2024-05-28 06:44:30] [INFO ] Deduced a trap composed of 161 places in 149 ms of which 3 ms to minimize.
[2024-05-28 06:44:30] [INFO ] Deduced a trap composed of 179 places in 171 ms of which 3 ms to minimize.
[2024-05-28 06:44:30] [INFO ] Deduced a trap composed of 173 places in 161 ms of which 3 ms to minimize.
[2024-05-28 06:44:31] [INFO ] Deduced a trap composed of 179 places in 166 ms of which 3 ms to minimize.
[2024-05-28 06:44:31] [INFO ] Deduced a trap composed of 158 places in 162 ms of which 3 ms to minimize.
[2024-05-28 06:44:31] [INFO ] Deduced a trap composed of 208 places in 194 ms of which 3 ms to minimize.
[2024-05-28 06:44:31] [INFO ] Deduced a trap composed of 208 places in 194 ms of which 3 ms to minimize.
[2024-05-28 06:44:31] [INFO ] Deduced a trap composed of 202 places in 160 ms of which 3 ms to minimize.
[2024-05-28 06:44:32] [INFO ] Deduced a trap composed of 204 places in 164 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 740 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 525/1272 variables, and 132 constraints, problems are : Problem set: 0 solved, 740 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/530 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 740/740 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 740 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 740 unsolved
[2024-05-28 06:44:35] [INFO ] Deduced a trap composed of 164 places in 141 ms of which 3 ms to minimize.
[2024-05-28 06:44:35] [INFO ] Deduced a trap composed of 159 places in 170 ms of which 3 ms to minimize.
[2024-05-28 06:44:35] [INFO ] Deduced a trap composed of 171 places in 172 ms of which 3 ms to minimize.
[2024-05-28 06:44:35] [INFO ] Deduced a trap composed of 164 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:44:35] [INFO ] Deduced a trap composed of 168 places in 167 ms of which 3 ms to minimize.
[2024-05-28 06:44:36] [INFO ] Deduced a trap composed of 155 places in 203 ms of which 3 ms to minimize.
[2024-05-28 06:44:36] [INFO ] Deduced a trap composed of 182 places in 178 ms of which 2 ms to minimize.
[2024-05-28 06:44:36] [INFO ] Deduced a trap composed of 155 places in 166 ms of which 4 ms to minimize.
[2024-05-28 06:44:36] [INFO ] Deduced a trap composed of 174 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:44:36] [INFO ] Deduced a trap composed of 161 places in 189 ms of which 3 ms to minimize.
[2024-05-28 06:44:37] [INFO ] Deduced a trap composed of 162 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:44:37] [INFO ] Deduced a trap composed of 167 places in 180 ms of which 3 ms to minimize.
[2024-05-28 06:44:37] [INFO ] Deduced a trap composed of 182 places in 175 ms of which 2 ms to minimize.
[2024-05-28 06:44:37] [INFO ] Deduced a trap composed of 136 places in 182 ms of which 3 ms to minimize.
[2024-05-28 06:44:37] [INFO ] Deduced a trap composed of 151 places in 194 ms of which 3 ms to minimize.
[2024-05-28 06:44:38] [INFO ] Deduced a trap composed of 136 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:44:38] [INFO ] Deduced a trap composed of 161 places in 175 ms of which 3 ms to minimize.
[2024-05-28 06:44:38] [INFO ] Deduced a trap composed of 161 places in 217 ms of which 3 ms to minimize.
[2024-05-28 06:44:38] [INFO ] Deduced a trap composed of 167 places in 190 ms of which 3 ms to minimize.
[2024-05-28 06:44:38] [INFO ] Deduced a trap composed of 174 places in 191 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 740 unsolved
[2024-05-28 06:44:39] [INFO ] Deduced a trap composed of 176 places in 165 ms of which 3 ms to minimize.
[2024-05-28 06:44:39] [INFO ] Deduced a trap composed of 173 places in 160 ms of which 3 ms to minimize.
[2024-05-28 06:44:39] [INFO ] Deduced a trap composed of 155 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:44:40] [INFO ] Deduced a trap composed of 167 places in 161 ms of which 3 ms to minimize.
[2024-05-28 06:44:40] [INFO ] Deduced a trap composed of 167 places in 157 ms of which 2 ms to minimize.
[2024-05-28 06:44:40] [INFO ] Deduced a trap composed of 149 places in 174 ms of which 2 ms to minimize.
[2024-05-28 06:44:40] [INFO ] Deduced a trap composed of 164 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:44:41] [INFO ] Deduced a trap composed of 159 places in 180 ms of which 3 ms to minimize.
[2024-05-28 06:44:41] [INFO ] Deduced a trap composed of 158 places in 223 ms of which 4 ms to minimize.
[2024-05-28 06:44:41] [INFO ] Deduced a trap composed of 173 places in 206 ms of which 3 ms to minimize.
[2024-05-28 06:44:41] [INFO ] Deduced a trap composed of 161 places in 187 ms of which 3 ms to minimize.
[2024-05-28 06:44:41] [INFO ] Deduced a trap composed of 140 places in 190 ms of which 3 ms to minimize.
[2024-05-28 06:44:42] [INFO ] Deduced a trap composed of 152 places in 174 ms of which 2 ms to minimize.
[2024-05-28 06:44:42] [INFO ] Deduced a trap composed of 140 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:44:42] [INFO ] Deduced a trap composed of 136 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:44:42] [INFO ] Deduced a trap composed of 159 places in 189 ms of which 3 ms to minimize.
[2024-05-28 06:44:42] [INFO ] Deduced a trap composed of 152 places in 168 ms of which 3 ms to minimize.
[2024-05-28 06:44:42] [INFO ] Deduced a trap composed of 140 places in 175 ms of which 3 ms to minimize.
[2024-05-28 06:44:43] [INFO ] Deduced a trap composed of 136 places in 160 ms of which 3 ms to minimize.
[2024-05-28 06:44:43] [INFO ] Deduced a trap composed of 140 places in 170 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 740 unsolved
[2024-05-28 06:44:44] [INFO ] Deduced a trap composed of 168 places in 152 ms of which 3 ms to minimize.
[2024-05-28 06:44:44] [INFO ] Deduced a trap composed of 170 places in 154 ms of which 3 ms to minimize.
[2024-05-28 06:44:44] [INFO ] Deduced a trap composed of 170 places in 144 ms of which 2 ms to minimize.
[2024-05-28 06:44:44] [INFO ] Deduced a trap composed of 164 places in 163 ms of which 2 ms to minimize.
[2024-05-28 06:44:44] [INFO ] Deduced a trap composed of 167 places in 164 ms of which 2 ms to minimize.
[2024-05-28 06:44:45] [INFO ] Deduced a trap composed of 153 places in 142 ms of which 3 ms to minimize.
[2024-05-28 06:44:45] [INFO ] Deduced a trap composed of 164 places in 155 ms of which 3 ms to minimize.
[2024-05-28 06:44:45] [INFO ] Deduced a trap composed of 161 places in 151 ms of which 4 ms to minimize.
[2024-05-28 06:44:45] [INFO ] Deduced a trap composed of 161 places in 138 ms of which 3 ms to minimize.
[2024-05-28 06:44:45] [INFO ] Deduced a trap composed of 164 places in 163 ms of which 3 ms to minimize.
[2024-05-28 06:44:45] [INFO ] Deduced a trap composed of 136 places in 177 ms of which 3 ms to minimize.
[2024-05-28 06:44:46] [INFO ] Deduced a trap composed of 167 places in 160 ms of which 2 ms to minimize.
[2024-05-28 06:44:46] [INFO ] Deduced a trap composed of 167 places in 156 ms of which 3 ms to minimize.
[2024-05-28 06:44:46] [INFO ] Deduced a trap composed of 164 places in 153 ms of which 2 ms to minimize.
[2024-05-28 06:44:46] [INFO ] Deduced a trap composed of 136 places in 160 ms of which 3 ms to minimize.
[2024-05-28 06:44:46] [INFO ] Deduced a trap composed of 173 places in 171 ms of which 3 ms to minimize.
[2024-05-28 06:44:46] [INFO ] Deduced a trap composed of 136 places in 166 ms of which 3 ms to minimize.
[2024-05-28 06:44:47] [INFO ] Deduced a trap composed of 164 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:44:47] [INFO ] Deduced a trap composed of 167 places in 162 ms of which 3 ms to minimize.
[2024-05-28 06:44:47] [INFO ] Deduced a trap composed of 136 places in 208 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 740 unsolved
[2024-05-28 06:44:49] [INFO ] Deduced a trap composed of 168 places in 207 ms of which 3 ms to minimize.
[2024-05-28 06:44:49] [INFO ] Deduced a trap composed of 143 places in 197 ms of which 3 ms to minimize.
[2024-05-28 06:44:49] [INFO ] Deduced a trap composed of 136 places in 190 ms of which 3 ms to minimize.
[2024-05-28 06:44:49] [INFO ] Deduced a trap composed of 140 places in 171 ms of which 3 ms to minimize.
[2024-05-28 06:44:49] [INFO ] Deduced a trap composed of 136 places in 172 ms of which 3 ms to minimize.
[2024-05-28 06:44:50] [INFO ] Deduced a trap composed of 140 places in 182 ms of which 4 ms to minimize.
[2024-05-28 06:44:50] [INFO ] Deduced a trap composed of 136 places in 165 ms of which 2 ms to minimize.
[2024-05-28 06:44:50] [INFO ] Deduced a trap composed of 136 places in 165 ms of which 3 ms to minimize.
[2024-05-28 06:44:50] [INFO ] Deduced a trap composed of 136 places in 164 ms of which 3 ms to minimize.
[2024-05-28 06:44:50] [INFO ] Deduced a trap composed of 136 places in 156 ms of which 3 ms to minimize.
[2024-05-28 06:44:51] [INFO ] Deduced a trap composed of 140 places in 168 ms of which 3 ms to minimize.
[2024-05-28 06:44:51] [INFO ] Deduced a trap composed of 136 places in 164 ms of which 3 ms to minimize.
[2024-05-28 06:44:51] [INFO ] Deduced a trap composed of 167 places in 185 ms of which 3 ms to minimize.
[2024-05-28 06:44:51] [INFO ] Deduced a trap composed of 140 places in 171 ms of which 3 ms to minimize.
[2024-05-28 06:44:51] [INFO ] Deduced a trap composed of 136 places in 179 ms of which 2 ms to minimize.
[2024-05-28 06:44:52] [INFO ] Deduced a trap composed of 162 places in 160 ms of which 3 ms to minimize.
[2024-05-28 06:44:52] [INFO ] Deduced a trap composed of 136 places in 171 ms of which 3 ms to minimize.
[2024-05-28 06:44:53] [INFO ] Deduced a trap composed of 136 places in 265 ms of which 4 ms to minimize.
[2024-05-28 06:44:53] [INFO ] Deduced a trap composed of 155 places in 212 ms of which 4 ms to minimize.
[2024-05-28 06:44:53] [INFO ] Deduced a trap composed of 136 places in 204 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 740 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/1272 variables, and 212 constraints, problems are : Problem set: 0 solved, 740 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/530 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/740 constraints, Known Traps: 120/120 constraints]
After SMT, in 41253ms problems are : Problem set: 0 solved, 740 unsolved
Search for dead transitions found 0 dead transitions in 41260ms
[2024-05-28 06:44:54] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2024-05-28 06:44:54] [INFO ] Invariant cache hit.
[2024-05-28 06:44:54] [INFO ] Implicit Places using invariants in 477 ms returned []
[2024-05-28 06:44:54] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2024-05-28 06:44:54] [INFO ] Invariant cache hit.
[2024-05-28 06:44:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:44:56] [INFO ] Implicit Places using invariants and state equation in 1817 ms returned []
Implicit Place search using SMT with State Equation took 2296 ms to find 0 implicit places.
[2024-05-28 06:44:56] [INFO ] Redundant transitions in 12 ms returned []
Running 740 sub problems to find dead transitions.
[2024-05-28 06:44:56] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2024-05-28 06:44:56] [INFO ] Invariant cache hit.
[2024-05-28 06:44:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 740 unsolved
[2024-05-28 06:45:03] [INFO ] Deduced a trap composed of 176 places in 209 ms of which 4 ms to minimize.
[2024-05-28 06:45:03] [INFO ] Deduced a trap composed of 176 places in 184 ms of which 4 ms to minimize.
[2024-05-28 06:45:03] [INFO ] Deduced a trap composed of 136 places in 176 ms of which 3 ms to minimize.
[2024-05-28 06:45:04] [INFO ] Deduced a trap composed of 136 places in 181 ms of which 3 ms to minimize.
[2024-05-28 06:45:04] [INFO ] Deduced a trap composed of 167 places in 158 ms of which 2 ms to minimize.
[2024-05-28 06:45:04] [INFO ] Deduced a trap composed of 170 places in 145 ms of which 2 ms to minimize.
[2024-05-28 06:45:04] [INFO ] Deduced a trap composed of 136 places in 163 ms of which 2 ms to minimize.
[2024-05-28 06:45:04] [INFO ] Deduced a trap composed of 164 places in 153 ms of which 3 ms to minimize.
[2024-05-28 06:45:05] [INFO ] Deduced a trap composed of 136 places in 159 ms of which 3 ms to minimize.
[2024-05-28 06:45:05] [INFO ] Deduced a trap composed of 136 places in 153 ms of which 3 ms to minimize.
[2024-05-28 06:45:05] [INFO ] Deduced a trap composed of 136 places in 190 ms of which 3 ms to minimize.
[2024-05-28 06:45:05] [INFO ] Deduced a trap composed of 167 places in 147 ms of which 3 ms to minimize.
[2024-05-28 06:45:05] [INFO ] Deduced a trap composed of 161 places in 147 ms of which 2 ms to minimize.
[2024-05-28 06:45:05] [INFO ] Deduced a trap composed of 170 places in 154 ms of which 2 ms to minimize.
[2024-05-28 06:45:06] [INFO ] Deduced a trap composed of 167 places in 156 ms of which 3 ms to minimize.
[2024-05-28 06:45:06] [INFO ] Deduced a trap composed of 136 places in 155 ms of which 3 ms to minimize.
[2024-05-28 06:45:06] [INFO ] Deduced a trap composed of 136 places in 157 ms of which 2 ms to minimize.
[2024-05-28 06:45:06] [INFO ] Deduced a trap composed of 155 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:45:06] [INFO ] Deduced a trap composed of 164 places in 155 ms of which 3 ms to minimize.
[2024-05-28 06:45:07] [INFO ] Deduced a trap composed of 136 places in 155 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 740 unsolved
[2024-05-28 06:45:11] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 3 ms to minimize.
[2024-05-28 06:45:13] [INFO ] Deduced a trap composed of 173 places in 166 ms of which 3 ms to minimize.
[2024-05-28 06:45:13] [INFO ] Deduced a trap composed of 164 places in 158 ms of which 3 ms to minimize.
[2024-05-28 06:45:13] [INFO ] Deduced a trap composed of 170 places in 158 ms of which 3 ms to minimize.
[2024-05-28 06:45:13] [INFO ] Deduced a trap composed of 167 places in 156 ms of which 3 ms to minimize.
[2024-05-28 06:45:13] [INFO ] Deduced a trap composed of 164 places in 155 ms of which 2 ms to minimize.
[2024-05-28 06:45:14] [INFO ] Deduced a trap composed of 167 places in 154 ms of which 2 ms to minimize.
[2024-05-28 06:45:14] [INFO ] Deduced a trap composed of 167 places in 152 ms of which 3 ms to minimize.
[2024-05-28 06:45:14] [INFO ] Deduced a trap composed of 179 places in 154 ms of which 3 ms to minimize.
[2024-05-28 06:45:14] [INFO ] Deduced a trap composed of 170 places in 154 ms of which 3 ms to minimize.
[2024-05-28 06:45:14] [INFO ] Deduced a trap composed of 170 places in 149 ms of which 3 ms to minimize.
[2024-05-28 06:45:14] [INFO ] Deduced a trap composed of 161 places in 151 ms of which 2 ms to minimize.
[2024-05-28 06:45:15] [INFO ] Deduced a trap composed of 179 places in 185 ms of which 3 ms to minimize.
[2024-05-28 06:45:15] [INFO ] Deduced a trap composed of 173 places in 143 ms of which 2 ms to minimize.
[2024-05-28 06:45:15] [INFO ] Deduced a trap composed of 179 places in 156 ms of which 3 ms to minimize.
[2024-05-28 06:45:15] [INFO ] Deduced a trap composed of 158 places in 202 ms of which 3 ms to minimize.
[2024-05-28 06:45:15] [INFO ] Deduced a trap composed of 208 places in 191 ms of which 3 ms to minimize.
[2024-05-28 06:45:16] [INFO ] Deduced a trap composed of 208 places in 177 ms of which 3 ms to minimize.
[2024-05-28 06:45:16] [INFO ] Deduced a trap composed of 202 places in 177 ms of which 3 ms to minimize.
[2024-05-28 06:45:16] [INFO ] Deduced a trap composed of 204 places in 192 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 5 (OVERLAPS) 4/529 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 740 unsolved
[2024-05-28 06:45:26] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 3 ms to minimize.
[2024-05-28 06:45:27] [INFO ] Deduced a trap composed of 136 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:45:27] [INFO ] Deduced a trap composed of 95 places in 168 ms of which 3 ms to minimize.
[2024-05-28 06:45:27] [INFO ] Deduced a trap composed of 95 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:45:27] [INFO ] Deduced a trap composed of 95 places in 198 ms of which 3 ms to minimize.
[2024-05-28 06:45:27] [INFO ] Deduced a trap composed of 95 places in 165 ms of which 2 ms to minimize.
[2024-05-28 06:45:28] [INFO ] Deduced a trap composed of 95 places in 169 ms of which 3 ms to minimize.
SMT process timed out in 31565ms, After SMT, problems are : Problem set: 0 solved, 740 unsolved
Search for dead transitions found 0 dead transitions in 31581ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 75174 ms. Remains : 530/530 places, 746/746 transitions.
Treatment of property PolyORBNT-COL-S05J40-LTLFireability-15 finished in 257758 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))'
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)))'
[2024-05-28 06:45:28] [INFO ] Flatten gal took : 47 ms
[2024-05-28 06:45:28] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-28 06:45:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 623 places, 856 transitions and 4117 arcs took 12 ms.
Total runtime 1087930 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBNT-COL-S05J40

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 623
TRANSITIONS: 856
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.014s, Sys 0.007s]


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


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

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

Process ID: 4930
MODEL NAME: /home/mcc/execution/416/model
623 places, 856 transitions.

No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

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

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-S05J40"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBNT-COL-S05J40, 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 r289-tajo-171654445800380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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