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.r516-tajo-171654446400105.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 ltsminxred
Input is PolyORBLF-COL-S02J06T08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446400105
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 8.3K Apr 11 17:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 11 17:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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.9K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 11 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K 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-S02J06T08-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717249024419

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:37:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 13:37:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:37:05] [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-06-01 13:37:06] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 13:37:06] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 600 ms
[2024-06-01 13:37:06] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 690 PT places and 1492.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
[2024-06-01 13:37:06] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 4 ms.
[2024-06-01 13:37:06] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40002 steps (18 resets) in 2118 ms. (18 steps per ms) remains 59/91 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 48 ms. (81 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4000 steps (8 resets) in 83 ms. (47 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4000 steps (9 resets) in 94 ms. (42 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 66 ms. (59 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4000 steps (8 resets) in 43 ms. (90 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (9 resets) in 45 ms. (87 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4000 steps (8 resets) in 28 ms. (137 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 42 ms. (93 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 51 ms. (76 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (9 resets) in 33 ms. (117 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4000 steps (8 resets) in 31 ms. (125 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4000 steps (8 resets) in 57 ms. (68 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4000 steps (8 resets) in 42 ms. (93 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 47 ms. (83 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4000 steps (8 resets) in 50 ms. (78 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4000 steps (8 resets) in 38 ms. (102 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4000 steps (8 resets) in 71 ms. (55 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4000 steps (8 resets) in 41 ms. (95 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4000 steps (9 resets) in 31 ms. (125 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 67 ms. (58 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4000 steps (8 resets) in 31 ms. (125 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 58/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 47 ms. (83 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4000 steps (8 resets) in 65 ms. (60 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4000 steps (9 resets) in 35 ms. (111 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4000 steps (9 resets) in 34 ms. (114 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4000 steps (8 resets) in 30 ms. (129 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4000 steps (9 resets) in 22 ms. (173 steps per ms) remains 58/58 properties
[2024-06-01 13:37:08] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 13:37:08] [INFO ] Computed 26 invariants in 10 ms
[2024-06-01 13:37:08] [INFO ] State equation strengthened by 8 read => feed constraints.
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp63 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 4/4 constraints. Problems are: Problem set: 6 solved, 52 unsolved
Problem AtomicPropp85 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 1/5 constraints. Problems are: Problem set: 7 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/5 constraints. Problems are: Problem set: 7 solved, 51 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp86 is UNSAT
Problem AtomicPropp87 is UNSAT
Problem AtomicPropp89 is UNSAT
At refinement iteration 3 (OVERLAPS) 19/72 variables, 7/12 constraints. Problems are: Problem set: 38 solved, 20 unsolved
Problem AtomicPropp53 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 4/16 constraints. Problems are: Problem set: 39 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/16 constraints. Problems are: Problem set: 39 solved, 19 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp84 is UNSAT
At refinement iteration 6 (OVERLAPS) 9/81 variables, 10/26 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 57 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 57 solved, 1 unsolved in 587 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: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 57 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/40 variables, 3/3 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/48 variables, 5/8 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/49 variables, 1/9 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/73 variables, 12/21 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/21 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/78 variables, 3/24 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 0/24 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/79 variables, 1/25 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/79 variables, 0/25 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 64/143 variables, 79/104 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/143 variables, 8/112 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/143 variables, 1/113 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/143 variables, 0/113 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/145 variables, 2/115 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/145 variables, 1/116 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/145 variables, 0/116 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/145 variables, 0/116 constraints. Problems are: Problem set: 57 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 116 constraints, problems are : Problem set: 57 solved, 1 unsolved in 144 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/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 827ms problems are : Problem set: 57 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 80 transition count 58
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 73 transition count 58
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 15 place count 73 transition count 54
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 23 place count 69 transition count 54
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 68 transition count 53
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 68 transition count 53
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 37 place count 62 transition count 47
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 62 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 41 place count 60 transition count 45
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 60 transition count 45
Applied a total of 42 rules in 38 ms. Remains 60 /81 variables (removed 21) and now considering 45/65 (removed 20) transitions.
Running 44 sub problems to find dead transitions.
[2024-06-01 13:37:09] [INFO ] Flow matrix only has 44 transitions (discarded 1 similar events)
// Phase 1: matrix 44 rows 60 cols
[2024-06-01 13:37:09] [INFO ] Computed 25 invariants in 5 ms
[2024-06-01 13:37:09] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-01 13:37:09] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 6 ms to minimize.
[2024-06-01 13:37:09] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 2 ms to minimize.
[2024-06-01 13:37:09] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:37:09] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:37:09] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/30 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-06-01 13:37:09] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-06-01 13:37:09] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 11 ms to minimize.
[2024-06-01 13:37:09] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 13:37:09] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-06-01 13:37:09] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 5/35 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-06-01 13:37:09] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 1/36 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 44/104 variables, 60/96 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 8/104 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-06-01 13:37:10] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 1/105 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 0/105 constraints. Problems are: Problem set: 2 solved, 42 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/104 variables, 0/105 constraints. Problems are: Problem set: 2 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 105 constraints, problems are : Problem set: 2 solved, 42 unsolved in 1711 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 2 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 7/31 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-06-01 13:37:11] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/32 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 1/60 variables, 1/33 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 5/38 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/38 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 44/104 variables, 60/98 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 8/106 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 42/148 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 0/148 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-06-01 13:37:12] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/104 variables, 1/149 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/104 variables, 0/149 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 14 (OVERLAPS) 0/104 variables, 0/149 constraints. Problems are: Problem set: 2 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 149 constraints, problems are : Problem set: 2 solved, 42 unsolved in 2646 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 42/44 constraints, Known Traps: 14/14 constraints]
After SMT, in 4388ms problems are : Problem set: 2 solved, 42 unsolved
Search for dead transitions found 2 dead transitions in 4389ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/81 places, 43/65 transitions.
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 58 transition count 41
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 57 transition count 39
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 3 rules in 8 ms. Remains 57 /60 variables (removed 3) and now considering 39/43 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4449 ms. Remains : 57/81 places, 39/65 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Successfully simplified 58 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:37:13] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-01 13:37:13] [INFO ] Flatten gal took : 67 ms
[2024-06-01 13:37:13] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:37:13] [INFO ] Flatten gal took : 20 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-06-01 13:37:13] [INFO ] Unfolded HLPN to a Petri net with 690 places and 1434 transitions 6564 arcs in 54 ms.
[2024-06-01 13:37:13] [INFO ] Unfolded 8 HLPN properties in 1 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 520 out of 690 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Applied a total of 0 rules in 23 ms. Remains 690 /690 variables (removed 0) and now considering 1306/1306 (removed 0) transitions.
Running 1304 sub problems to find dead transitions.
[2024-06-01 13:37:13] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 690 cols
[2024-06-01 13:37:13] [INFO ] Computed 54 invariants in 119 ms
[2024-06-01 13:37:14] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/686 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/686 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
[2024-06-01 13:37:26] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 2 ms to minimize.
[2024-06-01 13:37:27] [INFO ] Deduced a trap composed of 73 places in 90 ms of which 2 ms to minimize.
[2024-06-01 13:37:27] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 4 ms to minimize.
[2024-06-01 13:37:27] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:37:27] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:37:27] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:37:27] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 2 ms to minimize.
[2024-06-01 13:37:28] [INFO ] Deduced a trap composed of 370 places in 390 ms of which 5 ms to minimize.
[2024-06-01 13:37:28] [INFO ] Deduced a trap composed of 210 places in 321 ms of which 5 ms to minimize.
[2024-06-01 13:37:29] [INFO ] Deduced a trap composed of 188 places in 274 ms of which 4 ms to minimize.
[2024-06-01 13:37:30] [INFO ] Deduced a trap composed of 353 places in 353 ms of which 5 ms to minimize.
[2024-06-01 13:37:30] [INFO ] Deduced a trap composed of 373 places in 318 ms of which 5 ms to minimize.
[2024-06-01 13:37:31] [INFO ] Deduced a trap composed of 453 places in 307 ms of which 4 ms to minimize.
[2024-06-01 13:37:31] [INFO ] Deduced a trap composed of 361 places in 274 ms of which 3 ms to minimize.
[2024-06-01 13:37:31] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 7.0)
(s1 3.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 3.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.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 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.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 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 1.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 9.0)
(s195 0.0)
(s196 1.0)
(s197 1.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 1.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 1.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)
(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)
(s359 1.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 686/1980 variables, and 65 constraints, problems are : Problem set: 0 solved, 1304 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/690 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1304/1304 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/686 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/686 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/686 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
[2024-06-01 13:37:38] [INFO ] Deduced a trap composed of 356 places in 290 ms of which 4 ms to minimize.
[2024-06-01 13:37:46] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 3 ms to minimize.
[2024-06-01 13:37:52] [INFO ] Deduced a trap composed of 346 places in 296 ms of which 4 ms to minimize.
[2024-06-01 13:37:52] [INFO ] Deduced a trap composed of 354 places in 293 ms of which 5 ms to minimize.
[2024-06-01 13:37:53] [INFO ] Deduced a trap composed of 327 places in 344 ms of which 5 ms to minimize.
[2024-06-01 13:37:53] [INFO ] Deduced a trap composed of 49 places in 358 ms of which 5 ms to minimize.
[2024-06-01 13:37:54] [INFO ] Deduced a trap composed of 47 places in 370 ms of which 5 ms to minimize.
[2024-06-01 13:37:56] [INFO ] Deduced a trap composed of 379 places in 374 ms of which 5 ms to minimize.
[2024-06-01 13:37:56] [INFO ] Deduced a trap composed of 372 places in 345 ms of which 5 ms to minimize.
SMT process timed out in 42521ms, After SMT, problems are : Problem set: 0 solved, 1304 unsolved
Search for dead transitions found 0 dead transitions in 42548ms
[2024-06-01 13:37:56] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
[2024-06-01 13:37:56] [INFO ] Invariant cache hit.
[2024-06-01 13:37:56] [INFO ] Implicit Places using invariants in 397 ms returned [532, 533, 534, 535, 536, 537, 538, 539]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 403 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 682/690 places, 1306/1306 transitions.
Applied a total of 0 rules in 15 ms. Remains 682 /682 variables (removed 0) and now considering 1306/1306 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42999 ms. Remains : 682/690 places, 1306/1306 transitions.
Support contains 520 out of 682 places after structural reductions.
[2024-06-01 13:37:56] [INFO ] Flatten gal took : 128 ms
[2024-06-01 13:37:57] [INFO ] Flatten gal took : 104 ms
[2024-06-01 13:37:57] [INFO ] Input system was already deterministic with 1306 transitions.
RANDOM walk for 40000 steps (10 resets) in 1459 ms. (27 steps per ms) remains 34/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (8 resets) in 66 ms. (59 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (8 resets) in 58 ms. (67 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 80 ms. (49 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (8 resets) in 43 ms. (90 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (8 resets) in 94 ms. (42 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 69 ms. (57 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (8 resets) in 57 ms. (68 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (8 resets) in 45 ms. (86 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 34/34 properties
[2024-06-01 13:37:58] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 682 cols
[2024-06-01 13:37:58] [INFO ] Computed 46 invariants in 24 ms
[2024-06-01 13:37:58] [INFO ] State equation strengthened by 96 read => feed constraints.
Problem AtomicPropp34 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/338 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 33 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp49 is UNSAT
At refinement iteration 2 (OVERLAPS) 138/476 variables, 10/17 constraints. Problems are: Problem set: 8 solved, 26 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/476 variables, 1/18 constraints. Problems are: Problem set: 9 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 0/18 constraints. Problems are: Problem set: 9 solved, 25 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
At refinement iteration 5 (OVERLAPS) 206/682 variables, 28/46 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/682 variables, 0/46 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1290/1972 variables, 682/728 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1972 variables, 96/824 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1972 variables, 0/824 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1972 variables, 0/824 constraints. Problems are: Problem set: 32 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1972/1972 variables, and 824 constraints, problems are : Problem set: 32 solved, 2 unsolved in 2300 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 682/682 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 32 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 216/248 variables, 3/3 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 0/3 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 62/310 variables, 3/6 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/6 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 13/323 variables, 7/13 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/13 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 351/674 variables, 26/39 constraints. Problems are: Problem set: 32 solved, 2 unsolved
[2024-06-01 13:38:01] [INFO ] Deduced a trap composed of 75 places in 368 ms of which 4 ms to minimize.
[2024-06-01 13:38:01] [INFO ] Deduced a trap composed of 74 places in 288 ms of which 4 ms to minimize.
[2024-06-01 13:38:02] [INFO ] Deduced a trap composed of 74 places in 284 ms of which 3 ms to minimize.
[2024-06-01 13:38:02] [INFO ] Deduced a trap composed of 74 places in 256 ms of which 3 ms to minimize.
[2024-06-01 13:38:02] [INFO ] Deduced a trap composed of 410 places in 234 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/674 variables, 5/44 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/674 variables, 0/44 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/677 variables, 3/47 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/677 variables, 0/47 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/680 variables, 3/50 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/680 variables, 0/50 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1290/1970 variables, 680/730 constraints. Problems are: Problem set: 32 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1970/1972 variables, and 826 constraints, problems are : Problem set: 32 solved, 2 unsolved in 4402 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 680/682 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 0/34 constraints, Known Traps: 5/5 constraints]
After SMT, in 6847ms problems are : Problem set: 32 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 682 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 682/682 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 680 transition count 1258
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 98 place count 632 transition count 1258
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 88 Pre rules applied. Total rules applied 98 place count 632 transition count 1170
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 274 place count 544 transition count 1170
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 282 place count 536 transition count 1162
Iterating global reduction 2 with 8 rules applied. Total rules applied 290 place count 536 transition count 1162
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 14 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 386 place count 488 transition count 1114
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 402 place count 488 transition count 1098
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 418 place count 472 transition count 1098
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 426 place count 472 transition count 1098
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 434 place count 464 transition count 1090
Iterating global reduction 3 with 8 rules applied. Total rules applied 442 place count 464 transition count 1090
Applied a total of 442 rules in 302 ms. Remains 464 /682 variables (removed 218) and now considering 1090/1306 (removed 216) transitions.
Running 1088 sub problems to find dead transitions.
[2024-06-01 13:38:05] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
// Phase 1: matrix 1074 rows 464 cols
[2024-06-01 13:38:05] [INFO ] Computed 44 invariants in 15 ms
[2024-06-01 13:38:05] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 25/42 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
[2024-06-01 13:38:15] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 2 ms to minimize.
[2024-06-01 13:38:15] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:38:15] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:38:15] [INFO ] Deduced a trap composed of 47 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:38:15] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:38:15] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:38:15] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:38:16] [INFO ] Deduced a trap composed of 47 places in 238 ms of which 3 ms to minimize.
[2024-06-01 13:38:16] [INFO ] Deduced a trap composed of 203 places in 240 ms of which 3 ms to minimize.
[2024-06-01 13:38:16] [INFO ] Deduced a trap composed of 175 places in 257 ms of which 2 ms to minimize.
[2024-06-01 13:38:16] [INFO ] Deduced a trap composed of 175 places in 231 ms of which 3 ms to minimize.
[2024-06-01 13:38:17] [INFO ] Deduced a trap composed of 203 places in 271 ms of which 3 ms to minimize.
[2024-06-01 13:38:17] [INFO ] Deduced a trap composed of 193 places in 265 ms of which 3 ms to minimize.
[2024-06-01 13:38:17] [INFO ] Deduced a trap composed of 208 places in 237 ms of which 13 ms to minimize.
[2024-06-01 13:38:18] [INFO ] Deduced a trap composed of 222 places in 213 ms of which 3 ms to minimize.
[2024-06-01 13:38:18] [INFO ] Deduced a trap composed of 207 places in 233 ms of which 2 ms to minimize.
[2024-06-01 13:38:18] [INFO ] Deduced a trap composed of 203 places in 215 ms of which 3 ms to minimize.
[2024-06-01 13:38:19] [INFO ] Deduced a trap composed of 57 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:38:20] [INFO ] Deduced a trap composed of 47 places in 211 ms of which 2 ms to minimize.
[2024-06-01 13:38:23] [INFO ] Deduced a trap composed of 172 places in 262 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
[2024-06-01 13:38:23] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 3 ms to minimize.
[2024-06-01 13:38:26] [INFO ] Deduced a trap composed of 285 places in 253 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1538 variables, and 64 constraints, problems are : Problem set: 0 solved, 1088 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1088/1088 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1088 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 25/42 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 22/64 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
[2024-06-01 13:38:37] [INFO ] Deduced a trap composed of 167 places in 260 ms of which 4 ms to minimize.
[2024-06-01 13:38:37] [INFO ] Deduced a trap composed of 175 places in 176 ms of which 2 ms to minimize.
[2024-06-01 13:38:38] [INFO ] Deduced a trap composed of 81 places in 163 ms of which 2 ms to minimize.
[2024-06-01 13:38:41] [INFO ] Deduced a trap composed of 163 places in 169 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/1538 variables, and 68 constraints, problems are : Problem set: 0 solved, 1088 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1088 constraints, Known Traps: 26/26 constraints]
After SMT, in 42573ms problems are : Problem set: 0 solved, 1088 unsolved
Search for dead transitions found 0 dead transitions in 42585ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42891 ms. Remains : 464/682 places, 1090/1306 transitions.
RANDOM walk for 40000 steps (21 resets) in 343 ms. (116 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 154 ms. (258 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40000 steps (8 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
[2024-06-01 13:38:48] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2024-06-01 13:38:48] [INFO ] Invariant cache hit.
[2024-06-01 13:38:48] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 344/360 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/380 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/392 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 69/461 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/462 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1074/1536 variables, 462/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1536 variables, 96/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1536 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1538 variables, 2/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1538 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1538 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1538 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1538/1538 variables, and 604 constraints, problems are : Problem set: 0 solved, 1 unsolved in 525 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 464/464 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 344/360 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/380 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/392 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 69/461 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:38:49] [INFO ] Deduced a trap composed of 47 places in 189 ms of which 2 ms to minimize.
[2024-06-01 13:38:49] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 2 ms to minimize.
[2024-06-01 13:38:49] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 2 ms to minimize.
[2024-06-01 13:38:49] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 1 ms to minimize.
[2024-06-01 13:38:49] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/462 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1074/1536 variables, 462/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1536 variables, 96/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1536 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:38:52] [INFO ] Deduced a trap composed of 184 places in 308 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1536 variables, 1/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1536 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/1538 variables, 2/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1538 variables, 1/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1538 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1538 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1538/1538 variables, and 611 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3529 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 464/464 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 4074ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 98 ms.
Support contains 16 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1090/1090 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 464 transition count 1082
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 456 transition count 1082
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 448 transition count 1074
Applied a total of 32 rules in 56 ms. Remains 448 /464 variables (removed 16) and now considering 1074/1090 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 448/464 places, 1074/1090 transitions.
RANDOM walk for 40000 steps (17 resets) in 511 ms. (78 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 218 ms. (182 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 356489 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :0 out of 1
Probabilistic random walk after 356489 steps, saw 192838 distinct states, run finished after 3005 ms. (steps per millisecond=118 ) properties seen :0
[2024-06-01 13:38:56] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
// Phase 1: matrix 1058 rows 448 cols
[2024-06-01 13:38:56] [INFO ] Computed 44 invariants in 28 ms
[2024-06-01 13:38:56] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 345/361 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/367 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/368 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 72/440 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/446 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/446 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1058/1504 variables, 446/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1504 variables, 96/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1504 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1506 variables, 2/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1506 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1506 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1506 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1506/1506 variables, and 588 constraints, problems are : Problem set: 0 solved, 1 unsolved in 823 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 448/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 345/361 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/367 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/368 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 72/440 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:38:57] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 2 ms to minimize.
[2024-06-01 13:38:57] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 2 ms to minimize.
[2024-06-01 13:38:57] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 2 ms to minimize.
[2024-06-01 13:38:57] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/446 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1058/1504 variables, 446/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1504 variables, 96/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1504 variables, 1/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1504 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1506 variables, 2/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1506 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:39:00] [INFO ] Deduced a trap composed of 19 places in 256 ms of which 3 ms to minimize.
[2024-06-01 13:39:00] [INFO ] Deduced a trap composed of 183 places in 221 ms of which 4 ms to minimize.
[2024-06-01 13:39:00] [INFO ] Deduced a trap composed of 153 places in 297 ms of which 3 ms to minimize.
[2024-06-01 13:39:00] [INFO ] Deduced a trap composed of 179 places in 218 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1506 variables, 4/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1506 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1506 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1506/1506 variables, and 597 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4219 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 448/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 5083ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 102 ms.
Support contains 16 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 29 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 448/448 places, 1074/1074 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 27 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
[2024-06-01 13:39:01] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-06-01 13:39:01] [INFO ] Invariant cache hit.
[2024-06-01 13:39:01] [INFO ] Implicit Places using invariants in 528 ms returned []
[2024-06-01 13:39:01] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-06-01 13:39:01] [INFO ] Invariant cache hit.
[2024-06-01 13:39:02] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:39:07] [INFO ] Implicit Places using invariants and state equation in 5760 ms returned []
Implicit Place search using SMT with State Equation took 6303 ms to find 0 implicit places.
[2024-06-01 13:39:07] [INFO ] Redundant transitions in 65 ms returned []
Running 1072 sub problems to find dead transitions.
[2024-06-01 13:39:07] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-06-01 13:39:07] [INFO ] Invariant cache hit.
[2024-06-01 13:39:07] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 19/34 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-06-01 13:39:17] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:39:17] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:39:17] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:39:17] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:39:17] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:39:17] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:39:17] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:39:18] [INFO ] Deduced a trap composed of 45 places in 227 ms of which 3 ms to minimize.
[2024-06-01 13:39:18] [INFO ] Deduced a trap composed of 215 places in 191 ms of which 3 ms to minimize.
[2024-06-01 13:39:18] [INFO ] Deduced a trap composed of 203 places in 245 ms of which 3 ms to minimize.
[2024-06-01 13:39:18] [INFO ] Deduced a trap composed of 220 places in 158 ms of which 3 ms to minimize.
[2024-06-01 13:39:19] [INFO ] Deduced a trap composed of 199 places in 200 ms of which 3 ms to minimize.
[2024-06-01 13:39:19] [INFO ] Deduced a trap composed of 206 places in 141 ms of which 2 ms to minimize.
[2024-06-01 13:39:20] [INFO ] Deduced a trap composed of 56 places in 161 ms of which 2 ms to minimize.
[2024-06-01 13:39:24] [INFO ] Deduced a trap composed of 151 places in 255 ms of which 3 ms to minimize.
[2024-06-01 13:39:27] [INFO ] Deduced a trap composed of 130 places in 262 ms of which 3 ms to minimize.
[2024-06-01 13:39:27] [INFO ] Deduced a trap composed of 158 places in 275 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
SMT process timed out in 32073ms, After SMT, problems are : Problem set: 0 solved, 1072 unsolved
Search for dead transitions found 0 dead transitions in 32087ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38491 ms. Remains : 448/448 places, 1074/1074 transitions.
Successfully simplified 32 atomic propositions for a total of 8 simplifications.
[2024-06-01 13:39:39] [INFO ] Flatten gal took : 50 ms
[2024-06-01 13:39:39] [INFO ] Flatten gal took : 99 ms
[2024-06-01 13:39:40] [INFO ] Input system was already deterministic with 1306 transitions.
Support contains 112 out of 682 places (down from 169) after GAL structural reductions.
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 680 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 672 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 672 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 664 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 664 transition count 1290
Applied a total of 34 rules in 37 ms. Remains 664 /682 variables (removed 18) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 13:39:40] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 664 cols
[2024-06-01 13:39:40] [INFO ] Computed 44 invariants in 24 ms
[2024-06-01 13:39:40] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:39:51] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 2 ms to minimize.
[2024-06-01 13:39:51] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:39:51] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:39:51] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:39:52] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:39:52] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:39:52] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:39:52] [INFO ] Deduced a trap composed of 349 places in 258 ms of which 4 ms to minimize.
[2024-06-01 13:39:52] [INFO ] Deduced a trap composed of 372 places in 238 ms of which 4 ms to minimize.
[2024-06-01 13:39:53] [INFO ] Deduced a trap composed of 358 places in 244 ms of which 3 ms to minimize.
[2024-06-01 13:39:53] [INFO ] Deduced a trap composed of 72 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:39:54] [INFO ] Deduced a trap composed of 368 places in 278 ms of which 4 ms to minimize.
[2024-06-01 13:39:54] [INFO ] Deduced a trap composed of 347 places in 305 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 55 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:40:03] [INFO ] Deduced a trap composed of 171 places in 298 ms of which 5 ms to minimize.
[2024-06-01 13:40:04] [INFO ] Deduced a trap composed of 396 places in 335 ms of which 5 ms to minimize.
[2024-06-01 13:40:05] [INFO ] Deduced a trap composed of 342 places in 333 ms of which 5 ms to minimize.
[2024-06-01 13:40:13] [INFO ] Deduced a trap composed of 408 places in 290 ms of which 3 ms to minimize.
[2024-06-01 13:40:15] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 3 ms to minimize.
[2024-06-01 13:40:18] [INFO ] Deduced a trap composed of 349 places in 335 ms of which 5 ms to minimize.
[2024-06-01 13:40:19] [INFO ] Deduced a trap composed of 47 places in 212 ms of which 3 ms to minimize.
[2024-06-01 13:40:20] [INFO ] Deduced a trap composed of 74 places in 374 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/1938 variables, and 63 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 21/21 constraints]
After SMT, in 41760ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41776ms
Finished structural reductions in LTL mode , in 1 iterations and 41817 ms. Remains : 664/682 places, 1290/1306 transitions.
[2024-06-01 13:40:22] [INFO ] Flatten gal took : 46 ms
[2024-06-01 13:40:22] [INFO ] Flatten gal took : 47 ms
[2024-06-01 13:40:22] [INFO ] Input system was already deterministic with 1290 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 680 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 672 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 672 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 664 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 664 transition count 1290
Applied a total of 34 rules in 23 ms. Remains 664 /682 variables (removed 18) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 13:40:22] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 664 cols
[2024-06-01 13:40:22] [INFO ] Computed 44 invariants in 30 ms
[2024-06-01 13:40:22] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:40:37] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:40:42] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 2 ms to minimize.
[2024-06-01 13:40:42] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:40:42] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:40:42] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:40:42] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:40:42] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 1 ms to minimize.
[2024-06-01 13:40:43] [INFO ] Deduced a trap composed of 72 places in 83 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 50 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:40:45] [INFO ] Deduced a trap composed of 154 places in 223 ms of which 3 ms to minimize.
[2024-06-01 13:40:46] [INFO ] Deduced a trap composed of 168 places in 214 ms of which 3 ms to minimize.
[2024-06-01 13:40:46] [INFO ] Deduced a trap composed of 391 places in 326 ms of which 5 ms to minimize.
[2024-06-01 13:40:53] [INFO ] Deduced a trap composed of 129 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:40:54] [INFO ] Deduced a trap composed of 49 places in 211 ms of which 3 ms to minimize.
[2024-06-01 13:40:54] [INFO ] Deduced a trap composed of 19 places in 229 ms of which 5 ms to minimize.
[2024-06-01 13:41:00] [INFO ] Deduced a trap composed of 346 places in 295 ms of which 5 ms to minimize.
[2024-06-01 13:41:01] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/1938 variables, and 58 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 16/16 constraints]
After SMT, in 41976ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41993ms
Finished structural reductions in LTL mode , in 1 iterations and 42020 ms. Remains : 664/682 places, 1290/1306 transitions.
[2024-06-01 13:41:04] [INFO ] Flatten gal took : 47 ms
[2024-06-01 13:41:04] [INFO ] Flatten gal took : 64 ms
[2024-06-01 13:41:04] [INFO ] Input system was already deterministic with 1290 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 680 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 672 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 672 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 664 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 664 transition count 1290
Applied a total of 34 rules in 26 ms. Remains 664 /682 variables (removed 18) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 13:41:04] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 664 cols
[2024-06-01 13:41:04] [INFO ] Computed 44 invariants in 13 ms
[2024-06-01 13:41:04] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:41:16] [INFO ] Deduced a trap composed of 72 places in 88 ms of which 1 ms to minimize.
[2024-06-01 13:41:16] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:41:16] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:41:16] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:41:16] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:41:16] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 2 ms to minimize.
[2024-06-01 13:41:16] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 0 ms to minimize.
[2024-06-01 13:41:17] [INFO ] Deduced a trap composed of 349 places in 321 ms of which 5 ms to minimize.
[2024-06-01 13:41:17] [INFO ] Deduced a trap composed of 372 places in 347 ms of which 5 ms to minimize.
[2024-06-01 13:41:18] [INFO ] Deduced a trap composed of 358 places in 353 ms of which 5 ms to minimize.
[2024-06-01 13:41:18] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:41:19] [INFO ] Deduced a trap composed of 368 places in 350 ms of which 5 ms to minimize.
[2024-06-01 13:41:20] [INFO ] Deduced a trap composed of 347 places in 360 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 55 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:41:28] [INFO ] Deduced a trap composed of 171 places in 228 ms of which 4 ms to minimize.
[2024-06-01 13:41:28] [INFO ] Deduced a trap composed of 396 places in 265 ms of which 4 ms to minimize.
[2024-06-01 13:41:29] [INFO ] Deduced a trap composed of 342 places in 251 ms of which 3 ms to minimize.
[2024-06-01 13:41:36] [INFO ] Deduced a trap composed of 408 places in 247 ms of which 4 ms to minimize.
[2024-06-01 13:41:38] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
[2024-06-01 13:41:42] [INFO ] Deduced a trap composed of 349 places in 252 ms of which 4 ms to minimize.
[2024-06-01 13:41:42] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 3 ms to minimize.
[2024-06-01 13:41:43] [INFO ] Deduced a trap composed of 74 places in 271 ms of which 4 ms to minimize.
[2024-06-01 13:41:46] [INFO ] Deduced a trap composed of 154 places in 249 ms of which 3 ms to minimize.
SMT process timed out in 41951ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41965ms
Finished structural reductions in LTL mode , in 1 iterations and 41994 ms. Remains : 664/682 places, 1290/1306 transitions.
[2024-06-01 13:41:46] [INFO ] Flatten gal took : 45 ms
[2024-06-01 13:41:46] [INFO ] Flatten gal took : 71 ms
[2024-06-01 13:41:46] [INFO ] Input system was already deterministic with 1290 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 680 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 672 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 672 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 664 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 664 transition count 1290
Applied a total of 34 rules in 23 ms. Remains 664 /682 variables (removed 18) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 13:41:46] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 13:41:46] [INFO ] Invariant cache hit.
[2024-06-01 13:41:46] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:42:00] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:42:00] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:42:02] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:42:02] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:42:02] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:42:02] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:42:02] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:42:02] [INFO ] Deduced a trap composed of 72 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:42:05] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 2 ms to minimize.
[2024-06-01 13:42:07] [INFO ] Deduced a trap composed of 350 places in 348 ms of which 5 ms to minimize.
[2024-06-01 13:42:07] [INFO ] Deduced a trap composed of 397 places in 314 ms of which 5 ms to minimize.
[2024-06-01 13:42:08] [INFO ] Deduced a trap composed of 46 places in 240 ms of which 3 ms to minimize.
[2024-06-01 13:42:08] [INFO ] Deduced a trap composed of 346 places in 232 ms of which 3 ms to minimize.
[2024-06-01 13:42:08] [INFO ] Deduced a trap composed of 348 places in 227 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 662/1938 variables, and 56 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:42:10] [INFO ] Deduced a trap composed of 375 places in 330 ms of which 5 ms to minimize.
[2024-06-01 13:42:10] [INFO ] Deduced a trap composed of 369 places in 226 ms of which 3 ms to minimize.
[2024-06-01 13:42:10] [INFO ] Deduced a trap composed of 392 places in 213 ms of which 3 ms to minimize.
[2024-06-01 13:42:11] [INFO ] Deduced a trap composed of 165 places in 202 ms of which 4 ms to minimize.
[2024-06-01 13:42:11] [INFO ] Deduced a trap composed of 321 places in 343 ms of which 5 ms to minimize.
[2024-06-01 13:42:20] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2024-06-01 13:42:23] [INFO ] Deduced a trap composed of 326 places in 231 ms of which 4 ms to minimize.
[2024-06-01 13:42:24] [INFO ] Deduced a trap composed of 75 places in 237 ms of which 3 ms to minimize.
[2024-06-01 13:42:25] [INFO ] Deduced a trap composed of 75 places in 354 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 Int declared 662/1938 variables, and 65 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 23/23 constraints]
After SMT, in 42022ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 42036ms
Finished structural reductions in LTL mode , in 1 iterations and 42062 ms. Remains : 664/682 places, 1290/1306 transitions.
[2024-06-01 13:42:28] [INFO ] Flatten gal took : 38 ms
[2024-06-01 13:42:28] [INFO ] Flatten gal took : 39 ms
[2024-06-01 13:42:28] [INFO ] Input system was already deterministic with 1290 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 680 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 672 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 672 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 664 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 664 transition count 1290
Applied a total of 34 rules in 20 ms. Remains 664 /682 variables (removed 18) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 13:42:28] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 13:42:28] [INFO ] Invariant cache hit.
[2024-06-01 13:42:28] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:42:44] [INFO ] Deduced a trap composed of 72 places in 92 ms of which 2 ms to minimize.
[2024-06-01 13:42:45] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 2 ms to minimize.
[2024-06-01 13:42:47] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 2 ms to minimize.
[2024-06-01 13:42:47] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 2 ms to minimize.
[2024-06-01 13:42:47] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:42:47] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:42:47] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:42:47] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:42:50] [INFO ] Deduced a trap composed of 72 places in 33 ms of which 1 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 662/1938 variables, and 51 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:42:52] [INFO ] Deduced a trap composed of 187 places in 327 ms of which 4 ms to minimize.
[2024-06-01 13:42:53] [INFO ] Deduced a trap composed of 322 places in 335 ms of which 5 ms to minimize.
[2024-06-01 13:42:53] [INFO ] Deduced a trap composed of 382 places in 305 ms of which 3 ms to minimize.
[2024-06-01 13:42:59] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 3 ms to minimize.
[2024-06-01 13:43:00] [INFO ] Deduced a trap composed of 355 places in 324 ms of which 4 ms to minimize.
[2024-06-01 13:43:01] [INFO ] Deduced a trap composed of 357 places in 234 ms of which 3 ms to minimize.
[2024-06-01 13:43:06] [INFO ] Deduced a trap composed of 330 places in 215 ms of which 4 ms to minimize.
[2024-06-01 13:43:07] [INFO ] Deduced a trap composed of 75 places in 221 ms of which 3 ms to minimize.
[2024-06-01 13:43:07] [INFO ] Deduced a trap composed of 350 places in 238 ms of which 3 ms to minimize.
[2024-06-01 13:43:10] [INFO ] Deduced a trap composed of 369 places in 347 ms of which 5 ms to minimize.
SMT process timed out in 41735ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41749ms
Finished structural reductions in LTL mode , in 1 iterations and 41772 ms. Remains : 664/682 places, 1290/1306 transitions.
[2024-06-01 13:43:10] [INFO ] Flatten gal took : 45 ms
[2024-06-01 13:43:10] [INFO ] Flatten gal took : 39 ms
[2024-06-01 13:43:10] [INFO ] Input system was already deterministic with 1290 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 680 transition count 1306
Applied a total of 2 rules in 8 ms. Remains 680 /682 variables (removed 2) and now considering 1306/1306 (removed 0) transitions.
Running 1304 sub problems to find dead transitions.
[2024-06-01 13:43:10] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 680 cols
[2024-06-01 13:43:10] [INFO ] Computed 44 invariants in 39 ms
[2024-06-01 13:43:10] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/678 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/678 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
[2024-06-01 13:43:23] [INFO ] Deduced a trap composed of 175 places in 261 ms of which 4 ms to minimize.
[2024-06-01 13:43:23] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:43:23] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 1 ms to minimize.
[2024-06-01 13:43:24] [INFO ] Deduced a trap composed of 74 places in 259 ms of which 3 ms to minimize.
[2024-06-01 13:43:24] [INFO ] Deduced a trap composed of 314 places in 234 ms of which 3 ms to minimize.
[2024-06-01 13:43:24] [INFO ] Deduced a trap composed of 74 places in 233 ms of which 3 ms to minimize.
[2024-06-01 13:43:24] [INFO ] Deduced a trap composed of 405 places in 240 ms of which 4 ms to minimize.
[2024-06-01 13:43:25] [INFO ] Deduced a trap composed of 69 places in 177 ms of which 2 ms to minimize.
[2024-06-01 13:43:25] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:43:26] [INFO ] Deduced a trap composed of 74 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:43:27] [INFO ] Deduced a trap composed of 74 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:43:31] [INFO ] Deduced a trap composed of 74 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:43:32] [INFO ] Deduced a trap composed of 386 places in 246 ms of which 4 ms to minimize.
SMT process timed out in 21988ms, After SMT, problems are : Problem set: 0 solved, 1304 unsolved
Search for dead transitions found 0 dead transitions in 22022ms
Finished structural reductions in LTL mode , in 1 iterations and 22046 ms. Remains : 680/682 places, 1306/1306 transitions.
[2024-06-01 13:43:32] [INFO ] Flatten gal took : 41 ms
[2024-06-01 13:43:32] [INFO ] Flatten gal took : 43 ms
[2024-06-01 13:43:33] [INFO ] Input system was already deterministic with 1306 transitions.
[2024-06-01 13:43:33] [INFO ] Flatten gal took : 52 ms
[2024-06-01 13:43:33] [INFO ] Flatten gal took : 44 ms
[2024-06-01 13:43:33] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-01 13:43:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 682 places, 1306 transitions and 5652 arcs took 18 ms.
Total runtime 387607 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBLF-COL-S02J06T08-CTLCardinality-2024-00
Could not compute solution for formula : PolyORBLF-COL-S02J06T08-CTLCardinality-2024-01
Could not compute solution for formula : PolyORBLF-COL-S02J06T08-CTLCardinality-2024-05
Could not compute solution for formula : PolyORBLF-COL-S02J06T08-CTLCardinality-2024-06
Could not compute solution for formula : PolyORBLF-COL-S02J06T08-CTLCardinality-2024-09
Could not compute solution for formula : PolyORBLF-COL-S02J06T08-CTLCardinality-2024-11

BK_STOP 1717249413495

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name PolyORBLF-COL-S02J06T08-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/1292/ctl_0_
ctl formula name PolyORBLF-COL-S02J06T08-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/1292/ctl_1_
ctl formula name PolyORBLF-COL-S02J06T08-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1292/ctl_2_
ctl formula name PolyORBLF-COL-S02J06T08-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/1292/ctl_3_
ctl formula name PolyORBLF-COL-S02J06T08-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1292/ctl_4_
ctl formula name PolyORBLF-COL-S02J06T08-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1292/ctl_5_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-S02J06T08"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PolyORBLF-COL-S02J06T08, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654446400105"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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