MCC'2024- Execution of r289-tajo-171654445200115

About the Execution of GreatSPN+red for PolyORBLF-COL-S02J06T10

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
8518.243	3600000.00	7983182.00	333.90	FTFFFF??FT??TFTT	normal

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-171654445200115.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 PolyORBLF-COL-S02J06T10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445200115
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 11K Apr 11 17:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 17:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 11 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 11 17:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 11 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716848257931

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 22:17:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-27 22:17:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 22:17:39] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-27 22:17:39] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 22:17:39] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 695 ms
[2024-05-27 22:17:39] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 844 PT places and 1904.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2024-05-27 22:17:40] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-27 22:17:40] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40001 steps (16 resets) in 1922 ms. (20 steps per ms) remains 7/28 properties
BEST_FIRST walk for 40002 steps (15 resets) in 390 ms. (102 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (11 resets) in 117 ms. (338 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (19 resets) in 141 ms. (281 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (12 resets) in 148 ms. (268 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (13 resets) in 129 ms. (307 steps per ms) remains 7/7 properties
[2024-05-27 22:17:41] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-27 22:17:41] [INFO ] Computed 26 invariants in 15 ms
[2024-05-27 22:17:41] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
At refinement iteration 1 (OVERLAPS) 41/50 variables, 8/8 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3/53 variables, 2/10 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
At refinement iteration 5 (OVERLAPS) 26/79 variables, 14/24 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/24 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/80 variables, 1/25 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/25 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/81 variables, 1/26 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 6 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 6 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 6 solved, 1 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/23 variables, 2/4 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/46 variables, 3/7 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/49 variables, 2/9 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/73 variables, 12/21 constraints. Problems are: Problem set: 6 solved, 1 unsolved
[2024-05-27 22:17:41] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 52 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 1/22 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/78 variables, 3/25 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 1/114 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/143 variables, 0/114 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/145 variables, 2/116 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/145 variables, 1/117 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/145 variables, 0/117 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/145 variables, 0/117 constraints. Problems are: Problem set: 6 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 117 constraints, problems are : Problem set: 6 solved, 1 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 633ms problems are : Problem set: 6 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 80 transition count 56
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 71 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 19 place count 71 transition count 53
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 68 transition count 53
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 39 place count 61 transition count 46
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 61 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 59 transition count 44
Applied a total of 43 rules in 30 ms. Remains 59 /81 variables (removed 22) and now considering 44/65 (removed 21) transitions.
Running 43 sub problems to find dead transitions.
[2024-05-27 22:17:41] [INFO ] Flow matrix only has 43 transitions (discarded 1 similar events)
// Phase 1: matrix 43 rows 59 cols
[2024-05-27 22:17:41] [INFO ] Computed 25 invariants in 1 ms
[2024-05-27 22:17:41] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-27 22:17:42] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-05-27 22:17:42] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2024-05-27 22:17:42] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-27 22:17:42] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-27 22:17:42] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/30 constraints. Problems are: Problem set: 2 solved, 41 unsolved
[2024-05-27 22:17:42] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-27 22:17:42] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-27 22:17:42] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-27 22:17:42] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-27 22:17:42] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-27 22:17:42] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 6/36 constraints. Problems are: Problem set: 2 solved, 41 unsolved
[2024-05-27 22:17:43] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 1/37 constraints. Problems are: Problem set: 2 solved, 41 unsolved
[2024-05-27 22:17:43] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-27 22:17:43] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 2/39 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 0/39 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 43/102 variables, 59/98 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 8/106 constraints. Problems are: Problem set: 2 solved, 41 unsolved
[2024-05-27 22:17:43] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-27 22:17:43] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 2/108 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 0/108 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 13 (OVERLAPS) 0/102 variables, 0/108 constraints. Problems are: Problem set: 2 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 108 constraints, problems are : Problem set: 2 solved, 41 unsolved in 2088 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 59/59 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 2 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 8/32 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/33 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 8/41 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 43/102 variables, 59/100 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 8/108 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 41/149 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 0/149 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 11 (OVERLAPS) 0/102 variables, 0/149 constraints. Problems are: Problem set: 2 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 149 constraints, problems are : Problem set: 2 solved, 41 unsolved in 913 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 59/59 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 41/43 constraints, Known Traps: 16/16 constraints]
After SMT, in 3027ms problems are : Problem set: 2 solved, 41 unsolved
Search for dead transitions found 2 dead transitions in 3029ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/81 places, 42/65 transitions.
Reduce places removed 2 places and 2 transitions.
Graph (complete) has 194 edges and 57 vertex of which 1 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.1 ms
Discarding 56 places :
Also discarding 39 output transitions
Drop transitions (Output transitions of discarded places.) removed 39 transitions
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1 transition count 1
Reduce places removed 0 places and 1 transitions.
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 3 rules in 7 ms. Remains 1 /59 variables (removed 58) and now considering 0/42 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3078 ms. Remains : 1/81 places, 0/65 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Successfully simplified 7 atomic propositions for a total of 14 simplifications.
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 22:17:45] [INFO ] Flatten gal took : 27 ms
[2024-05-27 22:17:45] [INFO ] Flatten gal took : 9 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-27 22:17:45] [INFO ] Unfolded HLPN to a Petri net with 844 places and 1812 transitions 8302 arcs in 45 ms.
[2024-05-27 22:17:45] [INFO ] Unfolded 10 HLPN properties in 1 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Support contains 414 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 832 transition count 1642
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 832 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 822 transition count 1632
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 822 transition count 1632
Applied a total of 42 rules in 80 ms. Remains 822 /844 variables (removed 22) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:17:45] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 822 cols
[2024-05-27 22:17:45] [INFO ] Computed 56 invariants in 66 ms
[2024-05-27 22:17:45] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 39/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-27 22:18:07] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 2 ms to minimize.
[2024-05-27 22:18:07] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 2 ms to minimize.
[2024-05-27 22:18:07] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 1 ms to minimize.
[2024-05-27 22:18:07] [INFO ] Deduced a trap composed of 71 places in 90 ms of which 1 ms to minimize.
[2024-05-27 22:18:07] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 1 ms to minimize.
[2024-05-27 22:18:07] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 2 ms to minimize.
[2024-05-27 22:18:07] [INFO ] Deduced a trap composed of 71 places in 89 ms of which 15 ms to minimize.
[2024-05-27 22:18:08] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:18:08] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.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 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 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 1.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 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 10.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 820/2434 variables, and 63 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 39/40 constraints, State Equation: 0/822 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 39/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 9/63 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-27 22:18:10] [INFO ] Deduced a trap composed of 205 places in 313 ms of which 4 ms to minimize.
[2024-05-27 22:18:11] [INFO ] Deduced a trap composed of 228 places in 319 ms of which 4 ms to minimize.
[2024-05-27 22:18:11] [INFO ] Deduced a trap composed of 71 places in 37 ms of which 1 ms to minimize.
[2024-05-27 22:18:12] [INFO ] Deduced a trap composed of 412 places in 312 ms of which 4 ms to minimize.
[2024-05-27 22:18:25] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 3 ms to minimize.
[2024-05-27 22:18:27] [INFO ] Deduced a trap composed of 430 places in 411 ms of which 6 ms to minimize.
[2024-05-27 22:18:27] [INFO ] Deduced a trap composed of 419 places in 405 ms of which 6 ms to minimize.
[2024-05-27 22:18:28] [INFO ] Deduced a trap composed of 443 places in 313 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 8)
(s1 2)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 1)
(s13 1)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(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 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 9)
(s243 1)
(s244 0)
(s245 1)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 1)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 1)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 1)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 1)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 1)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s437 1)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 1)
(s490 1)
(s491 1)
(s492 0)
(s493 1)
(s494 1)
(s495 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 820/2434 variables, and 71 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 39/40 constraints, State Equation: 0/822 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 17/17 constraints]
After SMT, in 43031ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 43054ms
[2024-05-27 22:18:28] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:18:28] [INFO ] Invariant cache hit.
[2024-05-27 22:18:28] [INFO ] Implicit Places using invariants in 445 ms returned [646, 647, 648, 649, 650, 651, 652, 653, 654, 655]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 454 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 812/844 places, 1632/1652 transitions.
Applied a total of 0 rules in 13 ms. Remains 812 /812 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43611 ms. Remains : 812/844 places, 1632/1652 transitions.
Support contains 414 out of 812 places after structural reductions.
[2024-05-27 22:18:29] [INFO ] Flatten gal took : 120 ms
[2024-05-27 22:18:29] [INFO ] Flatten gal took : 95 ms
[2024-05-27 22:18:29] [INFO ] Input system was already deterministic with 1632 transitions.
Support contains 404 out of 812 places (down from 414) after GAL structural reductions.
RANDOM walk for 40000 steps (12 resets) in 788 ms. (50 steps per ms) remains 3/22 properties
BEST_FIRST walk for 40003 steps (8 resets) in 190 ms. (209 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (9 resets) in 231 ms. (172 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 287 ms. (138 steps per ms) remains 3/3 properties
[2024-05-27 22:18:29] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 812 cols
[2024-05-27 22:18:29] [INFO ] Computed 46 invariants in 38 ms
[2024-05-27 22:18:29] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 694/776 variables, 19/20 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-27 22:18:30] [INFO ] Deduced a trap composed of 72 places in 146 ms of which 6 ms to minimize.
[2024-05-27 22:18:30] [INFO ] Deduced a trap composed of 72 places in 138 ms of which 2 ms to minimize.
[2024-05-27 22:18:30] [INFO ] Deduced a trap composed of 72 places in 115 ms of which 2 ms to minimize.
[2024-05-27 22:18:31] [INFO ] Deduced a trap composed of 72 places in 185 ms of which 3 ms to minimize.
[2024-05-27 22:18:31] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 1 ms to minimize.
[2024-05-27 22:18:31] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 1 ms to minimize.
[2024-05-27 22:18:31] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/776 variables, 7/27 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/776 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 13/789 variables, 12/39 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-27 22:18:31] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 1 ms to minimize.
[2024-05-27 22:18:31] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/789 variables, 2/41 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/789 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp15 is UNSAT
After SMT solving in domain Real declared 810/2424 variables, and 54 constraints, problems are : Problem set: 3 solved, 0 unsolved in 1768 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints]
After SMT, in 1830ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 8 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(F(p1) U (!p0 U X(X(p2))))))'
Support contains 41 out of 812 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Applied a total of 0 rules in 20 ms. Remains 812 /812 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:18:32] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:18:32] [INFO ] Invariant cache hit.
[2024-05-27 22:18:32] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
(s286 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 8.0)
(s1 2.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 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 1.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 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 1.0)
(s98 1.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 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 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 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 9.0)
(s243 0.0)
(s244 1.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 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.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 44 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-27 22:18:55] [INFO ] Deduced a trap composed of 72 places in 83 ms of which 1 ms to minimize.
[2024-05-27 22:18:55] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
[2024-05-27 22:18:55] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 1 ms to minimize.
[2024-05-27 22:18:56] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 1 ms to minimize.
[2024-05-27 22:18:56] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 1 ms to minimize.
[2024-05-27 22:18:57] [INFO ] Deduced a trap composed of 73 places in 397 ms of which 6 ms to minimize.
[2024-05-27 22:18:58] [INFO ] Deduced a trap composed of 207 places in 296 ms of which 4 ms to minimize.
[2024-05-27 22:19:00] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 1 ms to minimize.
[2024-05-27 22:19:08] [INFO ] Deduced a trap composed of 117 places in 297 ms of which 4 ms to minimize.
[2024-05-27 22:19:08] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 1 ms to minimize.
[2024-05-27 22:19:13] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 55 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 11/11 constraints]
After SMT, in 42515ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 42530ms
[2024-05-27 22:19:14] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:19:14] [INFO ] Invariant cache hit.
[2024-05-27 22:19:15] [INFO ] Implicit Places using invariants in 665 ms returned []
[2024-05-27 22:19:15] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:19:15] [INFO ] Invariant cache hit.
[2024-05-27 22:19:16] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:19:27] [INFO ] Implicit Places using invariants and state equation in 12583 ms returned []
Implicit Place search using SMT with State Equation took 13250 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:19:27] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:19:27] [INFO ] Invariant cache hit.
[2024-05-27 22:19:27] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-27 22:19:58] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-05-27 22:19:58] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 1 ms to minimize.
[2024-05-27 22:19:58] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 4 ms to minimize.
[2024-05-27 22:19:58] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 1 ms to minimize.
[2024-05-27 22:19:58] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 1 ms to minimize.
[2024-05-27 22:19:58] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 0 ms to minimize.
[2024-05-27 22:19:58] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 1 ms to minimize.
[2024-05-27 22:19:59] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 0 ms to minimize.
[2024-05-27 22:19:59] [INFO ] Deduced a trap composed of 72 places in 36 ms of which 1 ms to minimize.
[2024-05-27 22:19:59] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 54 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-27 22:20:05] [INFO ] Deduced a trap composed of 208 places in 331 ms of which 4 ms to minimize.
[2024-05-27 22:20:15] [INFO ] Deduced a trap composed of 79 places in 196 ms of which 3 ms to minimize.
[2024-05-27 22:20:29] [INFO ] Deduced a trap composed of 52 places in 215 ms of which 3 ms to minimize.
[2024-05-27 22:20:29] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 4)
(s1 6)
(s2 1)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 1)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(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 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 9)
(s243 1)
(s244 0)
(s245 1)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 1)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 1)
(s293 0)
(s294 0)
(s295 1)
(s296 0)
(s297 1)
(s298 0)
(s299 0)
(s300 1)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 1)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 58 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 14/14 constraints]
After SMT, in 62613ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 62629ms
Finished structural reductions in LTL mode , in 1 iterations and 118436 ms. Remains : 812/812 places, 1632/1632 transitions.
Stuttering acceptance computed with spot in 459 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-04
Stuttering criterion allowed to conclude after 4696 steps with 54 reset in 79 ms.
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-04 finished in 119047 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 11 out of 812 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Applied a total of 0 rules in 18 ms. Remains 812 /812 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:20:31] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:20:31] [INFO ] Invariant cache hit.
[2024-05-27 22:20:31] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 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 810/2424 variables, and 44 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-27 22:20:54] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 1 ms to minimize.
[2024-05-27 22:20:54] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 1 ms to minimize.
[2024-05-27 22:20:54] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2024-05-27 22:20:54] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 1 ms to minimize.
[2024-05-27 22:20:55] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 1 ms to minimize.
[2024-05-27 22:20:56] [INFO ] Deduced a trap composed of 73 places in 411 ms of which 5 ms to minimize.
[2024-05-27 22:20:56] [INFO ] Deduced a trap composed of 207 places in 373 ms of which 5 ms to minimize.
[2024-05-27 22:20:59] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 1 ms to minimize.
[2024-05-27 22:21:07] [INFO ] Deduced a trap composed of 117 places in 323 ms of which 4 ms to minimize.
[2024-05-27 22:21:07] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
[2024-05-27 22:21:13] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 55 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 11/11 constraints]
After SMT, in 42506ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 42523ms
[2024-05-27 22:21:13] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:21:13] [INFO ] Invariant cache hit.
[2024-05-27 22:21:14] [INFO ] Implicit Places using invariants in 700 ms returned []
[2024-05-27 22:21:14] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:21:14] [INFO ] Invariant cache hit.
[2024-05-27 22:21:15] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:21:33] [INFO ] Implicit Places using invariants and state equation in 18980 ms returned []
Implicit Place search using SMT with State Equation took 19681 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:21:33] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:21:33] [INFO ] Invariant cache hit.
[2024-05-27 22:21:33] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-27 22:22:04] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 1 ms to minimize.
[2024-05-27 22:22:04] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-05-27 22:22:04] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
[2024-05-27 22:22:04] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-05-27 22:22:04] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 1 ms to minimize.
[2024-05-27 22:22:04] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-05-27 22:22:04] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 4 ms to minimize.
[2024-05-27 22:22:05] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:22:05] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:22:05] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 54 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-27 22:22:11] [INFO ] Deduced a trap composed of 208 places in 404 ms of which 5 ms to minimize.
[2024-05-27 22:22:21] [INFO ] Deduced a trap composed of 79 places in 206 ms of which 3 ms to minimize.
[2024-05-27 22:22:31] [INFO ] Deduced a trap composed of 52 places in 213 ms of which 3 ms to minimize.
[2024-05-27 22:22:31] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 5)
(s1 5)
(s2 1)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(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 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 9)
(s243 1)
(s244 0)
(s245 1)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 58 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 14/14 constraints]
After SMT, in 63018ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 63033ms
Finished structural reductions in LTL mode , in 1 iterations and 125263 ms. Remains : 812/812 places, 1632/1632 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-06
Product exploration explored 100000 steps with 25000 reset in 548 ms.
Product exploration explored 100000 steps with 25000 reset in 569 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 118 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 334 steps (0 resets) in 7 ms. (41 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 812 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Applied a total of 0 rules in 12 ms. Remains 812 /812 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:22:38] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:22:38] [INFO ] Invariant cache hit.
[2024-05-27 22:22:38] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 4.0)
(s1 6.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 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 1.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 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 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 1.0)
(s205 1.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 1.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 1.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 9.0)
(s243 0.0)
(s244 1.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 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 1.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 (/ 2.0 3.0))
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 (/ 1.0 3.0))
(s300 1.0)
(s301 (/ 1.0 3.0))
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 (/ 2.0 3.0))
(s392 1.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 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 1.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 1.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 4.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 44 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-27 22:23:01] [INFO ] Deduced a trap composed of 72 places in 88 ms of which 2 ms to minimize.
[2024-05-27 22:23:01] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 1 ms to minimize.
[2024-05-27 22:23:02] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 1 ms to minimize.
[2024-05-27 22:23:02] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 2 ms to minimize.
[2024-05-27 22:23:02] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 2 ms to minimize.
[2024-05-27 22:23:03] [INFO ] Deduced a trap composed of 73 places in 384 ms of which 5 ms to minimize.
[2024-05-27 22:23:03] [INFO ] Deduced a trap composed of 207 places in 393 ms of which 5 ms to minimize.
[2024-05-27 22:23:06] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 1 ms to minimize.
[2024-05-27 22:23:13] [INFO ] Deduced a trap composed of 117 places in 297 ms of which 4 ms to minimize.
[2024-05-27 22:23:13] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 2 ms to minimize.
[2024-05-27 22:23:18] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 3 ms to minimize.
[2024-05-27 22:23:20] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 56 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 12/12 constraints]
After SMT, in 42362ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 42377ms
[2024-05-27 22:23:20] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:23:20] [INFO ] Invariant cache hit.
[2024-05-27 22:23:21] [INFO ] Implicit Places using invariants in 760 ms returned []
[2024-05-27 22:23:21] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:23:21] [INFO ] Invariant cache hit.
[2024-05-27 22:23:22] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:23:39] [INFO ] Implicit Places using invariants and state equation in 18734 ms returned []
Implicit Place search using SMT with State Equation took 19498 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:23:40] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:23:40] [INFO ] Invariant cache hit.
[2024-05-27 22:23:40] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-27 22:24:09] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 2 ms to minimize.
[2024-05-27 22:24:09] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-05-27 22:24:09] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 1 ms to minimize.
[2024-05-27 22:24:09] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:24:10] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:24:10] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 1 ms to minimize.
[2024-05-27 22:24:10] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
[2024-05-27 22:24:10] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:24:10] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 1 ms to minimize.
[2024-05-27 22:24:10] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 2 ms to minimize.
[2024-05-27 22:24:13] [INFO ] Deduced a trap composed of 457 places in 477 ms of which 6 ms to minimize.
SMT process timed out in 33505ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 33520ms
Finished structural reductions in LTL mode , in 1 iterations and 95415 ms. Remains : 812/812 places, 1632/1632 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 54 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 313 steps (0 resets) in 6 ms. (44 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 86 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 379 ms.
Product exploration explored 100000 steps with 25000 reset in 386 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 812 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 812 transition count 1632
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 110 Pre rules applied. Total rules applied 50 place count 812 transition count 1742
Deduced a syphon composed of 160 places in 1 ms
Iterating global reduction 1 with 110 rules applied. Total rules applied 160 place count 812 transition count 1742
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 230 places in 1 ms
Iterating global reduction 1 with 70 rules applied. Total rules applied 230 place count 812 transition count 1742
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 260 place count 782 transition count 1712
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 290 place count 782 transition count 1712
Deduced a syphon composed of 210 places in 0 ms
Applied a total of 290 rules in 228 ms. Remains 782 /812 variables (removed 30) and now considering 1712/1632 (removed -80) transitions.
Running 1710 sub problems to find dead transitions.
[2024-05-27 22:24:15] [INFO ] Flow matrix only has 1692 transitions (discarded 20 similar events)
// Phase 1: matrix 1692 rows 782 cols
[2024-05-27 22:24:15] [INFO ] Computed 46 invariants in 84 ms
[2024-05-27 22:24:15] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/780 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/780 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1710 unsolved
[2024-05-27 22:24:36] [INFO ] Deduced a trap composed of 48 places in 275 ms of which 4 ms to minimize.
[2024-05-27 22:24:37] [INFO ] Deduced a trap composed of 48 places in 261 ms of which 4 ms to minimize.
[2024-05-27 22:24:37] [INFO ] Deduced a trap composed of 48 places in 194 ms of which 3 ms to minimize.
[2024-05-27 22:24:37] [INFO ] Deduced a trap composed of 48 places in 152 ms of which 3 ms to minimize.
[2024-05-27 22:24:37] [INFO ] Deduced a trap composed of 48 places in 172 ms of which 3 ms to minimize.
[2024-05-27 22:24:37] [INFO ] Deduced a trap composed of 48 places in 130 ms of which 2 ms to minimize.
[2024-05-27 22:24:37] [INFO ] Deduced a trap composed of 48 places in 114 ms of which 2 ms to minimize.
[2024-05-27 22:24:38] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 2 ms to minimize.
[2024-05-27 22:24:38] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-05-27 22:24:38] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 780/2474 variables, and 54 constraints, problems are : Problem set: 20 solved, 1690 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/782 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1710/1710 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 20 solved, 1690 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/780 variables, 16/16 constraints. Problems are: Problem set: 20 solved, 1690 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/780 variables, 28/44 constraints. Problems are: Problem set: 20 solved, 1690 unsolved
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1546 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1652 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1673 is UNSAT
Problem TDEAD1675 is UNSAT
Problem TDEAD1677 is UNSAT
Problem TDEAD1679 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1685 is UNSAT
Problem TDEAD1687 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1691 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/780 variables, 10/54 constraints. Problems are: Problem set: 300 solved, 1410 unsolved
[2024-05-27 22:24:41] [INFO ] Deduced a trap composed of 240 places in 399 ms of which 6 ms to minimize.
[2024-05-27 22:24:41] [INFO ] Deduced a trap composed of 241 places in 373 ms of which 5 ms to minimize.
[2024-05-27 22:24:42] [INFO ] Deduced a trap composed of 45 places in 190 ms of which 3 ms to minimize.
[2024-05-27 22:24:43] [INFO ] Deduced a trap composed of 46 places in 175 ms of which 2 ms to minimize.
[2024-05-27 22:24:44] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 3 ms to minimize.
[2024-05-27 22:24:44] [INFO ] Deduced a trap composed of 48 places in 152 ms of which 2 ms to minimize.
[2024-05-27 22:24:44] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-05-27 22:24:50] [INFO ] Deduced a trap composed of 372 places in 395 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 780/2474 variables, and 62 constraints, problems are : Problem set: 300 solved, 1410 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/782 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1710 constraints, Known Traps: 18/18 constraints]
After SMT, in 43084ms problems are : Problem set: 300 solved, 1410 unsolved
Search for dead transitions found 300 dead transitions in 43100ms
Found 300 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 300 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 300 transitions.
[2024-05-27 22:24:58] [INFO ] Redundant transitions in 75 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 782/812 places, 1412/1632 transitions.
Graph (complete) has 3786 edges and 782 vertex of which 592 are kept as prefixes of interest. Removing 190 places using SCC suffix rule.5 ms
Discarding 190 places :
Also discarding 0 output transitions
Deduced a syphon composed of 20 places in 0 ms
Applied a total of 1 rules in 55 ms. Remains 592 /782 variables (removed 190) and now considering 1412/1412 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 592/812 places, 1412/1632 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 43471 ms. Remains : 592/812 places, 1412/1632 transitions.
Support contains 11 out of 812 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Applied a total of 0 rules in 47 ms. Remains 812 /812 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:24:58] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 812 cols
[2024-05-27 22:24:58] [INFO ] Computed 46 invariants in 25 ms
[2024-05-27 22:24:58] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
SMT process timed out in 22460ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 22478ms
[2024-05-27 22:25:21] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:25:21] [INFO ] Invariant cache hit.
[2024-05-27 22:25:22] [INFO ] Implicit Places using invariants in 701 ms returned []
[2024-05-27 22:25:22] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:25:22] [INFO ] Invariant cache hit.
[2024-05-27 22:25:22] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:25:39] [INFO ] Implicit Places using invariants and state equation in 17909 ms returned []
Implicit Place search using SMT with State Equation took 18615 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:25:39] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:25:39] [INFO ] Invariant cache hit.
[2024-05-27 22:25:39] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 44 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-27 22:26:13] [INFO ] Deduced a trap composed of 72 places in 127 ms of which 4 ms to minimize.
[2024-05-27 22:26:14] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-05-27 22:26:14] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 2 ms to minimize.
[2024-05-27 22:26:14] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 1 ms to minimize.
[2024-05-27 22:26:14] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 1 ms to minimize.
[2024-05-27 22:26:15] [INFO ] Deduced a trap composed of 73 places in 360 ms of which 6 ms to minimize.
[2024-05-27 22:26:15] [INFO ] Deduced a trap composed of 207 places in 349 ms of which 6 ms to minimize.
[2024-05-27 22:26:18] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-05-27 22:26:24] [INFO ] Deduced a trap composed of 117 places in 220 ms of which 4 ms to minimize.
[2024-05-27 22:26:25] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 2 ms to minimize.
[2024-05-27 22:26:28] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-05-27 22:26:30] [INFO ] Deduced a trap composed of 72 places in 39 ms of which 1 ms to minimize.
[2024-05-27 22:26:32] [INFO ] Deduced a trap composed of 424 places in 311 ms of which 4 ms to minimize.
[2024-05-27 22:26:39] [INFO ] Deduced a trap composed of 443 places in 367 ms of which 5 ms to minimize.
[2024-05-27 22:26:39] [INFO ] Deduced a trap composed of 533 places in 355 ms of which 5 ms to minimize.
[2024-05-27 22:26:40] [INFO ] Deduced a trap composed of 406 places in 351 ms of which 4 ms to minimize.
[2024-05-27 22:26:41] [INFO ] Deduced a trap composed of 66 places in 314 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 61 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 17/17 constraints]
After SMT, in 62766ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 62784ms
Finished structural reductions in LTL mode , in 1 iterations and 103932 ms. Remains : 812/812 places, 1632/1632 transitions.
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-06 finished in 371934 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 71 out of 812 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 812 transition count 1562
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 742 transition count 1562
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 140 place count 742 transition count 1532
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 200 place count 712 transition count 1532
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 360 place count 632 transition count 1452
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 370 place count 622 transition count 1442
Iterating global reduction 2 with 10 rules applied. Total rules applied 380 place count 622 transition count 1442
Applied a total of 380 rules in 188 ms. Remains 622 /812 variables (removed 190) and now considering 1442/1632 (removed 190) transitions.
Running 1440 sub problems to find dead transitions.
[2024-05-27 22:26:43] [INFO ] Flow matrix only has 1422 transitions (discarded 20 similar events)
// Phase 1: matrix 1422 rows 622 cols
[2024-05-27 22:26:43] [INFO ] Computed 46 invariants in 21 ms
[2024-05-27 22:26:43] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
[2024-05-27 22:26:57] [INFO ] Deduced a trap composed of 53 places in 105 ms of which 2 ms to minimize.
[2024-05-27 22:26:57] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 1 ms to minimize.
[2024-05-27 22:26:58] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 1 ms to minimize.
[2024-05-27 22:26:58] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 2 ms to minimize.
[2024-05-27 22:26:58] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-05-27 22:26:58] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 1 ms to minimize.
[2024-05-27 22:26:58] [INFO ] Deduced a trap composed of 53 places in 43 ms of which 1 ms to minimize.
[2024-05-27 22:26:58] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:26:58] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:26:59] [INFO ] Deduced a trap composed of 311 places in 370 ms of which 5 ms to minimize.
[2024-05-27 22:26:59] [INFO ] Deduced a trap composed of 277 places in 344 ms of which 4 ms to minimize.
[2024-05-27 22:26:59] [INFO ] Deduced a trap composed of 330 places in 321 ms of which 5 ms to minimize.
[2024-05-27 22:27:00] [INFO ] Deduced a trap composed of 339 places in 363 ms of which 5 ms to minimize.
[2024-05-27 22:27:00] [INFO ] Deduced a trap composed of 288 places in 373 ms of which 5 ms to minimize.
[2024-05-27 22:27:00] [INFO ] Deduced a trap composed of 23 places in 336 ms of which 4 ms to minimize.
[2024-05-27 22:27:01] [INFO ] Deduced a trap composed of 295 places in 305 ms of which 3 ms to minimize.
[2024-05-27 22:27:01] [INFO ] Deduced a trap composed of 339 places in 284 ms of which 3 ms to minimize.
[2024-05-27 22:27:01] [INFO ] Deduced a trap composed of 343 places in 315 ms of which 3 ms to minimize.
[2024-05-27 22:27:02] [INFO ] Deduced a trap composed of 324 places in 336 ms of which 4 ms to minimize.
[2024-05-27 22:27:03] [INFO ] Deduced a trap composed of 287 places in 336 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
[2024-05-27 22:27:03] [INFO ] Deduced a trap composed of 53 places in 37 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/2044 variables, and 65 constraints, problems are : Problem set: 0 solved, 1440 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/622 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1440/1440 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1440 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 21/65 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 620/2044 variables, and 65 constraints, problems are : Problem set: 0 solved, 1440 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/622 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1440 constraints, Known Traps: 21/21 constraints]
After SMT, in 42603ms problems are : Problem set: 0 solved, 1440 unsolved
Search for dead transitions found 0 dead transitions in 42619ms
[2024-05-27 22:27:25] [INFO ] Flow matrix only has 1422 transitions (discarded 20 similar events)
[2024-05-27 22:27:25] [INFO ] Invariant cache hit.
[2024-05-27 22:27:26] [INFO ] Implicit Places using invariants in 619 ms returned []
[2024-05-27 22:27:26] [INFO ] Flow matrix only has 1422 transitions (discarded 20 similar events)
[2024-05-27 22:27:26] [INFO ] Invariant cache hit.
[2024-05-27 22:27:26] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:27:32] [INFO ] Implicit Places using invariants and state equation in 6570 ms returned []
Implicit Place search using SMT with State Equation took 7190 ms to find 0 implicit places.
[2024-05-27 22:27:32] [INFO ] Redundant transitions in 13 ms returned []
Running 1440 sub problems to find dead transitions.
[2024-05-27 22:27:32] [INFO ] Flow matrix only has 1422 transitions (discarded 20 similar events)
[2024-05-27 22:27:32] [INFO ] Invariant cache hit.
[2024-05-27 22:27:32] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
[2024-05-27 22:27:47] [INFO ] Deduced a trap composed of 67 places in 264 ms of which 4 ms to minimize.
[2024-05-27 22:27:47] [INFO ] Deduced a trap composed of 53 places in 134 ms of which 3 ms to minimize.
[2024-05-27 22:27:48] [INFO ] Deduced a trap composed of 53 places in 156 ms of which 3 ms to minimize.
[2024-05-27 22:27:48] [INFO ] Deduced a trap composed of 53 places in 98 ms of which 2 ms to minimize.
[2024-05-27 22:27:48] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 1 ms to minimize.
[2024-05-27 22:27:48] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 2 ms to minimize.
[2024-05-27 22:27:48] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 1 ms to minimize.
[2024-05-27 22:27:48] [INFO ] Deduced a trap composed of 53 places in 34 ms of which 1 ms to minimize.
[2024-05-27 22:27:48] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:27:48] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
[2024-05-27 22:27:49] [INFO ] Deduced a trap composed of 320 places in 291 ms of which 4 ms to minimize.
[2024-05-27 22:27:49] [INFO ] Deduced a trap composed of 347 places in 304 ms of which 4 ms to minimize.
[2024-05-27 22:27:49] [INFO ] Deduced a trap composed of 286 places in 303 ms of which 4 ms to minimize.
[2024-05-27 22:27:50] [INFO ] Deduced a trap composed of 286 places in 287 ms of which 4 ms to minimize.
[2024-05-27 22:27:50] [INFO ] Deduced a trap composed of 342 places in 340 ms of which 4 ms to minimize.
[2024-05-27 22:27:50] [INFO ] Deduced a trap composed of 53 places in 40 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 4.0)
(s1 6.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 0.0)
(s8 1.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 1.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 1.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 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 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 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 9.0)
(s213 1.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 1.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 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(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 1.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 1.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 1.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 4.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 1.0)
(s431 0.0)
(s432 1.0)
(s433 0.0)
(s434 1.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 1.0)
(s439 1.0)
(s440 0.0)
(s441 0.0)
(s442 1.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 1.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 10.0)
(s529 0.0)
(s530 0.0)
(s531 1.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 1.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 1.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 1.0)
(s547 0.0)
(s548 1.0)
(s549 0.0)
(s550 0.0)
(s551 1.0)
(s552 0.0)
(s553 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/2044 variables, and 60 constraints, problems are : Problem set: 0 solved, 1440 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/622 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1440/1440 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1440 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
[2024-05-27 22:28:09] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 3 ms to minimize.
[2024-05-27 22:28:26] [INFO ] Deduced a trap composed of 288 places in 355 ms of which 5 ms to minimize.
[2024-05-27 22:28:26] [INFO ] Deduced a trap composed of 288 places in 249 ms of which 4 ms to minimize.
[2024-05-27 22:28:26] [INFO ] Deduced a trap composed of 266 places in 248 ms of which 4 ms to minimize.
[2024-05-27 22:28:27] [INFO ] Deduced a trap composed of 251 places in 275 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/620 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
[2024-05-27 22:28:34] [INFO ] Deduced a trap composed of 91 places in 296 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 620/2044 variables, and 66 constraints, problems are : Problem set: 0 solved, 1440 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/622 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1440 constraints, Known Traps: 22/22 constraints]
After SMT, in 62557ms problems are : Problem set: 0 solved, 1440 unsolved
Search for dead transitions found 0 dead transitions in 62570ms
Starting structural reductions in SI_LTL mode, iteration 1 : 622/812 places, 1442/1632 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 112605 ms. Remains : 622/812 places, 1442/1632 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-07
Product exploration explored 100000 steps with 2415 reset in 439 ms.
Product exploration explored 100000 steps with 2449 reset in 501 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 107 steps (0 resets) in 5 ms. (17 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Support contains 71 out of 622 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 622/622 places, 1442/1442 transitions.
Applied a total of 0 rules in 29 ms. Remains 622 /622 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Running 1440 sub problems to find dead transitions.
[2024-05-27 22:28:36] [INFO ] Flow matrix only has 1422 transitions (discarded 20 similar events)
[2024-05-27 22:28:36] [INFO ] Invariant cache hit.
[2024-05-27 22:28:36] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
[2024-05-27 22:28:52] [INFO ] Deduced a trap composed of 67 places in 266 ms of which 4 ms to minimize.
[2024-05-27 22:28:52] [INFO ] Deduced a trap composed of 53 places in 150 ms of which 3 ms to minimize.
[2024-05-27 22:28:53] [INFO ] Deduced a trap composed of 53 places in 140 ms of which 3 ms to minimize.
[2024-05-27 22:28:53] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 2 ms to minimize.
[2024-05-27 22:28:53] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 1 ms to minimize.
[2024-05-27 22:28:53] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 1 ms to minimize.
[2024-05-27 22:28:53] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
[2024-05-27 22:28:53] [INFO ] Deduced a trap composed of 53 places in 32 ms of which 1 ms to minimize.
[2024-05-27 22:28:53] [INFO ] Deduced a trap composed of 53 places in 32 ms of which 1 ms to minimize.
[2024-05-27 22:28:53] [INFO ] Deduced a trap composed of 53 places in 33 ms of which 1 ms to minimize.
[2024-05-27 22:28:54] [INFO ] Deduced a trap composed of 320 places in 279 ms of which 3 ms to minimize.
[2024-05-27 22:28:54] [INFO ] Deduced a trap composed of 347 places in 249 ms of which 4 ms to minimize.
[2024-05-27 22:28:54] [INFO ] Deduced a trap composed of 286 places in 280 ms of which 3 ms to minimize.
[2024-05-27 22:28:54] [INFO ] Deduced a trap composed of 286 places in 260 ms of which 4 ms to minimize.
[2024-05-27 22:28:55] [INFO ] Deduced a trap composed of 342 places in 251 ms of which 3 ms to minimize.
[2024-05-27 22:28:55] [INFO ] Deduced a trap composed of 53 places in 31 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/2044 variables, and 60 constraints, problems are : Problem set: 0 solved, 1440 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/622 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1440/1440 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1440 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
[2024-05-27 22:29:03] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 620/2044 variables, and 61 constraints, problems are : Problem set: 0 solved, 1440 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/622 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1440 constraints, Known Traps: 17/17 constraints]
After SMT, in 42256ms problems are : Problem set: 0 solved, 1440 unsolved
Search for dead transitions found 0 dead transitions in 42271ms
[2024-05-27 22:29:19] [INFO ] Flow matrix only has 1422 transitions (discarded 20 similar events)
[2024-05-27 22:29:19] [INFO ] Invariant cache hit.
[2024-05-27 22:29:19] [INFO ] Implicit Places using invariants in 579 ms returned []
[2024-05-27 22:29:19] [INFO ] Flow matrix only has 1422 transitions (discarded 20 similar events)
[2024-05-27 22:29:19] [INFO ] Invariant cache hit.
[2024-05-27 22:29:20] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:29:26] [INFO ] Implicit Places using invariants and state equation in 6503 ms returned []
Implicit Place search using SMT with State Equation took 7083 ms to find 0 implicit places.
[2024-05-27 22:29:26] [INFO ] Redundant transitions in 124 ms returned []
Running 1440 sub problems to find dead transitions.
[2024-05-27 22:29:26] [INFO ] Flow matrix only has 1422 transitions (discarded 20 similar events)
[2024-05-27 22:29:26] [INFO ] Invariant cache hit.
[2024-05-27 22:29:26] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
[2024-05-27 22:29:42] [INFO ] Deduced a trap composed of 67 places in 215 ms of which 5 ms to minimize.
[2024-05-27 22:29:42] [INFO ] Deduced a trap composed of 53 places in 156 ms of which 3 ms to minimize.
[2024-05-27 22:29:42] [INFO ] Deduced a trap composed of 53 places in 139 ms of which 3 ms to minimize.
[2024-05-27 22:29:42] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 3 ms to minimize.
[2024-05-27 22:29:42] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 2 ms to minimize.
[2024-05-27 22:29:42] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 2 ms to minimize.
[2024-05-27 22:29:42] [INFO ] Deduced a trap composed of 53 places in 45 ms of which 1 ms to minimize.
[2024-05-27 22:29:42] [INFO ] Deduced a trap composed of 53 places in 29 ms of which 1 ms to minimize.
[2024-05-27 22:29:43] [INFO ] Deduced a trap composed of 53 places in 32 ms of which 1 ms to minimize.
[2024-05-27 22:29:43] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 1 ms to minimize.
[2024-05-27 22:29:43] [INFO ] Deduced a trap composed of 320 places in 361 ms of which 4 ms to minimize.
[2024-05-27 22:29:43] [INFO ] Deduced a trap composed of 347 places in 273 ms of which 3 ms to minimize.
[2024-05-27 22:29:44] [INFO ] Deduced a trap composed of 286 places in 267 ms of which 3 ms to minimize.
[2024-05-27 22:29:44] [INFO ] Deduced a trap composed of 286 places in 246 ms of which 3 ms to minimize.
[2024-05-27 22:29:44] [INFO ] Deduced a trap composed of 342 places in 310 ms of which 5 ms to minimize.
[2024-05-27 22:29:45] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/2044 variables, and 60 constraints, problems are : Problem set: 0 solved, 1440 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/622 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1440/1440 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1440 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
[2024-05-27 22:30:03] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-27 22:30:21] [INFO ] Deduced a trap composed of 288 places in 294 ms of which 4 ms to minimize.
[2024-05-27 22:30:21] [INFO ] Deduced a trap composed of 288 places in 249 ms of which 3 ms to minimize.
[2024-05-27 22:30:22] [INFO ] Deduced a trap composed of 266 places in 240 ms of which 3 ms to minimize.
[2024-05-27 22:30:23] [INFO ] Deduced a trap composed of 251 places in 259 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/620 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 620/2044 variables, and 65 constraints, problems are : Problem set: 0 solved, 1440 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/622 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1440 constraints, Known Traps: 21/21 constraints]
After SMT, in 62404ms problems are : Problem set: 0 solved, 1440 unsolved
Search for dead transitions found 0 dead transitions in 62420ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 111943 ms. Remains : 622/622 places, 1442/1442 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 99 steps (0 resets) in 4 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2427 reset in 531 ms.
Product exploration explored 100000 steps with 2447 reset in 431 ms.
Support contains 71 out of 622 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 622/622 places, 1442/1442 transitions.
Applied a total of 0 rules in 21 ms. Remains 622 /622 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Running 1440 sub problems to find dead transitions.
[2024-05-27 22:30:30] [INFO ] Flow matrix only has 1422 transitions (discarded 20 similar events)
[2024-05-27 22:30:30] [INFO ] Invariant cache hit.
[2024-05-27 22:30:30] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
[2024-05-27 22:30:46] [INFO ] Deduced a trap composed of 67 places in 207 ms of which 3 ms to minimize.
[2024-05-27 22:30:47] [INFO ] Deduced a trap composed of 53 places in 169 ms of which 2 ms to minimize.
[2024-05-27 22:30:47] [INFO ] Deduced a trap composed of 53 places in 142 ms of which 3 ms to minimize.
[2024-05-27 22:30:47] [INFO ] Deduced a trap composed of 53 places in 118 ms of which 3 ms to minimize.
[2024-05-27 22:30:47] [INFO ] Deduced a trap composed of 53 places in 98 ms of which 2 ms to minimize.
[2024-05-27 22:30:47] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 1 ms to minimize.
[2024-05-27 22:30:47] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 2 ms to minimize.
[2024-05-27 22:30:47] [INFO ] Deduced a trap composed of 53 places in 35 ms of which 0 ms to minimize.
[2024-05-27 22:30:47] [INFO ] Deduced a trap composed of 53 places in 33 ms of which 1 ms to minimize.
[2024-05-27 22:30:47] [INFO ] Deduced a trap composed of 53 places in 34 ms of which 1 ms to minimize.
[2024-05-27 22:30:48] [INFO ] Deduced a trap composed of 320 places in 362 ms of which 4 ms to minimize.
[2024-05-27 22:30:48] [INFO ] Deduced a trap composed of 347 places in 283 ms of which 4 ms to minimize.
[2024-05-27 22:30:48] [INFO ] Deduced a trap composed of 286 places in 291 ms of which 5 ms to minimize.
[2024-05-27 22:30:49] [INFO ] Deduced a trap composed of 286 places in 258 ms of which 4 ms to minimize.
[2024-05-27 22:30:49] [INFO ] Deduced a trap composed of 342 places in 245 ms of which 3 ms to minimize.
[2024-05-27 22:30:49] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/2044 variables, and 60 constraints, problems are : Problem set: 0 solved, 1440 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/622 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1440/1440 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1440 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
[2024-05-27 22:30:57] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 620/2044 variables, and 61 constraints, problems are : Problem set: 0 solved, 1440 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/622 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1440 constraints, Known Traps: 17/17 constraints]
After SMT, in 42919ms problems are : Problem set: 0 solved, 1440 unsolved
Search for dead transitions found 0 dead transitions in 42932ms
[2024-05-27 22:31:13] [INFO ] Flow matrix only has 1422 transitions (discarded 20 similar events)
[2024-05-27 22:31:13] [INFO ] Invariant cache hit.
[2024-05-27 22:31:13] [INFO ] Implicit Places using invariants in 436 ms returned []
[2024-05-27 22:31:13] [INFO ] Flow matrix only has 1422 transitions (discarded 20 similar events)
[2024-05-27 22:31:13] [INFO ] Invariant cache hit.
[2024-05-27 22:31:14] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:31:20] [INFO ] Implicit Places using invariants and state equation in 6394 ms returned []
Implicit Place search using SMT with State Equation took 6832 ms to find 0 implicit places.
[2024-05-27 22:31:20] [INFO ] Redundant transitions in 43 ms returned []
Running 1440 sub problems to find dead transitions.
[2024-05-27 22:31:20] [INFO ] Flow matrix only has 1422 transitions (discarded 20 similar events)
[2024-05-27 22:31:20] [INFO ] Invariant cache hit.
[2024-05-27 22:31:20] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
[2024-05-27 22:31:36] [INFO ] Deduced a trap composed of 67 places in 234 ms of which 3 ms to minimize.
[2024-05-27 22:31:36] [INFO ] Deduced a trap composed of 53 places in 157 ms of which 3 ms to minimize.
[2024-05-27 22:31:36] [INFO ] Deduced a trap composed of 53 places in 127 ms of which 2 ms to minimize.
[2024-05-27 22:31:36] [INFO ] Deduced a trap composed of 53 places in 108 ms of which 2 ms to minimize.
[2024-05-27 22:31:36] [INFO ] Deduced a trap composed of 53 places in 87 ms of which 2 ms to minimize.
[2024-05-27 22:31:36] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 2 ms to minimize.
[2024-05-27 22:31:36] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 2 ms to minimize.
[2024-05-27 22:31:36] [INFO ] Deduced a trap composed of 53 places in 32 ms of which 1 ms to minimize.
[2024-05-27 22:31:37] [INFO ] Deduced a trap composed of 53 places in 36 ms of which 1 ms to minimize.
[2024-05-27 22:31:37] [INFO ] Deduced a trap composed of 53 places in 34 ms of which 1 ms to minimize.
[2024-05-27 22:31:37] [INFO ] Deduced a trap composed of 320 places in 344 ms of which 4 ms to minimize.
[2024-05-27 22:31:37] [INFO ] Deduced a trap composed of 347 places in 289 ms of which 4 ms to minimize.
[2024-05-27 22:31:38] [INFO ] Deduced a trap composed of 286 places in 291 ms of which 4 ms to minimize.
[2024-05-27 22:31:38] [INFO ] Deduced a trap composed of 286 places in 248 ms of which 3 ms to minimize.
[2024-05-27 22:31:38] [INFO ] Deduced a trap composed of 342 places in 281 ms of which 5 ms to minimize.
[2024-05-27 22:31:39] [INFO ] Deduced a trap composed of 53 places in 34 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/2044 variables, and 60 constraints, problems are : Problem set: 0 solved, 1440 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/622 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1440/1440 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1440 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
[2024-05-27 22:31:56] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-27 22:32:16] [INFO ] Deduced a trap composed of 288 places in 337 ms of which 5 ms to minimize.
[2024-05-27 22:32:16] [INFO ] Deduced a trap composed of 288 places in 279 ms of which 3 ms to minimize.
[2024-05-27 22:32:17] [INFO ] Deduced a trap composed of 266 places in 303 ms of which 4 ms to minimize.
[2024-05-27 22:32:18] [INFO ] Deduced a trap composed of 251 places in 269 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/620 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 1440 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 620/2044 variables, and 65 constraints, problems are : Problem set: 0 solved, 1440 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/622 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1440 constraints, Known Traps: 21/21 constraints]
After SMT, in 62223ms problems are : Problem set: 0 solved, 1440 unsolved
Search for dead transitions found 0 dead transitions in 62242ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 112083 ms. Remains : 622/622 places, 1442/1442 transitions.
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-07 finished in 339583 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U p1))'
Support contains 15 out of 812 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 812 transition count 1562
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 742 transition count 1562
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 140 place count 742 transition count 1462
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 340 place count 642 transition count 1462
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 440 place count 592 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 450 place count 582 transition count 1402
Iterating global reduction 2 with 10 rules applied. Total rules applied 460 place count 582 transition count 1402
Applied a total of 460 rules in 56 ms. Remains 582 /812 variables (removed 230) and now considering 1402/1632 (removed 230) transitions.
Running 1400 sub problems to find dead transitions.
[2024-05-27 22:32:22] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
// Phase 1: matrix 1382 rows 582 cols
[2024-05-27 22:32:22] [INFO ] Computed 46 invariants in 22 ms
[2024-05-27 22:32:22] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-05-27 22:32:38] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 2 ms to minimize.
[2024-05-27 22:32:38] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 1 ms to minimize.
[2024-05-27 22:32:38] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
[2024-05-27 22:32:38] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 1 ms to minimize.
[2024-05-27 22:32:38] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 0 ms to minimize.
[2024-05-27 22:32:38] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 0 ms to minimize.
[2024-05-27 22:32:38] [INFO ] Deduced a trap composed of 49 places in 35 ms of which 0 ms to minimize.
[2024-05-27 22:32:38] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 0 ms to minimize.
[2024-05-27 22:32:38] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 0 ms to minimize.
[2024-05-27 22:32:39] [INFO ] Deduced a trap composed of 247 places in 287 ms of which 4 ms to minimize.
[2024-05-27 22:32:39] [INFO ] Deduced a trap composed of 216 places in 296 ms of which 4 ms to minimize.
[2024-05-27 22:32:40] [INFO ] Deduced a trap composed of 254 places in 292 ms of which 3 ms to minimize.
[2024-05-27 22:32:42] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/1964 variables, and 57 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/580 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-05-27 22:32:46] [INFO ] Deduced a trap composed of 49 places in 156 ms of which 3 ms to minimize.
[2024-05-27 22:32:47] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 3 ms to minimize.
[2024-05-27 22:32:58] [INFO ] Deduced a trap composed of 216 places in 323 ms of which 4 ms to minimize.
[2024-05-27 22:33:00] [INFO ] Deduced a trap composed of 199 places in 296 ms of which 4 ms to minimize.
[2024-05-27 22:33:00] [INFO ] Deduced a trap composed of 74 places in 242 ms of which 4 ms to minimize.
[2024-05-27 22:33:00] [INFO ] Deduced a trap composed of 113 places in 217 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/1964 variables, and 63 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 19/19 constraints]
After SMT, in 42157ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 42169ms
[2024-05-27 22:33:04] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-27 22:33:04] [INFO ] Invariant cache hit.
[2024-05-27 22:33:05] [INFO ] Implicit Places using invariants in 503 ms returned []
[2024-05-27 22:33:05] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-27 22:33:05] [INFO ] Invariant cache hit.
[2024-05-27 22:33:05] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:33:13] [INFO ] Implicit Places using invariants and state equation in 8424 ms returned []
Implicit Place search using SMT with State Equation took 8927 ms to find 0 implicit places.
[2024-05-27 22:33:13] [INFO ] Redundant transitions in 13 ms returned []
Running 1400 sub problems to find dead transitions.
[2024-05-27 22:33:13] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2024-05-27 22:33:13] [INFO ] Invariant cache hit.
[2024-05-27 22:33:13] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-05-27 22:33:29] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 1 ms to minimize.
[2024-05-27 22:33:29] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 0 ms to minimize.
[2024-05-27 22:33:29] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:33:29] [INFO ] Deduced a trap composed of 49 places in 34 ms of which 0 ms to minimize.
[2024-05-27 22:33:29] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 0 ms to minimize.
[2024-05-27 22:33:29] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 1 ms to minimize.
[2024-05-27 22:33:29] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
[2024-05-27 22:33:29] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 0 ms to minimize.
[2024-05-27 22:33:29] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 0 ms to minimize.
[2024-05-27 22:33:30] [INFO ] Deduced a trap composed of 207 places in 316 ms of which 4 ms to minimize.
[2024-05-27 22:33:30] [INFO ] Deduced a trap composed of 216 places in 312 ms of which 4 ms to minimize.
[2024-05-27 22:33:31] [INFO ] Deduced a trap composed of 250 places in 272 ms of which 4 ms to minimize.
[2024-05-27 22:33:31] [INFO ] Deduced a trap composed of 237 places in 298 ms of which 4 ms to minimize.
[2024-05-27 22:33:32] [INFO ] Deduced a trap composed of 49 places in 28 ms of which 0 ms to minimize.
[2024-05-27 22:33:41] [INFO ] Deduced a trap composed of 216 places in 299 ms of which 4 ms to minimize.
[2024-05-27 22:33:43] [INFO ] Deduced a trap composed of 200 places in 271 ms of which 4 ms to minimize.
[2024-05-27 22:33:43] [INFO ] Deduced a trap composed of 92 places in 259 ms of which 4 ms to minimize.
[2024-05-27 22:33:43] [INFO ] Deduced a trap composed of 111 places in 193 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/1964 variables, and 62 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/580 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
[2024-05-27 22:33:50] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 2 ms to minimize.
[2024-05-27 22:33:54] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/1964 variables, and 64 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 20/20 constraints]
After SMT, in 62320ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 62332ms
Starting structural reductions in SI_LTL mode, iteration 1 : 582/812 places, 1402/1632 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113510 ms. Remains : 582/812 places, 1402/1632 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 33 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-08 finished in 113632 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 30 out of 812 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 812 transition count 1602
Reduce places removed 30 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 40 rules applied. Total rules applied 70 place count 782 transition count 1592
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 80 place count 772 transition count 1592
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 80 place count 772 transition count 1482
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 300 place count 662 transition count 1482
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 440 place count 592 transition count 1412
Applied a total of 440 rules in 83 ms. Remains 592 /812 variables (removed 220) and now considering 1412/1632 (removed 220) transitions.
Running 1410 sub problems to find dead transitions.
[2024-05-27 22:34:16] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 592 cols
[2024-05-27 22:34:16] [INFO ] Computed 46 invariants in 25 ms
[2024-05-27 22:34:16] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-27 22:34:30] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-05-27 22:34:30] [INFO ] Deduced a trap composed of 50 places in 44 ms of which 1 ms to minimize.
[2024-05-27 22:34:30] [INFO ] Deduced a trap composed of 50 places in 31 ms of which 1 ms to minimize.
[2024-05-27 22:34:30] [INFO ] Deduced a trap composed of 50 places in 35 ms of which 1 ms to minimize.
[2024-05-27 22:34:30] [INFO ] Deduced a trap composed of 50 places in 31 ms of which 1 ms to minimize.
[2024-05-27 22:34:30] [INFO ] Deduced a trap composed of 50 places in 30 ms of which 1 ms to minimize.
[2024-05-27 22:34:30] [INFO ] Deduced a trap composed of 50 places in 30 ms of which 0 ms to minimize.
[2024-05-27 22:34:30] [INFO ] Deduced a trap composed of 50 places in 30 ms of which 0 ms to minimize.
[2024-05-27 22:34:30] [INFO ] Deduced a trap composed of 50 places in 29 ms of which 0 ms to minimize.
[2024-05-27 22:34:31] [INFO ] Deduced a trap composed of 271 places in 229 ms of which 3 ms to minimize.
[2024-05-27 22:34:31] [INFO ] Deduced a trap composed of 243 places in 234 ms of which 4 ms to minimize.
[2024-05-27 22:34:31] [INFO ] Deduced a trap composed of 266 places in 246 ms of which 3 ms to minimize.
[2024-05-27 22:34:31] [INFO ] Deduced a trap composed of 244 places in 244 ms of which 3 ms to minimize.
[2024-05-27 22:34:32] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 590/1984 variables, and 58 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-27 22:34:49] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 3)
(s1 7)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 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 1)
(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 0)
(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 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 9)
(s223 0)
(s224 1)
(s225 1)
(s226 0)
(s227 0)
(s228 1)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 1)
(s235 1)
(s236 0)
(s237 1)
(s238 0)
(s239 1)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 1)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 1)
(s327 0)
(s328 1)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s377 1)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 590/1984 variables, and 59 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 15/15 constraints]
After SMT, in 42494ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 42509ms
[2024-05-27 22:34:58] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-27 22:34:58] [INFO ] Invariant cache hit.
[2024-05-27 22:34:59] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-05-27 22:34:59] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-27 22:34:59] [INFO ] Invariant cache hit.
[2024-05-27 22:34:59] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:35:08] [INFO ] Implicit Places using invariants and state equation in 9249 ms returned []
Implicit Place search using SMT with State Equation took 9702 ms to find 0 implicit places.
[2024-05-27 22:35:08] [INFO ] Redundant transitions in 13 ms returned []
Running 1410 sub problems to find dead transitions.
[2024-05-27 22:35:08] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-27 22:35:08] [INFO ] Invariant cache hit.
[2024-05-27 22:35:08] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-27 22:35:24] [INFO ] Deduced a trap composed of 50 places in 138 ms of which 3 ms to minimize.
[2024-05-27 22:35:24] [INFO ] Deduced a trap composed of 50 places in 148 ms of which 2 ms to minimize.
[2024-05-27 22:35:24] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 2 ms to minimize.
[2024-05-27 22:35:24] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2024-05-27 22:35:24] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2024-05-27 22:35:24] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:35:24] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 1 ms to minimize.
[2024-05-27 22:35:24] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 0 ms to minimize.
[2024-05-27 22:35:24] [INFO ] Deduced a trap composed of 50 places in 35 ms of which 1 ms to minimize.
[2024-05-27 22:35:25] [INFO ] Deduced a trap composed of 225 places in 289 ms of which 4 ms to minimize.
[2024-05-27 22:35:25] [INFO ] Deduced a trap composed of 239 places in 302 ms of which 4 ms to minimize.
[2024-05-27 22:35:26] [INFO ] Deduced a trap composed of 235 places in 310 ms of which 4 ms to minimize.
[2024-05-27 22:35:26] [INFO ] Deduced a trap composed of 256 places in 262 ms of which 4 ms to minimize.
[2024-05-27 22:35:26] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 6.0)
(s1 4.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.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 1.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 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 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 9.0)
(s223 1.0)
(s224 0.0)
(s225 1.0)
(s226 1.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 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(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 1.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 1.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 1.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 1.0)
(s401 0.0)
(s402 1.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 4.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 1.0)
(s441 1.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 1.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 1.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 590/1984 variables, and 58 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-27 22:35:51] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 3 ms to minimize.
[2024-05-27 22:35:51] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 2 ms to minimize.
[2024-05-27 22:35:51] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 2 ms to minimize.
[2024-05-27 22:35:56] [INFO ] Deduced a trap composed of 58 places in 156 ms of which 3 ms to minimize.
[2024-05-27 22:36:03] [INFO ] Deduced a trap composed of 225 places in 290 ms of which 4 ms to minimize.
[2024-05-27 22:36:04] [INFO ] Deduced a trap composed of 209 places in 312 ms of which 4 ms to minimize.
[2024-05-27 22:36:04] [INFO ] Deduced a trap composed of 264 places in 319 ms of which 3 ms to minimize.
[2024-05-27 22:36:05] [INFO ] Deduced a trap composed of 216 places in 299 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/590 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 590/1984 variables, and 66 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 22/22 constraints]
After SMT, in 62432ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 62444ms
Starting structural reductions in SI_LTL mode, iteration 1 : 592/812 places, 1412/1632 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 114763 ms. Remains : 592/812 places, 1412/1632 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-10
Product exploration explored 100000 steps with 5321 reset in 413 ms.
Product exploration explored 100000 steps with 5295 reset in 374 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 132 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 419 steps (0 resets) in 18 ms. (22 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 312 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-27 22:36:12] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-27 22:36:12] [INFO ] Invariant cache hit.
[2024-05-27 22:36:13] [INFO ] [Real]Absence check using 14 positive place invariants in 68 ms returned sat
[2024-05-27 22:36:13] [INFO ] [Real]Absence check using 14 positive and 32 generalized place invariants in 220 ms returned sat
[2024-05-27 22:36:16] [INFO ] [Real]Absence check using state equation in 2502 ms returned sat
[2024-05-27 22:36:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:36:17] [INFO ] [Nat]Absence check using 14 positive place invariants in 21 ms returned sat
[2024-05-27 22:36:17] [INFO ] [Nat]Absence check using 14 positive and 32 generalized place invariants in 104 ms returned sat
[2024-05-27 22:36:19] [INFO ] [Nat]Absence check using state equation in 2376 ms returned sat
[2024-05-27 22:36:19] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:36:20] [INFO ] [Nat]Added 120 Read/Feed constraints in 847 ms returned sat
[2024-05-27 22:36:20] [INFO ] Deduced a trap composed of 37 places in 314 ms of which 3 ms to minimize.
[2024-05-27 22:36:21] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-05-27 22:36:21] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 1 ms to minimize.
[2024-05-27 22:36:21] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 1 ms to minimize.
[2024-05-27 22:36:22] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-05-27 22:36:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1821 ms
[2024-05-27 22:36:22] [INFO ] Computed and/alt/rep : 450/978/440 causal constraints (skipped 950 transitions) in 166 ms.
[2024-05-27 22:36:25] [INFO ] Added : 124 causal constraints over 25 iterations in 3601 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 30 out of 592 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 592/592 places, 1412/1412 transitions.
Applied a total of 0 rules in 25 ms. Remains 592 /592 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
Running 1410 sub problems to find dead transitions.
[2024-05-27 22:36:25] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-27 22:36:25] [INFO ] Invariant cache hit.
[2024-05-27 22:36:25] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-27 22:36:41] [INFO ] Deduced a trap composed of 50 places in 177 ms of which 3 ms to minimize.
[2024-05-27 22:36:41] [INFO ] Deduced a trap composed of 50 places in 131 ms of which 2 ms to minimize.
[2024-05-27 22:36:41] [INFO ] Deduced a trap composed of 50 places in 114 ms of which 2 ms to minimize.
[2024-05-27 22:36:41] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 2 ms to minimize.
[2024-05-27 22:36:42] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
[2024-05-27 22:36:42] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-05-27 22:36:42] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 1 ms to minimize.
[2024-05-27 22:36:42] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 0 ms to minimize.
[2024-05-27 22:36:42] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 1 ms to minimize.
[2024-05-27 22:36:42] [INFO ] Deduced a trap composed of 225 places in 317 ms of which 5 ms to minimize.
[2024-05-27 22:36:43] [INFO ] Deduced a trap composed of 239 places in 328 ms of which 4 ms to minimize.
[2024-05-27 22:36:43] [INFO ] Deduced a trap composed of 235 places in 330 ms of which 4 ms to minimize.
[2024-05-27 22:36:44] [INFO ] Deduced a trap composed of 256 places in 324 ms of which 3 ms to minimize.
[2024-05-27 22:36:44] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 590/1984 variables, and 58 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-27 22:36:59] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 3 ms to minimize.
[2024-05-27 22:36:59] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 2 ms to minimize.
[2024-05-27 22:36:59] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 2 ms to minimize.
[2024-05-27 22:37:04] [INFO ] Deduced a trap composed of 58 places in 181 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 590/1984 variables, and 62 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 18/18 constraints]
After SMT, in 42457ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 42475ms
[2024-05-27 22:37:08] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-27 22:37:08] [INFO ] Invariant cache hit.
[2024-05-27 22:37:08] [INFO ] Implicit Places using invariants in 413 ms returned []
[2024-05-27 22:37:08] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-27 22:37:08] [INFO ] Invariant cache hit.
[2024-05-27 22:37:09] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:37:17] [INFO ] Implicit Places using invariants and state equation in 8923 ms returned []
Implicit Place search using SMT with State Equation took 9344 ms to find 0 implicit places.
[2024-05-27 22:37:17] [INFO ] Redundant transitions in 33 ms returned []
Running 1410 sub problems to find dead transitions.
[2024-05-27 22:37:17] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-27 22:37:17] [INFO ] Invariant cache hit.
[2024-05-27 22:37:17] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-27 22:37:33] [INFO ] Deduced a trap composed of 50 places in 170 ms of which 3 ms to minimize.
[2024-05-27 22:37:33] [INFO ] Deduced a trap composed of 50 places in 123 ms of which 3 ms to minimize.
[2024-05-27 22:37:33] [INFO ] Deduced a trap composed of 50 places in 108 ms of which 2 ms to minimize.
[2024-05-27 22:37:33] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 2 ms to minimize.
[2024-05-27 22:37:33] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 2 ms to minimize.
[2024-05-27 22:37:34] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
[2024-05-27 22:37:34] [INFO ] Deduced a trap composed of 50 places in 33 ms of which 1 ms to minimize.
[2024-05-27 22:37:34] [INFO ] Deduced a trap composed of 50 places in 31 ms of which 0 ms to minimize.
[2024-05-27 22:37:34] [INFO ] Deduced a trap composed of 50 places in 29 ms of which 0 ms to minimize.
[2024-05-27 22:37:34] [INFO ] Deduced a trap composed of 225 places in 268 ms of which 4 ms to minimize.
[2024-05-27 22:37:34] [INFO ] Deduced a trap composed of 239 places in 245 ms of which 3 ms to minimize.
[2024-05-27 22:37:35] [INFO ] Deduced a trap composed of 235 places in 234 ms of which 3 ms to minimize.
[2024-05-27 22:37:35] [INFO ] Deduced a trap composed of 256 places in 239 ms of which 4 ms to minimize.
[2024-05-27 22:37:35] [INFO ] Deduced a trap composed of 50 places in 29 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 (/ 29.0 4.0))
(s1 (/ 11.0 4.0))
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 (/ 5.0 4.0))
(s8 0.0)
(s9 0.0)
(s10 1.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 1.0)
(s103 1.0)
(s104 1.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 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 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 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 9.0)
(s223 1.0)
(s224 0.0)
(s225 1.0)
(s226 1.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 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(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 1.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 (/ 1.0 4.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 1.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 1.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 3.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 1.0)
(s441 0.0)
(s442 1.0)
(s443 1.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 (/ 1.0 4.0))
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 (/ 5.0 2.0))
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 1.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 1.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 590/1984 variables, and 58 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-27 22:38:00] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 3 ms to minimize.
[2024-05-27 22:38:00] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 3 ms to minimize.
[2024-05-27 22:38:00] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 2 ms to minimize.
[2024-05-27 22:38:06] [INFO ] Deduced a trap composed of 58 places in 162 ms of which 2 ms to minimize.
[2024-05-27 22:38:14] [INFO ] Deduced a trap composed of 225 places in 279 ms of which 4 ms to minimize.
[2024-05-27 22:38:15] [INFO ] Deduced a trap composed of 209 places in 298 ms of which 4 ms to minimize.
[2024-05-27 22:38:15] [INFO ] Deduced a trap composed of 264 places in 289 ms of which 4 ms to minimize.
[2024-05-27 22:38:16] [INFO ] Deduced a trap composed of 216 places in 293 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/590 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 590/1984 variables, and 66 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 22/22 constraints]
After SMT, in 62439ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 62460ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 114359 ms. Remains : 592/592 places, 1412/1412 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 120 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 540 steps (0 resets) in 12 ms. (41 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 228 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-27 22:38:20] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-27 22:38:20] [INFO ] Invariant cache hit.
[2024-05-27 22:38:21] [INFO ] [Real]Absence check using 14 positive place invariants in 69 ms returned sat
[2024-05-27 22:38:21] [INFO ] [Real]Absence check using 14 positive and 32 generalized place invariants in 195 ms returned sat
[2024-05-27 22:38:24] [INFO ] [Real]Absence check using state equation in 2327 ms returned sat
[2024-05-27 22:38:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:38:25] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2024-05-27 22:38:25] [INFO ] [Nat]Absence check using 14 positive and 32 generalized place invariants in 101 ms returned sat
[2024-05-27 22:38:27] [INFO ] [Nat]Absence check using state equation in 2636 ms returned sat
[2024-05-27 22:38:27] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:38:28] [INFO ] [Nat]Added 120 Read/Feed constraints in 849 ms returned sat
[2024-05-27 22:38:29] [INFO ] Deduced a trap composed of 37 places in 300 ms of which 4 ms to minimize.
[2024-05-27 22:38:29] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-05-27 22:38:29] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-05-27 22:38:29] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-05-27 22:38:30] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-05-27 22:38:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1828 ms
[2024-05-27 22:38:30] [INFO ] Computed and/alt/rep : 450/978/440 causal constraints (skipped 950 transitions) in 116 ms.
[2024-05-27 22:38:34] [INFO ] Added : 124 causal constraints over 25 iterations in 3474 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5301 reset in 594 ms.
Product exploration explored 100000 steps with 5284 reset in 514 ms.
Support contains 30 out of 592 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 592/592 places, 1412/1412 transitions.
Applied a total of 0 rules in 19 ms. Remains 592 /592 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
Running 1410 sub problems to find dead transitions.
[2024-05-27 22:38:35] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-27 22:38:35] [INFO ] Invariant cache hit.
[2024-05-27 22:38:35] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-27 22:38:49] [INFO ] Deduced a trap composed of 50 places in 132 ms of which 2 ms to minimize.
[2024-05-27 22:38:50] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 6 ms to minimize.
[2024-05-27 22:38:50] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2024-05-27 22:38:50] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-05-27 22:38:50] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
[2024-05-27 22:38:50] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-05-27 22:38:50] [INFO ] Deduced a trap composed of 50 places in 32 ms of which 0 ms to minimize.
[2024-05-27 22:38:50] [INFO ] Deduced a trap composed of 50 places in 34 ms of which 1 ms to minimize.
[2024-05-27 22:38:50] [INFO ] Deduced a trap composed of 50 places in 33 ms of which 1 ms to minimize.
[2024-05-27 22:38:50] [INFO ] Deduced a trap composed of 225 places in 236 ms of which 3 ms to minimize.
[2024-05-27 22:38:51] [INFO ] Deduced a trap composed of 239 places in 226 ms of which 3 ms to minimize.
[2024-05-27 22:38:51] [INFO ] Deduced a trap composed of 235 places in 269 ms of which 3 ms to minimize.
[2024-05-27 22:38:51] [INFO ] Deduced a trap composed of 256 places in 233 ms of which 3 ms to minimize.
[2024-05-27 22:38:52] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 590/1984 variables, and 58 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-27 22:39:09] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 3 ms to minimize.
[2024-05-27 22:39:09] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 3 ms to minimize.
[2024-05-27 22:39:09] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 3 ms to minimize.
[2024-05-27 22:39:15] [INFO ] Deduced a trap composed of 58 places in 160 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(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 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 9)
(s223 1)
(s224 0)
(s225 1)
(s226 1)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 1)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 1)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 1)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 590/1984 variables, and 62 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 18/18 constraints]
After SMT, in 42598ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 42610ms
[2024-05-27 22:39:17] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-27 22:39:17] [INFO ] Invariant cache hit.
[2024-05-27 22:39:18] [INFO ] Implicit Places using invariants in 463 ms returned []
[2024-05-27 22:39:18] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-27 22:39:18] [INFO ] Invariant cache hit.
[2024-05-27 22:39:19] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:39:27] [INFO ] Implicit Places using invariants and state equation in 8889 ms returned []
Implicit Place search using SMT with State Equation took 9352 ms to find 0 implicit places.
[2024-05-27 22:39:27] [INFO ] Redundant transitions in 14 ms returned []
Running 1410 sub problems to find dead transitions.
[2024-05-27 22:39:27] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-27 22:39:27] [INFO ] Invariant cache hit.
[2024-05-27 22:39:27] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-27 22:39:42] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 2 ms to minimize.
[2024-05-27 22:39:42] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 2 ms to minimize.
[2024-05-27 22:39:42] [INFO ] Deduced a trap composed of 50 places in 116 ms of which 1 ms to minimize.
[2024-05-27 22:39:42] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 2 ms to minimize.
[2024-05-27 22:39:42] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 1 ms to minimize.
[2024-05-27 22:39:43] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-05-27 22:39:43] [INFO ] Deduced a trap composed of 50 places in 34 ms of which 1 ms to minimize.
[2024-05-27 22:39:43] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 1 ms to minimize.
[2024-05-27 22:39:43] [INFO ] Deduced a trap composed of 50 places in 33 ms of which 1 ms to minimize.
[2024-05-27 22:39:43] [INFO ] Deduced a trap composed of 225 places in 306 ms of which 4 ms to minimize.
[2024-05-27 22:39:44] [INFO ] Deduced a trap composed of 239 places in 249 ms of which 3 ms to minimize.
[2024-05-27 22:39:44] [INFO ] Deduced a trap composed of 235 places in 244 ms of which 3 ms to minimize.
[2024-05-27 22:39:44] [INFO ] Deduced a trap composed of 256 places in 279 ms of which 4 ms to minimize.
[2024-05-27 22:39:44] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 590/1984 variables, and 58 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-27 22:40:11] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 2 ms to minimize.
[2024-05-27 22:40:11] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 3 ms to minimize.
[2024-05-27 22:40:12] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 2 ms to minimize.
[2024-05-27 22:40:17] [INFO ] Deduced a trap composed of 58 places in 121 ms of which 2 ms to minimize.
[2024-05-27 22:40:25] [INFO ] Deduced a trap composed of 225 places in 325 ms of which 4 ms to minimize.
[2024-05-27 22:40:26] [INFO ] Deduced a trap composed of 209 places in 293 ms of which 5 ms to minimize.
[2024-05-27 22:40:27] [INFO ] Deduced a trap composed of 264 places in 322 ms of which 4 ms to minimize.
[2024-05-27 22:40:28] [INFO ] Deduced a trap composed of 216 places in 299 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/590 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 590/1984 variables, and 66 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 22/22 constraints]
After SMT, in 62758ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 62771ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 114779 ms. Remains : 592/592 places, 1412/1412 transitions.
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-10 finished in 373961 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 112 out of 812 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 812 transition count 1562
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 742 transition count 1562
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 140 place count 742 transition count 1552
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 160 place count 732 transition count 1552
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 320 place count 652 transition count 1472
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 330 place count 642 transition count 1462
Iterating global reduction 2 with 10 rules applied. Total rules applied 340 place count 642 transition count 1462
Applied a total of 340 rules in 69 ms. Remains 642 /812 variables (removed 170) and now considering 1462/1632 (removed 170) transitions.
Running 1460 sub problems to find dead transitions.
[2024-05-27 22:40:30] [INFO ] Flow matrix only has 1442 transitions (discarded 20 similar events)
// Phase 1: matrix 1442 rows 642 cols
[2024-05-27 22:40:30] [INFO ] Computed 46 invariants in 40 ms
[2024-05-27 22:40:30] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-05-27 22:40:47] [INFO ] Deduced a trap composed of 37 places in 207 ms of which 3 ms to minimize.
[2024-05-27 22:40:47] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 2 ms to minimize.
[2024-05-27 22:40:47] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 1 ms to minimize.
[2024-05-27 22:40:47] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 1 ms to minimize.
[2024-05-27 22:40:47] [INFO ] Deduced a trap composed of 55 places in 36 ms of which 1 ms to minimize.
[2024-05-27 22:40:47] [INFO ] Deduced a trap composed of 55 places in 32 ms of which 0 ms to minimize.
[2024-05-27 22:40:47] [INFO ] Deduced a trap composed of 55 places in 34 ms of which 1 ms to minimize.
[2024-05-27 22:40:47] [INFO ] Deduced a trap composed of 55 places in 34 ms of which 1 ms to minimize.
[2024-05-27 22:40:47] [INFO ] Deduced a trap composed of 55 places in 36 ms of which 1 ms to minimize.
[2024-05-27 22:40:47] [INFO ] Deduced a trap composed of 55 places in 38 ms of which 1 ms to minimize.
[2024-05-27 22:40:48] [INFO ] Deduced a trap composed of 311 places in 364 ms of which 4 ms to minimize.
[2024-05-27 22:40:49] [INFO ] Deduced a trap composed of 316 places in 361 ms of which 4 ms to minimize.
[2024-05-27 22:40:49] [INFO ] Deduced a trap composed of 297 places in 369 ms of which 5 ms to minimize.
[2024-05-27 22:40:50] [INFO ] Deduced a trap composed of 358 places in 328 ms of which 4 ms to minimize.
[2024-05-27 22:40:50] [INFO ] Deduced a trap composed of 308 places in 307 ms of which 4 ms to minimize.
[2024-05-27 22:40:50] [INFO ] Deduced a trap composed of 321 places in 290 ms of which 3 ms to minimize.
[2024-05-27 22:40:52] [INFO ] Deduced a trap composed of 367 places in 368 ms of which 5 ms to minimize.
[2024-05-27 22:40:52] [INFO ] Deduced a trap composed of 367 places in 323 ms of which 4 ms to minimize.
[2024-05-27 22:40:53] [INFO ] Deduced a trap composed of 302 places in 282 ms of which 4 ms to minimize.
[2024-05-27 22:40:53] [INFO ] Deduced a trap composed of 23 places in 282 ms of which 3 ms to minimize.
SMT process timed out in 23125ms, After SMT, problems are : Problem set: 0 solved, 1460 unsolved
Search for dead transitions found 0 dead transitions in 23140ms
[2024-05-27 22:40:53] [INFO ] Flow matrix only has 1442 transitions (discarded 20 similar events)
[2024-05-27 22:40:53] [INFO ] Invariant cache hit.
[2024-05-27 22:40:53] [INFO ] Implicit Places using invariants in 472 ms returned []
[2024-05-27 22:40:53] [INFO ] Flow matrix only has 1442 transitions (discarded 20 similar events)
[2024-05-27 22:40:53] [INFO ] Invariant cache hit.
[2024-05-27 22:40:54] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:41:04] [INFO ] Implicit Places using invariants and state equation in 10516 ms returned []
Implicit Place search using SMT with State Equation took 10990 ms to find 0 implicit places.
[2024-05-27 22:41:04] [INFO ] Redundant transitions in 30 ms returned []
Running 1460 sub problems to find dead transitions.
[2024-05-27 22:41:04] [INFO ] Flow matrix only has 1442 transitions (discarded 20 similar events)
[2024-05-27 22:41:04] [INFO ] Invariant cache hit.
[2024-05-27 22:41:04] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-05-27 22:41:22] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 2 ms to minimize.
[2024-05-27 22:41:22] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 2 ms to minimize.
[2024-05-27 22:41:22] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 1 ms to minimize.
[2024-05-27 22:41:22] [INFO ] Deduced a trap composed of 55 places in 38 ms of which 1 ms to minimize.
[2024-05-27 22:41:22] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 1 ms to minimize.
[2024-05-27 22:41:22] [INFO ] Deduced a trap composed of 55 places in 37 ms of which 1 ms to minimize.
[2024-05-27 22:41:22] [INFO ] Deduced a trap composed of 55 places in 36 ms of which 0 ms to minimize.
[2024-05-27 22:41:22] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 1 ms to minimize.
[2024-05-27 22:41:22] [INFO ] Deduced a trap composed of 55 places in 47 ms of which 1 ms to minimize.
[2024-05-27 22:41:23] [INFO ] Deduced a trap composed of 318 places in 362 ms of which 5 ms to minimize.
[2024-05-27 22:41:24] [INFO ] Deduced a trap composed of 344 places in 363 ms of which 4 ms to minimize.
[2024-05-27 22:41:24] [INFO ] Deduced a trap composed of 324 places in 445 ms of which 5 ms to minimize.
[2024-05-27 22:41:24] [INFO ] Deduced a trap composed of 366 places in 348 ms of which 4 ms to minimize.
[2024-05-27 22:41:25] [INFO ] Deduced a trap composed of 391 places in 349 ms of which 5 ms to minimize.
[2024-05-27 22:41:25] [INFO ] Deduced a trap composed of 362 places in 337 ms of which 3 ms to minimize.
[2024-05-27 22:41:25] [INFO ] Deduced a trap composed of 329 places in 294 ms of which 4 ms to minimize.
[2024-05-27 22:41:26] [INFO ] Deduced a trap composed of 302 places in 270 ms of which 3 ms to minimize.
[2024-05-27 22:41:26] [INFO ] Deduced a trap composed of 311 places in 310 ms of which 3 ms to minimize.
[2024-05-27 22:41:26] [INFO ] Deduced a trap composed of 326 places in 299 ms of which 5 ms to minimize.
[2024-05-27 22:41:27] [INFO ] Deduced a trap composed of 67 places in 163 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-05-27 22:41:28] [INFO ] Deduced a trap composed of 55 places in 51 ms of which 1 ms to minimize.
[2024-05-27 22:41:29] [INFO ] Deduced a trap composed of 301 places in 332 ms of which 4 ms to minimize.
[2024-05-27 22:41:29] [INFO ] Deduced a trap composed of 316 places in 298 ms of which 5 ms to minimize.
[2024-05-27 22:41:29] [INFO ] Deduced a trap composed of 307 places in 278 ms of which 4 ms to minimize.
[2024-05-27 22:41:30] [INFO ] Deduced a trap composed of 322 places in 260 ms of which 3 ms to minimize.
[2024-05-27 22:41:30] [INFO ] Deduced a trap composed of 310 places in 261 ms of which 3 ms to minimize.
[2024-05-27 22:41:30] [INFO ] Deduced a trap composed of 362 places in 266 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")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 640/2084 variables, and 71 constraints, problems are : Problem set: 0 solved, 1460 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/642 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1460/1460 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 27/71 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-05-27 22:41:49] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 3 ms to minimize.
[2024-05-27 22:42:02] [INFO ] Deduced a trap composed of 287 places in 257 ms of which 4 ms to minimize.
[2024-05-27 22:42:04] [INFO ] Deduced a trap composed of 267 places in 346 ms of which 5 ms to minimize.
[2024-05-27 22:42:06] [INFO ] Deduced a trap composed of 71 places in 336 ms of which 5 ms to minimize.
[2024-05-27 22:42:07] [INFO ] Deduced a trap composed of 107 places in 336 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 640/2084 variables, and 76 constraints, problems are : Problem set: 0 solved, 1460 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/642 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1460 constraints, Known Traps: 32/32 constraints]
After SMT, in 62751ms problems are : Problem set: 0 solved, 1460 unsolved
Search for dead transitions found 0 dead transitions in 62771ms
Starting structural reductions in SI_LTL mode, iteration 1 : 642/812 places, 1462/1632 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97017 ms. Remains : 642/812 places, 1462/1632 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-11
Product exploration explored 100000 steps with 4126 reset in 487 ms.
Product exploration explored 100000 steps with 4127 reset in 497 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 88 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 31 ms :[(NOT p0)]
RANDOM walk for 90 steps (0 resets) in 5 ms. (15 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 72 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)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-05-27 22:42:08] [INFO ] Flow matrix only has 1442 transitions (discarded 20 similar events)
[2024-05-27 22:42:08] [INFO ] Invariant cache hit.
[2024-05-27 22:42:09] [INFO ] [Real]Absence check using 15 positive place invariants in 47 ms returned sat
[2024-05-27 22:42:09] [INFO ] [Real]Absence check using 15 positive and 31 generalized place invariants in 77 ms returned sat
[2024-05-27 22:42:10] [INFO ] [Real]Absence check using state equation in 927 ms returned sat
[2024-05-27 22:42:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:42:11] [INFO ] [Nat]Absence check using 15 positive place invariants in 15 ms returned sat
[2024-05-27 22:42:11] [INFO ] [Nat]Absence check using 15 positive and 31 generalized place invariants in 265 ms returned sat
[2024-05-27 22:42:13] [INFO ] [Nat]Absence check using state equation in 2057 ms returned sat
[2024-05-27 22:42:13] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:42:14] [INFO ] [Nat]Added 120 Read/Feed constraints in 501 ms returned sat
[2024-05-27 22:42:14] [INFO ] Deduced a trap composed of 308 places in 279 ms of which 4 ms to minimize.
[2024-05-27 22:42:14] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2024-05-27 22:42:15] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 1 ms to minimize.
[2024-05-27 22:42:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1055 ms
[2024-05-27 22:42:15] [INFO ] Computed and/alt/rep : 500/1148/490 causal constraints (skipped 950 transitions) in 106 ms.
[2024-05-27 22:42:18] [INFO ] Added : 96 causal constraints over 20 iterations in 3208 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 112 out of 642 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 642/642 places, 1462/1462 transitions.
Applied a total of 0 rules in 24 ms. Remains 642 /642 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Running 1460 sub problems to find dead transitions.
[2024-05-27 22:42:18] [INFO ] Flow matrix only has 1442 transitions (discarded 20 similar events)
[2024-05-27 22:42:18] [INFO ] Invariant cache hit.
[2024-05-27 22:42:18] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-05-27 22:42:35] [INFO ] Deduced a trap composed of 55 places in 94 ms of which 2 ms to minimize.
[2024-05-27 22:42:35] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 2 ms to minimize.
[2024-05-27 22:42:35] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:42:36] [INFO ] Deduced a trap composed of 55 places in 33 ms of which 1 ms to minimize.
[2024-05-27 22:42:36] [INFO ] Deduced a trap composed of 55 places in 39 ms of which 0 ms to minimize.
[2024-05-27 22:42:36] [INFO ] Deduced a trap composed of 55 places in 39 ms of which 1 ms to minimize.
[2024-05-27 22:42:36] [INFO ] Deduced a trap composed of 55 places in 34 ms of which 1 ms to minimize.
[2024-05-27 22:42:36] [INFO ] Deduced a trap composed of 55 places in 32 ms of which 0 ms to minimize.
[2024-05-27 22:42:36] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 1 ms to minimize.
[2024-05-27 22:42:37] [INFO ] Deduced a trap composed of 318 places in 284 ms of which 4 ms to minimize.
[2024-05-27 22:42:37] [INFO ] Deduced a trap composed of 344 places in 315 ms of which 4 ms to minimize.
[2024-05-27 22:42:37] [INFO ] Deduced a trap composed of 324 places in 305 ms of which 4 ms to minimize.
[2024-05-27 22:42:38] [INFO ] Deduced a trap composed of 366 places in 265 ms of which 3 ms to minimize.
[2024-05-27 22:42:38] [INFO ] Deduced a trap composed of 391 places in 352 ms of which 4 ms to minimize.
[2024-05-27 22:42:38] [INFO ] Deduced a trap composed of 362 places in 302 ms of which 4 ms to minimize.
[2024-05-27 22:42:38] [INFO ] Deduced a trap composed of 329 places in 253 ms of which 3 ms to minimize.
[2024-05-27 22:42:39] [INFO ] Deduced a trap composed of 302 places in 249 ms of which 4 ms to minimize.
[2024-05-27 22:42:39] [INFO ] Deduced a trap composed of 311 places in 251 ms of which 3 ms to minimize.
[2024-05-27 22:42:39] [INFO ] Deduced a trap composed of 326 places in 254 ms of which 3 ms to minimize.
[2024-05-27 22:42:40] [INFO ] Deduced a trap composed of 67 places in 159 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-05-27 22:42:41] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 13 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 640/2084 variables, and 65 constraints, problems are : Problem set: 0 solved, 1460 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/642 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1460/1460 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 21/65 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-05-27 22:42:46] [INFO ] Deduced a trap composed of 44 places in 320 ms of which 4 ms to minimize.
[2024-05-27 22:42:46] [INFO ] Deduced a trap composed of 310 places in 267 ms of which 3 ms to minimize.
[2024-05-27 22:42:53] [INFO ] Deduced a trap composed of 314 places in 366 ms of which 4 ms to minimize.
[2024-05-27 22:42:53] [INFO ] Deduced a trap composed of 44 places in 169 ms of which 2 ms to minimize.
[2024-05-27 22:42:53] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 640/2084 variables, and 70 constraints, problems are : Problem set: 0 solved, 1460 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/642 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1460 constraints, Known Traps: 26/26 constraints]
After SMT, in 42908ms problems are : Problem set: 0 solved, 1460 unsolved
Search for dead transitions found 0 dead transitions in 42923ms
[2024-05-27 22:43:01] [INFO ] Flow matrix only has 1442 transitions (discarded 20 similar events)
[2024-05-27 22:43:01] [INFO ] Invariant cache hit.
[2024-05-27 22:43:01] [INFO ] Implicit Places using invariants in 606 ms returned []
[2024-05-27 22:43:01] [INFO ] Flow matrix only has 1442 transitions (discarded 20 similar events)
[2024-05-27 22:43:01] [INFO ] Invariant cache hit.
[2024-05-27 22:43:02] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:43:12] [INFO ] Implicit Places using invariants and state equation in 10091 ms returned []
Implicit Place search using SMT with State Equation took 10699 ms to find 0 implicit places.
[2024-05-27 22:43:12] [INFO ] Redundant transitions in 14 ms returned []
Running 1460 sub problems to find dead transitions.
[2024-05-27 22:43:12] [INFO ] Flow matrix only has 1442 transitions (discarded 20 similar events)
[2024-05-27 22:43:12] [INFO ] Invariant cache hit.
[2024-05-27 22:43:12] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-05-27 22:43:29] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 1 ms to minimize.
[2024-05-27 22:43:29] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 2 ms to minimize.
[2024-05-27 22:43:29] [INFO ] Deduced a trap composed of 55 places in 47 ms of which 1 ms to minimize.
[2024-05-27 22:43:29] [INFO ] Deduced a trap composed of 55 places in 51 ms of which 1 ms to minimize.
[2024-05-27 22:43:29] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 1 ms to minimize.
[2024-05-27 22:43:29] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 1 ms to minimize.
[2024-05-27 22:43:29] [INFO ] Deduced a trap composed of 55 places in 37 ms of which 1 ms to minimize.
[2024-05-27 22:43:29] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 1 ms to minimize.
[2024-05-27 22:43:30] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 1 ms to minimize.
[2024-05-27 22:43:30] [INFO ] Deduced a trap composed of 318 places in 379 ms of which 5 ms to minimize.
[2024-05-27 22:43:31] [INFO ] Deduced a trap composed of 344 places in 361 ms of which 4 ms to minimize.
[2024-05-27 22:43:31] [INFO ] Deduced a trap composed of 324 places in 318 ms of which 5 ms to minimize.
[2024-05-27 22:43:32] [INFO ] Deduced a trap composed of 366 places in 318 ms of which 4 ms to minimize.
[2024-05-27 22:43:32] [INFO ] Deduced a trap composed of 391 places in 282 ms of which 4 ms to minimize.
[2024-05-27 22:43:32] [INFO ] Deduced a trap composed of 362 places in 343 ms of which 4 ms to minimize.
[2024-05-27 22:43:32] [INFO ] Deduced a trap composed of 329 places in 302 ms of which 5 ms to minimize.
[2024-05-27 22:43:33] [INFO ] Deduced a trap composed of 302 places in 262 ms of which 3 ms to minimize.
[2024-05-27 22:43:33] [INFO ] Deduced a trap composed of 311 places in 258 ms of which 3 ms to minimize.
[2024-05-27 22:43:33] [INFO ] Deduced a trap composed of 326 places in 277 ms of which 3 ms to minimize.
[2024-05-27 22:43:34] [INFO ] Deduced a trap composed of 67 places in 177 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-05-27 22:43:35] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 1 ms to minimize.
[2024-05-27 22:43:36] [INFO ] Deduced a trap composed of 301 places in 365 ms of which 4 ms to minimize.
[2024-05-27 22:43:37] [INFO ] Deduced a trap composed of 316 places in 253 ms of which 3 ms to minimize.
[2024-05-27 22:43:37] [INFO ] Deduced a trap composed of 307 places in 300 ms of which 5 ms to minimize.
[2024-05-27 22:43:37] [INFO ] Deduced a trap composed of 322 places in 273 ms of which 4 ms to minimize.
[2024-05-27 22:43:38] [INFO ] Deduced a trap composed of 310 places in 258 ms of which 4 ms to minimize.
[2024-05-27 22:43:38] [INFO ] Deduced a trap composed of 362 places in 314 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 640/2084 variables, and 71 constraints, problems are : Problem set: 0 solved, 1460 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/642 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1460/1460 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 27/71 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-05-27 22:43:56] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 2 ms to minimize.
[2024-05-27 22:44:12] [INFO ] Deduced a trap composed of 287 places in 306 ms of which 4 ms to minimize.
[2024-05-27 22:44:14] [INFO ] Deduced a trap composed of 267 places in 358 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 640/2084 variables, and 74 constraints, problems are : Problem set: 0 solved, 1460 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/642 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1460 constraints, Known Traps: 30/30 constraints]
After SMT, in 62961ms problems are : Problem set: 0 solved, 1460 unsolved
Search for dead transitions found 0 dead transitions in 62985ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 116663 ms. Remains : 642/642 places, 1462/1462 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 83 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 30 ms :[(NOT p0)]
RANDOM walk for 101 steps (0 resets) in 5 ms. (16 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 122 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 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2024-05-27 22:44:15] [INFO ] Flow matrix only has 1442 transitions (discarded 20 similar events)
[2024-05-27 22:44:15] [INFO ] Invariant cache hit.
[2024-05-27 22:44:16] [INFO ] [Real]Absence check using 15 positive place invariants in 48 ms returned sat
[2024-05-27 22:44:16] [INFO ] [Real]Absence check using 15 positive and 31 generalized place invariants in 143 ms returned sat
[2024-05-27 22:44:17] [INFO ] [Real]Absence check using state equation in 1070 ms returned sat
[2024-05-27 22:44:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:44:18] [INFO ] [Nat]Absence check using 15 positive place invariants in 16 ms returned sat
[2024-05-27 22:44:19] [INFO ] [Nat]Absence check using 15 positive and 31 generalized place invariants in 374 ms returned sat
[2024-05-27 22:44:21] [INFO ] [Nat]Absence check using state equation in 2087 ms returned sat
[2024-05-27 22:44:21] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:44:21] [INFO ] [Nat]Added 120 Read/Feed constraints in 497 ms returned sat
[2024-05-27 22:44:22] [INFO ] Deduced a trap composed of 308 places in 313 ms of which 3 ms to minimize.
[2024-05-27 22:44:22] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2024-05-27 22:44:22] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2024-05-27 22:44:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1167 ms
[2024-05-27 22:44:23] [INFO ] Computed and/alt/rep : 500/1148/490 causal constraints (skipped 950 transitions) in 137 ms.
[2024-05-27 22:44:26] [INFO ] Added : 96 causal constraints over 20 iterations in 3435 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4126 reset in 616 ms.
Product exploration explored 100000 steps with 4119 reset in 527 ms.
Support contains 112 out of 642 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 642/642 places, 1462/1462 transitions.
Applied a total of 0 rules in 29 ms. Remains 642 /642 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Running 1460 sub problems to find dead transitions.
[2024-05-27 22:44:27] [INFO ] Flow matrix only has 1442 transitions (discarded 20 similar events)
[2024-05-27 22:44:27] [INFO ] Invariant cache hit.
[2024-05-27 22:44:27] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-05-27 22:44:45] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 1 ms to minimize.
[2024-05-27 22:44:45] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 1 ms to minimize.
[2024-05-27 22:44:45] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 1 ms to minimize.
[2024-05-27 22:44:45] [INFO ] Deduced a trap composed of 55 places in 32 ms of which 1 ms to minimize.
[2024-05-27 22:44:45] [INFO ] Deduced a trap composed of 55 places in 36 ms of which 1 ms to minimize.
[2024-05-27 22:44:45] [INFO ] Deduced a trap composed of 55 places in 34 ms of which 1 ms to minimize.
[2024-05-27 22:44:45] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 1 ms to minimize.
[2024-05-27 22:44:45] [INFO ] Deduced a trap composed of 55 places in 47 ms of which 1 ms to minimize.
[2024-05-27 22:44:45] [INFO ] Deduced a trap composed of 55 places in 39 ms of which 0 ms to minimize.
[2024-05-27 22:44:46] [INFO ] Deduced a trap composed of 318 places in 360 ms of which 5 ms to minimize.
[2024-05-27 22:44:46] [INFO ] Deduced a trap composed of 344 places in 336 ms of which 5 ms to minimize.
[2024-05-27 22:44:47] [INFO ] Deduced a trap composed of 324 places in 303 ms of which 4 ms to minimize.
[2024-05-27 22:44:47] [INFO ] Deduced a trap composed of 366 places in 318 ms of which 4 ms to minimize.
[2024-05-27 22:44:47] [INFO ] Deduced a trap composed of 391 places in 292 ms of which 3 ms to minimize.
[2024-05-27 22:44:48] [INFO ] Deduced a trap composed of 362 places in 255 ms of which 4 ms to minimize.
[2024-05-27 22:44:48] [INFO ] Deduced a trap composed of 329 places in 252 ms of which 3 ms to minimize.
[2024-05-27 22:44:48] [INFO ] Deduced a trap composed of 302 places in 251 ms of which 4 ms to minimize.
[2024-05-27 22:44:49] [INFO ] Deduced a trap composed of 311 places in 261 ms of which 3 ms to minimize.
[2024-05-27 22:44:49] [INFO ] Deduced a trap composed of 326 places in 302 ms of which 4 ms to minimize.
[2024-05-27 22:44:50] [INFO ] Deduced a trap composed of 67 places in 162 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 640/2084 variables, and 64 constraints, problems are : Problem set: 0 solved, 1460 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/642 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1460/1460 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-05-27 22:44:53] [INFO ] Deduced a trap composed of 55 places in 29 ms of which 1 ms to minimize.
[2024-05-27 22:45:01] [INFO ] Deduced a trap composed of 23 places in 348 ms of which 4 ms to minimize.
[2024-05-27 22:45:01] [INFO ] Deduced a trap composed of 345 places in 295 ms of which 4 ms to minimize.
[2024-05-27 22:45:02] [INFO ] Deduced a trap composed of 311 places in 311 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 640/2084 variables, and 68 constraints, problems are : Problem set: 0 solved, 1460 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/642 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1460 constraints, Known Traps: 24/24 constraints]
After SMT, in 43084ms problems are : Problem set: 0 solved, 1460 unsolved
Search for dead transitions found 0 dead transitions in 43102ms
[2024-05-27 22:45:10] [INFO ] Flow matrix only has 1442 transitions (discarded 20 similar events)
[2024-05-27 22:45:10] [INFO ] Invariant cache hit.
[2024-05-27 22:45:11] [INFO ] Implicit Places using invariants in 610 ms returned []
[2024-05-27 22:45:11] [INFO ] Flow matrix only has 1442 transitions (discarded 20 similar events)
[2024-05-27 22:45:11] [INFO ] Invariant cache hit.
[2024-05-27 22:45:11] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:45:21] [INFO ] Implicit Places using invariants and state equation in 10174 ms returned []
Implicit Place search using SMT with State Equation took 10785 ms to find 0 implicit places.
[2024-05-27 22:45:21] [INFO ] Redundant transitions in 39 ms returned []
Running 1460 sub problems to find dead transitions.
[2024-05-27 22:45:21] [INFO ] Flow matrix only has 1442 transitions (discarded 20 similar events)
[2024-05-27 22:45:21] [INFO ] Invariant cache hit.
[2024-05-27 22:45:21] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-05-27 22:45:38] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 2 ms to minimize.
[2024-05-27 22:45:38] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 1 ms to minimize.
[2024-05-27 22:45:38] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 1 ms to minimize.
[2024-05-27 22:45:38] [INFO ] Deduced a trap composed of 55 places in 36 ms of which 1 ms to minimize.
[2024-05-27 22:45:38] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 1 ms to minimize.
[2024-05-27 22:45:38] [INFO ] Deduced a trap composed of 55 places in 38 ms of which 1 ms to minimize.
[2024-05-27 22:45:39] [INFO ] Deduced a trap composed of 55 places in 38 ms of which 1 ms to minimize.
[2024-05-27 22:45:39] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:45:39] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 1 ms to minimize.
[2024-05-27 22:45:40] [INFO ] Deduced a trap composed of 318 places in 357 ms of which 4 ms to minimize.
[2024-05-27 22:45:40] [INFO ] Deduced a trap composed of 344 places in 349 ms of which 5 ms to minimize.
[2024-05-27 22:45:40] [INFO ] Deduced a trap composed of 324 places in 276 ms of which 3 ms to minimize.
[2024-05-27 22:45:41] [INFO ] Deduced a trap composed of 366 places in 301 ms of which 4 ms to minimize.
[2024-05-27 22:45:41] [INFO ] Deduced a trap composed of 391 places in 264 ms of which 4 ms to minimize.
[2024-05-27 22:45:41] [INFO ] Deduced a trap composed of 362 places in 259 ms of which 4 ms to minimize.
[2024-05-27 22:45:41] [INFO ] Deduced a trap composed of 329 places in 261 ms of which 4 ms to minimize.
[2024-05-27 22:45:42] [INFO ] Deduced a trap composed of 302 places in 265 ms of which 4 ms to minimize.
[2024-05-27 22:45:42] [INFO ] Deduced a trap composed of 311 places in 263 ms of which 3 ms to minimize.
[2024-05-27 22:45:42] [INFO ] Deduced a trap composed of 326 places in 262 ms of which 4 ms to minimize.
[2024-05-27 22:45:43] [INFO ] Deduced a trap composed of 67 places in 170 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-05-27 22:45:44] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 1 ms to minimize.
[2024-05-27 22:45:45] [INFO ] Deduced a trap composed of 301 places in 392 ms of which 5 ms to minimize.
[2024-05-27 22:45:45] [INFO ] Deduced a trap composed of 316 places in 343 ms of which 5 ms to minimize.
[2024-05-27 22:45:46] [INFO ] Deduced a trap composed of 307 places in 295 ms of which 4 ms to minimize.
[2024-05-27 22:45:46] [INFO ] Deduced a trap composed of 322 places in 260 ms of which 3 ms to minimize.
[2024-05-27 22:45:46] [INFO ] Deduced a trap composed of 310 places in 267 ms of which 4 ms to minimize.
[2024-05-27 22:45:47] [INFO ] Deduced a trap composed of 362 places in 275 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 640/2084 variables, and 71 constraints, problems are : Problem set: 0 solved, 1460 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/642 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1460/1460 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 27/71 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-05-27 22:46:07] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 640/2084 variables, and 72 constraints, problems are : Problem set: 0 solved, 1460 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/642 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1460 constraints, Known Traps: 28/28 constraints]
After SMT, in 63019ms problems are : Problem set: 0 solved, 1460 unsolved
Search for dead transitions found 0 dead transitions in 63040ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 117012 ms. Remains : 642/642 places, 1462/1462 transitions.
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-11 finished in 354499 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0 U (p1||G(p0))))))'
Support contains 11 out of 812 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Applied a total of 0 rules in 11 ms. Remains 812 /812 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:46:24] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 812 cols
[2024-05-27 22:46:24] [INFO ] Computed 46 invariants in 41 ms
[2024-05-27 22:46:24] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-27 22:46:47] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 2 ms to minimize.
SMT process timed out in 22877ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 22895ms
[2024-05-27 22:46:47] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:46:47] [INFO ] Invariant cache hit.
[2024-05-27 22:46:48] [INFO ] Implicit Places using invariants in 674 ms returned []
[2024-05-27 22:46:48] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:46:48] [INFO ] Invariant cache hit.
[2024-05-27 22:46:49] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:47:04] [INFO ] Implicit Places using invariants and state equation in 16301 ms returned []
Implicit Place search using SMT with State Equation took 16977 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:47:04] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:47:04] [INFO ] Invariant cache hit.
[2024-05-27 22:47:04] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 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 810/2424 variables, and 44 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-27 22:47:38] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 2 ms to minimize.
[2024-05-27 22:47:38] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
[2024-05-27 22:47:38] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2024-05-27 22:47:38] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:47:38] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:47:39] [INFO ] Deduced a trap composed of 73 places in 373 ms of which 6 ms to minimize.
[2024-05-27 22:47:40] [INFO ] Deduced a trap composed of 207 places in 371 ms of which 5 ms to minimize.
[2024-05-27 22:47:42] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 1 ms to minimize.
[2024-05-27 22:47:49] [INFO ] Deduced a trap composed of 117 places in 290 ms of which 3 ms to minimize.
[2024-05-27 22:47:49] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 1 ms to minimize.
[2024-05-27 22:47:54] [INFO ] Deduced a trap composed of 72 places in 90 ms of which 1 ms to minimize.
[2024-05-27 22:47:56] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2024-05-27 22:47:59] [INFO ] Deduced a trap composed of 424 places in 462 ms of which 6 ms to minimize.
[2024-05-27 22:48:07] [INFO ] Deduced a trap composed of 443 places in 383 ms of which 6 ms to minimize.
[2024-05-27 22:48:07] [INFO ] Deduced a trap composed of 533 places in 355 ms of which 5 ms to minimize.
SMT process timed out in 62841ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 62867ms
Finished structural reductions in LTL mode , in 1 iterations and 102852 ms. Remains : 812/812 places, 1632/1632 transitions.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 490 ms.
Product exploration explored 100000 steps with 50000 reset in 511 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 16 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-14 finished in 103954 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||(G(p1)&&F(p2)))))'
Support contains 51 out of 812 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Applied a total of 0 rules in 8 ms. Remains 812 /812 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:48:08] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:48:08] [INFO ] Invariant cache hit.
[2024-05-27 22:48:08] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 4.0)
(s1 6.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 1.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 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 1.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 9.0)
(s243 0.0)
(s244 1.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 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 1.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 (/ 2.0 3.0))
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 (/ 1.0 3.0))
(s300 1.0)
(s301 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 44 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-27 22:48:32] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 2 ms to minimize.
[2024-05-27 22:48:32] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2024-05-27 22:48:32] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2024-05-27 22:48:32] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-05-27 22:48:32] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2024-05-27 22:48:34] [INFO ] Deduced a trap composed of 73 places in 338 ms of which 4 ms to minimize.
[2024-05-27 22:48:34] [INFO ] Deduced a trap composed of 207 places in 313 ms of which 4 ms to minimize.
[2024-05-27 22:48:37] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-05-27 22:48:45] [INFO ] Deduced a trap composed of 117 places in 315 ms of which 4 ms to minimize.
[2024-05-27 22:48:45] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 1 ms to minimize.
[2024-05-27 22:48:51] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 55 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 11/11 constraints]
After SMT, in 42784ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 42799ms
[2024-05-27 22:48:51] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:48:51] [INFO ] Invariant cache hit.
[2024-05-27 22:48:52] [INFO ] Implicit Places using invariants in 680 ms returned []
[2024-05-27 22:48:52] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:48:52] [INFO ] Invariant cache hit.
[2024-05-27 22:48:53] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:49:07] [INFO ] Implicit Places using invariants and state equation in 15120 ms returned []
Implicit Place search using SMT with State Equation took 15809 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:49:07] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:49:07] [INFO ] Invariant cache hit.
[2024-05-27 22:49:07] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-27 22:49:39] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 0 ms to minimize.
SMT process timed out in 32655ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 32672ms
Finished structural reductions in LTL mode , in 1 iterations and 91295 ms. Remains : 812/812 places, 1632/1632 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 526 ms.
Product exploration explored 100000 steps with 50000 reset in 527 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 13 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-15 finished in 92524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : PolyORBLF-COL-S02J06T10-LTLCardinality-06
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 812 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 812 transition count 1592
Reduce places removed 40 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 50 rules applied. Total rules applied 90 place count 772 transition count 1582
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 100 place count 762 transition count 1582
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 100 place count 762 transition count 1472
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 320 place count 652 transition count 1472
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 460 place count 582 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 470 place count 572 transition count 1392
Iterating global reduction 3 with 10 rules applied. Total rules applied 480 place count 572 transition count 1392
Applied a total of 480 rules in 65 ms. Remains 572 /812 variables (removed 240) and now considering 1392/1632 (removed 240) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-27 22:49:41] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 572 cols
[2024-05-27 22:49:41] [INFO ] Computed 46 invariants in 16 ms
[2024-05-27 22:49:41] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 22:49:55] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 2 ms to minimize.
[2024-05-27 22:49:56] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 3 ms to minimize.
[2024-05-27 22:49:56] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 2 ms to minimize.
[2024-05-27 22:49:56] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 1 ms to minimize.
[2024-05-27 22:49:56] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 2 ms to minimize.
[2024-05-27 22:49:56] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 1 ms to minimize.
[2024-05-27 22:49:56] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2024-05-27 22:49:56] [INFO ] Deduced a trap composed of 48 places in 35 ms of which 0 ms to minimize.
[2024-05-27 22:49:56] [INFO ] Deduced a trap composed of 48 places in 37 ms of which 1 ms to minimize.
[2024-05-27 22:49:57] [INFO ] Deduced a trap composed of 227 places in 288 ms of which 4 ms to minimize.
[2024-05-27 22:49:58] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 1 ms to minimize.
[2024-05-27 22:50:00] [INFO ] Deduced a trap composed of 67 places in 209 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1944 variables, and 56 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 22:50:07] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 2 ms to minimize.
[2024-05-27 22:50:07] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 2 ms to minimize.
[2024-05-27 22:50:15] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1944 variables, and 59 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 15/15 constraints]
After SMT, in 42509ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42521ms
[2024-05-27 22:50:23] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-27 22:50:23] [INFO ] Invariant cache hit.
[2024-05-27 22:50:24] [INFO ] Implicit Places using invariants in 458 ms returned []
[2024-05-27 22:50:24] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-27 22:50:24] [INFO ] Invariant cache hit.
[2024-05-27 22:50:24] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:50:35] [INFO ] Implicit Places using invariants and state equation in 10711 ms returned []
Implicit Place search using SMT with State Equation took 11170 ms to find 0 implicit places.
Running 1390 sub problems to find dead transitions.
[2024-05-27 22:50:35] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-27 22:50:35] [INFO ] Invariant cache hit.
[2024-05-27 22:50:35] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 22:50:50] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 2 ms to minimize.
[2024-05-27 22:50:50] [INFO ] Deduced a trap composed of 48 places in 117 ms of which 2 ms to minimize.
[2024-05-27 22:50:50] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 2 ms to minimize.
[2024-05-27 22:50:50] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 1 ms to minimize.
[2024-05-27 22:50:50] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-05-27 22:50:50] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
[2024-05-27 22:50:50] [INFO ] Deduced a trap composed of 48 places in 30 ms of which 1 ms to minimize.
[2024-05-27 22:50:51] [INFO ] Deduced a trap composed of 48 places in 29 ms of which 0 ms to minimize.
[2024-05-27 22:50:51] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 1 ms to minimize.
[2024-05-27 22:50:51] [INFO ] Deduced a trap composed of 253 places in 299 ms of which 3 ms to minimize.
[2024-05-27 22:50:51] [INFO ] Deduced a trap composed of 227 places in 287 ms of which 4 ms to minimize.
[2024-05-27 22:50:54] [INFO ] Deduced a trap composed of 48 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 22:51:07] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 2 ms to minimize.
SMT process timed out in 32548ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 32561ms
Starting structural reductions in LI_LTL mode, iteration 1 : 572/812 places, 1392/1632 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 86322 ms. Remains : 572/812 places, 1392/1632 transitions.
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-06
Product exploration explored 100000 steps with 25000 reset in 314 ms.
Product exploration explored 100000 steps with 25000 reset in 443 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 89 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 172 steps (0 resets) in 6 ms. (24 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 104 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 572 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 572/572 places, 1392/1392 transitions.
Applied a total of 0 rules in 8 ms. Remains 572 /572 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-27 22:51:09] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-27 22:51:09] [INFO ] Invariant cache hit.
[2024-05-27 22:51:09] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 22:51:24] [INFO ] Deduced a trap composed of 48 places in 195 ms of which 3 ms to minimize.
[2024-05-27 22:51:24] [INFO ] Deduced a trap composed of 48 places in 107 ms of which 2 ms to minimize.
[2024-05-27 22:51:24] [INFO ] Deduced a trap composed of 48 places in 137 ms of which 2 ms to minimize.
[2024-05-27 22:51:24] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 2 ms to minimize.
[2024-05-27 22:51:24] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 1 ms to minimize.
[2024-05-27 22:51:24] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2024-05-27 22:51:24] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 1 ms to minimize.
[2024-05-27 22:51:24] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 0 ms to minimize.
[2024-05-27 22:51:24] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-05-27 22:51:25] [INFO ] Deduced a trap composed of 253 places in 354 ms of which 4 ms to minimize.
[2024-05-27 22:51:25] [INFO ] Deduced a trap composed of 227 places in 336 ms of which 4 ms to minimize.
[2024-05-27 22:51:27] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1944 variables, and 56 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 22:51:34] [INFO ] Deduced a trap composed of 23 places in 294 ms of which 4 ms to minimize.
[2024-05-27 22:51:34] [INFO ] Deduced a trap composed of 237 places in 269 ms of which 3 ms to minimize.
[2024-05-27 22:51:39] [INFO ] Deduced a trap composed of 372 places in 296 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1944 variables, and 59 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 15/15 constraints]
After SMT, in 42769ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42787ms
[2024-05-27 22:51:51] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-27 22:51:51] [INFO ] Invariant cache hit.
[2024-05-27 22:51:52] [INFO ] Implicit Places using invariants in 538 ms returned []
[2024-05-27 22:51:52] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-27 22:51:52] [INFO ] Invariant cache hit.
[2024-05-27 22:51:52] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:52:03] [INFO ] Implicit Places using invariants and state equation in 10912 ms returned []
Implicit Place search using SMT with State Equation took 11452 ms to find 0 implicit places.
Running 1390 sub problems to find dead transitions.
[2024-05-27 22:52:03] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-27 22:52:03] [INFO ] Invariant cache hit.
[2024-05-27 22:52:03] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 22:52:18] [INFO ] Deduced a trap composed of 48 places in 114 ms of which 2 ms to minimize.
[2024-05-27 22:52:18] [INFO ] Deduced a trap composed of 48 places in 148 ms of which 2 ms to minimize.
[2024-05-27 22:52:18] [INFO ] Deduced a trap composed of 48 places in 127 ms of which 2 ms to minimize.
[2024-05-27 22:52:18] [INFO ] Deduced a trap composed of 48 places in 104 ms of which 2 ms to minimize.
[2024-05-27 22:52:18] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 1 ms to minimize.
[2024-05-27 22:52:18] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-05-27 22:52:18] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 0 ms to minimize.
[2024-05-27 22:52:18] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 0 ms to minimize.
[2024-05-27 22:52:18] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2024-05-27 22:52:19] [INFO ] Deduced a trap composed of 253 places in 311 ms of which 4 ms to minimize.
[2024-05-27 22:52:19] [INFO ] Deduced a trap composed of 227 places in 318 ms of which 4 ms to minimize.
[2024-05-27 22:52:21] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 22:52:35] [INFO ] Deduced a trap composed of 58 places in 177 ms of which 2 ms to minimize.
[2024-05-27 22:52:35] [INFO ] Deduced a trap composed of 238 places in 266 ms of which 3 ms to minimize.
SMT process timed out in 32485ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 32499ms
Finished structural reductions in LTL mode , in 1 iterations and 86752 ms. Remains : 572/572 places, 1392/1392 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 77 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 219 steps (0 resets) in 5 ms. (36 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 109 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 478 ms.
Product exploration explored 100000 steps with 25000 reset in 435 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 572 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 572/572 places, 1392/1392 transitions.
Applied a total of 0 rules in 18 ms. Remains 572 /572 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-27 22:52:37] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-27 22:52:37] [INFO ] Invariant cache hit.
[2024-05-27 22:52:37] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 22:52:52] [INFO ] Deduced a trap composed of 48 places in 170 ms of which 2 ms to minimize.
[2024-05-27 22:52:52] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 2 ms to minimize.
[2024-05-27 22:52:52] [INFO ] Deduced a trap composed of 48 places in 141 ms of which 2 ms to minimize.
[2024-05-27 22:52:53] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 2 ms to minimize.
[2024-05-27 22:52:53] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 1 ms to minimize.
[2024-05-27 22:52:53] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-05-27 22:52:53] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 0 ms to minimize.
[2024-05-27 22:52:53] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 0 ms to minimize.
[2024-05-27 22:52:53] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 1 ms to minimize.
[2024-05-27 22:52:54] [INFO ] Deduced a trap composed of 253 places in 282 ms of which 3 ms to minimize.
[2024-05-27 22:52:54] [INFO ] Deduced a trap composed of 227 places in 334 ms of which 3 ms to minimize.
[2024-05-27 22:52:56] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1944 variables, and 56 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 22:53:02] [INFO ] Deduced a trap composed of 23 places in 367 ms of which 4 ms to minimize.
[2024-05-27 22:53:02] [INFO ] Deduced a trap composed of 237 places in 324 ms of which 5 ms to minimize.
[2024-05-27 22:53:08] [INFO ] Deduced a trap composed of 372 places in 293 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 3)
(s1 7)
(s2 0)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(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 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 10)
(s223 1)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 1)
(s229 0)
(s230 0)
(s231 1)
(s232 1)
(s233 0)
(s234 0)
(s235 0)
(s236 1)
(s237 1)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 1)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 1)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 1)
(s331 1)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 1)
(s354 0)
(s355 1)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s377 1)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 1)
(s450 0)
(s451 1)
(s452 0)
(s453 1)
(s454 0)
(s455 1)
(s456 0)
(s457 1)
(s458 0)
(s459 1)
(s460 0)
(s461 1)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1944 variables, and 59 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 15/15 constraints]
After SMT, in 42714ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42727ms
[2024-05-27 22:53:20] [INFO ] Redundant transitions in 12 ms returned []
Running 1390 sub problems to find dead transitions.
[2024-05-27 22:53:20] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-27 22:53:20] [INFO ] Invariant cache hit.
[2024-05-27 22:53:20] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 22:53:35] [INFO ] Deduced a trap composed of 48 places in 136 ms of which 3 ms to minimize.
[2024-05-27 22:53:35] [INFO ] Deduced a trap composed of 48 places in 124 ms of which 2 ms to minimize.
[2024-05-27 22:53:35] [INFO ] Deduced a trap composed of 48 places in 104 ms of which 2 ms to minimize.
[2024-05-27 22:53:35] [INFO ] Deduced a trap composed of 48 places in 104 ms of which 2 ms to minimize.
[2024-05-27 22:53:35] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 2 ms to minimize.
[2024-05-27 22:53:35] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-05-27 22:53:36] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 1 ms to minimize.
[2024-05-27 22:53:36] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 0 ms to minimize.
[2024-05-27 22:53:36] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 1 ms to minimize.
[2024-05-27 22:53:36] [INFO ] Deduced a trap composed of 253 places in 308 ms of which 4 ms to minimize.
[2024-05-27 22:53:36] [INFO ] Deduced a trap composed of 227 places in 278 ms of which 3 ms to minimize.
[2024-05-27 22:53:38] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 22:53:52] [INFO ] Deduced a trap composed of 58 places in 205 ms of which 3 ms to minimize.
[2024-05-27 22:53:53] [INFO ] Deduced a trap composed of 238 places in 352 ms of which 4 ms to minimize.
SMT process timed out in 32790ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 32803ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 75575 ms. Remains : 572/572 places, 1392/1392 transitions.
Support contains 11 out of 572 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 572/572 places, 1392/1392 transitions.
Applied a total of 0 rules in 6 ms. Remains 572 /572 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-27 22:53:53] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-27 22:53:53] [INFO ] Invariant cache hit.
[2024-05-27 22:53:53] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 22:54:08] [INFO ] Deduced a trap composed of 48 places in 168 ms of which 3 ms to minimize.
[2024-05-27 22:54:08] [INFO ] Deduced a trap composed of 48 places in 134 ms of which 2 ms to minimize.
[2024-05-27 22:54:08] [INFO ] Deduced a trap composed of 48 places in 150 ms of which 2 ms to minimize.
[2024-05-27 22:54:09] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 2 ms to minimize.
[2024-05-27 22:54:09] [INFO ] Deduced a trap composed of 48 places in 107 ms of which 2 ms to minimize.
[2024-05-27 22:54:09] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 1 ms to minimize.
[2024-05-27 22:54:09] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:54:09] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2024-05-27 22:54:09] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-05-27 22:54:10] [INFO ] Deduced a trap composed of 253 places in 360 ms of which 4 ms to minimize.
[2024-05-27 22:54:10] [INFO ] Deduced a trap composed of 227 places in 355 ms of which 5 ms to minimize.
[2024-05-27 22:54:13] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 0 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 570/1944 variables, and 56 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 22:54:18] [INFO ] Deduced a trap composed of 23 places in 347 ms of which 4 ms to minimize.
[2024-05-27 22:54:19] [INFO ] Deduced a trap composed of 237 places in 314 ms of which 4 ms to minimize.
[2024-05-27 22:54:24] [INFO ] Deduced a trap composed of 372 places in 293 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1944 variables, and 59 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 15/15 constraints]
After SMT, in 43256ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 43276ms
[2024-05-27 22:54:36] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-27 22:54:36] [INFO ] Invariant cache hit.
[2024-05-27 22:54:37] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-05-27 22:54:37] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-27 22:54:37] [INFO ] Invariant cache hit.
[2024-05-27 22:54:37] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:54:48] [INFO ] Implicit Places using invariants and state equation in 11125 ms returned []
Implicit Place search using SMT with State Equation took 11578 ms to find 0 implicit places.
Running 1390 sub problems to find dead transitions.
[2024-05-27 22:54:48] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-27 22:54:48] [INFO ] Invariant cache hit.
[2024-05-27 22:54:48] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 22:55:02] [INFO ] Deduced a trap composed of 48 places in 157 ms of which 2 ms to minimize.
[2024-05-27 22:55:03] [INFO ] Deduced a trap composed of 48 places in 138 ms of which 2 ms to minimize.
[2024-05-27 22:55:03] [INFO ] Deduced a trap composed of 48 places in 134 ms of which 2 ms to minimize.
[2024-05-27 22:55:03] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 2 ms to minimize.
[2024-05-27 22:55:03] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 1 ms to minimize.
[2024-05-27 22:55:03] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:55:03] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 1 ms to minimize.
[2024-05-27 22:55:03] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 0 ms to minimize.
[2024-05-27 22:55:03] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 1 ms to minimize.
[2024-05-27 22:55:04] [INFO ] Deduced a trap composed of 253 places in 321 ms of which 4 ms to minimize.
[2024-05-27 22:55:04] [INFO ] Deduced a trap composed of 227 places in 274 ms of which 3 ms to minimize.
[2024-05-27 22:55:06] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 22:55:20] [INFO ] Deduced a trap composed of 58 places in 161 ms of which 2 ms to minimize.
[2024-05-27 22:55:20] [INFO ] Deduced a trap composed of 238 places in 303 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")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1944 variables, and 58 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 22:55:22] [INFO ] Deduced a trap composed of 216 places in 314 ms of which 4 ms to minimize.
[2024-05-27 22:55:24] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 3 ms to minimize.
[2024-05-27 22:55:27] [INFO ] Deduced a trap composed of 67 places in 227 ms of which 2 ms to minimize.
[2024-05-27 22:55:40] [INFO ] Deduced a trap composed of 192 places in 308 ms of which 4 ms to minimize.
[2024-05-27 22:55:42] [INFO ] Deduced a trap composed of 3 places in 249 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 22:55:49] [INFO ] Deduced a trap composed of 388 places in 275 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1944 variables, and 64 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 20/20 constraints]
After SMT, in 62628ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 62643ms
Finished structural reductions in LTL mode , in 1 iterations and 117514 ms. Remains : 572/572 places, 1392/1392 transitions.
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-06 finished in 369987 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
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))'
[2024-05-27 22:55:51] [INFO ] Flatten gal took : 135 ms
[2024-05-27 22:55:51] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-27 22:55:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 812 places, 1632 transitions and 7100 arcs took 16 ms.
Total runtime 2292636 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-COL-S02J06T10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/419/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 812
TRANSITIONS: 1632
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.065s, Sys 0.006s]

SAVING FILE /home/mcc/execution/419/model (.net / .def) ...
EXPORT TIME: [User 0.008s, 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: 4152
MODEL NAME: /home/mcc/execution/419/model
812 places, 1632 transitions.

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

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 LTLCardinality -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="PolyORBLF-COL-S02J06T10"
export BK_EXAMINATION="LTLCardinality"
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 PolyORBLF-COL-S02J06T10, examination is LTLCardinality"
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-171654445200115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T10.tgz
mv PolyORBLF-COL-S02J06T10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;