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.r299-tajo-171654455900252.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBNT-COL-S10J20, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r299-tajo-171654455900252
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 8.2K Apr 12 11:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 11:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 12 11:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 11:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 13:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 13:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 92K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717142056347

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-COL-S10J20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
QuasiLiveness COL
Running Version 202405141337
[2024-05-31 07:54:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-31 07:54:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 07:54:17] [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-31 07:54:18] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 07:54:18] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 704 ms
[2024-05-31 07:54:18] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 494 PT places and 11822.0 transition bindings in 26 ms.
[2024-05-31 07:54:18] [INFO ] Unfolded HLPN to a Petri net with 494 places and 11780 transitions 111159 arcs in 279 ms.
[2024-05-31 07:54:18] [INFO ] Unfolded 38 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
[2024-05-31 07:54:18] [INFO ] Reduced 9285 identical enabling conditions.
[2024-05-31 07:54:18] [INFO ] Reduced 780 identical enabling conditions.
[2024-05-31 07:54:18] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 20 places in 32 ms
Reduce places removed 20 places and 20 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
[2024-05-31 07:54:21] [INFO ] Flatten gal took : 1487 ms
[2024-05-31 07:54:21] [INFO ] Flatten gal took : 436 ms
[2024-05-31 07:54:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15614579582043232937.gal : 140 ms
[2024-05-31 07:54:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14806263288897898574.prop : 35 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15614579582043232937.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14806263288897898574.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality14806263288897898574.prop.
RANDOM walk for 40000 steps (2240 resets) in 12960 ms. (3 steps per ms) remains 9/36 properties
BEST_FIRST walk for 40003 steps (422 resets) in 981 ms. (40 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (421 resets) in 680 ms. (58 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (420 resets) in 800 ms. (49 steps per ms) remains 9/9 properties
SDD proceeding with computation,36 properties remain. new max is 4
SDD size :1 after 386
BEST_FIRST walk for 40003 steps (109 resets) in 6907 ms. (5 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40004 steps (100 resets) in 492 ms. (81 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40002 steps (418 resets) in 234 ms. (170 steps per ms) remains 4/4 properties
[2024-05-31 07:54:25] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2024-05-31 07:54:26] [INFO ] Computed 72 invariants in 152 ms
[2024-05-31 07:54:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 382/398 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/398 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 65/463 variables, 44/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 10/473 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,36 properties remain. new max is 8
SDD size :386 after 1023
SDD proceeding with computation,36 properties remain. new max is 16
SDD size :1023 after 1024
[2024-05-31 07:54:28] [INFO ] Deduced a trap composed of 213 places in 1499 ms of which 62 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/474 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Reachability property qltransition_35 is true.
At refinement iteration 10 (OVERLAPS) 1641/2115 variables, 474/547 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2115 variables, 1/548 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Reachability property qltransition_32 is true.
Reachability property qltransition_31 is true.
Reachability property qltransition_27 is true.
Reachability property qltransition_21 is true.
Reachability property qltransition_20 is true.
Reachability property qltransition_19 is true.
Reachability property qltransition_18 is true.
Reachability property qltransition_17 is true.
Reachability property qltransition_16 is true.
Reachability property qltransition_15 is true.
Reachability property qltransition_6 is true.
SDD proceeding with computation,24 properties remain. new max is 16
SDD size :1024 after 26361
SDD proceeding with computation,24 properties remain. new max is 32
SDD size :26361 after 100425
[2024-05-31 07:54:39] [INFO ] Deduced a trap composed of 226 places in 8403 ms of which 17 ms to minimize.
SMT process timed out in 13258ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 464 transition count 1625
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 60 place count 439 transition count 1625
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 60 place count 439 transition count 1601
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 108 place count 415 transition count 1601
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 414 transition count 1600
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 414 transition count 1600
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 114 place count 412 transition count 1598
Applied a total of 114 rules in 716 ms. Remains 412 /474 variables (removed 62) and now considering 1598/1650 (removed 52) transitions.
Running 1587 sub problems to find dead transitions.
[2024-05-31 07:54:39] [INFO ] Flow matrix only has 1589 transitions (discarded 9 similar events)
// Phase 1: matrix 1589 rows 412 cols
[2024-05-31 07:54:40] [INFO ] Computed 62 invariants in 101 ms
[2024-05-31 07:54:40] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,24 properties remain. new max is 64
SDD size :100425 after 285389
SDD proceeding with computation,24 properties remain. new max is 128
SDD size :285389 after 656716
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1587 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1587 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 402/2001 variables, and 52 constraints, problems are : Problem set: 0 solved, 1587 unsolved in 20101 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/412 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1587/587 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1587 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1587 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1587 unsolved
SDD proceeding with computation,24 properties remain. new max is 256
SDD size :656716 after 1.33202e+06
[2024-05-31 07:55:19] [INFO ] Deduced a trap composed of 69 places in 421 ms of which 5 ms to minimize.
[2024-05-31 07:55:33] [INFO ] Deduced a trap composed of 15 places in 296 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1587 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 402/2001 variables, and 54 constraints, problems are : Problem set: 0 solved, 1587 unsolved in 20057 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/412 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/587 constraints, Known Traps: 2/2 constraints]
After SMT, in 58016ms problems are : Problem set: 0 solved, 1587 unsolved
Search for dead transitions found 0 dead transitions in 58067ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58856 ms. Remains : 412/474 places, 1598/1650 transitions.
RANDOM walk for 4000000 steps (281018 resets) in 82160 ms. (48 steps per ms) remains 1/3 properties
SDD proceeding with computation,24 properties remain. new max is 512
SDD size :1.33202e+06 after 2.48828e+06
BEST_FIRST walk for 4000004 steps (38157 resets) in 14147 ms. (282 steps per ms) remains 1/1 properties
[2024-05-31 07:56:04] [INFO ] Flow matrix only has 1589 transitions (discarded 9 similar events)
[2024-05-31 07:56:04] [INFO ] Invariant cache hit.
[2024-05-31 07:56:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/88 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/401 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/402 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/410 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/411 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/411 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1589/2000 variables, 411/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2000 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2000 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/2001 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2001 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2001 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2001/2001 variables, and 475 constraints, problems are : Problem set: 0 solved, 1 unsolved in 617 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 412/412 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/88 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/401 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/402 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/410 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/411 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/411 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1589/2000 variables, 411/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2000 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2000 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/2001 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2001 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2001 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2001 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2001/2001 variables, and 476 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1166 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 412/412 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1799ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 49 ms.
Support contains 1 out of 412 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 1598/1598 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 412 transition count 1597
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 411 transition count 1597
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 411 transition count 1596
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 410 transition count 1596
Applied a total of 4 rules in 79 ms. Remains 410 /412 variables (removed 2) and now considering 1596/1598 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 410/412 places, 1596/1598 transitions.
RANDOM walk for 4000000 steps (290260 resets) in 94739 ms. (42 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (38596 resets) in 14871 ms. (268 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 10903174 steps, run timeout after 87001 ms. (steps per millisecond=125 ) properties seen :0 out of 1
Probabilistic random walk after 10903174 steps, saw 1906094 distinct states, run finished after 87010 ms. (steps per millisecond=125 ) properties seen :0
[2024-05-31 07:58:02] [INFO ] Flow matrix only has 1587 transitions (discarded 9 similar events)
// Phase 1: matrix 1587 rows 410 cols
[2024-05-31 07:58:02] [INFO ] Computed 62 invariants in 72 ms
[2024-05-31 07:58:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/399 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/408 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/409 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1587/1996 variables, 409/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1996 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1996 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1997 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1997 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1997 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1997/1997 variables, and 473 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1002 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 410/410 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/399 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/408 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/409 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1587/1996 variables, 409/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1996 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1996 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1997 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1997 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 07:58:04] [INFO ] Deduced a trap composed of 84 places in 466 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1997 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1997 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1997 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1997/1997 variables, and 475 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1373 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 410/410 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2495ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 1596/1596 transitions.
Applied a total of 0 rules in 51 ms. Remains 410 /410 variables (removed 0) and now considering 1596/1596 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 410/410 places, 1596/1596 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 1596/1596 transitions.
Applied a total of 0 rules in 37 ms. Remains 410 /410 variables (removed 0) and now considering 1596/1596 (removed 0) transitions.
[2024-05-31 07:58:05] [INFO ] Flow matrix only has 1587 transitions (discarded 9 similar events)
[2024-05-31 07:58:05] [INFO ] Invariant cache hit.
[2024-05-31 07:58:06] [INFO ] Implicit Places using invariants in 767 ms returned []
[2024-05-31 07:58:06] [INFO ] Flow matrix only has 1587 transitions (discarded 9 similar events)
[2024-05-31 07:58:06] [INFO ] Invariant cache hit.
[2024-05-31 07:58:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 07:58:09] [INFO ] Implicit Places using invariants and state equation in 3161 ms returned []
Implicit Place search using SMT with State Equation took 3944 ms to find 0 implicit places.
[2024-05-31 07:58:09] [INFO ] Redundant transitions in 116 ms returned []
Running 1585 sub problems to find dead transitions.
[2024-05-31 07:58:09] [INFO ] Flow matrix only has 1587 transitions (discarded 9 similar events)
[2024-05-31 07:58:09] [INFO ] Invariant cache hit.
[2024-05-31 07:58:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1585 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1585 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1585 unsolved
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1356 is UNSAT
At refinement iteration 3 (OVERLAPS) 9/409 variables, 9/61 constraints. Problems are: Problem set: 558 solved, 1027 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 0/61 constraints. Problems are: Problem set: 558 solved, 1027 unsolved
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1302 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/410 variables, 1/62 constraints. Problems are: Problem set: 615 solved, 970 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/1997 variables, and 62 constraints, problems are : Problem set: 615 solved, 970 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1585/585 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 615 solved, 970 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 615 solved, 970 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 615 solved, 970 unsolved
[2024-05-31 07:59:03] [INFO ] Deduced a trap composed of 18 places in 3022 ms of which 27 ms to minimize.
[2024-05-31 07:59:09] [INFO ] Deduced a trap composed of 13 places in 344 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 2/54 constraints. Problems are: Problem set: 615 solved, 970 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 0/54 constraints. Problems are: Problem set: 615 solved, 970 unsolved
At refinement iteration 4 (OVERLAPS) 9/409 variables, 9/63 constraints. Problems are: Problem set: 615 solved, 970 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 0/63 constraints. Problems are: Problem set: 615 solved, 970 unsolved
At refinement iteration 6 (OVERLAPS) 1/410 variables, 1/64 constraints. Problems are: Problem set: 615 solved, 970 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/1997 variables, and 64 constraints, problems are : Problem set: 615 solved, 970 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 385/585 constraints, Known Traps: 2/2 constraints]
After SMT, in 80050ms problems are : Problem set: 615 solved, 970 unsolved
Search for dead transitions found 615 dead transitions in 80090ms
Found 615 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 615 transitions
Dead transitions reduction (with SMT) removed 615 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 410/410 places, 981/1596 transitions.
Applied a total of 0 rules in 47 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2024-05-31 07:59:29] [INFO ] Redundant transitions in 45 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 84326 ms. Remains : 410/410 places, 981/1596 transitions.
RANDOM walk for 4000000 steps (290946 resets) in 57617 ms. (69 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000002 steps (38629 resets) in 10898 ms. (367 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 9932675 steps, run timeout after 54001 ms. (steps per millisecond=183 ) properties seen :0 out of 1
Probabilistic random walk after 9932675 steps, saw 1737142 distinct states, run finished after 54002 ms. (steps per millisecond=183 ) properties seen :0
[2024-05-31 08:00:42] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2024-05-31 08:00:42] [INFO ] Computed 62 invariants in 26 ms
[2024-05-31 08:00:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/399 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/408 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/409 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 972/1381 variables, 409/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1381 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1381 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1382 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1382 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1382 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1382/1382 variables, and 473 constraints, problems are : Problem set: 0 solved, 1 unsolved in 504 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 410/410 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/399 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/408 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 08:00:43] [INFO ] Deduced a trap composed of 172 places in 317 ms of which 3 ms to minimize.
[2024-05-31 08:00:43] [INFO ] Deduced a trap composed of 164 places in 239 ms of which 3 ms to minimize.
[2024-05-31 08:00:43] [INFO ] Deduced a trap composed of 162 places in 265 ms of which 3 ms to minimize.
[2024-05-31 08:00:43] [INFO ] Deduced a trap composed of 170 places in 252 ms of which 3 ms to minimize.
[2024-05-31 08:00:44] [INFO ] Deduced a trap composed of 166 places in 255 ms of which 2 ms to minimize.
[2024-05-31 08:00:44] [INFO ] Deduced a trap composed of 166 places in 224 ms of which 3 ms to minimize.
[2024-05-31 08:00:44] [INFO ] Deduced a trap composed of 164 places in 281 ms of which 2 ms to minimize.
[2024-05-31 08:00:44] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 2 ms to minimize.
[2024-05-31 08:00:45] [INFO ] Deduced a trap composed of 164 places in 242 ms of which 3 ms to minimize.
[2024-05-31 08:00:45] [INFO ] Deduced a trap composed of 166 places in 261 ms of which 3 ms to minimize.
[2024-05-31 08:00:45] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 3 ms to minimize.
[2024-05-31 08:00:45] [INFO ] Deduced a trap composed of 170 places in 215 ms of which 2 ms to minimize.
[2024-05-31 08:00:46] [INFO ] Deduced a trap composed of 160 places in 183 ms of which 2 ms to minimize.
[2024-05-31 08:00:46] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 3 ms to minimize.
[2024-05-31 08:00:46] [INFO ] Deduced a trap composed of 162 places in 246 ms of which 2 ms to minimize.
[2024-05-31 08:00:46] [INFO ] Deduced a trap composed of 162 places in 289 ms of which 3 ms to minimize.
[2024-05-31 08:00:47] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 2 ms to minimize.
[2024-05-31 08:00:47] [INFO ] Deduced a trap composed of 170 places in 229 ms of which 3 ms to minimize.
[2024-05-31 08:00:47] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 2 ms to minimize.
[2024-05-31 08:00:47] [INFO ] Deduced a trap composed of 162 places in 249 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 08:00:48] [INFO ] Deduced a trap composed of 172 places in 189 ms of which 3 ms to minimize.
[2024-05-31 08:00:48] [INFO ] Deduced a trap composed of 166 places in 311 ms of which 4 ms to minimize.
[2024-05-31 08:00:48] [INFO ] Deduced a trap composed of 162 places in 235 ms of which 2 ms to minimize.
[2024-05-31 08:00:48] [INFO ] Deduced a trap composed of 158 places in 271 ms of which 3 ms to minimize.
[2024-05-31 08:00:49] [INFO ] Deduced a trap composed of 160 places in 376 ms of which 2 ms to minimize.
[2024-05-31 08:00:49] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 3 ms to minimize.
[2024-05-31 08:00:49] [INFO ] Deduced a trap composed of 164 places in 255 ms of which 3 ms to minimize.
[2024-05-31 08:00:50] [INFO ] Deduced a trap composed of 162 places in 315 ms of which 5 ms to minimize.
[2024-05-31 08:00:50] [INFO ] Deduced a trap composed of 158 places in 253 ms of which 3 ms to minimize.
[2024-05-31 08:00:50] [INFO ] Deduced a trap composed of 162 places in 248 ms of which 2 ms to minimize.
[2024-05-31 08:00:51] [INFO ] Deduced a trap composed of 168 places in 281 ms of which 2 ms to minimize.
[2024-05-31 08:00:51] [INFO ] Deduced a trap composed of 168 places in 275 ms of which 3 ms to minimize.
[2024-05-31 08:00:51] [INFO ] Deduced a trap composed of 164 places in 246 ms of which 4 ms to minimize.
[2024-05-31 08:00:52] [INFO ] Deduced a trap composed of 171 places in 281 ms of which 5 ms to minimize.
[2024-05-31 08:00:52] [INFO ] Deduced a trap composed of 160 places in 253 ms of which 4 ms to minimize.
[2024-05-31 08:00:52] [INFO ] Deduced a trap composed of 168 places in 260 ms of which 3 ms to minimize.
[2024-05-31 08:00:52] [INFO ] Deduced a trap composed of 158 places in 263 ms of which 3 ms to minimize.
[2024-05-31 08:00:53] [INFO ] Deduced a trap composed of 160 places in 255 ms of which 3 ms to minimize.
[2024-05-31 08:00:53] [INFO ] Deduced a trap composed of 134 places in 244 ms of which 3 ms to minimize.
[2024-05-31 08:00:53] [INFO ] Deduced a trap composed of 170 places in 245 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/408 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 08:00:54] [INFO ] Deduced a trap composed of 160 places in 252 ms of which 3 ms to minimize.
[2024-05-31 08:00:54] [INFO ] Deduced a trap composed of 166 places in 249 ms of which 3 ms to minimize.
[2024-05-31 08:00:54] [INFO ] Deduced a trap composed of 156 places in 272 ms of which 3 ms to minimize.
[2024-05-31 08:00:55] [INFO ] Deduced a trap composed of 172 places in 242 ms of which 4 ms to minimize.
[2024-05-31 08:00:55] [INFO ] Deduced a trap composed of 168 places in 235 ms of which 3 ms to minimize.
[2024-05-31 08:00:55] [INFO ] Deduced a trap composed of 158 places in 228 ms of which 2 ms to minimize.
[2024-05-31 08:00:55] [INFO ] Deduced a trap composed of 164 places in 246 ms of which 2 ms to minimize.
[2024-05-31 08:00:56] [INFO ] Deduced a trap composed of 164 places in 247 ms of which 2 ms to minimize.
[2024-05-31 08:00:56] [INFO ] Deduced a trap composed of 162 places in 234 ms of which 5 ms to minimize.
[2024-05-31 08:00:56] [INFO ] Deduced a trap composed of 160 places in 230 ms of which 14 ms to minimize.
[2024-05-31 08:00:57] [INFO ] Deduced a trap composed of 160 places in 214 ms of which 3 ms to minimize.
[2024-05-31 08:00:57] [INFO ] Deduced a trap composed of 154 places in 184 ms of which 2 ms to minimize.
[2024-05-31 08:00:57] [INFO ] Deduced a trap composed of 166 places in 190 ms of which 3 ms to minimize.
[2024-05-31 08:00:57] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 2 ms to minimize.
[2024-05-31 08:00:58] [INFO ] Deduced a trap composed of 164 places in 223 ms of which 4 ms to minimize.
[2024-05-31 08:00:58] [INFO ] Deduced a trap composed of 166 places in 223 ms of which 2 ms to minimize.
[2024-05-31 08:00:58] [INFO ] Deduced a trap composed of 160 places in 183 ms of which 3 ms to minimize.
[2024-05-31 08:00:58] [INFO ] Deduced a trap composed of 166 places in 203 ms of which 2 ms to minimize.
[2024-05-31 08:00:58] [INFO ] Deduced a trap composed of 168 places in 222 ms of which 3 ms to minimize.
[2024-05-31 08:00:59] [INFO ] Deduced a trap composed of 164 places in 276 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 08:00:59] [INFO ] Deduced a trap composed of 164 places in 240 ms of which 3 ms to minimize.
[2024-05-31 08:00:59] [INFO ] Deduced a trap composed of 165 places in 286 ms of which 2 ms to minimize.
[2024-05-31 08:01:00] [INFO ] Deduced a trap composed of 164 places in 226 ms of which 2 ms to minimize.
[2024-05-31 08:01:00] [INFO ] Deduced a trap composed of 162 places in 274 ms of which 2 ms to minimize.
[2024-05-31 08:01:00] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 2 ms to minimize.
[2024-05-31 08:01:00] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 2 ms to minimize.
[2024-05-31 08:01:00] [INFO ] Deduced a trap composed of 170 places in 216 ms of which 2 ms to minimize.
[2024-05-31 08:01:01] [INFO ] Deduced a trap composed of 166 places in 215 ms of which 3 ms to minimize.
[2024-05-31 08:01:01] [INFO ] Deduced a trap composed of 162 places in 261 ms of which 3 ms to minimize.
[2024-05-31 08:01:01] [INFO ] Deduced a trap composed of 164 places in 217 ms of which 3 ms to minimize.
[2024-05-31 08:01:01] [INFO ] Deduced a trap composed of 162 places in 268 ms of which 2 ms to minimize.
[2024-05-31 08:01:02] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 3 ms to minimize.
[2024-05-31 08:01:02] [INFO ] Deduced a trap composed of 156 places in 202 ms of which 3 ms to minimize.
[2024-05-31 08:01:02] [INFO ] Deduced a trap composed of 170 places in 202 ms of which 3 ms to minimize.
[2024-05-31 08:01:02] [INFO ] Deduced a trap composed of 183 places in 256 ms of which 3 ms to minimize.
[2024-05-31 08:01:04] [INFO ] Deduced a trap composed of 164 places in 285 ms of which 2 ms to minimize.
[2024-05-31 08:01:04] [INFO ] Deduced a trap composed of 162 places in 294 ms of which 3 ms to minimize.
[2024-05-31 08:01:04] [INFO ] Deduced a trap composed of 160 places in 295 ms of which 2 ms to minimize.
[2024-05-31 08:01:05] [INFO ] Deduced a trap composed of 170 places in 289 ms of which 3 ms to minimize.
[2024-05-31 08:01:05] [INFO ] Deduced a trap composed of 166 places in 257 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 08:01:05] [INFO ] Deduced a trap composed of 170 places in 268 ms of which 5 ms to minimize.
[2024-05-31 08:01:06] [INFO ] Deduced a trap composed of 162 places in 378 ms of which 3 ms to minimize.
[2024-05-31 08:01:06] [INFO ] Deduced a trap composed of 164 places in 323 ms of which 12 ms to minimize.
[2024-05-31 08:01:07] [INFO ] Deduced a trap composed of 170 places in 334 ms of which 13 ms to minimize.
[2024-05-31 08:01:07] [INFO ] Deduced a trap composed of 164 places in 321 ms of which 3 ms to minimize.
[2024-05-31 08:01:07] [INFO ] Deduced a trap composed of 156 places in 345 ms of which 3 ms to minimize.
[2024-05-31 08:01:08] [INFO ] Deduced a trap composed of 166 places in 337 ms of which 12 ms to minimize.
[2024-05-31 08:01:08] [INFO ] Deduced a trap composed of 166 places in 341 ms of which 12 ms to minimize.
[2024-05-31 08:01:08] [INFO ] Deduced a trap composed of 162 places in 329 ms of which 3 ms to minimize.
[2024-05-31 08:01:09] [INFO ] Deduced a trap composed of 166 places in 370 ms of which 13 ms to minimize.
[2024-05-31 08:01:09] [INFO ] Deduced a trap composed of 164 places in 329 ms of which 3 ms to minimize.
[2024-05-31 08:01:09] [INFO ] Deduced a trap composed of 158 places in 226 ms of which 3 ms to minimize.
[2024-05-31 08:01:10] [INFO ] Deduced a trap composed of 164 places in 344 ms of which 3 ms to minimize.
[2024-05-31 08:01:10] [INFO ] Deduced a trap composed of 166 places in 349 ms of which 3 ms to minimize.
[2024-05-31 08:01:11] [INFO ] Deduced a trap composed of 156 places in 344 ms of which 3 ms to minimize.
[2024-05-31 08:01:11] [INFO ] Deduced a trap composed of 166 places in 360 ms of which 3 ms to minimize.
[2024-05-31 08:01:11] [INFO ] Deduced a trap composed of 168 places in 365 ms of which 3 ms to minimize.
[2024-05-31 08:01:12] [INFO ] Deduced a trap composed of 170 places in 332 ms of which 2 ms to minimize.
[2024-05-31 08:01:12] [INFO ] Deduced a trap composed of 158 places in 255 ms of which 3 ms to minimize.
[2024-05-31 08:01:12] [INFO ] Deduced a trap composed of 166 places in 317 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 08:01:13] [INFO ] Deduced a trap composed of 162 places in 362 ms of which 3 ms to minimize.
[2024-05-31 08:01:13] [INFO ] Deduced a trap composed of 158 places in 341 ms of which 13 ms to minimize.
[2024-05-31 08:01:14] [INFO ] Deduced a trap composed of 158 places in 334 ms of which 3 ms to minimize.
[2024-05-31 08:01:14] [INFO ] Deduced a trap composed of 166 places in 340 ms of which 2 ms to minimize.
[2024-05-31 08:01:14] [INFO ] Deduced a trap composed of 164 places in 217 ms of which 3 ms to minimize.
[2024-05-31 08:01:15] [INFO ] Deduced a trap composed of 166 places in 251 ms of which 3 ms to minimize.
[2024-05-31 08:01:15] [INFO ] Deduced a trap composed of 164 places in 335 ms of which 12 ms to minimize.
[2024-05-31 08:01:15] [INFO ] Deduced a trap composed of 162 places in 386 ms of which 3 ms to minimize.
[2024-05-31 08:01:16] [INFO ] Deduced a trap composed of 162 places in 244 ms of which 3 ms to minimize.
[2024-05-31 08:01:16] [INFO ] Deduced a trap composed of 146 places in 334 ms of which 3 ms to minimize.
[2024-05-31 08:01:17] [INFO ] Deduced a trap composed of 158 places in 359 ms of which 3 ms to minimize.
[2024-05-31 08:01:17] [INFO ] Deduced a trap composed of 164 places in 327 ms of which 3 ms to minimize.
[2024-05-31 08:01:18] [INFO ] Deduced a trap composed of 166 places in 371 ms of which 3 ms to minimize.
[2024-05-31 08:01:18] [INFO ] Deduced a trap composed of 146 places in 264 ms of which 3 ms to minimize.
[2024-05-31 08:01:18] [INFO ] Deduced a trap composed of 162 places in 319 ms of which 2 ms to minimize.
[2024-05-31 08:01:19] [INFO ] Deduced a trap composed of 168 places in 336 ms of which 3 ms to minimize.
[2024-05-31 08:01:19] [INFO ] Deduced a trap composed of 170 places in 309 ms of which 12 ms to minimize.
[2024-05-31 08:01:19] [INFO ] Deduced a trap composed of 162 places in 308 ms of which 2 ms to minimize.
[2024-05-31 08:01:19] [INFO ] Deduced a trap composed of 164 places in 306 ms of which 2 ms to minimize.
[2024-05-31 08:01:20] [INFO ] Deduced a trap composed of 170 places in 347 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/408 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 08:01:20] [INFO ] Deduced a trap composed of 166 places in 305 ms of which 2 ms to minimize.
[2024-05-31 08:01:20] [INFO ] Deduced a trap composed of 158 places in 319 ms of which 3 ms to minimize.
[2024-05-31 08:01:21] [INFO ] Deduced a trap composed of 164 places in 316 ms of which 12 ms to minimize.
[2024-05-31 08:01:21] [INFO ] Deduced a trap composed of 166 places in 317 ms of which 12 ms to minimize.
[2024-05-31 08:01:22] [INFO ] Deduced a trap composed of 164 places in 341 ms of which 3 ms to minimize.
[2024-05-31 08:01:22] [INFO ] Deduced a trap composed of 146 places in 329 ms of which 2 ms to minimize.
[2024-05-31 08:01:22] [INFO ] Deduced a trap composed of 160 places in 327 ms of which 3 ms to minimize.
[2024-05-31 08:01:23] [INFO ] Deduced a trap composed of 164 places in 348 ms of which 13 ms to minimize.
[2024-05-31 08:01:23] [INFO ] Deduced a trap composed of 166 places in 350 ms of which 2 ms to minimize.
[2024-05-31 08:01:23] [INFO ] Deduced a trap composed of 172 places in 325 ms of which 2 ms to minimize.
[2024-05-31 08:01:24] [INFO ] Deduced a trap composed of 168 places in 370 ms of which 3 ms to minimize.
[2024-05-31 08:01:24] [INFO ] Deduced a trap composed of 162 places in 230 ms of which 3 ms to minimize.
[2024-05-31 08:01:24] [INFO ] Deduced a trap composed of 166 places in 314 ms of which 2 ms to minimize.
[2024-05-31 08:01:26] [INFO ] Deduced a trap composed of 158 places in 318 ms of which 3 ms to minimize.
[2024-05-31 08:01:26] [INFO ] Deduced a trap composed of 160 places in 355 ms of which 3 ms to minimize.
[2024-05-31 08:01:27] [INFO ] Deduced a trap composed of 166 places in 325 ms of which 3 ms to minimize.
[2024-05-31 08:01:28] [INFO ] Deduced a trap composed of 166 places in 331 ms of which 3 ms to minimize.
[2024-05-31 08:01:28] [INFO ] Deduced a trap composed of 164 places in 334 ms of which 13 ms to minimize.
[2024-05-31 08:01:29] [INFO ] Deduced a trap composed of 162 places in 347 ms of which 3 ms to minimize.
[2024-05-31 08:01:29] [INFO ] Deduced a trap composed of 168 places in 304 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/408 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 08:01:29] [INFO ] Deduced a trap composed of 150 places in 300 ms of which 2 ms to minimize.
[2024-05-31 08:01:30] [INFO ] Deduced a trap composed of 164 places in 296 ms of which 2 ms to minimize.
[2024-05-31 08:01:30] [INFO ] Deduced a trap composed of 166 places in 297 ms of which 3 ms to minimize.
[2024-05-31 08:01:30] [INFO ] Deduced a trap composed of 164 places in 316 ms of which 13 ms to minimize.
[2024-05-31 08:01:31] [INFO ] Deduced a trap composed of 168 places in 342 ms of which 2 ms to minimize.
[2024-05-31 08:01:31] [INFO ] Deduced a trap composed of 164 places in 331 ms of which 2 ms to minimize.
[2024-05-31 08:01:31] [INFO ] Deduced a trap composed of 150 places in 322 ms of which 3 ms to minimize.
[2024-05-31 08:01:32] [INFO ] Deduced a trap composed of 158 places in 306 ms of which 3 ms to minimize.
[2024-05-31 08:01:32] [INFO ] Deduced a trap composed of 162 places in 313 ms of which 12 ms to minimize.
[2024-05-31 08:01:32] [INFO ] Deduced a trap composed of 166 places in 309 ms of which 11 ms to minimize.
[2024-05-31 08:01:33] [INFO ] Deduced a trap composed of 166 places in 320 ms of which 13 ms to minimize.
[2024-05-31 08:01:33] [INFO ] Deduced a trap composed of 162 places in 311 ms of which 2 ms to minimize.
[2024-05-31 08:01:33] [INFO ] Deduced a trap composed of 164 places in 344 ms of which 3 ms to minimize.
[2024-05-31 08:01:34] [INFO ] Deduced a trap composed of 160 places in 306 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 408/1382 variables, and 215 constraints, problems are : Problem set: 0 solved, 1 unsolved in 69565 ms.
Refiners :[Positive P Invariants (semi-flows): 54/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 154/154 constraints]
After SMT, in 70127ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 81 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 37 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2024-05-31 08:01:52] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2024-05-31 08:01:52] [INFO ] Invariant cache hit.
[2024-05-31 08:01:53] [INFO ] Implicit Places using invariants in 658 ms returned []
[2024-05-31 08:01:53] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2024-05-31 08:01:53] [INFO ] Invariant cache hit.
[2024-05-31 08:01:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 08:01:54] [INFO ] Implicit Places using invariants and state equation in 1763 ms returned []
Implicit Place search using SMT with State Equation took 2426 ms to find 0 implicit places.
[2024-05-31 08:01:54] [INFO ] Redundant transitions in 16 ms returned []
Running 970 sub problems to find dead transitions.
[2024-05-31 08:01:54] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2024-05-31 08:01:54] [INFO ] Invariant cache hit.
[2024-05-31 08:01:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 970 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-05-31 08:02:11] [INFO ] Deduced a trap composed of 111 places in 289 ms of which 3 ms to minimize.
[2024-05-31 08:02:11] [INFO ] Deduced a trap composed of 111 places in 216 ms of which 3 ms to minimize.
[2024-05-31 08:02:11] [INFO ] Deduced a trap composed of 116 places in 216 ms of which 3 ms to minimize.
[2024-05-31 08:02:12] [INFO ] Deduced a trap composed of 121 places in 213 ms of which 3 ms to minimize.
[2024-05-31 08:02:12] [INFO ] Deduced a trap composed of 111 places in 216 ms of which 3 ms to minimize.
[2024-05-31 08:02:12] [INFO ] Deduced a trap composed of 111 places in 215 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-05-31 08:02:21] [INFO ] Deduced a trap composed of 13 places in 275 ms of which 3 ms to minimize.
[2024-05-31 08:02:22] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 3 ms to minimize.
[2024-05-31 08:02:23] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 3 ms to minimize.
[2024-05-31 08:02:23] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 3 ms to minimize.
[2024-05-31 08:02:23] [INFO ] Deduced a trap composed of 171 places in 202 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-05-31 08:02:28] [INFO ] Deduced a trap composed of 126 places in 248 ms of which 3 ms to minimize.
[2024-05-31 08:02:29] [INFO ] Deduced a trap composed of 131 places in 220 ms of which 3 ms to minimize.
[2024-05-31 08:02:29] [INFO ] Deduced a trap composed of 136 places in 201 ms of which 3 ms to minimize.
[2024-05-31 08:02:29] [INFO ] Deduced a trap composed of 126 places in 262 ms of which 5 ms to minimize.
[2024-05-31 08:02:29] [INFO ] Deduced a trap composed of 131 places in 210 ms of which 2 ms to minimize.
[2024-05-31 08:02:30] [INFO ] Deduced a trap composed of 126 places in 220 ms of which 3 ms to minimize.
[2024-05-31 08:02:30] [INFO ] Deduced a trap composed of 131 places in 232 ms of which 3 ms to minimize.
[2024-05-31 08:02:30] [INFO ] Deduced a trap composed of 131 places in 230 ms of which 3 ms to minimize.
[2024-05-31 08:02:30] [INFO ] Deduced a trap composed of 131 places in 204 ms of which 3 ms to minimize.
[2024-05-31 08:02:31] [INFO ] Deduced a trap composed of 126 places in 249 ms of which 3 ms to minimize.
[2024-05-31 08:02:31] [INFO ] Deduced a trap composed of 126 places in 250 ms of which 3 ms to minimize.
[2024-05-31 08:02:31] [INFO ] Deduced a trap composed of 126 places in 228 ms of which 3 ms to minimize.
[2024-05-31 08:02:31] [INFO ] Deduced a trap composed of 126 places in 226 ms of which 3 ms to minimize.
[2024-05-31 08:02:32] [INFO ] Deduced a trap composed of 126 places in 297 ms of which 3 ms to minimize.
[2024-05-31 08:02:32] [INFO ] Deduced a trap composed of 136 places in 200 ms of which 3 ms to minimize.
[2024-05-31 08:02:32] [INFO ] Deduced a trap composed of 131 places in 206 ms of which 3 ms to minimize.
[2024-05-31 08:02:32] [INFO ] Deduced a trap composed of 131 places in 210 ms of which 10 ms to minimize.
[2024-05-31 08:02:33] [INFO ] Deduced a trap composed of 131 places in 221 ms of which 3 ms to minimize.
[2024-05-31 08:02:33] [INFO ] Deduced a trap composed of 126 places in 202 ms of which 3 ms to minimize.
[2024-05-31 08:02:33] [INFO ] Deduced a trap composed of 121 places in 205 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-05-31 08:02:35] [INFO ] Deduced a trap composed of 111 places in 274 ms of which 3 ms to minimize.
[2024-05-31 08:02:35] [INFO ] Deduced a trap composed of 107 places in 252 ms of which 11 ms to minimize.
[2024-05-31 08:02:35] [INFO ] Deduced a trap composed of 111 places in 267 ms of which 3 ms to minimize.
[2024-05-31 08:02:35] [INFO ] Deduced a trap composed of 126 places in 233 ms of which 2 ms to minimize.
SMT process timed out in 41112ms, After SMT, problems are : Problem set: 0 solved, 970 unsolved
Search for dead transitions found 0 dead transitions in 41139ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43641 ms. Remains : 410/410 places, 981/981 transitions.
RANDOM walk for 400001 steps (29210 resets) in 6690 ms. (59 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-05-31 08:02:37] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2024-05-31 08:02:37] [INFO ] Invariant cache hit.
[2024-05-31 08:02:37] [INFO ] [Real]Absence check using 55 positive place invariants in 14 ms returned sat
[2024-05-31 08:02:38] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 14 ms returned sat
[2024-05-31 08:02:38] [INFO ] After 422ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 08:02:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 08:02:38] [INFO ] After 22ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 08:02:38] [INFO ] After 85ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 08:02:38] [INFO ] After 659ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 08:02:38] [INFO ] [Nat]Absence check using 55 positive place invariants in 13 ms returned sat
[2024-05-31 08:02:38] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 11 ms returned sat
[2024-05-31 08:02:39] [INFO ] After 360ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 08:02:39] [INFO ] After 97ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 08:02:39] [INFO ] Deduced a trap composed of 164 places in 411 ms of which 2 ms to minimize.
[2024-05-31 08:02:39] [INFO ] Deduced a trap composed of 162 places in 380 ms of which 2 ms to minimize.
[2024-05-31 08:02:40] [INFO ] Deduced a trap composed of 166 places in 886 ms of which 3 ms to minimize.
[2024-05-31 08:02:41] [INFO ] Deduced a trap composed of 156 places in 358 ms of which 3 ms to minimize.
[2024-05-31 08:02:41] [INFO ] Deduced a trap composed of 162 places in 389 ms of which 3 ms to minimize.
[2024-05-31 08:02:42] [INFO ] Deduced a trap composed of 158 places in 377 ms of which 3 ms to minimize.
[2024-05-31 08:02:42] [INFO ] Deduced a trap composed of 164 places in 381 ms of which 3 ms to minimize.
[2024-05-31 08:02:42] [INFO ] Deduced a trap composed of 164 places in 375 ms of which 3 ms to minimize.
[2024-05-31 08:02:43] [INFO ] Deduced a trap composed of 164 places in 390 ms of which 2 ms to minimize.
[2024-05-31 08:02:43] [INFO ] Deduced a trap composed of 160 places in 357 ms of which 3 ms to minimize.
[2024-05-31 08:02:44] [INFO ] Deduced a trap composed of 164 places in 364 ms of which 3 ms to minimize.
[2024-05-31 08:02:44] [INFO ] Deduced a trap composed of 162 places in 412 ms of which 2 ms to minimize.
[2024-05-31 08:02:45] [INFO ] Deduced a trap composed of 162 places in 361 ms of which 3 ms to minimize.
[2024-05-31 08:02:45] [INFO ] Deduced a trap composed of 160 places in 371 ms of which 3 ms to minimize.
[2024-05-31 08:02:46] [INFO ] Deduced a trap composed of 164 places in 418 ms of which 2 ms to minimize.
[2024-05-31 08:02:46] [INFO ] Deduced a trap composed of 164 places in 429 ms of which 3 ms to minimize.
[2024-05-31 08:02:47] [INFO ] Deduced a trap composed of 171 places in 390 ms of which 3 ms to minimize.
[2024-05-31 08:02:47] [INFO ] Deduced a trap composed of 166 places in 382 ms of which 3 ms to minimize.
[2024-05-31 08:02:48] [INFO ] Deduced a trap composed of 164 places in 384 ms of which 3 ms to minimize.
[2024-05-31 08:02:48] [INFO ] Deduced a trap composed of 172 places in 387 ms of which 3 ms to minimize.
[2024-05-31 08:02:49] [INFO ] Deduced a trap composed of 179 places in 414 ms of which 3 ms to minimize.
[2024-05-31 08:02:50] [INFO ] Deduced a trap composed of 164 places in 404 ms of which 3 ms to minimize.
[2024-05-31 08:02:50] [INFO ] Deduced a trap composed of 166 places in 411 ms of which 3 ms to minimize.
[2024-05-31 08:02:50] [INFO ] Deduced a trap composed of 172 places in 393 ms of which 3 ms to minimize.
[2024-05-31 08:02:51] [INFO ] Deduced a trap composed of 179 places in 385 ms of which 3 ms to minimize.
[2024-05-31 08:02:51] [INFO ] Deduced a trap composed of 177 places in 388 ms of which 3 ms to minimize.
[2024-05-31 08:02:52] [INFO ] Deduced a trap composed of 175 places in 402 ms of which 3 ms to minimize.
[2024-05-31 08:02:53] [INFO ] Deduced a trap composed of 156 places in 381 ms of which 3 ms to minimize.
[2024-05-31 08:02:53] [INFO ] Deduced a trap composed of 158 places in 417 ms of which 3 ms to minimize.
[2024-05-31 08:02:54] [INFO ] Deduced a trap composed of 166 places in 405 ms of which 3 ms to minimize.
[2024-05-31 08:02:54] [INFO ] Deduced a trap composed of 175 places in 393 ms of which 3 ms to minimize.
[2024-05-31 08:02:54] [INFO ] Deduced a trap composed of 166 places in 380 ms of which 3 ms to minimize.
[2024-05-31 08:02:55] [INFO ] Deduced a trap composed of 160 places in 382 ms of which 4 ms to minimize.
[2024-05-31 08:02:55] [INFO ] Deduced a trap composed of 164 places in 402 ms of which 4 ms to minimize.
[2024-05-31 08:02:56] [INFO ] Deduced a trap composed of 158 places in 401 ms of which 3 ms to minimize.
[2024-05-31 08:02:56] [INFO ] Deduced a trap composed of 158 places in 396 ms of which 4 ms to minimize.
[2024-05-31 08:02:57] [INFO ] Deduced a trap composed of 160 places in 431 ms of which 3 ms to minimize.
[2024-05-31 08:02:57] [INFO ] Deduced a trap composed of 162 places in 389 ms of which 3 ms to minimize.
[2024-05-31 08:02:58] [INFO ] Deduced a trap composed of 160 places in 384 ms of which 3 ms to minimize.
[2024-05-31 08:02:58] [INFO ] Deduced a trap composed of 164 places in 381 ms of which 3 ms to minimize.
[2024-05-31 08:02:59] [INFO ] Deduced a trap composed of 162 places in 366 ms of which 3 ms to minimize.
[2024-05-31 08:02:59] [INFO ] Deduced a trap composed of 156 places in 398 ms of which 3 ms to minimize.
[2024-05-31 08:03:00] [INFO ] Deduced a trap composed of 170 places in 396 ms of which 3 ms to minimize.
[2024-05-31 08:03:00] [INFO ] Deduced a trap composed of 164 places in 375 ms of which 3 ms to minimize.
[2024-05-31 08:03:01] [INFO ] Deduced a trap composed of 160 places in 402 ms of which 3 ms to minimize.
[2024-05-31 08:03:02] [INFO ] Deduced a trap composed of 164 places in 402 ms of which 3 ms to minimize.
[2024-05-31 08:03:02] [INFO ] Deduced a trap composed of 162 places in 381 ms of which 3 ms to minimize.
[2024-05-31 08:03:03] [INFO ] Deduced a trap composed of 166 places in 417 ms of which 3 ms to minimize.
[2024-05-31 08:03:03] [INFO ] Deduced a trap composed of 166 places in 458 ms of which 3 ms to minimize.
[2024-05-31 08:03:04] [INFO ] Deduced a trap composed of 172 places in 405 ms of which 3 ms to minimize.
[2024-05-31 08:03:07] [INFO ] Deduced a trap composed of 162 places in 415 ms of which 3 ms to minimize.
[2024-05-31 08:03:07] [INFO ] Deduced a trap composed of 168 places in 407 ms of which 3 ms to minimize.
[2024-05-31 08:03:08] [INFO ] Deduced a trap composed of 154 places in 385 ms of which 4 ms to minimize.
[2024-05-31 08:03:08] [INFO ] Deduced a trap composed of 162 places in 393 ms of which 6 ms to minimize.
[2024-05-31 08:03:09] [INFO ] Deduced a trap composed of 160 places in 395 ms of which 4 ms to minimize.
[2024-05-31 08:03:09] [INFO ] Deduced a trap composed of 156 places in 401 ms of which 2 ms to minimize.
[2024-05-31 08:03:10] [INFO ] Deduced a trap composed of 166 places in 390 ms of which 4 ms to minimize.
[2024-05-31 08:03:10] [INFO ] Deduced a trap composed of 160 places in 387 ms of which 3 ms to minimize.
[2024-05-31 08:03:11] [INFO ] Deduced a trap composed of 168 places in 413 ms of which 5 ms to minimize.
[2024-05-31 08:03:12] [INFO ] Deduced a trap composed of 160 places in 419 ms of which 16 ms to minimize.
[2024-05-31 08:03:14] [INFO ] Deduced a trap composed of 164 places in 485 ms of which 4 ms to minimize.
[2024-05-31 08:03:15] [INFO ] Deduced a trap composed of 162 places in 411 ms of which 2 ms to minimize.
[2024-05-31 08:03:15] [INFO ] Deduced a trap composed of 160 places in 301 ms of which 2 ms to minimize.
[2024-05-31 08:03:16] [INFO ] Deduced a trap composed of 162 places in 301 ms of which 2 ms to minimize.
[2024-05-31 08:03:16] [INFO ] Deduced a trap composed of 166 places in 403 ms of which 2 ms to minimize.
[2024-05-31 08:03:17] [INFO ] Deduced a trap composed of 156 places in 373 ms of which 3 ms to minimize.
[2024-05-31 08:03:17] [INFO ] Deduced a trap composed of 158 places in 359 ms of which 2 ms to minimize.
[2024-05-31 08:03:18] [INFO ] Deduced a trap composed of 160 places in 361 ms of which 2 ms to minimize.
[2024-05-31 08:03:19] [INFO ] Deduced a trap composed of 172 places in 572 ms of which 4 ms to minimize.
[2024-05-31 08:03:19] [INFO ] Deduced a trap composed of 160 places in 530 ms of which 3 ms to minimize.
[2024-05-31 08:03:20] [INFO ] Deduced a trap composed of 162 places in 416 ms of which 3 ms to minimize.
[2024-05-31 08:03:21] [INFO ] Deduced a trap composed of 170 places in 1262 ms of which 2 ms to minimize.
[2024-05-31 08:03:21] [INFO ] Deduced a trap composed of 166 places in 256 ms of which 3 ms to minimize.
[2024-05-31 08:03:22] [INFO ] Deduced a trap composed of 158 places in 347 ms of which 3 ms to minimize.
[2024-05-31 08:03:22] [INFO ] Deduced a trap composed of 158 places in 280 ms of which 3 ms to minimize.
[2024-05-31 08:03:24] [INFO ] Deduced a trap composed of 158 places in 582 ms of which 3 ms to minimize.
[2024-05-31 08:03:24] [INFO ] Deduced a trap composed of 156 places in 503 ms of which 2 ms to minimize.
[2024-05-31 08:03:25] [INFO ] Deduced a trap composed of 160 places in 321 ms of which 2 ms to minimize.
[2024-05-31 08:03:25] [INFO ] Deduced a trap composed of 164 places in 372 ms of which 3 ms to minimize.
[2024-05-31 08:03:26] [INFO ] Deduced a trap composed of 164 places in 585 ms of which 3 ms to minimize.
[2024-05-31 08:03:27] [INFO ] Deduced a trap composed of 156 places in 532 ms of which 3 ms to minimize.
[2024-05-31 08:03:28] [INFO ] Deduced a trap composed of 158 places in 572 ms of which 3 ms to minimize.
[2024-05-31 08:03:28] [INFO ] Deduced a trap composed of 162 places in 561 ms of which 4 ms to minimize.
[2024-05-31 08:03:29] [INFO ] Deduced a trap composed of 164 places in 360 ms of which 3 ms to minimize.
[2024-05-31 08:03:30] [INFO ] Deduced a trap composed of 160 places in 545 ms of which 3 ms to minimize.
[2024-05-31 08:03:32] [INFO ] Deduced a trap composed of 162 places in 550 ms of which 7 ms to minimize.
[2024-05-31 08:03:33] [INFO ] Deduced a trap composed of 158 places in 570 ms of which 3 ms to minimize.
[2024-05-31 08:03:34] [INFO ] Deduced a trap composed of 164 places in 574 ms of which 3 ms to minimize.
[2024-05-31 08:03:35] [INFO ] Deduced a trap composed of 156 places in 533 ms of which 3 ms to minimize.
[2024-05-31 08:03:36] [INFO ] Deduced a trap composed of 156 places in 558 ms of which 3 ms to minimize.
[2024-05-31 08:03:36] [INFO ] Deduced a trap composed of 164 places in 576 ms of which 3 ms to minimize.
[2024-05-31 08:03:37] [INFO ] Deduced a trap composed of 162 places in 555 ms of which 3 ms to minimize.
[2024-05-31 08:03:38] [INFO ] Deduced a trap composed of 164 places in 575 ms of which 3 ms to minimize.
[2024-05-31 08:03:38] [INFO ] Deduced a trap composed of 160 places in 544 ms of which 3 ms to minimize.
[2024-05-31 08:03:39] [INFO ] Deduced a trap composed of 164 places in 561 ms of which 3 ms to minimize.
[2024-05-31 08:03:41] [INFO ] Deduced a trap composed of 170 places in 581 ms of which 4 ms to minimize.
[2024-05-31 08:03:42] [INFO ] Deduced a trap composed of 164 places in 584 ms of which 3 ms to minimize.
[2024-05-31 08:03:43] [INFO ] Deduced a trap composed of 158 places in 309 ms of which 2 ms to minimize.
[2024-05-31 08:03:44] [INFO ] Deduced a trap composed of 158 places in 313 ms of which 2 ms to minimize.
[2024-05-31 08:03:44] [INFO ] Deduced a trap composed of 162 places in 527 ms of which 3 ms to minimize.
[2024-05-31 08:03:45] [INFO ] Deduced a trap composed of 166 places in 584 ms of which 4 ms to minimize.
[2024-05-31 08:03:46] [INFO ] Deduced a trap composed of 156 places in 593 ms of which 3 ms to minimize.
ITS-tools command line returned an error code 137
[2024-05-31 08:03:59] [INFO ] Flatten gal took : 266 ms
[2024-05-31 08:03:59] [INFO ] Applying decomposition
[2024-05-31 08:03:59] [INFO ] Flatten gal took : 172 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11481144951004231542.txt' '-o' '/tmp/graph11481144951004231542.bin' '-w' '/tmp/graph11481144951004231542.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11481144951004231542.bin' '-l' '-1' '-v' '-w' '/tmp/graph11481144951004231542.weights' '-q' '0' '-e' '0.001'
[2024-05-31 08:04:00] [INFO ] Decomposing Gal with order
[2024-05-31 08:04:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 08:04:01] [INFO ] Removed a total of 5103 redundant transitions.
[2024-05-31 08:04:01] [INFO ] Flatten gal took : 664 ms
[2024-05-31 08:04:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 261 labels/synchronizations in 96 ms.
[2024-05-31 08:04:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5588014055751422250.gal : 26 ms
[2024-05-31 08:04:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4473576251513703066.prop : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5588014055751422250.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4473576251513703066.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality4473576251513703066.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
[2024-05-31 08:04:06] [INFO ] Trap strengthening (SAT) tested/added 102/102 trap constraints in 87669 ms
TRAPS : Iteration 1
[2024-05-31 08:04:07] [INFO ] After 88228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 08:04:07] [INFO ] After 88713ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
RANDOM walk for 4000000 steps (290249 resets) in 53293 ms. (75 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (38491 resets) in 10416 ms. (383 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 9837775 steps, run timeout after 48001 ms. (steps per millisecond=204 ) properties seen :0 out of 1
Probabilistic random walk after 9837775 steps, saw 1720334 distinct states, run finished after 48001 ms. (steps per millisecond=204 ) properties seen :0
[2024-05-31 08:05:11] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2024-05-31 08:05:11] [INFO ] Invariant cache hit.
[2024-05-31 08:05:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/399 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/408 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/409 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 972/1381 variables, 409/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1381 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1381 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1382 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1382 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1382 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1382/1382 variables, and 473 constraints, problems are : Problem set: 0 solved, 1 unsolved in 586 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 410/410 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/399 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/408 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 08:05:12] [INFO ] Deduced a trap composed of 164 places in 319 ms of which 5 ms to minimize.
[2024-05-31 08:05:13] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 3 ms to minimize.
[2024-05-31 08:05:13] [INFO ] Deduced a trap composed of 168 places in 292 ms of which 11 ms to minimize.
[2024-05-31 08:05:13] [INFO ] Deduced a trap composed of 166 places in 276 ms of which 2 ms to minimize.
[2024-05-31 08:05:14] [INFO ] Deduced a trap composed of 166 places in 267 ms of which 2 ms to minimize.
[2024-05-31 08:05:14] [INFO ] Deduced a trap composed of 164 places in 325 ms of which 2 ms to minimize.
[2024-05-31 08:05:14] [INFO ] Deduced a trap composed of 162 places in 287 ms of which 10 ms to minimize.
[2024-05-31 08:05:15] [INFO ] Deduced a trap composed of 168 places in 286 ms of which 3 ms to minimize.
[2024-05-31 08:05:15] [INFO ] Deduced a trap composed of 164 places in 303 ms of which 2 ms to minimize.
[2024-05-31 08:05:15] [INFO ] Deduced a trap composed of 162 places in 271 ms of which 2 ms to minimize.
[2024-05-31 08:05:15] [INFO ] Deduced a trap composed of 160 places in 288 ms of which 2 ms to minimize.
[2024-05-31 08:05:16] [INFO ] Deduced a trap composed of 168 places in 296 ms of which 2 ms to minimize.
[2024-05-31 08:05:16] [INFO ] Deduced a trap composed of 164 places in 265 ms of which 2 ms to minimize.
[2024-05-31 08:05:16] [INFO ] Deduced a trap composed of 162 places in 298 ms of which 2 ms to minimize.
[2024-05-31 08:05:17] [INFO ] Deduced a trap composed of 170 places in 273 ms of which 2 ms to minimize.
[2024-05-31 08:05:17] [INFO ] Deduced a trap composed of 170 places in 218 ms of which 3 ms to minimize.
[2024-05-31 08:05:17] [INFO ] Deduced a trap composed of 164 places in 302 ms of which 3 ms to minimize.
[2024-05-31 08:05:17] [INFO ] Deduced a trap composed of 166 places in 280 ms of which 10 ms to minimize.
[2024-05-31 08:05:18] [INFO ] Deduced a trap composed of 158 places in 303 ms of which 2 ms to minimize.
[2024-05-31 08:05:18] [INFO ] Deduced a trap composed of 160 places in 275 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 08:05:18] [INFO ] Deduced a trap composed of 160 places in 301 ms of which 2 ms to minimize.
[2024-05-31 08:05:19] [INFO ] Deduced a trap composed of 164 places in 266 ms of which 2 ms to minimize.
[2024-05-31 08:05:19] [INFO ] Deduced a trap composed of 166 places in 262 ms of which 2 ms to minimize.
[2024-05-31 08:05:19] [INFO ] Deduced a trap composed of 170 places in 283 ms of which 11 ms to minimize.
[2024-05-31 08:05:20] [INFO ] Deduced a trap composed of 162 places in 315 ms of which 2 ms to minimize.
[2024-05-31 08:05:20] [INFO ] Deduced a trap composed of 164 places in 266 ms of which 2 ms to minimize.
[2024-05-31 08:05:20] [INFO ] Deduced a trap composed of 164 places in 267 ms of which 11 ms to minimize.
[2024-05-31 08:05:20] [INFO ] Deduced a trap composed of 166 places in 257 ms of which 2 ms to minimize.
[2024-05-31 08:05:21] [INFO ] Deduced a trap composed of 164 places in 306 ms of which 2 ms to minimize.
[2024-05-31 08:05:21] [INFO ] Deduced a trap composed of 172 places in 276 ms of which 2 ms to minimize.
[2024-05-31 08:05:21] [INFO ] Deduced a trap composed of 168 places in 304 ms of which 2 ms to minimize.
[2024-05-31 08:05:22] [INFO ] Deduced a trap composed of 156 places in 294 ms of which 2 ms to minimize.
[2024-05-31 08:05:22] [INFO ] Deduced a trap composed of 160 places in 275 ms of which 2 ms to minimize.
[2024-05-31 08:05:22] [INFO ] Deduced a trap composed of 164 places in 319 ms of which 2 ms to minimize.
[2024-05-31 08:05:23] [INFO ] Deduced a trap composed of 166 places in 312 ms of which 3 ms to minimize.
[2024-05-31 08:05:23] [INFO ] Deduced a trap composed of 158 places in 240 ms of which 2 ms to minimize.
[2024-05-31 08:05:23] [INFO ] Deduced a trap composed of 160 places in 272 ms of which 2 ms to minimize.
[2024-05-31 08:05:23] [INFO ] Deduced a trap composed of 164 places in 295 ms of which 11 ms to minimize.
[2024-05-31 08:05:24] [INFO ] Deduced a trap composed of 154 places in 290 ms of which 2 ms to minimize.
[2024-05-31 08:05:24] [INFO ] Deduced a trap composed of 162 places in 289 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/408 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 08:05:25] [INFO ] Deduced a trap composed of 160 places in 303 ms of which 2 ms to minimize.
[2024-05-31 08:05:25] [INFO ] Deduced a trap composed of 158 places in 270 ms of which 3 ms to minimize.
[2024-05-31 08:05:25] [INFO ] Deduced a trap composed of 156 places in 293 ms of which 2 ms to minimize.
[2024-05-31 08:05:26] [INFO ] Deduced a trap composed of 160 places in 320 ms of which 3 ms to minimize.
[2024-05-31 08:05:26] [INFO ] Deduced a trap composed of 162 places in 321 ms of which 2 ms to minimize.
[2024-05-31 08:05:26] [INFO ] Deduced a trap composed of 165 places in 285 ms of which 2 ms to minimize.
[2024-05-31 08:05:27] [INFO ] Deduced a trap composed of 166 places in 298 ms of which 13 ms to minimize.
[2024-05-31 08:05:27] [INFO ] Deduced a trap composed of 166 places in 303 ms of which 2 ms to minimize.
[2024-05-31 08:05:27] [INFO ] Deduced a trap composed of 162 places in 328 ms of which 2 ms to minimize.
[2024-05-31 08:05:28] [INFO ] Deduced a trap composed of 158 places in 275 ms of which 2 ms to minimize.
[2024-05-31 08:05:28] [INFO ] Deduced a trap composed of 162 places in 263 ms of which 3 ms to minimize.
[2024-05-31 08:05:28] [INFO ] Deduced a trap composed of 162 places in 289 ms of which 2 ms to minimize.
[2024-05-31 08:05:28] [INFO ] Deduced a trap composed of 168 places in 276 ms of which 2 ms to minimize.
[2024-05-31 08:05:29] [INFO ] Deduced a trap composed of 162 places in 299 ms of which 2 ms to minimize.
[2024-05-31 08:05:29] [INFO ] Deduced a trap composed of 158 places in 283 ms of which 2 ms to minimize.
[2024-05-31 08:05:29] [INFO ] Deduced a trap composed of 168 places in 287 ms of which 2 ms to minimize.
[2024-05-31 08:05:30] [INFO ] Deduced a trap composed of 166 places in 317 ms of which 2 ms to minimize.
[2024-05-31 08:05:30] [INFO ] Deduced a trap composed of 166 places in 298 ms of which 2 ms to minimize.
[2024-05-31 08:05:30] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 2 ms to minimize.
[2024-05-31 08:05:30] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 08:05:31] [INFO ] Deduced a trap composed of 164 places in 300 ms of which 2 ms to minimize.
[2024-05-31 08:05:31] [INFO ] Deduced a trap composed of 162 places in 272 ms of which 3 ms to minimize.
[2024-05-31 08:05:32] [INFO ] Deduced a trap composed of 160 places in 244 ms of which 3 ms to minimize.
[2024-05-31 08:05:32] [INFO ] Deduced a trap composed of 158 places in 225 ms of which 3 ms to minimize.
[2024-05-31 08:05:32] [INFO ] Deduced a trap composed of 160 places in 212 ms of which 2 ms to minimize.
[2024-05-31 08:05:32] [INFO ] Deduced a trap composed of 158 places in 318 ms of which 2 ms to minimize.
[2024-05-31 08:05:33] [INFO ] Deduced a trap composed of 160 places in 271 ms of which 3 ms to minimize.
[2024-05-31 08:05:33] [INFO ] Deduced a trap composed of 160 places in 273 ms of which 2 ms to minimize.
[2024-05-31 08:05:33] [INFO ] Deduced a trap composed of 168 places in 289 ms of which 2 ms to minimize.
[2024-05-31 08:05:34] [INFO ] Deduced a trap composed of 172 places in 328 ms of which 2 ms to minimize.
[2024-05-31 08:05:34] [INFO ] Deduced a trap composed of 166 places in 216 ms of which 3 ms to minimize.
[2024-05-31 08:05:34] [INFO ] Deduced a trap composed of 172 places in 274 ms of which 3 ms to minimize.
[2024-05-31 08:05:34] [INFO ] Deduced a trap composed of 166 places in 282 ms of which 2 ms to minimize.
[2024-05-31 08:05:35] [INFO ] Deduced a trap composed of 162 places in 276 ms of which 2 ms to minimize.
[2024-05-31 08:05:35] [INFO ] Deduced a trap composed of 166 places in 279 ms of which 11 ms to minimize.
[2024-05-31 08:05:35] [INFO ] Deduced a trap composed of 164 places in 294 ms of which 2 ms to minimize.
[2024-05-31 08:05:36] [INFO ] Deduced a trap composed of 162 places in 339 ms of which 11 ms to minimize.
[2024-05-31 08:05:36] [INFO ] Deduced a trap composed of 158 places in 276 ms of which 2 ms to minimize.
[2024-05-31 08:05:36] [INFO ] Deduced a trap composed of 166 places in 266 ms of which 2 ms to minimize.
[2024-05-31 08:05:37] [INFO ] Deduced a trap composed of 166 places in 278 ms of which 11 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 08:05:37] [INFO ] Deduced a trap composed of 168 places in 283 ms of which 2 ms to minimize.
[2024-05-31 08:05:37] [INFO ] Deduced a trap composed of 160 places in 270 ms of which 1 ms to minimize.
[2024-05-31 08:05:38] [INFO ] Deduced a trap composed of 138 places in 333 ms of which 2 ms to minimize.
[2024-05-31 08:05:38] [INFO ] Deduced a trap composed of 166 places in 287 ms of which 2 ms to minimize.
[2024-05-31 08:05:39] [INFO ] Deduced a trap composed of 164 places in 288 ms of which 3 ms to minimize.
[2024-05-31 08:05:39] [INFO ] Deduced a trap composed of 168 places in 269 ms of which 3 ms to minimize.
[2024-05-31 08:05:39] [INFO ] Deduced a trap composed of 160 places in 302 ms of which 2 ms to minimize.
[2024-05-31 08:05:39] [INFO ] Deduced a trap composed of 164 places in 267 ms of which 3 ms to minimize.
[2024-05-31 08:05:40] [INFO ] Deduced a trap composed of 166 places in 300 ms of which 11 ms to minimize.
[2024-05-31 08:05:40] [INFO ] Deduced a trap composed of 170 places in 291 ms of which 3 ms to minimize.
[2024-05-31 08:05:40] [INFO ] Deduced a trap composed of 166 places in 223 ms of which 3 ms to minimize.
[2024-05-31 08:05:40] [INFO ] Deduced a trap composed of 168 places in 224 ms of which 3 ms to minimize.
[2024-05-31 08:05:41] [INFO ] Deduced a trap composed of 158 places in 225 ms of which 2 ms to minimize.
[2024-05-31 08:05:41] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 2 ms to minimize.
[2024-05-31 08:05:41] [INFO ] Deduced a trap composed of 168 places in 249 ms of which 2 ms to minimize.
[2024-05-31 08:05:42] [INFO ] Deduced a trap composed of 170 places in 289 ms of which 2 ms to minimize.
[2024-05-31 08:05:42] [INFO ] Deduced a trap composed of 162 places in 283 ms of which 2 ms to minimize.
[2024-05-31 08:05:42] [INFO ] Deduced a trap composed of 166 places in 281 ms of which 2 ms to minimize.
[2024-05-31 08:05:42] [INFO ] Deduced a trap composed of 164 places in 277 ms of which 2 ms to minimize.
[2024-05-31 08:05:43] [INFO ] Deduced a trap composed of 164 places in 317 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 08:05:43] [INFO ] Deduced a trap composed of 166 places in 290 ms of which 2 ms to minimize.
[2024-05-31 08:05:43] [INFO ] Deduced a trap composed of 164 places in 287 ms of which 1 ms to minimize.
[2024-05-31 08:05:44] [INFO ] Deduced a trap composed of 164 places in 321 ms of which 11 ms to minimize.
[2024-05-31 08:05:44] [INFO ] Deduced a trap composed of 170 places in 242 ms of which 3 ms to minimize.
[2024-05-31 08:05:44] [INFO ] Deduced a trap composed of 170 places in 303 ms of which 2 ms to minimize.
[2024-05-31 08:05:45] [INFO ] Deduced a trap composed of 170 places in 282 ms of which 2 ms to minimize.
[2024-05-31 08:05:45] [INFO ] Deduced a trap composed of 166 places in 278 ms of which 12 ms to minimize.
[2024-05-31 08:05:45] [INFO ] Deduced a trap composed of 166 places in 284 ms of which 2 ms to minimize.
[2024-05-31 08:05:45] [INFO ] Deduced a trap composed of 156 places in 289 ms of which 2 ms to minimize.
[2024-05-31 08:05:46] [INFO ] Deduced a trap composed of 160 places in 292 ms of which 2 ms to minimize.
[2024-05-31 08:05:46] [INFO ] Deduced a trap composed of 164 places in 342 ms of which 2 ms to minimize.
[2024-05-31 08:05:46] [INFO ] Deduced a trap composed of 166 places in 294 ms of which 11 ms to minimize.
[2024-05-31 08:05:47] [INFO ] Deduced a trap composed of 166 places in 283 ms of which 11 ms to minimize.
[2024-05-31 08:05:47] [INFO ] Deduced a trap composed of 164 places in 313 ms of which 2 ms to minimize.
[2024-05-31 08:05:47] [INFO ] Deduced a trap composed of 166 places in 288 ms of which 2 ms to minimize.
[2024-05-31 08:05:48] [INFO ] Deduced a trap composed of 158 places in 293 ms of which 2 ms to minimize.
[2024-05-31 08:05:48] [INFO ] Deduced a trap composed of 164 places in 297 ms of which 2 ms to minimize.
[2024-05-31 08:05:48] [INFO ] Deduced a trap composed of 158 places in 306 ms of which 2 ms to minimize.
[2024-05-31 08:05:49] [INFO ] Deduced a trap composed of 162 places in 314 ms of which 3 ms to minimize.
[2024-05-31 08:05:49] [INFO ] Deduced a trap composed of 142 places in 327 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/408 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 08:05:50] [INFO ] Deduced a trap composed of 160 places in 331 ms of which 3 ms to minimize.
[2024-05-31 08:05:50] [INFO ] Deduced a trap composed of 158 places in 298 ms of which 2 ms to minimize.
[2024-05-31 08:05:50] [INFO ] Deduced a trap composed of 164 places in 266 ms of which 2 ms to minimize.
[2024-05-31 08:05:51] [INFO ] Deduced a trap composed of 162 places in 316 ms of which 11 ms to minimize.
[2024-05-31 08:05:51] [INFO ] Deduced a trap composed of 160 places in 298 ms of which 2 ms to minimize.
[2024-05-31 08:05:51] [INFO ] Deduced a trap composed of 162 places in 312 ms of which 3 ms to minimize.
[2024-05-31 08:05:52] [INFO ] Deduced a trap composed of 164 places in 319 ms of which 3 ms to minimize.
[2024-05-31 08:05:52] [INFO ] Deduced a trap composed of 166 places in 288 ms of which 3 ms to minimize.
[2024-05-31 08:05:53] [INFO ] Deduced a trap composed of 164 places in 311 ms of which 12 ms to minimize.
[2024-05-31 08:05:53] [INFO ] Deduced a trap composed of 166 places in 305 ms of which 2 ms to minimize.
[2024-05-31 08:05:53] [INFO ] Deduced a trap composed of 166 places in 301 ms of which 3 ms to minimize.
[2024-05-31 08:05:54] [INFO ] Deduced a trap composed of 164 places in 322 ms of which 3 ms to minimize.
[2024-05-31 08:05:54] [INFO ] Deduced a trap composed of 164 places in 326 ms of which 2 ms to minimize.
[2024-05-31 08:05:55] [INFO ] Deduced a trap composed of 160 places in 297 ms of which 2 ms to minimize.
[2024-05-31 08:05:55] [INFO ] Deduced a trap composed of 170 places in 296 ms of which 2 ms to minimize.
[2024-05-31 08:05:57] [INFO ] Deduced a trap composed of 156 places in 309 ms of which 2 ms to minimize.
[2024-05-31 08:05:57] [INFO ] Deduced a trap composed of 162 places in 301 ms of which 2 ms to minimize.
[2024-05-31 08:05:57] [INFO ] Deduced a trap composed of 146 places in 327 ms of which 3 ms to minimize.
[2024-05-31 08:05:58] [INFO ] Deduced a trap composed of 166 places in 319 ms of which 2 ms to minimize.
[2024-05-31 08:05:58] [INFO ] Deduced a trap composed of 168 places in 320 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/408 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 08:06:00] [INFO ] Deduced a trap composed of 160 places in 290 ms of which 3 ms to minimize.
[2024-05-31 08:06:00] [INFO ] Deduced a trap composed of 166 places in 298 ms of which 3 ms to minimize.
[2024-05-31 08:06:00] [INFO ] Deduced a trap composed of 168 places in 254 ms of which 3 ms to minimize.
[2024-05-31 08:06:01] [INFO ] Deduced a trap composed of 166 places in 251 ms of which 3 ms to minimize.
[2024-05-31 08:06:01] [INFO ] Deduced a trap composed of 164 places in 277 ms of which 3 ms to minimize.
[2024-05-31 08:06:01] [INFO ] Deduced a trap composed of 160 places in 297 ms of which 3 ms to minimize.
[2024-05-31 08:06:02] [INFO ] Deduced a trap composed of 162 places in 253 ms of which 3 ms to minimize.
[2024-05-31 08:06:02] [INFO ] Deduced a trap composed of 162 places in 247 ms of which 3 ms to minimize.
[2024-05-31 08:06:02] [INFO ] Deduced a trap composed of 160 places in 273 ms of which 3 ms to minimize.
[2024-05-31 08:06:02] [INFO ] Deduced a trap composed of 168 places in 214 ms of which 3 ms to minimize.
[2024-05-31 08:06:03] [INFO ] Deduced a trap composed of 168 places in 190 ms of which 2 ms to minimize.
[2024-05-31 08:06:03] [INFO ] Deduced a trap composed of 168 places in 193 ms of which 2 ms to minimize.
[2024-05-31 08:06:03] [INFO ] Deduced a trap composed of 160 places in 180 ms of which 2 ms to minimize.
[2024-05-31 08:06:03] [INFO ] Deduced a trap composed of 156 places in 177 ms of which 2 ms to minimize.
[2024-05-31 08:06:03] [INFO ] Deduced a trap composed of 158 places in 177 ms of which 2 ms to minimize.
[2024-05-31 08:06:04] [INFO ] Deduced a trap composed of 162 places in 171 ms of which 2 ms to minimize.
[2024-05-31 08:06:04] [INFO ] Deduced a trap composed of 164 places in 183 ms of which 2 ms to minimize.
[2024-05-31 08:06:04] [INFO ] Deduced a trap composed of 158 places in 181 ms of which 2 ms to minimize.
[2024-05-31 08:06:04] [INFO ] Deduced a trap composed of 160 places in 177 ms of which 1 ms to minimize.
[2024-05-31 08:06:04] [INFO ] Deduced a trap composed of 162 places in 171 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/408 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 08:06:05] [INFO ] Deduced a trap composed of 160 places in 179 ms of which 1 ms to minimize.
[2024-05-31 08:06:05] [INFO ] Deduced a trap composed of 164 places in 373 ms of which 2 ms to minimize.
[2024-05-31 08:06:05] [INFO ] Deduced a trap composed of 166 places in 223 ms of which 2 ms to minimize.
[2024-05-31 08:06:05] [INFO ] Deduced a trap composed of 168 places in 202 ms of which 2 ms to minimize.
[2024-05-31 08:06:06] [INFO ] Deduced a trap composed of 162 places in 174 ms of which 2 ms to minimize.
[2024-05-31 08:06:06] [INFO ] Deduced a trap composed of 162 places in 233 ms of which 2 ms to minimize.
[2024-05-31 08:06:06] [INFO ] Deduced a trap composed of 162 places in 185 ms of which 2 ms to minimize.
[2024-05-31 08:06:06] [INFO ] Deduced a trap composed of 154 places in 183 ms of which 3 ms to minimize.
[2024-05-31 08:06:06] [INFO ] Deduced a trap composed of 158 places in 170 ms of which 2 ms to minimize.
[2024-05-31 08:06:07] [INFO ] Deduced a trap composed of 160 places in 176 ms of which 2 ms to minimize.
[2024-05-31 08:06:07] [INFO ] Deduced a trap composed of 160 places in 181 ms of which 2 ms to minimize.
[2024-05-31 08:06:07] [INFO ] Deduced a trap composed of 156 places in 288 ms of which 2 ms to minimize.
[2024-05-31 08:06:07] [INFO ] Deduced a trap composed of 156 places in 229 ms of which 3 ms to minimize.
[2024-05-31 08:06:08] [INFO ] Deduced a trap composed of 158 places in 204 ms of which 3 ms to minimize.
[2024-05-31 08:06:08] [INFO ] Deduced a trap composed of 158 places in 288 ms of which 11 ms to minimize.
[2024-05-31 08:06:08] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 3 ms to minimize.
[2024-05-31 08:06:08] [INFO ] Deduced a trap composed of 156 places in 281 ms of which 2 ms to minimize.
[2024-05-31 08:06:09] [INFO ] Deduced a trap composed of 158 places in 240 ms of which 3 ms to minimize.
[2024-05-31 08:06:09] [INFO ] Deduced a trap composed of 164 places in 226 ms of which 2 ms to minimize.
[2024-05-31 08:06:09] [INFO ] Deduced a trap composed of 166 places in 260 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/408 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 08:06:10] [INFO ] Deduced a trap composed of 158 places in 280 ms of which 3 ms to minimize.
[2024-05-31 08:06:10] [INFO ] Deduced a trap composed of 158 places in 277 ms of which 2 ms to minimize.
[2024-05-31 08:06:10] [INFO ] Deduced a trap composed of 160 places in 248 ms of which 3 ms to minimize.
[2024-05-31 08:06:10] [INFO ] Deduced a trap composed of 160 places in 272 ms of which 3 ms to minimize.
[2024-05-31 08:06:11] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 2 ms to minimize.
[2024-05-31 08:06:11] [INFO ] Deduced a trap composed of 168 places in 235 ms of which 2 ms to minimize.
[2024-05-31 08:06:11] [INFO ] Deduced a trap composed of 162 places in 268 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 408/1382 variables, and 248 constraints, problems are : Problem set: 0 solved, 1 unsolved in 74900 ms.
Refiners :[Positive P Invariants (semi-flows): 54/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 187/187 constraints]
After SMT, in 75508ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 68 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 31 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2024-05-31 08:06:27] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2024-05-31 08:06:27] [INFO ] Invariant cache hit.
[2024-05-31 08:06:27] [INFO ] Implicit Places using invariants in 412 ms returned []
[2024-05-31 08:06:27] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2024-05-31 08:06:27] [INFO ] Invariant cache hit.
[2024-05-31 08:06:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 08:06:29] [INFO ] Implicit Places using invariants and state equation in 1824 ms returned []
Implicit Place search using SMT with State Equation took 2255 ms to find 0 implicit places.
[2024-05-31 08:06:29] [INFO ] Redundant transitions in 5 ms returned []
Running 970 sub problems to find dead transitions.
[2024-05-31 08:06:29] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2024-05-31 08:06:29] [INFO ] Invariant cache hit.
[2024-05-31 08:06:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 970 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-05-31 08:06:45] [INFO ] Deduced a trap composed of 111 places in 204 ms of which 3 ms to minimize.
[2024-05-31 08:06:45] [INFO ] Deduced a trap composed of 111 places in 200 ms of which 3 ms to minimize.
[2024-05-31 08:06:45] [INFO ] Deduced a trap composed of 116 places in 217 ms of which 3 ms to minimize.
[2024-05-31 08:06:46] [INFO ] Deduced a trap composed of 121 places in 183 ms of which 3 ms to minimize.
[2024-05-31 08:06:46] [INFO ] Deduced a trap composed of 111 places in 177 ms of which 3 ms to minimize.
[2024-05-31 08:06:46] [INFO ] Deduced a trap composed of 111 places in 177 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-05-31 08:06:56] [INFO ] Deduced a trap composed of 13 places in 253 ms of which 2 ms to minimize.
[2024-05-31 08:06:57] [INFO ] Deduced a trap composed of 166 places in 156 ms of which 2 ms to minimize.
[2024-05-31 08:06:58] [INFO ] Deduced a trap composed of 162 places in 164 ms of which 3 ms to minimize.
[2024-05-31 08:06:58] [INFO ] Deduced a trap composed of 166 places in 165 ms of which 3 ms to minimize.
[2024-05-31 08:06:58] [INFO ] Deduced a trap composed of 171 places in 208 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-05-31 08:07:03] [INFO ] Deduced a trap composed of 126 places in 137 ms of which 2 ms to minimize.
[2024-05-31 08:07:03] [INFO ] Deduced a trap composed of 131 places in 134 ms of which 2 ms to minimize.
[2024-05-31 08:07:04] [INFO ] Deduced a trap composed of 136 places in 135 ms of which 2 ms to minimize.
[2024-05-31 08:07:04] [INFO ] Deduced a trap composed of 126 places in 136 ms of which 2 ms to minimize.
[2024-05-31 08:07:04] [INFO ] Deduced a trap composed of 131 places in 161 ms of which 2 ms to minimize.
[2024-05-31 08:07:04] [INFO ] Deduced a trap composed of 126 places in 135 ms of which 2 ms to minimize.
[2024-05-31 08:07:04] [INFO ] Deduced a trap composed of 131 places in 134 ms of which 3 ms to minimize.
[2024-05-31 08:07:04] [INFO ] Deduced a trap composed of 131 places in 161 ms of which 2 ms to minimize.
[2024-05-31 08:07:04] [INFO ] Deduced a trap composed of 131 places in 131 ms of which 2 ms to minimize.
[2024-05-31 08:07:05] [INFO ] Deduced a trap composed of 126 places in 129 ms of which 2 ms to minimize.
[2024-05-31 08:07:05] [INFO ] Deduced a trap composed of 126 places in 132 ms of which 2 ms to minimize.
[2024-05-31 08:07:05] [INFO ] Deduced a trap composed of 126 places in 131 ms of which 2 ms to minimize.
[2024-05-31 08:07:05] [INFO ] Deduced a trap composed of 126 places in 132 ms of which 2 ms to minimize.
[2024-05-31 08:07:05] [INFO ] Deduced a trap composed of 126 places in 137 ms of which 2 ms to minimize.
[2024-05-31 08:07:05] [INFO ] Deduced a trap composed of 136 places in 134 ms of which 1 ms to minimize.
[2024-05-31 08:07:05] [INFO ] Deduced a trap composed of 131 places in 132 ms of which 4 ms to minimize.
[2024-05-31 08:07:06] [INFO ] Deduced a trap composed of 131 places in 232 ms of which 2 ms to minimize.
[2024-05-31 08:07:06] [INFO ] Deduced a trap composed of 131 places in 156 ms of which 2 ms to minimize.
[2024-05-31 08:07:06] [INFO ] Deduced a trap composed of 126 places in 131 ms of which 2 ms to minimize.
[2024-05-31 08:07:06] [INFO ] Deduced a trap composed of 121 places in 134 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-05-31 08:07:08] [INFO ] Deduced a trap composed of 111 places in 190 ms of which 3 ms to minimize.
[2024-05-31 08:07:08] [INFO ] Deduced a trap composed of 107 places in 166 ms of which 3 ms to minimize.
[2024-05-31 08:07:08] [INFO ] Deduced a trap composed of 111 places in 165 ms of which 4 ms to minimize.
[2024-05-31 08:07:08] [INFO ] Deduced a trap composed of 126 places in 160 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 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 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 (/ 2.0 3.0))
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.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 (/ 2.0 3.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 (/ 1.0 3.0))
(s106 0.0)
(s107 (/ 1.0 3.0))
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.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 1.0)
(s127 1.0)
(s128 1.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 9.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 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 400/1382 variables, and 87 constraints, problems are : Problem set: 0 solved, 970 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 970/970 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 970 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 970 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 970 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 35/87 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-05-31 08:07:11] [INFO ] Deduced a trap composed of 18 places in 318 ms of which 2 ms to minimize.
[2024-05-31 08:07:12] [INFO ] Deduced a trap composed of 173 places in 322 ms of which 2 ms to minimize.
[2024-05-31 08:07:12] [INFO ] Deduced a trap composed of 164 places in 280 ms of which 2 ms to minimize.
[2024-05-31 08:07:12] [INFO ] Deduced a trap composed of 170 places in 256 ms of which 3 ms to minimize.
[2024-05-31 08:07:12] [INFO ] Deduced a trap composed of 175 places in 284 ms of which 3 ms to minimize.
[2024-05-31 08:07:13] [INFO ] Deduced a trap composed of 162 places in 232 ms of which 2 ms to minimize.
[2024-05-31 08:07:13] [INFO ] Deduced a trap composed of 175 places in 222 ms of which 2 ms to minimize.
[2024-05-31 08:07:13] [INFO ] Deduced a trap composed of 164 places in 235 ms of which 2 ms to minimize.
[2024-05-31 08:07:13] [INFO ] Deduced a trap composed of 175 places in 209 ms of which 2 ms to minimize.
[2024-05-31 08:07:14] [INFO ] Deduced a trap composed of 175 places in 210 ms of which 2 ms to minimize.
[2024-05-31 08:07:14] [INFO ] Deduced a trap composed of 168 places in 206 ms of which 1 ms to minimize.
[2024-05-31 08:07:14] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 2 ms to minimize.
[2024-05-31 08:07:14] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 2 ms to minimize.
[2024-05-31 08:07:14] [INFO ] Deduced a trap composed of 173 places in 210 ms of which 2 ms to minimize.
[2024-05-31 08:07:15] [INFO ] Deduced a trap composed of 175 places in 348 ms of which 2 ms to minimize.
[2024-05-31 08:07:15] [INFO ] Deduced a trap composed of 175 places in 208 ms of which 2 ms to minimize.
[2024-05-31 08:07:15] [INFO ] Deduced a trap composed of 162 places in 269 ms of which 2 ms to minimize.
[2024-05-31 08:07:16] [INFO ] Deduced a trap composed of 170 places in 234 ms of which 2 ms to minimize.
[2024-05-31 08:07:16] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 2 ms to minimize.
[2024-05-31 08:07:16] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-05-31 08:07:18] [INFO ] Deduced a trap composed of 168 places in 373 ms of which 2 ms to minimize.
[2024-05-31 08:07:19] [INFO ] Deduced a trap composed of 164 places in 325 ms of which 4 ms to minimize.
[2024-05-31 08:07:19] [INFO ] Deduced a trap composed of 173 places in 305 ms of which 3 ms to minimize.
[2024-05-31 08:07:19] [INFO ] Deduced a trap composed of 162 places in 267 ms of which 2 ms to minimize.
[2024-05-31 08:07:20] [INFO ] Deduced a trap composed of 160 places in 268 ms of which 3 ms to minimize.
[2024-05-31 08:07:20] [INFO ] Deduced a trap composed of 158 places in 261 ms of which 2 ms to minimize.
[2024-05-31 08:07:20] [INFO ] Deduced a trap composed of 158 places in 251 ms of which 3 ms to minimize.
[2024-05-31 08:07:20] [INFO ] Deduced a trap composed of 162 places in 269 ms of which 2 ms to minimize.
[2024-05-31 08:07:21] [INFO ] Deduced a trap composed of 167 places in 236 ms of which 3 ms to minimize.
[2024-05-31 08:07:21] [INFO ] Deduced a trap composed of 169 places in 239 ms of which 3 ms to minimize.
[2024-05-31 08:07:21] [INFO ] Deduced a trap composed of 162 places in 277 ms of which 2 ms to minimize.
[2024-05-31 08:07:21] [INFO ] Deduced a trap composed of 162 places in 243 ms of which 3 ms to minimize.
[2024-05-31 08:07:22] [INFO ] Deduced a trap composed of 169 places in 275 ms of which 3 ms to minimize.
[2024-05-31 08:07:22] [INFO ] Deduced a trap composed of 173 places in 238 ms of which 3 ms to minimize.
[2024-05-31 08:07:22] [INFO ] Deduced a trap composed of 164 places in 341 ms of which 3 ms to minimize.
[2024-05-31 08:07:23] [INFO ] Deduced a trap composed of 175 places in 285 ms of which 3 ms to minimize.
[2024-05-31 08:07:23] [INFO ] Deduced a trap composed of 168 places in 294 ms of which 3 ms to minimize.
[2024-05-31 08:07:23] [INFO ] Deduced a trap composed of 162 places in 252 ms of which 3 ms to minimize.
[2024-05-31 08:07:24] [INFO ] Deduced a trap composed of 162 places in 257 ms of which 2 ms to minimize.
[2024-05-31 08:07:24] [INFO ] Deduced a trap composed of 164 places in 243 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-05-31 08:07:30] [INFO ] Deduced a trap composed of 167 places in 316 ms of which 3 ms to minimize.
[2024-05-31 08:07:30] [INFO ] Deduced a trap composed of 160 places in 324 ms of which 2 ms to minimize.
[2024-05-31 08:07:30] [INFO ] Deduced a trap composed of 173 places in 286 ms of which 3 ms to minimize.
[2024-05-31 08:07:31] [INFO ] Deduced a trap composed of 171 places in 251 ms of which 3 ms to minimize.
[2024-05-31 08:07:31] [INFO ] Deduced a trap composed of 168 places in 241 ms of which 2 ms to minimize.
[2024-05-31 08:07:31] [INFO ] Deduced a trap composed of 164 places in 259 ms of which 3 ms to minimize.
[2024-05-31 08:07:31] [INFO ] Deduced a trap composed of 168 places in 256 ms of which 2 ms to minimize.
[2024-05-31 08:07:32] [INFO ] Deduced a trap composed of 168 places in 252 ms of which 3 ms to minimize.
[2024-05-31 08:07:32] [INFO ] Deduced a trap composed of 164 places in 288 ms of which 2 ms to minimize.
[2024-05-31 08:07:32] [INFO ] Deduced a trap composed of 160 places in 290 ms of which 3 ms to minimize.
[2024-05-31 08:07:33] [INFO ] Deduced a trap composed of 162 places in 265 ms of which 3 ms to minimize.
[2024-05-31 08:07:33] [INFO ] Deduced a trap composed of 164 places in 260 ms of which 2 ms to minimize.
[2024-05-31 08:07:33] [INFO ] Deduced a trap composed of 177 places in 304 ms of which 2 ms to minimize.
[2024-05-31 08:07:34] [INFO ] Deduced a trap composed of 168 places in 236 ms of which 3 ms to minimize.
[2024-05-31 08:07:34] [INFO ] Deduced a trap composed of 160 places in 222 ms of which 2 ms to minimize.
[2024-05-31 08:07:34] [INFO ] Deduced a trap composed of 164 places in 272 ms of which 4 ms to minimize.
[2024-05-31 08:07:35] [INFO ] Deduced a trap composed of 166 places in 301 ms of which 2 ms to minimize.
[2024-05-31 08:07:35] [INFO ] Deduced a trap composed of 166 places in 240 ms of which 2 ms to minimize.
[2024-05-31 08:07:35] [INFO ] Deduced a trap composed of 168 places in 266 ms of which 2 ms to minimize.
[2024-05-31 08:07:35] [INFO ] Deduced a trap composed of 173 places in 268 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 970 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 400/1382 variables, and 147 constraints, problems are : Problem set: 0 solved, 970 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/970 constraints, Known Traps: 95/95 constraints]
After SMT, in 69126ms problems are : Problem set: 0 solved, 970 unsolved
Search for dead transitions found 0 dead transitions in 69152ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71454 ms. Remains : 410/410 places, 981/981 transitions.
RANDOM walk for 400000 steps (29144 resets) in 5662 ms. (70 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-05-31 08:07:40] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2024-05-31 08:07:40] [INFO ] Invariant cache hit.
[2024-05-31 08:07:40] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2024-05-31 08:07:40] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 22 ms returned sat
[2024-05-31 08:07:41] [INFO ] After 365ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 08:07:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 08:07:41] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 08:07:41] [INFO ] After 65ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 08:07:41] [INFO ] After 568ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 08:07:41] [INFO ] [Nat]Absence check using 55 positive place invariants in 9 ms returned sat
[2024-05-31 08:07:41] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-31 08:07:44] [INFO ] After 3681ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 08:07:45] [INFO ] After 134ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 08:07:45] [INFO ] Deduced a trap composed of 164 places in 288 ms of which 2 ms to minimize.
[2024-05-31 08:07:45] [INFO ] Deduced a trap composed of 162 places in 381 ms of which 2 ms to minimize.
[2024-05-31 08:07:46] [INFO ] Deduced a trap composed of 166 places in 331 ms of which 3 ms to minimize.
[2024-05-31 08:07:46] [INFO ] Deduced a trap composed of 156 places in 378 ms of which 3 ms to minimize.
[2024-05-31 08:07:47] [INFO ] Deduced a trap composed of 162 places in 580 ms of which 3 ms to minimize.
[2024-05-31 08:07:47] [INFO ] Deduced a trap composed of 158 places in 555 ms of which 3 ms to minimize.
[2024-05-31 08:07:48] [INFO ] Deduced a trap composed of 164 places in 571 ms of which 3 ms to minimize.
[2024-05-31 08:07:49] [INFO ] Deduced a trap composed of 164 places in 563 ms of which 3 ms to minimize.
[2024-05-31 08:07:49] [INFO ] Deduced a trap composed of 164 places in 606 ms of which 3 ms to minimize.
[2024-05-31 08:07:50] [INFO ] Deduced a trap composed of 160 places in 561 ms of which 3 ms to minimize.
[2024-05-31 08:07:50] [INFO ] Deduced a trap composed of 164 places in 563 ms of which 4 ms to minimize.
[2024-05-31 08:07:51] [INFO ] Deduced a trap composed of 162 places in 523 ms of which 3 ms to minimize.
[2024-05-31 08:07:51] [INFO ] Deduced a trap composed of 162 places in 380 ms of which 2 ms to minimize.
[2024-05-31 08:07:52] [INFO ] Deduced a trap composed of 160 places in 441 ms of which 2 ms to minimize.
[2024-05-31 08:07:52] [INFO ] Deduced a trap composed of 164 places in 384 ms of which 2 ms to minimize.
[2024-05-31 08:07:53] [INFO ] Deduced a trap composed of 164 places in 527 ms of which 3 ms to minimize.
[2024-05-31 08:07:54] [INFO ] Deduced a trap composed of 171 places in 338 ms of which 3 ms to minimize.
[2024-05-31 08:07:54] [INFO ] Deduced a trap composed of 166 places in 373 ms of which 3 ms to minimize.
[2024-05-31 08:07:55] [INFO ] Deduced a trap composed of 164 places in 338 ms of which 3 ms to minimize.
[2024-05-31 08:07:55] [INFO ] Deduced a trap composed of 172 places in 293 ms of which 3 ms to minimize.
[2024-05-31 08:07:55] [INFO ] Deduced a trap composed of 179 places in 312 ms of which 3 ms to minimize.
[2024-05-31 08:07:56] [INFO ] Deduced a trap composed of 164 places in 296 ms of which 3 ms to minimize.
[2024-05-31 08:07:56] [INFO ] Deduced a trap composed of 166 places in 286 ms of which 3 ms to minimize.
[2024-05-31 08:07:57] [INFO ] Deduced a trap composed of 172 places in 292 ms of which 2 ms to minimize.
[2024-05-31 08:07:57] [INFO ] Deduced a trap composed of 179 places in 311 ms of which 3 ms to minimize.
[2024-05-31 08:07:57] [INFO ] Deduced a trap composed of 177 places in 292 ms of which 3 ms to minimize.
[2024-05-31 08:07:58] [INFO ] Deduced a trap composed of 175 places in 296 ms of which 3 ms to minimize.
[2024-05-31 08:07:58] [INFO ] Deduced a trap composed of 156 places in 288 ms of which 3 ms to minimize.
[2024-05-31 08:07:59] [INFO ] Deduced a trap composed of 158 places in 305 ms of which 2 ms to minimize.
[2024-05-31 08:07:59] [INFO ] Deduced a trap composed of 166 places in 300 ms of which 3 ms to minimize.
[2024-05-31 08:07:59] [INFO ] Deduced a trap composed of 175 places in 344 ms of which 15 ms to minimize.
[2024-05-31 08:08:00] [INFO ] Deduced a trap composed of 166 places in 370 ms of which 3 ms to minimize.
[2024-05-31 08:08:00] [INFO ] Deduced a trap composed of 160 places in 358 ms of which 3 ms to minimize.
[2024-05-31 08:08:01] [INFO ] Deduced a trap composed of 164 places in 346 ms of which 3 ms to minimize.
[2024-05-31 08:08:01] [INFO ] Deduced a trap composed of 158 places in 360 ms of which 3 ms to minimize.
[2024-05-31 08:08:01] [INFO ] Deduced a trap composed of 158 places in 313 ms of which 2 ms to minimize.
[2024-05-31 08:08:02] [INFO ] Deduced a trap composed of 160 places in 288 ms of which 2 ms to minimize.
[2024-05-31 08:08:02] [INFO ] Deduced a trap composed of 162 places in 237 ms of which 2 ms to minimize.
[2024-05-31 08:08:02] [INFO ] Deduced a trap composed of 160 places in 223 ms of which 2 ms to minimize.
[2024-05-31 08:08:03] [INFO ] Deduced a trap composed of 164 places in 235 ms of which 2 ms to minimize.
[2024-05-31 08:08:03] [INFO ] Deduced a trap composed of 162 places in 244 ms of which 2 ms to minimize.
[2024-05-31 08:08:03] [INFO ] Deduced a trap composed of 156 places in 239 ms of which 2 ms to minimize.
[2024-05-31 08:08:04] [INFO ] Deduced a trap composed of 170 places in 290 ms of which 2 ms to minimize.
[2024-05-31 08:08:04] [INFO ] Deduced a trap composed of 164 places in 237 ms of which 2 ms to minimize.
[2024-05-31 08:08:04] [INFO ] Deduced a trap composed of 160 places in 285 ms of which 3 ms to minimize.
[2024-05-31 08:08:05] [INFO ] Deduced a trap composed of 164 places in 287 ms of which 3 ms to minimize.
[2024-05-31 08:08:05] [INFO ] Deduced a trap composed of 162 places in 272 ms of which 2 ms to minimize.
[2024-05-31 08:08:06] [INFO ] Deduced a trap composed of 166 places in 305 ms of which 3 ms to minimize.
[2024-05-31 08:08:06] [INFO ] Deduced a trap composed of 166 places in 263 ms of which 3 ms to minimize.
[2024-05-31 08:08:06] [INFO ] Deduced a trap composed of 172 places in 296 ms of which 3 ms to minimize.
[2024-05-31 08:08:09] [INFO ] Deduced a trap composed of 162 places in 295 ms of which 2 ms to minimize.
[2024-05-31 08:08:09] [INFO ] Deduced a trap composed of 168 places in 294 ms of which 2 ms to minimize.
[2024-05-31 08:08:09] [INFO ] Deduced a trap composed of 154 places in 304 ms of which 3 ms to minimize.
[2024-05-31 08:08:10] [INFO ] Deduced a trap composed of 162 places in 282 ms of which 3 ms to minimize.
[2024-05-31 08:08:10] [INFO ] Deduced a trap composed of 160 places in 285 ms of which 3 ms to minimize.
[2024-05-31 08:08:10] [INFO ] Deduced a trap composed of 156 places in 264 ms of which 3 ms to minimize.
[2024-05-31 08:08:11] [INFO ] Deduced a trap composed of 166 places in 287 ms of which 3 ms to minimize.
[2024-05-31 08:08:11] [INFO ] Deduced a trap composed of 160 places in 279 ms of which 4 ms to minimize.
[2024-05-31 08:08:12] [INFO ] Deduced a trap composed of 168 places in 304 ms of which 3 ms to minimize.
[2024-05-31 08:08:13] [INFO ] Deduced a trap composed of 160 places in 289 ms of which 2 ms to minimize.
[2024-05-31 08:08:14] [INFO ] Deduced a trap composed of 164 places in 298 ms of which 3 ms to minimize.
[2024-05-31 08:08:15] [INFO ] Deduced a trap composed of 162 places in 426 ms of which 2 ms to minimize.
[2024-05-31 08:08:16] [INFO ] Deduced a trap composed of 160 places in 330 ms of which 2 ms to minimize.
[2024-05-31 08:08:19] [INFO ] Deduced a trap composed of 162 places in 3539 ms of which 3 ms to minimize.
[2024-05-31 08:08:20] [INFO ] Deduced a trap composed of 166 places in 371 ms of which 3 ms to minimize.
[2024-05-31 08:08:20] [INFO ] Deduced a trap composed of 156 places in 362 ms of which 3 ms to minimize.
[2024-05-31 08:08:21] [INFO ] Deduced a trap composed of 158 places in 376 ms of which 2 ms to minimize.
[2024-05-31 08:08:21] [INFO ] Deduced a trap composed of 160 places in 400 ms of which 3 ms to minimize.
[2024-05-31 08:08:22] [INFO ] Deduced a trap composed of 172 places in 390 ms of which 3 ms to minimize.
[2024-05-31 08:08:22] [INFO ] Deduced a trap composed of 160 places in 374 ms of which 3 ms to minimize.
[2024-05-31 08:08:23] [INFO ] Deduced a trap composed of 162 places in 373 ms of which 3 ms to minimize.
[2024-05-31 08:08:23] [INFO ] Deduced a trap composed of 170 places in 445 ms of which 3 ms to minimize.
[2024-05-31 08:08:24] [INFO ] Deduced a trap composed of 166 places in 409 ms of which 3 ms to minimize.
[2024-05-31 08:08:25] [INFO ] Deduced a trap composed of 158 places in 392 ms of which 3 ms to minimize.
[2024-05-31 08:08:25] [INFO ] Deduced a trap composed of 158 places in 429 ms of which 3 ms to minimize.
[2024-05-31 08:08:27] [INFO ] Deduced a trap composed of 158 places in 463 ms of which 2 ms to minimize.
[2024-05-31 08:08:27] [INFO ] Deduced a trap composed of 156 places in 372 ms of which 3 ms to minimize.
[2024-05-31 08:08:27] [INFO ] Deduced a trap composed of 160 places in 365 ms of which 2 ms to minimize.
[2024-05-31 08:08:28] [INFO ] Deduced a trap composed of 164 places in 370 ms of which 3 ms to minimize.
[2024-05-31 08:08:29] [INFO ] Deduced a trap composed of 164 places in 364 ms of which 3 ms to minimize.
[2024-05-31 08:08:29] [INFO ] Deduced a trap composed of 156 places in 360 ms of which 3 ms to minimize.
[2024-05-31 08:08:30] [INFO ] Deduced a trap composed of 158 places in 312 ms of which 3 ms to minimize.
[2024-05-31 08:08:30] [INFO ] Deduced a trap composed of 162 places in 309 ms of which 3 ms to minimize.
[2024-05-31 08:08:31] [INFO ] Deduced a trap composed of 164 places in 274 ms of which 3 ms to minimize.
[2024-05-31 08:08:31] [INFO ] Deduced a trap composed of 160 places in 345 ms of which 2 ms to minimize.
[2024-05-31 08:08:33] [INFO ] Deduced a trap composed of 162 places in 271 ms of which 2 ms to minimize.
[2024-05-31 08:08:34] [INFO ] Deduced a trap composed of 158 places in 266 ms of which 2 ms to minimize.
[2024-05-31 08:08:35] [INFO ] Deduced a trap composed of 164 places in 370 ms of which 2 ms to minimize.
[2024-05-31 08:08:35] [INFO ] Deduced a trap composed of 156 places in 343 ms of which 2 ms to minimize.
[2024-05-31 08:08:36] [INFO ] Deduced a trap composed of 156 places in 306 ms of which 3 ms to minimize.
[2024-05-31 08:08:36] [INFO ] Deduced a trap composed of 164 places in 307 ms of which 2 ms to minimize.
[2024-05-31 08:08:36] [INFO ] Deduced a trap composed of 162 places in 275 ms of which 3 ms to minimize.
[2024-05-31 08:08:37] [INFO ] Deduced a trap composed of 164 places in 245 ms of which 2 ms to minimize.
[2024-05-31 08:08:37] [INFO ] Deduced a trap composed of 160 places in 252 ms of which 2 ms to minimize.
[2024-05-31 08:08:38] [INFO ] Deduced a trap composed of 164 places in 277 ms of which 2 ms to minimize.
[2024-05-31 08:08:39] [INFO ] Deduced a trap composed of 170 places in 271 ms of which 3 ms to minimize.
[2024-05-31 08:08:39] [INFO ] Deduced a trap composed of 164 places in 274 ms of which 2 ms to minimize.
[2024-05-31 08:08:40] [INFO ] Deduced a trap composed of 158 places in 267 ms of which 2 ms to minimize.
[2024-05-31 08:08:41] [INFO ] Deduced a trap composed of 158 places in 272 ms of which 2 ms to minimize.
[2024-05-31 08:08:41] [INFO ] Deduced a trap composed of 162 places in 251 ms of which 2 ms to minimize.
[2024-05-31 08:08:41] [INFO ] Deduced a trap composed of 166 places in 266 ms of which 2 ms to minimize.
[2024-05-31 08:08:42] [INFO ] Deduced a trap composed of 156 places in 251 ms of which 2 ms to minimize.
[2024-05-31 08:09:02] [INFO ] Trap strengthening (SAT) tested/added 102/102 trap constraints in 77293 ms
TRAPS : Iteration 1
[2024-05-31 08:09:02] [INFO ] After 77767ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 08:09:02] [INFO ] After 81544ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
RANDOM walk for 40000 steps (2884 resets) in 642 ms. (62 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (375 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 314748 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :0 out of 1
Probabilistic random walk after 314748 steps, saw 51066 distinct states, run finished after 3002 ms. (steps per millisecond=104 ) properties seen :0
[2024-05-31 08:09:06] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2024-05-31 08:09:06] [INFO ] Invariant cache hit.
[2024-05-31 08:09:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/399 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/408 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/409 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 972/1381 variables, 409/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1381 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1381 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1382 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1382 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1382 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1382/1382 variables, and 473 constraints, problems are : Problem set: 0 solved, 1 unsolved in 544 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 410/410 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/399 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/408 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 08:09:07] [INFO ] Deduced a trap composed of 164 places in 282 ms of which 2 ms to minimize.
[2024-05-31 08:09:07] [INFO ] Deduced a trap composed of 164 places in 254 ms of which 3 ms to minimize.
[2024-05-31 08:09:07] [INFO ] Deduced a trap composed of 168 places in 312 ms of which 3 ms to minimize.
[2024-05-31 08:09:07] [INFO ] Deduced a trap composed of 166 places in 345 ms of which 2 ms to minimize.
[2024-05-31 08:09:08] [INFO ] Deduced a trap composed of 162 places in 327 ms of which 2 ms to minimize.
[2024-05-31 08:09:08] [INFO ] Deduced a trap composed of 164 places in 445 ms of which 2 ms to minimize.
[2024-05-31 08:09:09] [INFO ] Deduced a trap composed of 166 places in 271 ms of which 3 ms to minimize.
[2024-05-31 08:09:09] [INFO ] Deduced a trap composed of 168 places in 238 ms of which 3 ms to minimize.
[2024-05-31 08:09:09] [INFO ] Deduced a trap composed of 162 places in 241 ms of which 3 ms to minimize.
[2024-05-31 08:09:09] [INFO ] Deduced a trap composed of 164 places in 235 ms of which 3 ms to minimize.
[2024-05-31 08:09:10] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 2 ms to minimize.
[2024-05-31 08:09:10] [INFO ] Deduced a trap composed of 166 places in 195 ms of which 2 ms to minimize.
[2024-05-31 08:09:10] [INFO ] Deduced a trap composed of 164 places in 170 ms of which 2 ms to minimize.
[2024-05-31 08:09:10] [INFO ] Deduced a trap composed of 164 places in 176 ms of which 2 ms to minimize.
[2024-05-31 08:09:10] [INFO ] Deduced a trap composed of 166 places in 333 ms of which 2 ms to minimize.
[2024-05-31 08:09:11] [INFO ] Deduced a trap composed of 160 places in 353 ms of which 2 ms to minimize.
[2024-05-31 08:09:11] [INFO ] Deduced a trap composed of 158 places in 226 ms of which 2 ms to minimize.
[2024-05-31 08:09:11] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 3 ms to minimize.
SMT process timed out in 5727ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 19 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Running 970 sub problems to find dead transitions.
[2024-05-31 08:09:11] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2024-05-31 08:09:11] [INFO ] Invariant cache hit.
[2024-05-31 08:09:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 970 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-05-31 08:09:25] [INFO ] Deduced a trap composed of 111 places in 215 ms of which 2 ms to minimize.
[2024-05-31 08:09:25] [INFO ] Deduced a trap composed of 111 places in 310 ms of which 3 ms to minimize.
[2024-05-31 08:09:26] [INFO ] Deduced a trap composed of 116 places in 238 ms of which 2 ms to minimize.
[2024-05-31 08:09:26] [INFO ] Deduced a trap composed of 121 places in 319 ms of which 3 ms to minimize.
[2024-05-31 08:09:26] [INFO ] Deduced a trap composed of 111 places in 208 ms of which 3 ms to minimize.
[2024-05-31 08:09:27] [INFO ] Deduced a trap composed of 111 places in 202 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 970 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/1382 variables, and 58 constraints, problems are : Problem set: 0 solved, 970 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 970/970 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 970 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 970 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 970 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-05-31 08:09:37] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 1 ms to minimize.
[2024-05-31 08:09:38] [INFO ] Deduced a trap composed of 171 places in 282 ms of which 3 ms to minimize.
[2024-05-31 08:09:38] [INFO ] Deduced a trap composed of 115 places in 261 ms of which 3 ms to minimize.
[2024-05-31 08:09:39] [INFO ] Deduced a trap composed of 107 places in 245 ms of which 2 ms to minimize.
[2024-05-31 08:09:39] [INFO ] Deduced a trap composed of 127 places in 221 ms of which 2 ms to minimize.
[2024-05-31 08:09:39] [INFO ] Deduced a trap composed of 107 places in 215 ms of which 2 ms to minimize.
[2024-05-31 08:09:39] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 2 ms to minimize.
[2024-05-31 08:09:40] [INFO ] Deduced a trap composed of 125 places in 220 ms of which 2 ms to minimize.
[2024-05-31 08:09:40] [INFO ] Deduced a trap composed of 130 places in 219 ms of which 3 ms to minimize.
[2024-05-31 08:09:40] [INFO ] Deduced a trap composed of 115 places in 317 ms of which 2 ms to minimize.
[2024-05-31 08:09:40] [INFO ] Deduced a trap composed of 171 places in 343 ms of which 3 ms to minimize.
[2024-05-31 08:09:41] [INFO ] Deduced a trap composed of 115 places in 313 ms of which 3 ms to minimize.
[2024-05-31 08:09:41] [INFO ] Deduced a trap composed of 120 places in 363 ms of which 3 ms to minimize.
[2024-05-31 08:09:41] [INFO ] Deduced a trap composed of 121 places in 330 ms of which 2 ms to minimize.
[2024-05-31 08:09:42] [INFO ] Deduced a trap composed of 116 places in 354 ms of which 2 ms to minimize.
[2024-05-31 08:09:42] [INFO ] Deduced a trap composed of 116 places in 395 ms of which 3 ms to minimize.
[2024-05-31 08:09:43] [INFO ] Deduced a trap composed of 130 places in 271 ms of which 3 ms to minimize.
[2024-05-31 08:09:43] [INFO ] Deduced a trap composed of 135 places in 264 ms of which 3 ms to minimize.
[2024-05-31 08:09:43] [INFO ] Deduced a trap composed of 121 places in 380 ms of which 3 ms to minimize.
[2024-05-31 08:09:44] [INFO ] Deduced a trap composed of 140 places in 343 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-05-31 08:09:45] [INFO ] Deduced a trap composed of 110 places in 262 ms of which 3 ms to minimize.
[2024-05-31 08:09:45] [INFO ] Deduced a trap composed of 115 places in 212 ms of which 3 ms to minimize.
[2024-05-31 08:09:45] [INFO ] Deduced a trap composed of 115 places in 296 ms of which 2 ms to minimize.
[2024-05-31 08:09:45] [INFO ] Deduced a trap composed of 175 places in 256 ms of which 3 ms to minimize.
[2024-05-31 08:09:46] [INFO ] Deduced a trap composed of 101 places in 255 ms of which 2 ms to minimize.
[2024-05-31 08:09:46] [INFO ] Deduced a trap composed of 105 places in 249 ms of which 2 ms to minimize.
[2024-05-31 08:09:46] [INFO ] Deduced a trap composed of 106 places in 224 ms of which 2 ms to minimize.
[2024-05-31 08:09:47] [INFO ] Deduced a trap composed of 110 places in 291 ms of which 2 ms to minimize.
[2024-05-31 08:09:47] [INFO ] Deduced a trap composed of 135 places in 214 ms of which 2 ms to minimize.
[2024-05-31 08:09:47] [INFO ] Deduced a trap composed of 135 places in 217 ms of which 2 ms to minimize.
[2024-05-31 08:09:47] [INFO ] Deduced a trap composed of 115 places in 221 ms of which 2 ms to minimize.
[2024-05-31 08:09:47] [INFO ] Deduced a trap composed of 125 places in 217 ms of which 2 ms to minimize.
[2024-05-31 08:09:48] [INFO ] Deduced a trap composed of 110 places in 238 ms of which 2 ms to minimize.
[2024-05-31 08:09:48] [INFO ] Deduced a trap composed of 131 places in 228 ms of which 2 ms to minimize.
[2024-05-31 08:09:48] [INFO ] Deduced a trap composed of 126 places in 218 ms of which 2 ms to minimize.
[2024-05-31 08:09:48] [INFO ] Deduced a trap composed of 140 places in 218 ms of which 2 ms to minimize.
[2024-05-31 08:09:49] [INFO ] Deduced a trap composed of 140 places in 217 ms of which 2 ms to minimize.
[2024-05-31 08:09:49] [INFO ] Deduced a trap composed of 121 places in 219 ms of which 2 ms to minimize.
[2024-05-31 08:09:49] [INFO ] Deduced a trap composed of 131 places in 220 ms of which 2 ms to minimize.
[2024-05-31 08:09:49] [INFO ] Deduced a trap composed of 130 places in 218 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-05-31 08:09:51] [INFO ] Deduced a trap composed of 130 places in 264 ms of which 3 ms to minimize.
[2024-05-31 08:09:51] [INFO ] Deduced a trap composed of 141 places in 270 ms of which 3 ms to minimize.
[2024-05-31 08:09:51] [INFO ] Deduced a trap composed of 140 places in 259 ms of which 3 ms to minimize.
[2024-05-31 08:09:52] [INFO ] Deduced a trap composed of 126 places in 261 ms of which 2 ms to minimize.
[2024-05-31 08:09:52] [INFO ] Deduced a trap composed of 135 places in 264 ms of which 3 ms to minimize.
[2024-05-31 08:09:52] [INFO ] Deduced a trap composed of 140 places in 290 ms of which 29 ms to minimize.
[2024-05-31 08:09:53] [INFO ] Deduced a trap composed of 145 places in 1039 ms of which 54 ms to minimize.
[2024-05-31 08:09:54] [INFO ] Deduced a trap composed of 150 places in 561 ms of which 35 ms to minimize.
[2024-05-31 08:09:55] [INFO ] Deduced a trap composed of 145 places in 598 ms of which 32 ms to minimize.
[2024-05-31 08:09:56] [INFO ] Deduced a trap composed of 145 places in 993 ms of which 8 ms to minimize.
[2024-05-31 08:10:02] [INFO ] Deduced a trap composed of 111 places in 5984 ms of which 839 ms to minimize.
SMT process timed out in 50344ms, After SMT, problems are : Problem set: 0 solved, 970 unsolved
Search for dead transitions found 0 dead transitions in 50362ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50390 ms. Remains : 410/410 places, 981/981 transitions.
RANDOM walk for 40000 steps (2853 resets) in 690 ms. (57 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (379 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 309519 steps, run timeout after 3034 ms. (steps per millisecond=102 ) properties seen :0 out of 1
Probabilistic random walk after 309519 steps, saw 50313 distinct states, run finished after 3162 ms. (steps per millisecond=97 ) properties seen :0
[2024-05-31 08:10:08] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2024-05-31 08:10:08] [INFO ] Invariant cache hit.
[2024-05-31 08:10:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/399 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/408 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
ITS-tools command line returned an error code 137
[2024-05-31 08:10:21] [INFO ] Deduced a trap composed of 164 places in 328 ms of which 8 ms to minimize.
[2024-05-31 08:10:21] [INFO ] Deduced a trap composed of 166 places in 247 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/408 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 1/409 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/409 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 972/1381 variables, 409/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1381 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1381 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/1382 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1382 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1382 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1382/1382 variables, and 475 constraints, problems are : Problem set: 0 solved, 1 unsolved in 12516 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 410/410 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/399 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/408 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 08:10:22] [INFO ] Deduced a trap composed of 164 places in 289 ms of which 3 ms to minimize.
[2024-05-31 08:10:22] [INFO ] Deduced a trap composed of 162 places in 283 ms of which 3 ms to minimize.
[2024-05-31 08:10:22] [INFO ] Deduced a trap composed of 162 places in 314 ms of which 4 ms to minimize.
[2024-05-31 08:10:23] [INFO ] Deduced a trap composed of 164 places in 292 ms of which 3 ms to minimize.
[2024-05-31 08:10:23] [INFO ] Deduced a trap composed of 162 places in 245 ms of which 2 ms to minimize.
[2024-05-31 08:10:23] [INFO ] Deduced a trap composed of 164 places in 396 ms of which 2 ms to minimize.
[2024-05-31 08:10:24] [INFO ] Deduced a trap composed of 164 places in 277 ms of which 3 ms to minimize.
[2024-05-31 08:10:24] [INFO ] Deduced a trap composed of 160 places in 312 ms of which 3 ms to minimize.
[2024-05-31 08:10:24] [INFO ] Deduced a trap composed of 160 places in 401 ms of which 4 ms to minimize.
[2024-05-31 08:10:25] [INFO ] Deduced a trap composed of 162 places in 360 ms of which 3 ms to minimize.
[2024-05-31 08:10:25] [INFO ] Deduced a trap composed of 154 places in 264 ms of which 3 ms to minimize.
[2024-05-31 08:10:25] [INFO ] Deduced a trap composed of 160 places in 297 ms of which 3 ms to minimize.
[2024-05-31 08:10:26] [INFO ] Deduced a trap composed of 158 places in 282 ms of which 3 ms to minimize.
[2024-05-31 08:10:26] [INFO ] Deduced a trap composed of 158 places in 400 ms of which 3 ms to minimize.
[2024-05-31 08:10:26] [INFO ] Deduced a trap composed of 156 places in 303 ms of which 3 ms to minimize.
[2024-05-31 08:10:27] [INFO ] Deduced a trap composed of 166 places in 317 ms of which 3 ms to minimize.
[2024-05-31 08:10:27] [INFO ] Deduced a trap composed of 166 places in 277 ms of which 3 ms to minimize.
[2024-05-31 08:10:27] [INFO ] Deduced a trap composed of 160 places in 288 ms of which 5 ms to minimize.
[2024-05-31 08:10:28] [INFO ] Deduced a trap composed of 154 places in 255 ms of which 3 ms to minimize.
[2024-05-31 08:10:28] [INFO ] Deduced a trap composed of 160 places in 303 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/408 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 08:10:28] [INFO ] Deduced a trap composed of 166 places in 247 ms of which 3 ms to minimize.
[2024-05-31 08:10:29] [INFO ] Deduced a trap composed of 166 places in 316 ms of which 3 ms to minimize.
[2024-05-31 08:10:29] [INFO ] Deduced a trap composed of 160 places in 180 ms of which 2 ms to minimize.
[2024-05-31 08:10:29] [INFO ] Deduced a trap composed of 168 places in 187 ms of which 2 ms to minimize.
[2024-05-31 08:10:29] [INFO ] Deduced a trap composed of 164 places in 245 ms of which 2 ms to minimize.
[2024-05-31 08:10:29] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 2 ms to minimize.
[2024-05-31 08:10:30] [INFO ] Deduced a trap composed of 164 places in 215 ms of which 2 ms to minimize.
[2024-05-31 08:10:30] [INFO ] Deduced a trap composed of 162 places in 249 ms of which 2 ms to minimize.
[2024-05-31 08:10:30] [INFO ] Deduced a trap composed of 160 places in 293 ms of which 3 ms to minimize.
[2024-05-31 08:10:31] [INFO ] Deduced a trap composed of 158 places in 303 ms of which 3 ms to minimize.
[2024-05-31 08:10:31] [INFO ] Deduced a trap composed of 164 places in 292 ms of which 2 ms to minimize.
[2024-05-31 08:10:31] [INFO ] Deduced a trap composed of 164 places in 255 ms of which 2 ms to minimize.
[2024-05-31 08:10:32] [INFO ] Deduced a trap composed of 162 places in 258 ms of which 2 ms to minimize.
[2024-05-31 08:10:32] [INFO ] Deduced a trap composed of 160 places in 233 ms of which 3 ms to minimize.
[2024-05-31 08:10:32] [INFO ] Deduced a trap composed of 162 places in 272 ms of which 2 ms to minimize.
[2024-05-31 08:10:32] [INFO ] Deduced a trap composed of 158 places in 246 ms of which 3 ms to minimize.
[2024-05-31 08:10:33] [INFO ] Deduced a trap composed of 168 places in 260 ms of which 3 ms to minimize.
[2024-05-31 08:10:33] [INFO ] Deduced a trap composed of 160 places in 240 ms of which 3 ms to minimize.
[2024-05-31 08:10:33] [INFO ] Deduced a trap composed of 162 places in 232 ms of which 2 ms to minimize.
[2024-05-31 08:10:33] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 08:10:34] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 2 ms to minimize.
[2024-05-31 08:10:34] [INFO ] Deduced a trap composed of 168 places in 285 ms of which 2 ms to minimize.
[2024-05-31 08:10:34] [INFO ] Deduced a trap composed of 164 places in 301 ms of which 2 ms to minimize.
[2024-05-31 08:10:35] [INFO ] Deduced a trap composed of 164 places in 255 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 408/1382 variables, and 107 constraints, problems are : Problem set: 0 solved, 1 unsolved in 17818 ms.
Refiners :[Positive P Invariants (semi-flows): 54/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 46/46 constraints]
After SMT, in 31638ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 62 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 49 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2024-05-31 08:10:39] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2024-05-31 08:10:39] [INFO ] Invariant cache hit.
[2024-05-31 08:10:40] [INFO ] Implicit Places using invariants in 463 ms returned []
[2024-05-31 08:10:40] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2024-05-31 08:10:40] [INFO ] Invariant cache hit.
[2024-05-31 08:10:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 08:10:42] [INFO ] Implicit Places using invariants and state equation in 1932 ms returned []
Implicit Place search using SMT with State Equation took 2398 ms to find 0 implicit places.
[2024-05-31 08:10:42] [INFO ] Redundant transitions in 17 ms returned []
Running 970 sub problems to find dead transitions.
[2024-05-31 08:10:42] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2024-05-31 08:10:42] [INFO ] Invariant cache hit.
[2024-05-31 08:10:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 970 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-05-31 08:10:53] [INFO ] Deduced a trap composed of 111 places in 193 ms of which 3 ms to minimize.
[2024-05-31 08:10:53] [INFO ] Deduced a trap composed of 111 places in 197 ms of which 3 ms to minimize.
[2024-05-31 08:10:53] [INFO ] Deduced a trap composed of 116 places in 192 ms of which 3 ms to minimize.
[2024-05-31 08:10:53] [INFO ] Deduced a trap composed of 121 places in 193 ms of which 2 ms to minimize.
[2024-05-31 08:10:54] [INFO ] Deduced a trap composed of 111 places in 179 ms of which 2 ms to minimize.
[2024-05-31 08:10:54] [INFO ] Deduced a trap composed of 111 places in 169 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-05-31 08:11:03] [INFO ] Deduced a trap composed of 13 places in 275 ms of which 3 ms to minimize.
[2024-05-31 08:11:05] [INFO ] Deduced a trap composed of 166 places in 246 ms of which 3 ms to minimize.
[2024-05-31 08:11:05] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 2 ms to minimize.
[2024-05-31 08:11:05] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 3 ms to minimize.
[2024-05-31 08:11:05] [INFO ] Deduced a trap composed of 171 places in 199 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-05-31 08:11:11] [INFO ] Deduced a trap composed of 126 places in 244 ms of which 3 ms to minimize.
[2024-05-31 08:11:12] [INFO ] Deduced a trap composed of 131 places in 215 ms of which 3 ms to minimize.
[2024-05-31 08:11:12] [INFO ] Deduced a trap composed of 136 places in 189 ms of which 2 ms to minimize.
[2024-05-31 08:11:12] [INFO ] Deduced a trap composed of 126 places in 248 ms of which 3 ms to minimize.
[2024-05-31 08:11:12] [INFO ] Deduced a trap composed of 131 places in 190 ms of which 3 ms to minimize.
[2024-05-31 08:11:13] [INFO ] Deduced a trap composed of 126 places in 189 ms of which 3 ms to minimize.
[2024-05-31 08:11:13] [INFO ] Deduced a trap composed of 131 places in 193 ms of which 3 ms to minimize.
[2024-05-31 08:11:13] [INFO ] Deduced a trap composed of 131 places in 221 ms of which 3 ms to minimize.
[2024-05-31 08:11:13] [INFO ] Deduced a trap composed of 131 places in 190 ms of which 3 ms to minimize.
[2024-05-31 08:11:13] [INFO ] Deduced a trap composed of 126 places in 182 ms of which 3 ms to minimize.
[2024-05-31 08:11:14] [INFO ] Deduced a trap composed of 126 places in 271 ms of which 3 ms to minimize.
[2024-05-31 08:11:14] [INFO ] Deduced a trap composed of 126 places in 256 ms of which 3 ms to minimize.
[2024-05-31 08:11:14] [INFO ] Deduced a trap composed of 126 places in 200 ms of which 3 ms to minimize.
[2024-05-31 08:11:14] [INFO ] Deduced a trap composed of 126 places in 198 ms of which 2 ms to minimize.
[2024-05-31 08:11:15] [INFO ] Deduced a trap composed of 136 places in 188 ms of which 2 ms to minimize.
[2024-05-31 08:11:15] [INFO ] Deduced a trap composed of 131 places in 256 ms of which 3 ms to minimize.
[2024-05-31 08:11:15] [INFO ] Deduced a trap composed of 131 places in 213 ms of which 3 ms to minimize.
[2024-05-31 08:11:15] [INFO ] Deduced a trap composed of 131 places in 210 ms of which 3 ms to minimize.
[2024-05-31 08:11:16] [INFO ] Deduced a trap composed of 126 places in 182 ms of which 3 ms to minimize.
[2024-05-31 08:11:16] [INFO ] Deduced a trap composed of 121 places in 248 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 970 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/1382 variables, and 83 constraints, problems are : Problem set: 0 solved, 970 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 970/970 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 970 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 970 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 970 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 31/83 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-05-31 08:11:18] [INFO ] Deduced a trap composed of 18 places in 294 ms of which 1 ms to minimize.
[2024-05-31 08:11:19] [INFO ] Deduced a trap composed of 101 places in 391 ms of which 3 ms to minimize.
[2024-05-31 08:11:20] [INFO ] Deduced a trap composed of 115 places in 345 ms of which 3 ms to minimize.
[2024-05-31 08:11:20] [INFO ] Deduced a trap composed of 117 places in 397 ms of which 3 ms to minimize.
[2024-05-31 08:11:20] [INFO ] Deduced a trap composed of 130 places in 343 ms of which 3 ms to minimize.
[2024-05-31 08:11:21] [INFO ] Deduced a trap composed of 111 places in 361 ms of which 3 ms to minimize.
[2024-05-31 08:11:21] [INFO ] Deduced a trap composed of 106 places in 380 ms of which 3 ms to minimize.
[2024-05-31 08:11:22] [INFO ] Deduced a trap composed of 106 places in 254 ms of which 2 ms to minimize.
[2024-05-31 08:11:22] [INFO ] Deduced a trap composed of 101 places in 263 ms of which 2 ms to minimize.
[2024-05-31 08:11:22] [INFO ] Deduced a trap composed of 120 places in 243 ms of which 2 ms to minimize.
[2024-05-31 08:11:22] [INFO ] Deduced a trap composed of 111 places in 233 ms of which 2 ms to minimize.
[2024-05-31 08:11:23] [INFO ] Deduced a trap composed of 115 places in 230 ms of which 1 ms to minimize.
[2024-05-31 08:11:23] [INFO ] Deduced a trap composed of 106 places in 258 ms of which 2 ms to minimize.
[2024-05-31 08:11:23] [INFO ] Deduced a trap composed of 111 places in 228 ms of which 2 ms to minimize.
[2024-05-31 08:11:23] [INFO ] Deduced a trap composed of 135 places in 247 ms of which 2 ms to minimize.
[2024-05-31 08:11:24] [INFO ] Deduced a trap composed of 131 places in 218 ms of which 2 ms to minimize.
[2024-05-31 08:11:24] [INFO ] Deduced a trap composed of 121 places in 257 ms of which 2 ms to minimize.
[2024-05-31 08:11:24] [INFO ] Deduced a trap composed of 116 places in 232 ms of which 2 ms to minimize.
[2024-05-31 08:11:24] [INFO ] Deduced a trap composed of 116 places in 229 ms of which 2 ms to minimize.
[2024-05-31 08:11:25] [INFO ] Deduced a trap composed of 150 places in 246 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-05-31 08:11:26] [INFO ] Deduced a trap composed of 116 places in 304 ms of which 3 ms to minimize.
[2024-05-31 08:11:27] [INFO ] Deduced a trap composed of 125 places in 393 ms of which 3 ms to minimize.
[2024-05-31 08:11:27] [INFO ] Deduced a trap composed of 126 places in 328 ms of which 3 ms to minimize.
[2024-05-31 08:11:27] [INFO ] Deduced a trap composed of 125 places in 329 ms of which 4 ms to minimize.
[2024-05-31 08:11:28] [INFO ] Deduced a trap composed of 126 places in 265 ms of which 3 ms to minimize.
[2024-05-31 08:11:28] [INFO ] Deduced a trap composed of 130 places in 309 ms of which 3 ms to minimize.
[2024-05-31 08:11:28] [INFO ] Deduced a trap composed of 136 places in 283 ms of which 2 ms to minimize.
[2024-05-31 08:11:29] [INFO ] Deduced a trap composed of 121 places in 259 ms of which 2 ms to minimize.
[2024-05-31 08:11:29] [INFO ] Deduced a trap composed of 125 places in 247 ms of which 2 ms to minimize.
[2024-05-31 08:11:29] [INFO ] Deduced a trap composed of 136 places in 286 ms of which 2 ms to minimize.
[2024-05-31 08:11:30] [INFO ] Deduced a trap composed of 120 places in 278 ms of which 2 ms to minimize.
[2024-05-31 08:11:30] [INFO ] Deduced a trap composed of 130 places in 236 ms of which 2 ms to minimize.
[2024-05-31 08:11:30] [INFO ] Deduced a trap composed of 121 places in 340 ms of which 2 ms to minimize.
[2024-05-31 08:11:31] [INFO ] Deduced a trap composed of 125 places in 390 ms of which 3 ms to minimize.
[2024-05-31 08:11:33] [INFO ] Deduced a trap composed of 116 places in 2812 ms of which 3 ms to minimize.
[2024-05-31 08:11:34] [INFO ] Deduced a trap composed of 111 places in 298 ms of which 3 ms to minimize.
[2024-05-31 08:11:34] [INFO ] Deduced a trap composed of 125 places in 316 ms of which 3 ms to minimize.
[2024-05-31 08:11:34] [INFO ] Deduced a trap composed of 130 places in 354 ms of which 2 ms to minimize.
[2024-05-31 08:11:35] [INFO ] Deduced a trap composed of 130 places in 331 ms of which 3 ms to minimize.
[2024-05-31 08:11:35] [INFO ] Deduced a trap composed of 130 places in 322 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-05-31 08:11:37] [INFO ] Deduced a trap composed of 121 places in 377 ms of which 3 ms to minimize.
[2024-05-31 08:11:38] [INFO ] Deduced a trap composed of 121 places in 362 ms of which 3 ms to minimize.
[2024-05-31 08:11:38] [INFO ] Deduced a trap composed of 121 places in 323 ms of which 3 ms to minimize.
[2024-05-31 08:11:38] [INFO ] Deduced a trap composed of 106 places in 281 ms of which 3 ms to minimize.
[2024-05-31 08:11:39] [INFO ] Deduced a trap composed of 122 places in 440 ms of which 3 ms to minimize.
[2024-05-31 08:11:39] [INFO ] Deduced a trap composed of 120 places in 364 ms of which 3 ms to minimize.
[2024-05-31 08:11:40] [INFO ] Deduced a trap composed of 111 places in 363 ms of which 4 ms to minimize.
[2024-05-31 08:11:40] [INFO ] Deduced a trap composed of 125 places in 327 ms of which 3 ms to minimize.
[2024-05-31 08:11:40] [INFO ] Deduced a trap composed of 126 places in 349 ms of which 2 ms to minimize.
[2024-05-31 08:11:41] [INFO ] Deduced a trap composed of 125 places in 343 ms of which 2 ms to minimize.
[2024-05-31 08:11:41] [INFO ] Deduced a trap composed of 106 places in 346 ms of which 3 ms to minimize.
[2024-05-31 08:11:41] [INFO ] Deduced a trap composed of 111 places in 342 ms of which 2 ms to minimize.
[2024-05-31 08:11:42] [INFO ] Deduced a trap composed of 120 places in 349 ms of which 3 ms to minimize.
[2024-05-31 08:11:42] [INFO ] Deduced a trap composed of 125 places in 315 ms of which 7 ms to minimize.
[2024-05-31 08:11:42] [INFO ] Deduced a trap composed of 125 places in 384 ms of which 3 ms to minimize.
[2024-05-31 08:11:43] [INFO ] Deduced a trap composed of 125 places in 319 ms of which 3 ms to minimize.
[2024-05-31 08:11:43] [INFO ] Deduced a trap composed of 120 places in 311 ms of which 2 ms to minimize.
[2024-05-31 08:11:44] [INFO ] Deduced a trap composed of 106 places in 373 ms of which 3 ms to minimize.
[2024-05-31 08:11:44] [INFO ] Deduced a trap composed of 111 places in 547 ms of which 3 ms to minimize.
[2024-05-31 08:11:45] [INFO ] Deduced a trap composed of 111 places in 451 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-05-31 08:11:46] [INFO ] Deduced a trap composed of 154 places in 526 ms of which 3 ms to minimize.
[2024-05-31 08:11:47] [INFO ] Deduced a trap composed of 162 places in 357 ms of which 2 ms to minimize.
SMT process timed out in 64965ms, After SMT, problems are : Problem set: 0 solved, 970 unsolved
Search for dead transitions found 0 dead transitions in 64982ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67455 ms. Remains : 410/410 places, 981/981 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 410 transition count 972
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 410 transition count 971
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 409 transition count 971
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 409 transition count 970
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 408 transition count 970
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 408 transition count 960
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 398 transition count 960
Applied a total of 33 rules in 119 ms. Remains 398 /410 variables (removed 12) and now considering 960/981 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 960 rows 398 cols
[2024-05-31 08:11:47] [INFO ] Computed 62 invariants in 9 ms
[2024-05-31 08:11:47] [INFO ] [Real]Absence check using 55 positive place invariants in 12 ms returned sat
[2024-05-31 08:11:47] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 20 ms returned sat
[2024-05-31 08:11:47] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 08:11:47] [INFO ] [Nat]Absence check using 55 positive place invariants in 14 ms returned sat
[2024-05-31 08:11:47] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 10 ms returned sat
[2024-05-31 08:11:47] [INFO ] After 251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 08:11:48] [INFO ] Deduced a trap composed of 164 places in 252 ms of which 3 ms to minimize.
[2024-05-31 08:11:48] [INFO ] Deduced a trap composed of 162 places in 301 ms of which 2 ms to minimize.
[2024-05-31 08:11:48] [INFO ] Deduced a trap composed of 164 places in 285 ms of which 2 ms to minimize.
[2024-05-31 08:11:49] [INFO ] Deduced a trap composed of 158 places in 301 ms of which 2 ms to minimize.
[2024-05-31 08:11:49] [INFO ] Deduced a trap composed of 154 places in 319 ms of which 2 ms to minimize.
[2024-05-31 08:11:50] [INFO ] Deduced a trap composed of 156 places in 343 ms of which 2 ms to minimize.
[2024-05-31 08:11:50] [INFO ] Deduced a trap composed of 158 places in 292 ms of which 3 ms to minimize.
[2024-05-31 08:11:50] [INFO ] Deduced a trap composed of 158 places in 270 ms of which 2 ms to minimize.
[2024-05-31 08:11:51] [INFO ] Deduced a trap composed of 158 places in 280 ms of which 2 ms to minimize.
[2024-05-31 08:11:51] [INFO ] Deduced a trap composed of 156 places in 273 ms of which 2 ms to minimize.
[2024-05-31 08:11:51] [INFO ] Deduced a trap composed of 160 places in 314 ms of which 2 ms to minimize.
[2024-05-31 08:11:52] [INFO ] Deduced a trap composed of 156 places in 391 ms of which 2 ms to minimize.
[2024-05-31 08:11:52] [INFO ] Deduced a trap composed of 163 places in 314 ms of which 2 ms to minimize.
[2024-05-31 08:11:52] [INFO ] Deduced a trap composed of 156 places in 285 ms of which 2 ms to minimize.
[2024-05-31 08:11:53] [INFO ] Deduced a trap composed of 169 places in 273 ms of which 3 ms to minimize.
[2024-05-31 08:11:53] [INFO ] Deduced a trap composed of 156 places in 286 ms of which 2 ms to minimize.
[2024-05-31 08:11:53] [INFO ] Deduced a trap composed of 169 places in 318 ms of which 2 ms to minimize.
[2024-05-31 08:11:54] [INFO ] Deduced a trap composed of 163 places in 266 ms of which 3 ms to minimize.
[2024-05-31 08:11:54] [INFO ] Deduced a trap composed of 162 places in 308 ms of which 2 ms to minimize.
[2024-05-31 08:11:54] [INFO ] Deduced a trap composed of 158 places in 280 ms of which 2 ms to minimize.
[2024-05-31 08:11:55] [INFO ] Deduced a trap composed of 164 places in 266 ms of which 3 ms to minimize.
[2024-05-31 08:11:55] [INFO ] Deduced a trap composed of 158 places in 279 ms of which 2 ms to minimize.
[2024-05-31 08:11:55] [INFO ] Deduced a trap composed of 158 places in 279 ms of which 2 ms to minimize.
[2024-05-31 08:11:56] [INFO ] Deduced a trap composed of 162 places in 283 ms of which 3 ms to minimize.
[2024-05-31 08:11:56] [INFO ] Deduced a trap composed of 164 places in 274 ms of which 2 ms to minimize.
[2024-05-31 08:11:56] [INFO ] Deduced a trap composed of 164 places in 290 ms of which 2 ms to minimize.
[2024-05-31 08:11:57] [INFO ] Deduced a trap composed of 164 places in 313 ms of which 2 ms to minimize.
[2024-05-31 08:11:57] [INFO ] Deduced a trap composed of 158 places in 307 ms of which 2 ms to minimize.
[2024-05-31 08:11:57] [INFO ] Deduced a trap composed of 164 places in 316 ms of which 2 ms to minimize.
[2024-05-31 08:11:58] [INFO ] Deduced a trap composed of 164 places in 266 ms of which 3 ms to minimize.
[2024-05-31 08:11:58] [INFO ] Deduced a trap composed of 156 places in 266 ms of which 2 ms to minimize.
[2024-05-31 08:11:58] [INFO ] Deduced a trap composed of 154 places in 265 ms of which 2 ms to minimize.
[2024-05-31 08:11:59] [INFO ] Deduced a trap composed of 154 places in 269 ms of which 2 ms to minimize.
[2024-05-31 08:11:59] [INFO ] Deduced a trap composed of 162 places in 350 ms of which 2 ms to minimize.
[2024-05-31 08:12:00] [INFO ] Deduced a trap composed of 160 places in 376 ms of which 2 ms to minimize.
[2024-05-31 08:12:00] [INFO ] Deduced a trap composed of 152 places in 264 ms of which 2 ms to minimize.
[2024-05-31 08:12:00] [INFO ] Deduced a trap composed of 162 places in 308 ms of which 2 ms to minimize.
[2024-05-31 08:12:02] [INFO ] Deduced a trap composed of 160 places in 500 ms of which 3 ms to minimize.
[2024-05-31 08:12:02] [INFO ] Deduced a trap composed of 166 places in 426 ms of which 4 ms to minimize.
[2024-05-31 08:12:03] [INFO ] Deduced a trap composed of 162 places in 457 ms of which 3 ms to minimize.
[2024-05-31 08:12:03] [INFO ] Deduced a trap composed of 160 places in 349 ms of which 3 ms to minimize.
[2024-05-31 08:12:04] [INFO ] Deduced a trap composed of 160 places in 447 ms of which 3 ms to minimize.
[2024-05-31 08:12:04] [INFO ] Deduced a trap composed of 158 places in 306 ms of which 2 ms to minimize.
[2024-05-31 08:12:04] [INFO ] Deduced a trap composed of 158 places in 266 ms of which 2 ms to minimize.
[2024-05-31 08:12:05] [INFO ] Deduced a trap composed of 160 places in 290 ms of which 2 ms to minimize.
[2024-05-31 08:12:05] [INFO ] Deduced a trap composed of 158 places in 305 ms of which 2 ms to minimize.
[2024-05-31 08:12:05] [INFO ] Deduced a trap composed of 169 places in 275 ms of which 2 ms to minimize.
[2024-05-31 08:12:06] [INFO ] Deduced a trap composed of 162 places in 286 ms of which 4 ms to minimize.
[2024-05-31 08:12:06] [INFO ] Deduced a trap composed of 166 places in 288 ms of which 2 ms to minimize.
[2024-05-31 08:12:06] [INFO ] Deduced a trap composed of 166 places in 311 ms of which 2 ms to minimize.
[2024-05-31 08:12:07] [INFO ] Deduced a trap composed of 164 places in 282 ms of which 2 ms to minimize.
[2024-05-31 08:12:07] [INFO ] Deduced a trap composed of 162 places in 262 ms of which 2 ms to minimize.
[2024-05-31 08:12:07] [INFO ] Deduced a trap composed of 162 places in 242 ms of which 2 ms to minimize.
[2024-05-31 08:12:08] [INFO ] Deduced a trap composed of 172 places in 372 ms of which 28 ms to minimize.
[2024-05-31 08:12:08] [INFO ] Deduced a trap composed of 175 places in 266 ms of which 2 ms to minimize.
[2024-05-31 08:12:08] [INFO ] Deduced a trap composed of 156 places in 275 ms of which 2 ms to minimize.
[2024-05-31 08:12:09] [INFO ] Deduced a trap composed of 158 places in 266 ms of which 2 ms to minimize.
[2024-05-31 08:12:09] [INFO ] Deduced a trap composed of 154 places in 267 ms of which 2 ms to minimize.
[2024-05-31 08:12:09] [INFO ] Deduced a trap composed of 158 places in 395 ms of which 2 ms to minimize.
[2024-05-31 08:12:10] [INFO ] Deduced a trap composed of 164 places in 294 ms of which 3 ms to minimize.
[2024-05-31 08:12:10] [INFO ] Deduced a trap composed of 156 places in 313 ms of which 3 ms to minimize.
[2024-05-31 08:12:11] [INFO ] Deduced a trap composed of 164 places in 482 ms of which 3 ms to minimize.
[2024-05-31 08:12:12] [INFO ] Deduced a trap composed of 166 places in 444 ms of which 3 ms to minimize.
[2024-05-31 08:19:17] [INFO ] Trap strengthening (SAT) tested/added 63/63 trap constraints in 449653 ms
[2024-05-31 08:19:17] [INFO ] After 449912ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 08:19:17] [INFO ] After 450034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2024-05-31 08:19:17] [INFO ] Flatten gal took : 70 ms
[2024-05-31 08:19:17] [INFO ] Flatten gal took : 68 ms
[2024-05-31 08:19:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5517130111875821302.gal : 22 ms
[2024-05-31 08:19:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17443363345197678693.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5517130111875821302.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17443363345197678693.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality17443363345197678693.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 786
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :786 after 33234
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :33234 after 155980
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :155980 after 445633
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :445633 after 1.77682e+06
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.77682e+06 after 3.47215e+06
Detected timeout of ITS tools.
[2024-05-31 08:19:32] [INFO ] Flatten gal took : 83 ms
[2024-05-31 08:19:32] [INFO ] Applying decomposition
[2024-05-31 08:19:32] [INFO ] Flatten gal took : 60 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6972970253625574683.txt' '-o' '/tmp/graph6972970253625574683.bin' '-w' '/tmp/graph6972970253625574683.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6972970253625574683.bin' '-l' '-1' '-v' '-w' '/tmp/graph6972970253625574683.weights' '-q' '0' '-e' '0.001'
[2024-05-31 08:19:33] [INFO ] Decomposing Gal with order
[2024-05-31 08:19:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 08:19:33] [INFO ] Removed a total of 2314 redundant transitions.
[2024-05-31 08:19:33] [INFO ] Flatten gal took : 123 ms
[2024-05-31 08:19:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 230 labels/synchronizations in 35 ms.
[2024-05-31 08:19:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15250092499261496147.gal : 9 ms
[2024-05-31 08:19:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16865420360534905974.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15250092499261496147.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16865420360534905974.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality16865420360534905974.prop.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 481267 ms.
[2024-05-31 08:19:48] [INFO ] Flatten gal took : 85 ms
[2024-05-31 08:19:48] [INFO ] Flatten gal took : 61 ms
[2024-05-31 08:19:48] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability12256926084225201506.gal : 9 ms
[2024-05-31 08:19:48] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9411786704943417451.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability12256926084225201506.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability9411786704943417451.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityFireability9411786704943417451.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 128
Detected timeout of ITS tools.
[2024-05-31 08:19:51] [INFO ] Flatten gal took : 41 ms
[2024-05-31 08:19:51] [INFO ] Applying decomposition
[2024-05-31 08:19:51] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16057606564671768831.txt' '-o' '/tmp/graph16057606564671768831.bin' '-w' '/tmp/graph16057606564671768831.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16057606564671768831.bin' '-l' '-1' '-v' '-w' '/tmp/graph16057606564671768831.weights' '-q' '0' '-e' '0.001'
[2024-05-31 08:19:51] [INFO ] Decomposing Gal with order
[2024-05-31 08:19:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 08:19:52] [INFO ] Removed a total of 2800 redundant transitions.
[2024-05-31 08:19:52] [INFO ] Flatten gal took : 114 ms
[2024-05-31 08:19:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 145 labels/synchronizations in 31 ms.
[2024-05-31 08:19:52] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability13208300504809275866.gal : 10 ms
[2024-05-31 08:19:52] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability4938149013648195179.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability13208300504809275866.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability4938149013648195179.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability4938149013648195179.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
Detected timeout of ITS tools.
[2024-05-31 08:19:55] [INFO ] Flatten gal took : 56 ms
[2024-05-31 08:19:55] [INFO ] Flatten gal took : 53 ms
[2024-05-31 08:19:55] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability2041964332365235621.gal : 9 ms
[2024-05-31 08:19:55] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9499437120012779879.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability2041964332365235621.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability9499437120012779879.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityFireability9499437120012779879.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 128
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :128 after 1024
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1024 after 2050
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2050 after 2052
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2052 after 2056
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2056 after 2064
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2064 after 2080
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2080 after 2613
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2613 after 77205
Detected timeout of ITS tools.
[2024-05-31 08:20:25] [INFO ] Flatten gal took : 53 ms
[2024-05-31 08:20:25] [INFO ] Applying decomposition
[2024-05-31 08:20:25] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9131146582694032984.txt' '-o' '/tmp/graph9131146582694032984.bin' '-w' '/tmp/graph9131146582694032984.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9131146582694032984.bin' '-l' '-1' '-v' '-w' '/tmp/graph9131146582694032984.weights' '-q' '0' '-e' '0.001'
[2024-05-31 08:20:25] [INFO ] Decomposing Gal with order
[2024-05-31 08:20:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 08:20:25] [INFO ] Removed a total of 2742 redundant transitions.
[2024-05-31 08:20:25] [INFO ] Flatten gal took : 97 ms
[2024-05-31 08:20:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 264 labels/synchronizations in 18 ms.
[2024-05-31 08:20:25] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability3475553132089809078.gal : 22 ms
[2024-05-31 08:20:25] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability1992079096551044587.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability3475553132089809078.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability1992079096551044587.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityFireability1992079096551044587.prop.
Detected timeout of ITS tools.
[2024-05-31 08:20:55] [INFO ] Flatten gal took : 86 ms
[2024-05-31 08:20:56] [INFO ] Flatten gal took : 62 ms
[2024-05-31 08:20:56] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability7950193638296892500.gal : 7 ms
[2024-05-31 08:20:56] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability5978800228232989656.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability7950193638296892500.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability5978800228232989656.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityFireability5978800228232989656.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 128
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :128 after 1024
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1024 after 2050
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2050 after 2052
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2052 after 2056
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2056 after 2064
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2064 after 2080
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2080 after 2613
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2613 after 77205
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :77205 after 356887
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :356887 after 1.14565e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.14565e+06 after 2.94777e+06

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S10J20"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is PolyORBNT-COL-S10J20, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r299-tajo-171654455900252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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