Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445100082.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-COL-S02J04T08, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445100082
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 7.4K Apr 11 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 11 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 11 16:52 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.6K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Apr 11 17:01 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-S02J04T08-CTLFireability-2024-00
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLFireability-2024-01
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLFireability-2024-02
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLFireability-2024-03
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLFireability-2024-04
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLFireability-2024-05
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLFireability-2024-06
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLFireability-2024-07
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLFireability-2024-08
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLFireability-2024-09
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLFireability-2024-10
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLFireability-2024-11
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLFireability-2024-12
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLFireability-2024-13
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLFireability-2024-14
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716844442290

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 21:14:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-27 21:14:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 21:14:03] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-27 21:14:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 21:14:04] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 615 ms
[2024-05-27 21:14:04] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 614 PT places and 1300.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
[2024-05-27 21:14:04] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-05-27 21:14:04] [INFO ] Skeletonized 15 HLPN properties in 3 ms. Removed 1 properties that had guard overlaps.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 62 to 61
RANDOM walk for 40000 steps (13 resets) in 1632 ms. (24 steps per ms) remains 13/61 properties
BEST_FIRST walk for 40001 steps (15 resets) in 328 ms. (121 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (14 resets) in 291 ms. (136 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (11 resets) in 239 ms. (166 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (10 resets) in 265 ms. (150 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (11 resets) in 189 ms. (210 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (12 resets) in 304 ms. (131 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (13 resets) in 183 ms. (217 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (10 resets) in 153 ms. (259 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (12 resets) in 133 ms. (298 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (8 resets) in 166 ms. (239 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (13 resets) in 129 ms. (307 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (14 resets) in 210 ms. (189 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (8 resets) in 179 ms. (222 steps per ms) remains 13/13 properties
[2024-05-27 21:14:06] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-27 21:14:06] [INFO ] Computed 26 invariants in 7 ms
[2024-05-27 21:14:06] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp49 is UNSAT
At refinement iteration 1 (OVERLAPS) 27/58 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Problem AtomicPropp53 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 3/9 constraints. Problems are: Problem set: 4 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 3/61 variables, 3/12 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 9 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp43 is UNSAT
At refinement iteration 6 (OVERLAPS) 16/77 variables, 11/23 constraints. Problems are: Problem set: 9 solved, 4 unsolved
[2024-05-27 21:14:06] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 1/24 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/24 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/78 variables, 1/25 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/143 variables, 0/113 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 2/145 variables, 2/115 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/145 variables, 1/116 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/145 variables, 0/116 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/145 variables, 0/116 constraints. Problems are: Problem set: 9 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 116 constraints, problems are : Problem set: 9 solved, 4 unsolved in 482 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: 13/13 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 9 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 35/46 variables, 4/4 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/5 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/5 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 6/52 variables, 4/9 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1/53 variables, 1/10 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/10 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 20/73 variables, 11/21 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 1/22 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 5/78 variables, 3/25 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 4/117 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 0/117 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/145 variables, 2/119 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/145 variables, 1/120 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/145 variables, 0/120 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/145 variables, 0/120 constraints. Problems are: Problem set: 9 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 120 constraints, problems are : Problem set: 9 solved, 4 unsolved in 288 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: 4/13 constraints, Known Traps: 1/1 constraints]
After SMT, in 824ms problems are : Problem set: 9 solved, 4 unsolved
Parikh walk visited 0 properties in 3837 ms.
Support contains 11 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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 80 transition count 60
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 75 transition count 58
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 73 transition count 58
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 15 place count 73 transition count 55
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 21 place count 70 transition count 55
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 31 place count 65 transition count 50
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 65 transition count 48
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 35 place count 63 transition count 48
Applied a total of 35 rules in 31 ms. Remains 63 /81 variables (removed 18) and now considering 48/65 (removed 17) transitions.
Running 47 sub problems to find dead transitions.
[2024-05-27 21:14:10] [INFO ] Flow matrix only has 47 transitions (discarded 1 similar events)
// Phase 1: matrix 47 rows 63 cols
[2024-05-27 21:14:10] [INFO ] Computed 25 invariants in 4 ms
[2024-05-27 21:14:10] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-27 21:14:10] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/63 variables, 1/26 constraints. Problems are: Problem set: 2 solved, 45 unsolved
[2024-05-27 21:14:11] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-27 21:14:11] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-27 21:14:11] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-27 21:14:11] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-27 21:14:11] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 5/31 constraints. Problems are: Problem set: 2 solved, 45 unsolved
[2024-05-27 21:14:11] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 2 solved, 45 unsolved
[2024-05-27 21:14:11] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-27 21:14:11] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-27 21:14:11] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 3/35 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/63 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 47/110 variables, 63/98 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 8/106 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 0/106 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 12 (OVERLAPS) 0/110 variables, 0/106 constraints. Problems are: Problem set: 2 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 106 constraints, problems are : Problem set: 2 solved, 45 unsolved in 1631 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 63/63 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 2 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 7/31 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/31 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 1/63 variables, 1/32 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 3/35 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 47/110 variables, 63/98 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 8/106 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 45/151 constraints. Problems are: Problem set: 2 solved, 45 unsolved
[2024-05-27 21:14:13] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 1/152 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 0/152 constraints. Problems are: Problem set: 2 solved, 45 unsolved
[2024-05-27 21:14:13] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/110 variables, 1/153 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/110 variables, 0/153 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 14 (OVERLAPS) 0/110 variables, 0/153 constraints. Problems are: Problem set: 2 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 153 constraints, problems are : Problem set: 2 solved, 45 unsolved in 1932 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 63/63 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 45/47 constraints, Known Traps: 12/12 constraints]
After SMT, in 3587ms problems are : Problem set: 2 solved, 45 unsolved
Search for dead transitions found 2 dead transitions in 3589ms
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 : 63/81 places, 46/65 transitions.
Reduce places removed 0 places and 2 transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 0 places and 2 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 42/46 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3637 ms. Remains : 63/81 places, 42/65 transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Successfully simplified 13 atomic propositions for a total of 15 simplifications.
FORMULA PolyORBLF-COL-S02J04T08-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 21:14:14] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-27 21:14:14] [INFO ] Flatten gal took : 29 ms
FORMULA PolyORBLF-COL-S02J04T08-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 21:14:14] [INFO ] Flatten gal took : 12 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-27 21:14:14] [INFO ] Unfolded HLPN to a Petri net with 614 places and 1242 transitions 5732 arcs in 31 ms.
[2024-05-27 21:14:14] [INFO ] Unfolded 14 HLPN properties in 1 ms.
[2024-05-27 21:14:14] [INFO ] Reduced 88 identical enabling conditions.
[2024-05-27 21:14:14] [INFO ] Reduced 32 identical enabling conditions.
[2024-05-27 21:14:14] [INFO ] Reduced 88 identical enabling conditions.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 571 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 612 transition count 1114
Applied a total of 2 rules in 12 ms. Remains 612 /614 variables (removed 2) and now considering 1114/1114 (removed 0) transitions.
Running 1112 sub problems to find dead transitions.
[2024-05-27 21:14:14] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 612 cols
[2024-05-27 21:14:14] [INFO ] Computed 48 invariants in 41 ms
[2024-05-27 21:14:14] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-05-27 21:14:29] [INFO ] Deduced a trap composed of 65 places in 178 ms of which 4 ms to minimize.
[2024-05-27 21:14:29] [INFO ] Deduced a trap composed of 65 places in 177 ms of which 2 ms to minimize.
[2024-05-27 21:14:29] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 3 ms to minimize.
[2024-05-27 21:14:29] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 1 ms to minimize.
[2024-05-27 21:14:29] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 3 ms to minimize.
[2024-05-27 21:14:29] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 1 ms to minimize.
[2024-05-27 21:14:29] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 2 ms to minimize.
[2024-05-27 21:14:29] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 2 ms to minimize.
[2024-05-27 21:14:32] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 1 ms to minimize.
[2024-05-27 21:14:33] [INFO ] Deduced a trap composed of 300 places in 286 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 610/1710 variables, and 56 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/612 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1112/1112 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-05-27 21:14:38] [INFO ] Deduced a trap composed of 139 places in 269 ms of which 5 ms to minimize.
[2024-05-27 21:14:39] [INFO ] Deduced a trap composed of 184 places in 242 ms of which 5 ms to minimize.
[2024-05-27 21:14:39] [INFO ] Deduced a trap composed of 198 places in 241 ms of which 3 ms to minimize.
[2024-05-27 21:14:40] [INFO ] Deduced a trap composed of 317 places in 335 ms of which 5 ms to minimize.
[2024-05-27 21:14:40] [INFO ] Deduced a trap composed of 371 places in 323 ms of which 5 ms to minimize.
[2024-05-27 21:14:48] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 3 ms to minimize.
[2024-05-27 21:14:48] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 3 ms to minimize.
[2024-05-27 21:14:48] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 3 ms to minimize.
[2024-05-27 21:14:52] [INFO ] Deduced a trap composed of 284 places in 277 ms of which 4 ms to minimize.
[2024-05-27 21:14:52] [INFO ] Deduced a trap composed of 324 places in 250 ms of which 4 ms to minimize.
[2024-05-27 21:14:52] [INFO ] Deduced a trap composed of 47 places in 127 ms of which 3 ms to minimize.
[2024-05-27 21:14:53] [INFO ] Deduced a trap composed of 327 places in 292 ms of which 6 ms to minimize.
[2024-05-27 21:14:56] [INFO ] Deduced a trap composed of 363 places in 294 ms of which 5 ms to minimize.
SMT process timed out in 41588ms, After SMT, problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 41606ms
[2024-05-27 21:14:56] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-05-27 21:14:56] [INFO ] Invariant cache hit.
[2024-05-27 21:14:56] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-27 21:14:56] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-05-27 21:14:56] [INFO ] Invariant cache hit.
[2024-05-27 21:14:56] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:14:57] [INFO ] Implicit Places using invariants and state equation in 1267 ms returned []
Implicit Place search using SMT with State Equation took 1438 ms to find 0 implicit places.
Running 1112 sub problems to find dead transitions.
[2024-05-27 21:14:57] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-05-27 21:14:57] [INFO ] Invariant cache hit.
[2024-05-27 21:14:57] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-05-27 21:15:09] [INFO ] Deduced a trap composed of 65 places in 42 ms of which 1 ms to minimize.
[2024-05-27 21:15:11] [INFO ] Deduced a trap composed of 65 places in 159 ms of which 2 ms to minimize.
[2024-05-27 21:15:11] [INFO ] Deduced a trap composed of 66 places in 53 ms of which 1 ms to minimize.
[2024-05-27 21:15:11] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 1 ms to minimize.
[2024-05-27 21:15:11] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 1 ms to minimize.
[2024-05-27 21:15:11] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 1 ms to minimize.
[2024-05-27 21:15:11] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 1 ms to minimize.
[2024-05-27 21:15:12] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 2 ms to minimize.
[2024-05-27 21:15:14] [INFO ] Deduced a trap composed of 65 places in 43 ms of which 1 ms to minimize.
[2024-05-27 21:15:15] [INFO ] Deduced a trap composed of 308 places in 278 ms of which 3 ms to minimize.
[2024-05-27 21:15:15] [INFO ] Deduced a trap composed of 326 places in 241 ms of which 4 ms to minimize.
[2024-05-27 21:15:16] [INFO ] Deduced a trap composed of 340 places in 283 ms of which 4 ms to minimize.
[2024-05-27 21:15:16] [INFO ] Deduced a trap composed of 338 places in 233 ms of which 3 ms to minimize.
[2024-05-27 21:15:20] [INFO ] Deduced a trap composed of 70 places in 308 ms of which 4 ms to minimize.
[2024-05-27 21:15:20] [INFO ] Deduced a trap composed of 328 places in 298 ms of which 5 ms to minimize.
[2024-05-27 21:15:21] [INFO ] Deduced a trap composed of 344 places in 239 ms of which 3 ms to minimize.
[2024-05-27 21:15:21] [INFO ] Deduced a trap composed of 332 places in 321 ms of which 7 ms to minimize.
[2024-05-27 21:15:21] [INFO ] Deduced a trap composed of 333 places in 313 ms of which 4 ms to minimize.
[2024-05-27 21:15:21] [INFO ] Deduced a trap composed of 333 places in 274 ms of which 4 ms to minimize.
[2024-05-27 21:15:22] [INFO ] Deduced a trap composed of 3 places in 286 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-05-27 21:15:23] [INFO ] Deduced a trap composed of 314 places in 294 ms of which 5 ms to minimize.
[2024-05-27 21:15:24] [INFO ] Deduced a trap composed of 164 places in 270 ms of which 5 ms to minimize.
[2024-05-27 21:15:24] [INFO ] Deduced a trap composed of 183 places in 245 ms of which 5 ms to minimize.
[2024-05-27 21:15:24] [INFO ] Deduced a trap composed of 197 places in 209 ms of which 3 ms to minimize.
[2024-05-27 21:15:24] [INFO ] Deduced a trap composed of 201 places in 269 ms of which 3 ms to minimize.
[2024-05-27 21:15:25] [INFO ] Deduced a trap composed of 369 places in 352 ms of which 4 ms to minimize.
[2024-05-27 21:15:25] [INFO ] Deduced a trap composed of 372 places in 296 ms of which 5 ms to minimize.
[2024-05-27 21:15:26] [INFO ] Deduced a trap composed of 314 places in 254 ms of which 5 ms to minimize.
[2024-05-27 21:15:27] [INFO ] Deduced a trap composed of 331 places in 226 ms of which 3 ms to minimize.
[2024-05-27 21:15:27] [INFO ] Deduced a trap composed of 320 places in 254 ms of which 8 ms to minimize.
[2024-05-27 21:15:27] [INFO ] Deduced a trap composed of 322 places in 244 ms of which 3 ms to minimize.
[2024-05-27 21:15:27] [INFO ] Deduced a trap composed of 329 places in 264 ms of which 3 ms to minimize.
[2024-05-27 21:15:28] [INFO ] Deduced a trap composed of 348 places in 299 ms of which 3 ms to minimize.
[2024-05-27 21:15:28] [INFO ] Deduced a trap composed of 333 places in 311 ms of which 4 ms to minimize.
[2024-05-27 21:15:28] [INFO ] Deduced a trap composed of 332 places in 295 ms of which 5 ms to minimize.
[2024-05-27 21:15:29] [INFO ] Deduced a trap composed of 300 places in 276 ms of which 5 ms to minimize.
SMT process timed out in 31506ms, After SMT, problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 31523ms
Starting structural reductions in LTL mode, iteration 1 : 612/614 places, 1114/1114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74590 ms. Remains : 612/614 places, 1114/1114 transitions.
Support contains 571 out of 612 places after structural reductions.
[2024-05-27 21:15:29] [INFO ] Flatten gal took : 102 ms
[2024-05-27 21:15:29] [INFO ] Flatten gal took : 103 ms
[2024-05-27 21:15:29] [INFO ] Input system was already deterministic with 1114 transitions.
Support contains 563 out of 612 places (down from 571) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 66 to 63
RANDOM walk for 40000 steps (10 resets) in 1425 ms. (28 steps per ms) remains 13/63 properties
BEST_FIRST walk for 40004 steps (9 resets) in 808 ms. (49 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40001 steps (8 resets) in 430 ms. (92 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (9 resets) in 534 ms. (74 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (9 resets) in 429 ms. (93 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 273 ms. (145 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (10 resets) in 561 ms. (71 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (9 resets) in 328 ms. (121 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (11 resets) in 576 ms. (69 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 398 ms. (100 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (9 resets) in 540 ms. (73 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 392 ms. (101 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 433 ms. (92 steps per ms) remains 12/12 properties
[2024-05-27 21:15:32] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-05-27 21:15:32] [INFO ] Invariant cache hit.
[2024-05-27 21:15:32] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 323/544 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp55 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/544 variables, 3/17 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/544 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1/545 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp58 is UNSAT
At refinement iteration 7 (OVERLAPS) 59/604 variables, 23/41 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/604 variables, 0/41 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 6/610 variables, 6/47 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 0/47 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1098/1708 variables, 610/657 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1708 variables, 96/753 constraints. Problems are: Problem set: 8 solved, 4 unsolved
[2024-05-27 21:15:34] [INFO ] Deduced a trap composed of 381 places in 316 ms of which 5 ms to minimize.
[2024-05-27 21:15:34] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1708 variables, 2/755 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1708 variables, 0/755 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/1710 variables, 2/757 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1710 variables, 1/758 constraints. Problems are: Problem set: 8 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1710/1710 variables, and 758 constraints, problems are : Problem set: 8 solved, 4 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 612/612 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 8 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 463/523 variables, 4/4 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/523 variables, 2/6 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/523 variables, 0/6 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/525 variables, 2/8 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 0/8 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 79/604 variables, 33/41 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/604 variables, 2/43 constraints. Problems are: Problem set: 8 solved, 4 unsolved
[2024-05-27 21:15:38] [INFO ] Deduced a trap composed of 65 places in 336 ms of which 5 ms to minimize.
[2024-05-27 21:15:38] [INFO ] Deduced a trap composed of 65 places in 294 ms of which 5 ms to minimize.
[2024-05-27 21:15:38] [INFO ] Deduced a trap composed of 66 places in 282 ms of which 4 ms to minimize.
[2024-05-27 21:15:39] [INFO ] Deduced a trap composed of 324 places in 237 ms of which 4 ms to minimize.
[2024-05-27 21:15:39] [INFO ] Deduced a trap composed of 65 places in 217 ms of which 3 ms to minimize.
[2024-05-27 21:15:39] [INFO ] Deduced a trap composed of 284 places in 216 ms of which 3 ms to minimize.
[2024-05-27 21:15:39] [INFO ] Deduced a trap composed of 315 places in 213 ms of which 3 ms to minimize.
[2024-05-27 21:15:39] [INFO ] Deduced a trap composed of 315 places in 200 ms of which 4 ms to minimize.
[2024-05-27 21:15:40] [INFO ] Deduced a trap composed of 329 places in 218 ms of which 3 ms to minimize.
[2024-05-27 21:15:40] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 1 ms to minimize.
[2024-05-27 21:15:40] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/604 variables, 11/54 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/604 variables, 0/54 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 6/610 variables, 6/60 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/610 variables, 0/60 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1098/1708 variables, 610/670 constraints. Problems are: Problem set: 8 solved, 4 unsolved
SMT process timed out in 10191ms, After SMT, problems are : Problem set: 8 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 60 out of 612 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 612 transition count 1074
Reduce places removed 40 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 56 rules applied. Total rules applied 96 place count 572 transition count 1058
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 112 place count 556 transition count 1058
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 112 place count 556 transition count 994
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 240 place count 492 transition count 994
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 336 place count 444 transition count 946
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 352 place count 444 transition count 930
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 368 place count 428 transition count 930
Applied a total of 368 rules in 231 ms. Remains 428 /612 variables (removed 184) and now considering 930/1114 (removed 184) transitions.
Running 928 sub problems to find dead transitions.
[2024-05-27 21:15:42] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
// Phase 1: matrix 914 rows 428 cols
[2024-05-27 21:15:42] [INFO ] Computed 48 invariants in 22 ms
[2024-05-27 21:15:42] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-27 21:15:50] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 1 ms to minimize.
[2024-05-27 21:15:50] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-27 21:15:50] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 1 ms to minimize.
[2024-05-27 21:15:50] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 1 ms to minimize.
[2024-05-27 21:15:50] [INFO ] Deduced a trap composed of 42 places in 30 ms of which 0 ms to minimize.
[2024-05-27 21:15:50] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-05-27 21:15:50] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-05-27 21:15:50] [INFO ] Deduced a trap composed of 181 places in 233 ms of which 4 ms to minimize.
[2024-05-27 21:15:51] [INFO ] Deduced a trap composed of 164 places in 223 ms of which 3 ms to minimize.
[2024-05-27 21:15:51] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 1 ms to minimize.
[2024-05-27 21:15:52] [INFO ] Deduced a trap composed of 148 places in 263 ms of which 3 ms to minimize.
[2024-05-27 21:15:54] [INFO ] Deduced a trap composed of 32 places in 193 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-27 21:16:01] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 2 ms to minimize.
[2024-05-27 21:16:04] [INFO ] Deduced a trap composed of 173 places in 196 ms of which 4 ms to minimize.
SMT process timed out in 21909ms, After SMT, problems are : Problem set: 0 solved, 928 unsolved
Search for dead transitions found 0 dead transitions in 21922ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22155 ms. Remains : 428/612 places, 930/1114 transitions.
RANDOM walk for 40000 steps (20 resets) in 530 ms. (75 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (12 resets) in 297 ms. (134 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (9 resets) in 342 ms. (116 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 193 ms. (206 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 175 ms. (227 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 131623 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 4
Probabilistic random walk after 131623 steps, saw 77704 distinct states, run finished after 3007 ms. (steps per millisecond=43 ) properties seen :0
[2024-05-27 21:16:08] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-05-27 21:16:08] [INFO ] Invariant cache hit.
[2024-05-27 21:16:08] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 313/381 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 11/392 variables, 7/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 33/425 variables, 14/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/426 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 914/1340 variables, 426/473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1340 variables, 96/569 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1340 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/1342 variables, 2/571 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1342 variables, 1/572 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1342 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1342 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1342/1342 variables, and 572 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 428/428 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 313/381 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-27 21:16:10] [INFO ] Deduced a trap composed of 204 places in 217 ms of which 3 ms to minimize.
[2024-05-27 21:16:10] [INFO ] Deduced a trap composed of 194 places in 191 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 11/392 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 33/425 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-27 21:16:11] [INFO ] Deduced a trap composed of 43 places in 154 ms of which 3 ms to minimize.
[2024-05-27 21:16:11] [INFO ] Deduced a trap composed of 42 places in 130 ms of which 3 ms to minimize.
[2024-05-27 21:16:11] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
[2024-05-27 21:16:11] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 2 ms to minimize.
[2024-05-27 21:16:11] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 2 ms to minimize.
[2024-05-27 21:16:11] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-05-27 21:16:11] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/426 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 914/1340 variables, 426/482 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1340 variables, 96/578 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1340 variables, 4/582 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-27 21:16:23] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1340 variables, 1/583 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1340 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/1342 variables, 2/585 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SMT process timed out in 47071ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 198 ms.
Support contains 60 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 930/930 transitions.
Applied a total of 0 rules in 41 ms. Remains 428 /428 variables (removed 0) and now considering 930/930 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 428/428 places, 930/930 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 930/930 transitions.
Applied a total of 0 rules in 28 ms. Remains 428 /428 variables (removed 0) and now considering 930/930 (removed 0) transitions.
[2024-05-27 21:16:55] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-05-27 21:16:55] [INFO ] Invariant cache hit.
[2024-05-27 21:16:55] [INFO ] Implicit Places using invariants in 420 ms returned [382, 383, 384, 385, 386, 387, 388, 389]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 426 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 420/428 places, 930/930 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 412 transition count 922
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 412 transition count 922
Applied a total of 16 rules in 48 ms. Remains 412 /420 variables (removed 8) and now considering 922/930 (removed 8) transitions.
[2024-05-27 21:16:55] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
// Phase 1: matrix 906 rows 412 cols
[2024-05-27 21:16:56] [INFO ] Computed 40 invariants in 30 ms
[2024-05-27 21:16:56] [INFO ] Implicit Places using invariants in 372 ms returned []
[2024-05-27 21:16:56] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-27 21:16:56] [INFO ] Invariant cache hit.
[2024-05-27 21:16:56] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:17:02] [INFO ] Implicit Places using invariants and state equation in 6201 ms returned []
Implicit Place search using SMT with State Equation took 6579 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 412/428 places, 922/930 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7084 ms. Remains : 412/428 places, 922/930 transitions.
RANDOM walk for 40000 steps (21 resets) in 488 ms. (81 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 172 ms. (231 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (15 resets) in 241 ms. (165 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (10 resets) in 160 ms. (248 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (11 resets) in 209 ms. (190 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 154285 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 4
Probabilistic random walk after 154285 steps, saw 86128 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
[2024-05-27 21:17:06] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-27 21:17:06] [INFO ] Invariant cache hit.
[2024-05-27 21:17:06] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 142/202 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 198/400 variables, 25/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 8/408 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-27 21:17:06] [INFO ] Deduced a trap composed of 176 places in 256 ms of which 4 ms to minimize.
[2024-05-27 21:17:06] [INFO ] Deduced a trap composed of 42 places in 130 ms of which 2 ms to minimize.
[2024-05-27 21:17:06] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 2 ms to minimize.
[2024-05-27 21:17:07] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 2 ms to minimize.
[2024-05-27 21:17:07] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 2 ms to minimize.
[2024-05-27 21:17:07] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-27 21:17:07] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-05-27 21:17:07] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/410 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 906/1316 variables, 410/457 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1316 variables, 96/553 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1316 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/1318 variables, 2/555 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1318 variables, 1/556 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1318 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/1318 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1318/1318 variables, and 556 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3846 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 412/412 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 142/202 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 198/400 variables, 25/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 8/408 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/410 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 906/1316 variables, 410/457 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1316 variables, 96/553 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1316 variables, 4/557 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-27 21:17:16] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1316 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1316 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 2/1318 variables, 2/560 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1318 variables, 1/561 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-27 21:17:49] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1318 variables, 1/562 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1318 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1318 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1318/1318 variables, and 562 constraints, problems are : Problem set: 0 solved, 4 unsolved in 75012 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 412/412 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 10/10 constraints]
After SMT, in 78889ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 60 out of 412 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 922/922 transitions.
Applied a total of 0 rules in 41 ms. Remains 412 /412 variables (removed 0) and now considering 922/922 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 412/412 places, 922/922 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 922/922 transitions.
Applied a total of 0 rules in 29 ms. Remains 412 /412 variables (removed 0) and now considering 922/922 (removed 0) transitions.
[2024-05-27 21:18:25] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-27 21:18:25] [INFO ] Invariant cache hit.
[2024-05-27 21:18:25] [INFO ] Implicit Places using invariants in 568 ms returned []
[2024-05-27 21:18:25] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-27 21:18:25] [INFO ] Invariant cache hit.
[2024-05-27 21:18:25] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:18:31] [INFO ] Implicit Places using invariants and state equation in 6328 ms returned []
Implicit Place search using SMT with State Equation took 6910 ms to find 0 implicit places.
[2024-05-27 21:18:32] [INFO ] Redundant transitions in 66 ms returned []
Running 920 sub problems to find dead transitions.
[2024-05-27 21:18:32] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-27 21:18:32] [INFO ] Invariant cache hit.
[2024-05-27 21:18:32] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-27 21:18:39] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 1 ms to minimize.
[2024-05-27 21:18:39] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-05-27 21:18:39] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2024-05-27 21:18:39] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 2 ms to minimize.
[2024-05-27 21:18:39] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 0 ms to minimize.
[2024-05-27 21:18:39] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 0 ms to minimize.
[2024-05-27 21:18:39] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 0 ms to minimize.
[2024-05-27 21:18:40] [INFO ] Deduced a trap composed of 163 places in 233 ms of which 3 ms to minimize.
[2024-05-27 21:18:40] [INFO ] Deduced a trap composed of 42 places in 197 ms of which 3 ms to minimize.
[2024-05-27 21:18:40] [INFO ] Deduced a trap composed of 169 places in 186 ms of which 2 ms to minimize.
[2024-05-27 21:18:40] [INFO ] Deduced a trap composed of 181 places in 201 ms of which 3 ms to minimize.
[2024-05-27 21:18:41] [INFO ] Deduced a trap composed of 19 places in 257 ms of which 3 ms to minimize.
[2024-05-27 21:18:42] [INFO ] Deduced a trap composed of 47 places in 133 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 920 unsolved
Problem TDEAD812 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/412 variables, 2/53 constraints. Problems are: Problem set: 88 solved, 832 unsolved
[2024-05-27 21:19:02] [INFO ] Deduced a trap composed of 169 places in 238 ms of which 4 ms to minimize.
[2024-05-27 21:19:02] [INFO ] Deduced a trap composed of 56 places in 145 ms of which 2 ms to minimize.
[2024-05-27 21:19:02] [INFO ] Deduced a trap composed of 169 places in 211 ms of which 3 ms to minimize.
[2024-05-27 21:19:03] [INFO ] Deduced a trap composed of 85 places in 212 ms of which 3 ms to minimize.
[2024-05-27 21:19:03] [INFO ] Deduced a trap composed of 164 places in 223 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 412/1318 variables, and 58 constraints, problems are : Problem set: 88 solved, 832 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 920/920 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 88 solved, 832 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 12/12 constraints. Problems are: Problem set: 88 solved, 832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 26/38 constraints. Problems are: Problem set: 88 solved, 832 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 17/55 constraints. Problems are: Problem set: 88 solved, 832 unsolved
[2024-05-27 21:19:13] [INFO ] Deduced a trap composed of 250 places in 256 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 1/56 constraints. Problems are: Problem set: 88 solved, 832 unsolved
[2024-05-27 21:19:25] [INFO ] Deduced a trap composed of 226 places in 253 ms of which 3 ms to minimize.
[2024-05-27 21:19:25] [INFO ] Deduced a trap composed of 150 places in 188 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/1318 variables, and 58 constraints, problems are : Problem set: 88 solved, 832 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/920 constraints, Known Traps: 20/21 constraints]
After SMT, in 61770ms problems are : Problem set: 88 solved, 832 unsolved
Search for dead transitions found 88 dead transitions in 61785ms
Found 88 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 88 transitions
Dead transitions reduction (with SMT) removed 88 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 412/412 places, 834/922 transitions.
Reduce places removed 0 places and 16 transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 0 places and 16 transitions.
Applied a total of 0 rules in 33 ms. Remains 412 /412 variables (removed 0) and now considering 802/834 (removed 32) transitions.
[2024-05-27 21:19:33] [INFO ] Redundant transitions in 7 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 68908 ms. Remains : 412/412 places, 802/922 transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Successfully simplified 12 atomic propositions for a total of 14 simplifications.
[2024-05-27 21:19:34] [INFO ] Flatten gal took : 130 ms
[2024-05-27 21:19:34] [INFO ] Flatten gal took : 130 ms
[2024-05-27 21:19:34] [INFO ] Input system was already deterministic with 1114 transitions.
Support contains 488 out of 612 places (down from 497) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 74 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-27 21:19:34] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 596 cols
[2024-05-27 21:19:34] [INFO ] Computed 48 invariants in 38 ms
[2024-05-27 21:19:34] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:19:46] [INFO ] Deduced a trap composed of 63 places in 101 ms of which 2 ms to minimize.
[2024-05-27 21:19:46] [INFO ] Deduced a trap composed of 63 places in 102 ms of which 2 ms to minimize.
[2024-05-27 21:19:46] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 6 ms to minimize.
[2024-05-27 21:19:46] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 1 ms to minimize.
[2024-05-27 21:19:46] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 1 ms to minimize.
[2024-05-27 21:19:46] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 1 ms to minimize.
[2024-05-27 21:19:46] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 1 ms to minimize.
[2024-05-27 21:19:47] [INFO ] Deduced a trap composed of 328 places in 311 ms of which 4 ms to minimize.
[2024-05-27 21:19:47] [INFO ] Deduced a trap composed of 316 places in 283 ms of which 4 ms to minimize.
[2024-05-27 21:19:47] [INFO ] Deduced a trap composed of 327 places in 285 ms of which 4 ms to minimize.
[2024-05-27 21:19:48] [INFO ] Deduced a trap composed of 320 places in 304 ms of which 5 ms to minimize.
[2024-05-27 21:19:48] [INFO ] Deduced a trap composed of 302 places in 289 ms of which 4 ms to minimize.
[2024-05-27 21:19:48] [INFO ] Deduced a trap composed of 183 places in 304 ms of which 4 ms to minimize.
[2024-05-27 21:19:50] [INFO ] Deduced a trap composed of 327 places in 308 ms of which 4 ms to minimize.
[2024-05-27 21:19:50] [INFO ] Deduced a trap composed of 379 places in 221 ms of which 5 ms to minimize.
[2024-05-27 21:19:50] [INFO ] Deduced a trap composed of 313 places in 266 ms of which 4 ms to minimize.
[2024-05-27 21:19:51] [INFO ] Deduced a trap composed of 388 places in 306 ms of which 4 ms to minimize.
[2024-05-27 21:19:51] [INFO ] Deduced a trap composed of 301 places in 246 ms of which 7 ms to minimize.
[2024-05-27 21:19:51] [INFO ] Deduced a trap composed of 314 places in 256 ms of which 3 ms to minimize.
[2024-05-27 21:19:51] [INFO ] Deduced a trap composed of 324 places in 252 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:19:52] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 1 ms to minimize.
[2024-05-27 21:19:53] [INFO ] Deduced a trap composed of 356 places in 290 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 6.0)
(s1 4.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 9.0)
(s163 0.0)
(s164 1.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 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 (/ 1.0 3.0))
(s202 1.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 (/ 1.0 3.0))
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 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 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 (/ 1.0 3.0))
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.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 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 68 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 22/68 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:20:03] [INFO ] Deduced a trap composed of 306 places in 220 ms of which 4 ms to minimize.
[2024-05-27 21:20:04] [INFO ] Deduced a trap composed of 330 places in 335 ms of which 7 ms to minimize.
[2024-05-27 21:20:04] [INFO ] Deduced a trap composed of 346 places in 287 ms of which 4 ms to minimize.
[2024-05-27 21:20:05] [INFO ] Deduced a trap composed of 343 places in 236 ms of which 4 ms to minimize.
[2024-05-27 21:20:05] [INFO ] Deduced a trap composed of 307 places in 268 ms of which 3 ms to minimize.
[2024-05-27 21:20:08] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 2 ms to minimize.
[2024-05-27 21:20:09] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 2 ms to minimize.
[2024-05-27 21:20:09] [INFO ] Deduced a trap composed of 53 places in 112 ms of which 2 ms to minimize.
[2024-05-27 21:20:11] [INFO ] Deduced a trap composed of 352 places in 247 ms of which 4 ms to minimize.
[2024-05-27 21:20:11] [INFO ] Deduced a trap composed of 353 places in 228 ms of which 3 ms to minimize.
[2024-05-27 21:20:11] [INFO ] Deduced a trap composed of 355 places in 237 ms of which 3 ms to minimize.
[2024-05-27 21:20:12] [INFO ] Deduced a trap composed of 341 places in 238 ms of which 3 ms to minimize.
[2024-05-27 21:20:12] [INFO ] Deduced a trap composed of 421 places in 234 ms of which 3 ms to minimize.
[2024-05-27 21:20:12] [INFO ] Deduced a trap composed of 355 places in 225 ms of which 3 ms to minimize.
[2024-05-27 21:20:12] [INFO ] Deduced a trap composed of 427 places in 220 ms of which 3 ms to minimize.
[2024-05-27 21:20:13] [INFO ] Deduced a trap composed of 353 places in 217 ms of which 3 ms to minimize.
[2024-05-27 21:20:13] [INFO ] Deduced a trap composed of 373 places in 220 ms of which 4 ms to minimize.
[2024-05-27 21:20:13] [INFO ] Deduced a trap composed of 353 places in 220 ms of which 3 ms to minimize.
[2024-05-27 21:20:13] [INFO ] Deduced a trap composed of 354 places in 222 ms of which 3 ms to minimize.
[2024-05-27 21:20:14] [INFO ] Deduced a trap composed of 352 places in 213 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 88 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 42/42 constraints]
After SMT, in 41643ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41670ms
Finished structural reductions in LTL mode , in 1 iterations and 41761 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-05-27 21:20:16] [INFO ] Flatten gal took : 74 ms
[2024-05-27 21:20:16] [INFO ] Flatten gal took : 64 ms
[2024-05-27 21:20:16] [INFO ] Input system was already deterministic with 1098 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 40 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-27 21:20:16] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-27 21:20:16] [INFO ] Invariant cache hit.
[2024-05-27 21:20:16] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:20:28] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 2 ms to minimize.
[2024-05-27 21:20:30] [INFO ] Deduced a trap composed of 63 places in 200 ms of which 3 ms to minimize.
[2024-05-27 21:20:30] [INFO ] Deduced a trap composed of 65 places in 178 ms of which 3 ms to minimize.
[2024-05-27 21:20:31] [INFO ] Deduced a trap composed of 63 places in 35 ms of which 1 ms to minimize.
[2024-05-27 21:20:31] [INFO ] Deduced a trap composed of 63 places in 35 ms of which 1 ms to minimize.
[2024-05-27 21:20:31] [INFO ] Deduced a trap composed of 63 places in 38 ms of which 0 ms to minimize.
[2024-05-27 21:20:31] [INFO ] Deduced a trap composed of 63 places in 36 ms of which 1 ms to minimize.
[2024-05-27 21:20:31] [INFO ] Deduced a trap composed of 63 places in 36 ms of which 1 ms to minimize.
[2024-05-27 21:20:31] [INFO ] Deduced a trap composed of 47 places in 159 ms of which 2 ms to minimize.
[2024-05-27 21:20:31] [INFO ] Deduced a trap composed of 63 places in 36 ms of which 0 ms to minimize.
[2024-05-27 21:20:33] [INFO ] Deduced a trap composed of 347 places in 281 ms of which 5 ms to minimize.
[2024-05-27 21:20:33] [INFO ] Deduced a trap composed of 338 places in 232 ms of which 4 ms to minimize.
[2024-05-27 21:20:34] [INFO ] Deduced a trap composed of 276 places in 238 ms of which 3 ms to minimize.
[2024-05-27 21:20:34] [INFO ] Deduced a trap composed of 300 places in 271 ms of which 4 ms to minimize.
[2024-05-27 21:20:34] [INFO ] Deduced a trap composed of 340 places in 295 ms of which 5 ms to minimize.
[2024-05-27 21:20:35] [INFO ] Deduced a trap composed of 315 places in 235 ms of which 4 ms to minimize.
[2024-05-27 21:20:35] [INFO ] Deduced a trap composed of 323 places in 245 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 63 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 17/63 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:20:39] [INFO ] Deduced a trap composed of 148 places in 240 ms of which 4 ms to minimize.
[2024-05-27 21:20:40] [INFO ] Deduced a trap composed of 167 places in 230 ms of which 4 ms to minimize.
[2024-05-27 21:20:40] [INFO ] Deduced a trap composed of 180 places in 213 ms of which 3 ms to minimize.
[2024-05-27 21:20:40] [INFO ] Deduced a trap composed of 185 places in 205 ms of which 9 ms to minimize.
[2024-05-27 21:20:41] [INFO ] Deduced a trap composed of 293 places in 281 ms of which 4 ms to minimize.
[2024-05-27 21:20:48] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 3 ms to minimize.
[2024-05-27 21:20:52] [INFO ] Deduced a trap composed of 305 places in 245 ms of which 5 ms to minimize.
[2024-05-27 21:20:53] [INFO ] Deduced a trap composed of 414 places in 294 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 71 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 25/25 constraints]
After SMT, in 41453ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41465ms
Finished structural reductions in LTL mode , in 1 iterations and 41508 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-05-27 21:20:58] [INFO ] Flatten gal took : 34 ms
[2024-05-27 21:20:58] [INFO ] Flatten gal took : 37 ms
[2024-05-27 21:20:58] [INFO ] Input system was already deterministic with 1098 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 30 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-27 21:20:58] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-27 21:20:58] [INFO ] Invariant cache hit.
[2024-05-27 21:20:58] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:21:09] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-05-27 21:21:11] [INFO ] Deduced a trap composed of 63 places in 326 ms of which 4 ms to minimize.
[2024-05-27 21:21:11] [INFO ] Deduced a trap composed of 65 places in 158 ms of which 3 ms to minimize.
[2024-05-27 21:21:11] [INFO ] Deduced a trap composed of 63 places in 34 ms of which 0 ms to minimize.
[2024-05-27 21:21:11] [INFO ] Deduced a trap composed of 63 places in 37 ms of which 1 ms to minimize.
[2024-05-27 21:21:11] [INFO ] Deduced a trap composed of 63 places in 34 ms of which 1 ms to minimize.
[2024-05-27 21:21:11] [INFO ] Deduced a trap composed of 63 places in 41 ms of which 0 ms to minimize.
[2024-05-27 21:21:11] [INFO ] Deduced a trap composed of 63 places in 41 ms of which 1 ms to minimize.
[2024-05-27 21:21:12] [INFO ] Deduced a trap composed of 47 places in 191 ms of which 2 ms to minimize.
[2024-05-27 21:21:12] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 1 ms to minimize.
[2024-05-27 21:21:14] [INFO ] Deduced a trap composed of 347 places in 278 ms of which 4 ms to minimize.
[2024-05-27 21:21:14] [INFO ] Deduced a trap composed of 338 places in 261 ms of which 4 ms to minimize.
[2024-05-27 21:21:14] [INFO ] Deduced a trap composed of 276 places in 243 ms of which 4 ms to minimize.
[2024-05-27 21:21:15] [INFO ] Deduced a trap composed of 300 places in 228 ms of which 3 ms to minimize.
[2024-05-27 21:21:15] [INFO ] Deduced a trap composed of 340 places in 260 ms of which 3 ms to minimize.
[2024-05-27 21:21:15] [INFO ] Deduced a trap composed of 315 places in 228 ms of which 4 ms to minimize.
[2024-05-27 21:21:16] [INFO ] Deduced a trap composed of 323 places in 229 ms of which 4 ms to minimize.
[2024-05-27 21:21:19] [INFO ] Deduced a trap composed of 185 places in 279 ms of which 4 ms to minimize.
SMT process timed out in 21373ms, After SMT, problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 21384ms
Finished structural reductions in LTL mode , in 1 iterations and 21417 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-05-27 21:21:19] [INFO ] Flatten gal took : 39 ms
[2024-05-27 21:21:19] [INFO ] Flatten gal took : 38 ms
[2024-05-27 21:21:19] [INFO ] Input system was already deterministic with 1098 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 69 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-27 21:21:20] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-27 21:21:20] [INFO ] Invariant cache hit.
[2024-05-27 21:21:20] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:21:31] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-05-27 21:21:33] [INFO ] Deduced a trap composed of 63 places in 199 ms of which 3 ms to minimize.
[2024-05-27 21:21:34] [INFO ] Deduced a trap composed of 65 places in 188 ms of which 2 ms to minimize.
[2024-05-27 21:21:34] [INFO ] Deduced a trap composed of 63 places in 44 ms of which 1 ms to minimize.
[2024-05-27 21:21:34] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 1 ms to minimize.
[2024-05-27 21:21:34] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2024-05-27 21:21:34] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 3 ms to minimize.
[2024-05-27 21:21:34] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 1 ms to minimize.
[2024-05-27 21:21:34] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 2 ms to minimize.
[2024-05-27 21:21:35] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 2 ms to minimize.
[2024-05-27 21:21:36] [INFO ] Deduced a trap composed of 347 places in 231 ms of which 3 ms to minimize.
[2024-05-27 21:21:37] [INFO ] Deduced a trap composed of 338 places in 235 ms of which 3 ms to minimize.
[2024-05-27 21:21:37] [INFO ] Deduced a trap composed of 276 places in 300 ms of which 4 ms to minimize.
[2024-05-27 21:21:37] [INFO ] Deduced a trap composed of 300 places in 215 ms of which 4 ms to minimize.
[2024-05-27 21:21:38] [INFO ] Deduced a trap composed of 340 places in 256 ms of which 3 ms to minimize.
[2024-05-27 21:21:38] [INFO ] Deduced a trap composed of 315 places in 218 ms of which 4 ms to minimize.
[2024-05-27 21:21:38] [INFO ] Deduced a trap composed of 323 places in 212 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 63 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 17/63 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:21:43] [INFO ] Deduced a trap composed of 148 places in 194 ms of which 4 ms to minimize.
[2024-05-27 21:21:43] [INFO ] Deduced a trap composed of 167 places in 254 ms of which 4 ms to minimize.
[2024-05-27 21:21:43] [INFO ] Deduced a trap composed of 180 places in 246 ms of which 5 ms to minimize.
[2024-05-27 21:21:43] [INFO ] Deduced a trap composed of 185 places in 199 ms of which 3 ms to minimize.
[2024-05-27 21:21:44] [INFO ] Deduced a trap composed of 293 places in 240 ms of which 3 ms to minimize.
[2024-05-27 21:21:52] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 1 ms to minimize.
[2024-05-27 21:21:56] [INFO ] Deduced a trap composed of 305 places in 269 ms of which 5 ms to minimize.
[2024-05-27 21:21:57] [INFO ] Deduced a trap composed of 414 places in 292 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 71 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 25/25 constraints]
After SMT, in 41506ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41523ms
Finished structural reductions in LTL mode , in 1 iterations and 41597 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-05-27 21:22:01] [INFO ] Flatten gal took : 32 ms
[2024-05-27 21:22:01] [INFO ] Flatten gal took : 32 ms
[2024-05-27 21:22:01] [INFO ] Input system was already deterministic with 1098 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 20 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-27 21:22:01] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-27 21:22:01] [INFO ] Invariant cache hit.
[2024-05-27 21:22:01] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:22:13] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 2 ms to minimize.
[2024-05-27 21:22:16] [INFO ] Deduced a trap composed of 63 places in 260 ms of which 4 ms to minimize.
[2024-05-27 21:22:16] [INFO ] Deduced a trap composed of 65 places in 170 ms of which 3 ms to minimize.
[2024-05-27 21:22:16] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 1 ms to minimize.
[2024-05-27 21:22:16] [INFO ] Deduced a trap composed of 63 places in 45 ms of which 2 ms to minimize.
[2024-05-27 21:22:16] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 1 ms to minimize.
[2024-05-27 21:22:16] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2024-05-27 21:22:16] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 1 ms to minimize.
[2024-05-27 21:22:17] [INFO ] Deduced a trap composed of 47 places in 211 ms of which 3 ms to minimize.
[2024-05-27 21:22:17] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 1 ms to minimize.
[2024-05-27 21:22:19] [INFO ] Deduced a trap composed of 347 places in 274 ms of which 4 ms to minimize.
[2024-05-27 21:22:19] [INFO ] Deduced a trap composed of 338 places in 289 ms of which 4 ms to minimize.
[2024-05-27 21:22:20] [INFO ] Deduced a trap composed of 276 places in 281 ms of which 4 ms to minimize.
[2024-05-27 21:22:20] [INFO ] Deduced a trap composed of 300 places in 271 ms of which 4 ms to minimize.
[2024-05-27 21:22:21] [INFO ] Deduced a trap composed of 340 places in 289 ms of which 4 ms to minimize.
[2024-05-27 21:22:21] [INFO ] Deduced a trap composed of 315 places in 238 ms of which 3 ms to minimize.
[2024-05-27 21:22:21] [INFO ] Deduced a trap composed of 323 places in 216 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 63 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 17/63 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:22:24] [INFO ] Deduced a trap composed of 148 places in 192 ms of which 4 ms to minimize.
[2024-05-27 21:22:25] [INFO ] Deduced a trap composed of 167 places in 265 ms of which 5 ms to minimize.
[2024-05-27 21:22:25] [INFO ] Deduced a trap composed of 180 places in 200 ms of which 3 ms to minimize.
[2024-05-27 21:22:25] [INFO ] Deduced a trap composed of 185 places in 209 ms of which 3 ms to minimize.
[2024-05-27 21:22:25] [INFO ] Deduced a trap composed of 293 places in 223 ms of which 3 ms to minimize.
[2024-05-27 21:22:33] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 2 ms to minimize.
[2024-05-27 21:22:36] [INFO ] Deduced a trap composed of 305 places in 294 ms of which 4 ms to minimize.
[2024-05-27 21:22:38] [INFO ] Deduced a trap composed of 414 places in 297 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 71 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 25/25 constraints]
After SMT, in 41378ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41392ms
Finished structural reductions in LTL mode , in 1 iterations and 41415 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-05-27 21:22:43] [INFO ] Flatten gal took : 30 ms
[2024-05-27 21:22:43] [INFO ] Flatten gal took : 33 ms
[2024-05-27 21:22:43] [INFO ] Input system was already deterministic with 1098 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Applied a total of 16 rules in 11 ms. Remains 604 /612 variables (removed 8) and now considering 1106/1114 (removed 8) transitions.
Running 1104 sub problems to find dead transitions.
[2024-05-27 21:22:43] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
// Phase 1: matrix 1090 rows 604 cols
[2024-05-27 21:22:43] [INFO ] Computed 48 invariants in 13 ms
[2024-05-27 21:22:43] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
[2024-05-27 21:22:54] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-05-27 21:22:56] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 1 ms to minimize.
[2024-05-27 21:22:56] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 2 ms to minimize.
[2024-05-27 21:22:56] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-05-27 21:22:57] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-05-27 21:22:57] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-05-27 21:22:57] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-05-27 21:22:58] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2024-05-27 21:23:00] [INFO ] Deduced a trap composed of 337 places in 311 ms of which 4 ms to minimize.
[2024-05-27 21:23:00] [INFO ] Deduced a trap composed of 299 places in 270 ms of which 5 ms to minimize.
[2024-05-27 21:23:00] [INFO ] Deduced a trap composed of 329 places in 257 ms of which 4 ms to minimize.
[2024-05-27 21:23:00] [INFO ] Deduced a trap composed of 367 places in 252 ms of which 3 ms to minimize.
[2024-05-27 21:23:01] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 3 ms to minimize.
[2024-05-27 21:23:01] [INFO ] Deduced a trap composed of 342 places in 252 ms of which 4 ms to minimize.
[2024-05-27 21:23:01] [INFO ] Deduced a trap composed of 350 places in 240 ms of which 4 ms to minimize.
[2024-05-27 21:23:01] [INFO ] Deduced a trap composed of 333 places in 230 ms of which 3 ms to minimize.
[2024-05-27 21:23:02] [INFO ] Deduced a trap composed of 322 places in 271 ms of which 3 ms to minimize.
[2024-05-27 21:23:02] [INFO ] Deduced a trap composed of 319 places in 213 ms of which 3 ms to minimize.
[2024-05-27 21:23:02] [INFO ] Deduced a trap composed of 316 places in 253 ms of which 4 ms to minimize.
[2024-05-27 21:23:03] [INFO ] Deduced a trap composed of 300 places in 247 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
[2024-05-27 21:23:04] [INFO ] Deduced a trap composed of 156 places in 266 ms of which 4 ms to minimize.
[2024-05-27 21:23:04] [INFO ] Deduced a trap composed of 176 places in 260 ms of which 4 ms to minimize.
SMT process timed out in 21229ms, After SMT, problems are : Problem set: 0 solved, 1104 unsolved
Search for dead transitions found 0 dead transitions in 21240ms
Finished structural reductions in LTL mode , in 1 iterations and 21253 ms. Remains : 604/612 places, 1106/1114 transitions.
[2024-05-27 21:23:04] [INFO ] Flatten gal took : 42 ms
[2024-05-27 21:23:04] [INFO ] Flatten gal took : 44 ms
[2024-05-27 21:23:04] [INFO ] Input system was already deterministic with 1106 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Applied a total of 0 rules in 6 ms. Remains 612 /612 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
Running 1112 sub problems to find dead transitions.
[2024-05-27 21:23:04] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 612 cols
[2024-05-27 21:23:04] [INFO ] Computed 48 invariants in 26 ms
[2024-05-27 21:23:04] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-05-27 21:23:17] [INFO ] Deduced a trap composed of 65 places in 113 ms of which 2 ms to minimize.
[2024-05-27 21:23:17] [INFO ] Deduced a trap composed of 65 places in 161 ms of which 3 ms to minimize.
[2024-05-27 21:23:17] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 1 ms to minimize.
[2024-05-27 21:23:17] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 1 ms to minimize.
[2024-05-27 21:23:17] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 1 ms to minimize.
[2024-05-27 21:23:17] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
[2024-05-27 21:23:17] [INFO ] Deduced a trap composed of 66 places in 45 ms of which 1 ms to minimize.
[2024-05-27 21:23:17] [INFO ] Deduced a trap composed of 65 places in 41 ms of which 1 ms to minimize.
[2024-05-27 21:23:19] [INFO ] Deduced a trap composed of 65 places in 33 ms of which 1 ms to minimize.
[2024-05-27 21:23:21] [INFO ] Deduced a trap composed of 300 places in 217 ms of which 4 ms to minimize.
[2024-05-27 21:23:24] [INFO ] Deduced a trap composed of 312 places in 210 ms of which 4 ms to minimize.
[2024-05-27 21:23:24] [INFO ] Deduced a trap composed of 322 places in 221 ms of which 4 ms to minimize.
[2024-05-27 21:23:24] [INFO ] Deduced a trap composed of 318 places in 285 ms of which 4 ms to minimize.
[2024-05-27 21:23:24] [INFO ] Deduced a trap composed of 310 places in 270 ms of which 4 ms to minimize.
[2024-05-27 21:23:25] [INFO ] Deduced a trap composed of 339 places in 226 ms of which 4 ms to minimize.
SMT process timed out in 21288ms, After SMT, problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 21300ms
Finished structural reductions in LTL mode , in 1 iterations and 21309 ms. Remains : 612/612 places, 1114/1114 transitions.
[2024-05-27 21:23:26] [INFO ] Flatten gal took : 31 ms
[2024-05-27 21:23:26] [INFO ] Flatten gal took : 32 ms
[2024-05-27 21:23:26] [INFO ] Input system was already deterministic with 1114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 18 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-27 21:23:26] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 596 cols
[2024-05-27 21:23:26] [INFO ] Computed 48 invariants in 29 ms
[2024-05-27 21:23:26] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:23:35] [INFO ] Deduced a trap composed of 63 places in 126 ms of which 2 ms to minimize.
[2024-05-27 21:23:35] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 2 ms to minimize.
[2024-05-27 21:23:36] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 1 ms to minimize.
[2024-05-27 21:23:36] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2024-05-27 21:23:36] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 1 ms to minimize.
[2024-05-27 21:23:36] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 1 ms to minimize.
[2024-05-27 21:23:36] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 0 ms to minimize.
[2024-05-27 21:23:37] [INFO ] Deduced a trap composed of 328 places in 279 ms of which 4 ms to minimize.
[2024-05-27 21:23:37] [INFO ] Deduced a trap composed of 316 places in 275 ms of which 4 ms to minimize.
[2024-05-27 21:23:37] [INFO ] Deduced a trap composed of 327 places in 278 ms of which 4 ms to minimize.
[2024-05-27 21:23:38] [INFO ] Deduced a trap composed of 320 places in 288 ms of which 4 ms to minimize.
[2024-05-27 21:23:38] [INFO ] Deduced a trap composed of 302 places in 289 ms of which 4 ms to minimize.
[2024-05-27 21:23:38] [INFO ] Deduced a trap composed of 183 places in 218 ms of which 4 ms to minimize.
[2024-05-27 21:23:39] [INFO ] Deduced a trap composed of 327 places in 245 ms of which 3 ms to minimize.
[2024-05-27 21:23:39] [INFO ] Deduced a trap composed of 379 places in 213 ms of which 3 ms to minimize.
[2024-05-27 21:23:40] [INFO ] Deduced a trap composed of 313 places in 214 ms of which 4 ms to minimize.
[2024-05-27 21:23:40] [INFO ] Deduced a trap composed of 388 places in 213 ms of which 3 ms to minimize.
[2024-05-27 21:23:40] [INFO ] Deduced a trap composed of 301 places in 221 ms of which 4 ms to minimize.
[2024-05-27 21:23:40] [INFO ] Deduced a trap composed of 314 places in 228 ms of which 3 ms to minimize.
[2024-05-27 21:23:41] [INFO ] Deduced a trap composed of 324 places in 200 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:23:41] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 1 ms to minimize.
[2024-05-27 21:23:42] [INFO ] Deduced a trap composed of 356 places in 260 ms of which 3 ms to minimize.
[2024-05-27 21:23:46] [INFO ] Deduced a trap composed of 47 places in 162 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 69 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 23/69 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:23:58] [INFO ] Deduced a trap composed of 294 places in 215 ms of which 4 ms to minimize.
[2024-05-27 21:23:59] [INFO ] Deduced a trap composed of 314 places in 270 ms of which 4 ms to minimize.
[2024-05-27 21:24:02] [INFO ] Deduced a trap composed of 365 places in 273 ms of which 5 ms to minimize.
[2024-05-27 21:24:02] [INFO ] Deduced a trap composed of 409 places in 241 ms of which 3 ms to minimize.
[2024-05-27 21:24:02] [INFO ] Deduced a trap composed of 318 places in 206 ms of which 3 ms to minimize.
[2024-05-27 21:24:02] [INFO ] Deduced a trap composed of 347 places in 187 ms of which 3 ms to minimize.
[2024-05-27 21:24:04] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 7/76 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 76 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 30/30 constraints]
After SMT, in 41202ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41216ms
Finished structural reductions in LTL mode , in 1 iterations and 41237 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-05-27 21:24:07] [INFO ] Flatten gal took : 30 ms
[2024-05-27 21:24:07] [INFO ] Flatten gal took : 34 ms
[2024-05-27 21:24:07] [INFO ] Input system was already deterministic with 1098 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 16 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-27 21:24:07] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-27 21:24:07] [INFO ] Invariant cache hit.
[2024-05-27 21:24:07] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:24:18] [INFO ] Deduced a trap composed of 64 places in 34 ms of which 0 ms to minimize.
[2024-05-27 21:24:20] [INFO ] Deduced a trap composed of 63 places in 193 ms of which 3 ms to minimize.
[2024-05-27 21:24:20] [INFO ] Deduced a trap composed of 65 places in 176 ms of which 2 ms to minimize.
[2024-05-27 21:24:21] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 0 ms to minimize.
[2024-05-27 21:24:21] [INFO ] Deduced a trap composed of 63 places in 45 ms of which 1 ms to minimize.
[2024-05-27 21:24:21] [INFO ] Deduced a trap composed of 63 places in 44 ms of which 0 ms to minimize.
[2024-05-27 21:24:21] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 1 ms to minimize.
[2024-05-27 21:24:21] [INFO ] Deduced a trap composed of 63 places in 38 ms of which 1 ms to minimize.
[2024-05-27 21:24:21] [INFO ] Deduced a trap composed of 47 places in 164 ms of which 3 ms to minimize.
[2024-05-27 21:24:22] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 2 ms to minimize.
[2024-05-27 21:24:23] [INFO ] Deduced a trap composed of 347 places in 258 ms of which 4 ms to minimize.
[2024-05-27 21:24:24] [INFO ] Deduced a trap composed of 338 places in 220 ms of which 3 ms to minimize.
[2024-05-27 21:24:24] [INFO ] Deduced a trap composed of 276 places in 247 ms of which 4 ms to minimize.
[2024-05-27 21:24:24] [INFO ] Deduced a trap composed of 300 places in 226 ms of which 3 ms to minimize.
[2024-05-27 21:24:24] [INFO ] Deduced a trap composed of 340 places in 232 ms of which 3 ms to minimize.
[2024-05-27 21:24:25] [INFO ] Deduced a trap composed of 315 places in 249 ms of which 3 ms to minimize.
[2024-05-27 21:24:25] [INFO ] Deduced a trap composed of 323 places in 225 ms of which 3 ms to minimize.
[2024-05-27 21:24:28] [INFO ] Deduced a trap composed of 185 places in 260 ms of which 3 ms to minimize.
SMT process timed out in 21385ms, After SMT, problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 21395ms
Finished structural reductions in LTL mode , in 1 iterations and 21414 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-05-27 21:24:28] [INFO ] Flatten gal took : 42 ms
[2024-05-27 21:24:28] [INFO ] Flatten gal took : 44 ms
[2024-05-27 21:24:29] [INFO ] Input system was already deterministic with 1098 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 20 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-27 21:24:29] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-27 21:24:29] [INFO ] Invariant cache hit.
[2024-05-27 21:24:29] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:24:40] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-05-27 21:24:42] [INFO ] Deduced a trap composed of 63 places in 196 ms of which 3 ms to minimize.
[2024-05-27 21:24:42] [INFO ] Deduced a trap composed of 65 places in 180 ms of which 3 ms to minimize.
[2024-05-27 21:24:42] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 1 ms to minimize.
[2024-05-27 21:24:42] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 1 ms to minimize.
[2024-05-27 21:24:42] [INFO ] Deduced a trap composed of 63 places in 44 ms of which 1 ms to minimize.
[2024-05-27 21:24:42] [INFO ] Deduced a trap composed of 63 places in 41 ms of which 1 ms to minimize.
[2024-05-27 21:24:43] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 1 ms to minimize.
[2024-05-27 21:24:43] [INFO ] Deduced a trap composed of 47 places in 211 ms of which 3 ms to minimize.
[2024-05-27 21:24:43] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2024-05-27 21:24:45] [INFO ] Deduced a trap composed of 347 places in 347 ms of which 6 ms to minimize.
[2024-05-27 21:24:45] [INFO ] Deduced a trap composed of 338 places in 273 ms of which 4 ms to minimize.
[2024-05-27 21:24:46] [INFO ] Deduced a trap composed of 276 places in 222 ms of which 3 ms to minimize.
[2024-05-27 21:24:46] [INFO ] Deduced a trap composed of 300 places in 241 ms of which 3 ms to minimize.
[2024-05-27 21:24:46] [INFO ] Deduced a trap composed of 340 places in 251 ms of which 3 ms to minimize.
[2024-05-27 21:24:47] [INFO ] Deduced a trap composed of 315 places in 218 ms of which 4 ms to minimize.
[2024-05-27 21:24:47] [INFO ] Deduced a trap composed of 323 places in 220 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 63 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 17/63 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:24:52] [INFO ] Deduced a trap composed of 148 places in 191 ms of which 4 ms to minimize.
[2024-05-27 21:24:52] [INFO ] Deduced a trap composed of 167 places in 202 ms of which 3 ms to minimize.
[2024-05-27 21:24:52] [INFO ] Deduced a trap composed of 180 places in 264 ms of which 4 ms to minimize.
[2024-05-27 21:24:52] [INFO ] Deduced a trap composed of 185 places in 228 ms of which 3 ms to minimize.
[2024-05-27 21:24:53] [INFO ] Deduced a trap composed of 293 places in 209 ms of which 3 ms to minimize.
[2024-05-27 21:24:59] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2024-05-27 21:25:03] [INFO ] Deduced a trap composed of 305 places in 304 ms of which 4 ms to minimize.
[2024-05-27 21:25:04] [INFO ] Deduced a trap composed of 414 places in 325 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:25:09] [INFO ] Deduced a trap composed of 355 places in 294 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 594/1678 variables, and 72 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 26/26 constraints]
After SMT, in 41384ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41399ms
Finished structural reductions in LTL mode , in 1 iterations and 41423 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-05-27 21:25:10] [INFO ] Flatten gal took : 29 ms
[2024-05-27 21:25:10] [INFO ] Flatten gal took : 31 ms
[2024-05-27 21:25:10] [INFO ] Input system was already deterministic with 1098 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 14 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-27 21:25:10] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-27 21:25:10] [INFO ] Invariant cache hit.
[2024-05-27 21:25:10] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:25:21] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-05-27 21:25:24] [INFO ] Deduced a trap composed of 63 places in 269 ms of which 4 ms to minimize.
[2024-05-27 21:25:24] [INFO ] Deduced a trap composed of 65 places in 176 ms of which 2 ms to minimize.
[2024-05-27 21:25:24] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 1 ms to minimize.
[2024-05-27 21:25:24] [INFO ] Deduced a trap composed of 63 places in 42 ms of which 1 ms to minimize.
[2024-05-27 21:25:24] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2024-05-27 21:25:24] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 0 ms to minimize.
[2024-05-27 21:25:24] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 0 ms to minimize.
[2024-05-27 21:25:25] [INFO ] Deduced a trap composed of 47 places in 185 ms of which 3 ms to minimize.
[2024-05-27 21:25:25] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 1 ms to minimize.
[2024-05-27 21:25:27] [INFO ] Deduced a trap composed of 347 places in 271 ms of which 3 ms to minimize.
[2024-05-27 21:25:27] [INFO ] Deduced a trap composed of 338 places in 247 ms of which 3 ms to minimize.
[2024-05-27 21:25:28] [INFO ] Deduced a trap composed of 276 places in 294 ms of which 5 ms to minimize.
[2024-05-27 21:25:28] [INFO ] Deduced a trap composed of 300 places in 245 ms of which 4 ms to minimize.
[2024-05-27 21:25:28] [INFO ] Deduced a trap composed of 340 places in 295 ms of which 4 ms to minimize.
[2024-05-27 21:25:29] [INFO ] Deduced a trap composed of 315 places in 249 ms of which 3 ms to minimize.
[2024-05-27 21:25:29] [INFO ] Deduced a trap composed of 323 places in 237 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 63 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 17/63 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:25:33] [INFO ] Deduced a trap composed of 148 places in 189 ms of which 3 ms to minimize.
[2024-05-27 21:25:33] [INFO ] Deduced a trap composed of 167 places in 262 ms of which 4 ms to minimize.
[2024-05-27 21:25:33] [INFO ] Deduced a trap composed of 180 places in 200 ms of which 3 ms to minimize.
[2024-05-27 21:25:34] [INFO ] Deduced a trap composed of 185 places in 257 ms of which 4 ms to minimize.
[2024-05-27 21:25:34] [INFO ] Deduced a trap composed of 293 places in 220 ms of which 3 ms to minimize.
[2024-05-27 21:25:41] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
[2024-05-27 21:25:44] [INFO ] Deduced a trap composed of 305 places in 285 ms of which 4 ms to minimize.
[2024-05-27 21:25:46] [INFO ] Deduced a trap composed of 414 places in 293 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:25:51] [INFO ] Deduced a trap composed of 355 places in 247 ms of which 4 ms to minimize.
SMT process timed out in 41240ms, After SMT, problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41250ms
Finished structural reductions in LTL mode , in 1 iterations and 41269 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-05-27 21:25:51] [INFO ] Flatten gal took : 44 ms
[2024-05-27 21:25:52] [INFO ] Flatten gal took : 46 ms
[2024-05-27 21:25:52] [INFO ] Input system was already deterministic with 1098 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 12 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-27 21:25:52] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-27 21:25:52] [INFO ] Invariant cache hit.
[2024-05-27 21:25:52] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:26:03] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 2 ms to minimize.
[2024-05-27 21:26:05] [INFO ] Deduced a trap composed of 63 places in 160 ms of which 2 ms to minimize.
[2024-05-27 21:26:05] [INFO ] Deduced a trap composed of 65 places in 175 ms of which 2 ms to minimize.
[2024-05-27 21:26:05] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2024-05-27 21:26:05] [INFO ] Deduced a trap composed of 63 places in 44 ms of which 1 ms to minimize.
[2024-05-27 21:26:05] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 1 ms to minimize.
[2024-05-27 21:26:05] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2024-05-27 21:26:06] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2024-05-27 21:26:06] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 3 ms to minimize.
[2024-05-27 21:26:06] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 1 ms to minimize.
[2024-05-27 21:26:08] [INFO ] Deduced a trap composed of 347 places in 333 ms of which 4 ms to minimize.
[2024-05-27 21:26:08] [INFO ] Deduced a trap composed of 338 places in 273 ms of which 4 ms to minimize.
[2024-05-27 21:26:09] [INFO ] Deduced a trap composed of 276 places in 269 ms of which 4 ms to minimize.
[2024-05-27 21:26:09] [INFO ] Deduced a trap composed of 300 places in 333 ms of which 5 ms to minimize.
[2024-05-27 21:26:10] [INFO ] Deduced a trap composed of 340 places in 274 ms of which 4 ms to minimize.
[2024-05-27 21:26:10] [INFO ] Deduced a trap composed of 315 places in 247 ms of which 4 ms to minimize.
[2024-05-27 21:26:10] [INFO ] Deduced a trap composed of 323 places in 320 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 594/1678 variables, and 63 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 17/63 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:26:14] [INFO ] Deduced a trap composed of 148 places in 218 ms of which 3 ms to minimize.
[2024-05-27 21:26:15] [INFO ] Deduced a trap composed of 167 places in 203 ms of which 3 ms to minimize.
[2024-05-27 21:26:15] [INFO ] Deduced a trap composed of 180 places in 201 ms of which 4 ms to minimize.
[2024-05-27 21:26:15] [INFO ] Deduced a trap composed of 185 places in 200 ms of which 4 ms to minimize.
[2024-05-27 21:26:16] [INFO ] Deduced a trap composed of 293 places in 224 ms of which 3 ms to minimize.
[2024-05-27 21:26:22] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 1 ms to minimize.
[2024-05-27 21:26:25] [INFO ] Deduced a trap composed of 305 places in 234 ms of which 3 ms to minimize.
[2024-05-27 21:26:26] [INFO ] Deduced a trap composed of 414 places in 252 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:26:32] [INFO ] Deduced a trap composed of 355 places in 230 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 72 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 26/26 constraints]
After SMT, in 41282ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41292ms
Finished structural reductions in LTL mode , in 1 iterations and 41307 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-05-27 21:26:33] [INFO ] Flatten gal took : 31 ms
[2024-05-27 21:26:33] [INFO ] Flatten gal took : 34 ms
[2024-05-27 21:26:33] [INFO ] Input system was already deterministic with 1098 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 15 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-27 21:26:33] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-27 21:26:33] [INFO ] Invariant cache hit.
[2024-05-27 21:26:33] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:26:44] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-05-27 21:26:46] [INFO ] Deduced a trap composed of 63 places in 143 ms of which 2 ms to minimize.
[2024-05-27 21:26:46] [INFO ] Deduced a trap composed of 65 places in 174 ms of which 2 ms to minimize.
[2024-05-27 21:26:47] [INFO ] Deduced a trap composed of 63 places in 37 ms of which 1 ms to minimize.
[2024-05-27 21:26:47] [INFO ] Deduced a trap composed of 63 places in 37 ms of which 1 ms to minimize.
[2024-05-27 21:26:47] [INFO ] Deduced a trap composed of 63 places in 36 ms of which 1 ms to minimize.
[2024-05-27 21:26:47] [INFO ] Deduced a trap composed of 63 places in 36 ms of which 1 ms to minimize.
[2024-05-27 21:26:47] [INFO ] Deduced a trap composed of 63 places in 36 ms of which 0 ms to minimize.
[2024-05-27 21:26:47] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 2 ms to minimize.
[2024-05-27 21:26:48] [INFO ] Deduced a trap composed of 63 places in 38 ms of which 1 ms to minimize.
[2024-05-27 21:26:49] [INFO ] Deduced a trap composed of 347 places in 246 ms of which 4 ms to minimize.
[2024-05-27 21:26:50] [INFO ] Deduced a trap composed of 338 places in 247 ms of which 3 ms to minimize.
[2024-05-27 21:26:50] [INFO ] Deduced a trap composed of 276 places in 248 ms of which 3 ms to minimize.
[2024-05-27 21:26:50] [INFO ] Deduced a trap composed of 300 places in 247 ms of which 4 ms to minimize.
[2024-05-27 21:26:50] [INFO ] Deduced a trap composed of 340 places in 280 ms of which 3 ms to minimize.
[2024-05-27 21:26:51] [INFO ] Deduced a trap composed of 315 places in 228 ms of which 3 ms to minimize.
[2024-05-27 21:26:51] [INFO ] Deduced a trap composed of 323 places in 248 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 63 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 17/63 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:26:56] [INFO ] Deduced a trap composed of 148 places in 208 ms of which 3 ms to minimize.
[2024-05-27 21:26:56] [INFO ] Deduced a trap composed of 167 places in 231 ms of which 5 ms to minimize.
[2024-05-27 21:26:56] [INFO ] Deduced a trap composed of 180 places in 208 ms of which 4 ms to minimize.
[2024-05-27 21:26:57] [INFO ] Deduced a trap composed of 185 places in 236 ms of which 3 ms to minimize.
[2024-05-27 21:26:57] [INFO ] Deduced a trap composed of 293 places in 230 ms of which 4 ms to minimize.
[2024-05-27 21:27:04] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
[2024-05-27 21:27:07] [INFO ] Deduced a trap composed of 305 places in 208 ms of which 4 ms to minimize.
[2024-05-27 21:27:08] [INFO ] Deduced a trap composed of 414 places in 220 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:27:13] [INFO ] Deduced a trap composed of 355 places in 211 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 72 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 26/26 constraints]
After SMT, in 41240ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41250ms
Finished structural reductions in LTL mode , in 1 iterations and 41267 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-05-27 21:27:14] [INFO ] Flatten gal took : 31 ms
[2024-05-27 21:27:14] [INFO ] Flatten gal took : 83 ms
[2024-05-27 21:27:15] [INFO ] Input system was already deterministic with 1098 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Applied a total of 0 rules in 20 ms. Remains 612 /612 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
Running 1112 sub problems to find dead transitions.
[2024-05-27 21:27:15] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 612 cols
[2024-05-27 21:27:15] [INFO ] Computed 48 invariants in 22 ms
[2024-05-27 21:27:15] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-05-27 21:27:29] [INFO ] Deduced a trap composed of 65 places in 170 ms of which 3 ms to minimize.
[2024-05-27 21:27:29] [INFO ] Deduced a trap composed of 65 places in 185 ms of which 3 ms to minimize.
[2024-05-27 21:27:29] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 1 ms to minimize.
[2024-05-27 21:27:29] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 1 ms to minimize.
[2024-05-27 21:27:29] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 2 ms to minimize.
[2024-05-27 21:27:29] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 1 ms to minimize.
[2024-05-27 21:27:29] [INFO ] Deduced a trap composed of 66 places in 36 ms of which 1 ms to minimize.
[2024-05-27 21:27:29] [INFO ] Deduced a trap composed of 65 places in 37 ms of which 0 ms to minimize.
[2024-05-27 21:27:31] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 2 ms to minimize.
[2024-05-27 21:27:32] [INFO ] Deduced a trap composed of 300 places in 257 ms of which 4 ms to minimize.
[2024-05-27 21:27:36] [INFO ] Deduced a trap composed of 312 places in 284 ms of which 5 ms to minimize.
[2024-05-27 21:27:36] [INFO ] Deduced a trap composed of 322 places in 255 ms of which 5 ms to minimize.
[2024-05-27 21:27:36] [INFO ] Deduced a trap composed of 318 places in 302 ms of which 5 ms to minimize.
[2024-05-27 21:27:36] [INFO ] Deduced a trap composed of 310 places in 260 ms of which 4 ms to minimize.
SMT process timed out in 21800ms, After SMT, problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 21817ms
Finished structural reductions in LTL mode , in 1 iterations and 21841 ms. Remains : 612/612 places, 1114/1114 transitions.
[2024-05-27 21:27:36] [INFO ] Flatten gal took : 31 ms
[2024-05-27 21:27:36] [INFO ] Flatten gal took : 35 ms
[2024-05-27 21:27:37] [INFO ] Input system was already deterministic with 1114 transitions.
[2024-05-27 21:27:37] [INFO ] Flatten gal took : 97 ms
[2024-05-27 21:27:37] [INFO ] Flatten gal took : 69 ms
[2024-05-27 21:27:37] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 19 ms.
[2024-05-27 21:27:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 612 places, 1114 transitions and 4818 arcs took 10 ms.
Total runtime 813930 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-COL-S02J04T08

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 612
TRANSITIONS: 1114
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.028s, Sys 0.005s]


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


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

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

Process ID: 2239
MODEL NAME: /home/mcc/execution/415/model
612 places, 1114 transitions.

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

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S02J04T08"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBLF-COL-S02J04T08, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654445100082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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