Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.8K Apr 11 14:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 11 14:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 11 14:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 11 14:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 15:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 11 15:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 15:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 11 15:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 32K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716840661646

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-COL-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 20:11:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-27 20:11:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 20:11:03] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-27 20:11:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 20:11:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 630 ms
[2024-05-27 20:11:03] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 170 PT places and 2320.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
[2024-05-27 20:11:03] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions 33 arcs in 5 ms.
[2024-05-27 20:11:04] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 2 formulas.
FORMULA PhilosophersDyn-COL-10-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-10-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40009 steps (2828 resets) in 818 ms. (48 steps per ms) remains 2/28 properties
BEST_FIRST walk for 40000 steps (4000 resets) in 233 ms. (170 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1988 resets) in 159 ms. (250 steps per ms) remains 2/2 properties
// Phase 1: matrix 7 rows 8 cols
[2024-05-27 20:11:04] [INFO ] Computed 3 invariants in 3 ms
[2024-05-27 20:11:04] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 1 (OVERLAPS) 4/7 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/14 variables, 7/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/15 variables, 1/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/15 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 15 constraints, problems are : Problem set: 1 solved, 1 unsolved in 556 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/7 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/14 variables, 7/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/15 variables, 1/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/15 variables, 1/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/15 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/15 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 16 constraints, problems are : Problem set: 1 solved, 1 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 726ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8/8 places, 7/7 transitions.
Applied a total of 0 rules in 23 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-05-27 20:11:05] [INFO ] Invariant cache hit.
[2024-05-27 20:11:05] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 7/15 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 15 constraints, problems are : Problem set: 0 solved, 6 unsolved in 251 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 7/15 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 21 constraints, problems are : Problem set: 0 solved, 6 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 436ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 437ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 492 ms. Remains : 8/8 places, 7/7 transitions.
RANDOM walk for 40009 steps (2847 resets) in 190 ms. (209 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (2012 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
Probably explored full state space saw : 504 states, properties seen :0
Probabilistic random walk after 1609 steps, saw 504 distinct states, run finished after 30 ms. (steps per millisecond=53 ) properties seen :0
Explored full state space saw : 504 states, properties seen :0
Exhaustive walk after 1609 steps, saw 504 distinct states, run finished after 5 ms. (steps per millisecond=321 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA PhilosophersDyn-COL-10-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 20:11:06] [INFO ] Flatten gal took : 19 ms
[2024-05-27 20:11:06] [INFO ] Flatten gal took : 3 ms
Domain [Philosopher(10), Philosopher(10)] of place Neighbourhood breaks symmetries in sort Philosopher
[2024-05-27 20:11:06] [INFO ] Unfolded HLPN to a Petri net with 170 places and 2310 transitions 18190 arcs in 92 ms.
[2024-05-27 20:11:06] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
Support contains 170 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 2265/2265 transitions.
Applied a total of 0 rules in 34 ms. Remains 170 /170 variables (removed 0) and now considering 2265/2265 (removed 0) transitions.
Running 2220 sub problems to find dead transitions.
[2024-05-27 20:11:06] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2024-05-27 20:11:06] [INFO ] Computed 39 invariants in 75 ms
[2024-05-27 20:11:06] [INFO ] State equation strengthened by 1030 read => feed constraints.
Problem TDEAD100 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1691 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1701 is UNSAT
Problem TDEAD1711 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1744 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1762 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1800 is UNSAT
Problem TDEAD1802 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1822 is UNSAT
Problem TDEAD1832 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1844 is UNSAT
Problem TDEAD1853 is UNSAT
Problem TDEAD1863 is UNSAT
Problem TDEAD1873 is UNSAT
Problem TDEAD1883 is UNSAT
Problem TDEAD1893 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1903 is UNSAT
Problem TDEAD1911 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1922 is UNSAT
Problem TDEAD1923 is UNSAT
Problem TDEAD1933 is UNSAT
Problem TDEAD1943 is UNSAT
Problem TDEAD1944 is UNSAT
Problem TDEAD1954 is UNSAT
Problem TDEAD1964 is UNSAT
Problem TDEAD1974 is UNSAT
Problem TDEAD1984 is UNSAT
Problem TDEAD1994 is UNSAT
Problem TDEAD2000 is UNSAT
Problem TDEAD2004 is UNSAT
Problem TDEAD2011 is UNSAT
Problem TDEAD2014 is UNSAT
Problem TDEAD2022 is UNSAT
Problem TDEAD2024 is UNSAT
Problem TDEAD2033 is UNSAT
Problem TDEAD2034 is UNSAT
Problem TDEAD2044 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 30/30 constraints. Problems are: Problem set: 190 solved, 2030 unsolved
Problem TDEAD45 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1745 is UNSAT
Problem TDEAD1756 is UNSAT
Problem TDEAD1767 is UNSAT
Problem TDEAD1778 is UNSAT
Problem TDEAD1789 is UNSAT
Problem TDEAD1845 is UNSAT
Problem TDEAD1856 is UNSAT
Problem TDEAD1867 is UNSAT
Problem TDEAD1878 is UNSAT
Problem TDEAD1889 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD1956 is UNSAT
Problem TDEAD1967 is UNSAT
Problem TDEAD1978 is UNSAT
Problem TDEAD1989 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 9/39 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1905/2075 variables, 170/209 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
SMT process timed out in 36094ms, After SMT, problems are : Problem set: 380 solved, 1840 unsolved
Search for dead transitions found 380 dead transitions in 36178ms
Found 380 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 380 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 380 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2024-05-27 20:11:42] [INFO ] Computed 39 invariants in 67 ms
[2024-05-27 20:11:42] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-27 20:11:42] [INFO ] Invariant cache hit.
[2024-05-27 20:11:43] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:11:44] [INFO ] Implicit Places using invariants and state equation in 2097 ms returned []
Implicit Place search using SMT with State Equation took 2272 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/170 places, 1885/2265 transitions.
Applied a total of 0 rules in 25 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38549 ms. Remains : 170/170 places, 1885/2265 transitions.
Support contains 170 out of 170 places after structural reductions.
[2024-05-27 20:11:45] [INFO ] Flatten gal took : 416 ms
[2024-05-27 20:11:45] [INFO ] Flatten gal took : 159 ms
[2024-05-27 20:11:45] [INFO ] Input system was already deterministic with 1885 transitions.
RANDOM walk for 40000 steps (4767 resets) in 1818 ms. (21 steps per ms) remains 6/26 properties
BEST_FIRST walk for 40003 steps (348 resets) in 175 ms. (227 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (360 resets) in 232 ms. (171 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (360 resets) in 152 ms. (261 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (348 resets) in 114 ms. (347 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (339 resets) in 105 ms. (377 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (396 resets) in 68 ms. (579 steps per ms) remains 6/6 properties
[2024-05-27 20:11:46] [INFO ] Invariant cache hit.
[2024-05-27 20:11:46] [INFO ] State equation strengthened by 1010 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 27/167 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 3/170 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2055 variables, 1010/1219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1768 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 6/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
[2024-05-27 20:11:49] [INFO ] Deduced a trap composed of 11 places in 341 ms of which 13 ms to minimize.
[2024-05-27 20:11:49] [INFO ] Deduced a trap composed of 11 places in 376 ms of which 15 ms to minimize.
[2024-05-27 20:11:49] [INFO ] Deduced a trap composed of 11 places in 241 ms of which 2 ms to minimize.
[2024-05-27 20:11:50] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 2 ms to minimize.
[2024-05-27 20:11:50] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 1 ms to minimize.
[2024-05-27 20:11:50] [INFO ] Deduced a trap composed of 11 places in 344 ms of which 4 ms to minimize.
[2024-05-27 20:11:50] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 1 ms to minimize.
[2024-05-27 20:11:51] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 13 ms to minimize.
[2024-05-27 20:11:51] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 0 ms to minimize.
[2024-05-27 20:11:51] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 0 ms to minimize.
[2024-05-27 20:11:51] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 27/167 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 28/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 3/170 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1885/2055 variables, 170/220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 1230 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 5/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 6970ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 140 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 155 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:11:54] [INFO ] Invariant cache hit.
[2024-05-27 20:11:54] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 32946ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 32967ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33127 ms. Remains : 170/170 places, 1885/1885 transitions.
RANDOM walk for 40000 steps (4748 resets) in 820 ms. (48 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (348 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (360 resets) in 134 ms. (296 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (359 resets) in 60 ms. (655 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (348 resets) in 71 ms. (555 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (339 resets) in 83 ms. (476 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (401 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 255027 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 6
Probabilistic random walk after 255027 steps, saw 64679 distinct states, run finished after 3009 ms. (steps per millisecond=84 ) properties seen :0
[2024-05-27 20:12:30] [INFO ] Invariant cache hit.
[2024-05-27 20:12:30] [INFO ] State equation strengthened by 1010 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 27/167 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 3/170 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2055 variables, 1010/1219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1439 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 6/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
[2024-05-27 20:12:32] [INFO ] Deduced a trap composed of 11 places in 323 ms of which 12 ms to minimize.
[2024-05-27 20:12:32] [INFO ] Deduced a trap composed of 11 places in 275 ms of which 1 ms to minimize.
[2024-05-27 20:12:33] [INFO ] Deduced a trap composed of 11 places in 252 ms of which 14 ms to minimize.
[2024-05-27 20:12:33] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 2 ms to minimize.
[2024-05-27 20:12:33] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 2 ms to minimize.
[2024-05-27 20:12:33] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 1 ms to minimize.
[2024-05-27 20:12:33] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 1 ms to minimize.
[2024-05-27 20:12:34] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 1 ms to minimize.
[2024-05-27 20:12:34] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 0 ms to minimize.
[2024-05-27 20:12:34] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 1 ms to minimize.
[2024-05-27 20:12:34] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 27/167 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 28/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 3/170 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1885/2055 variables, 170/220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2055 variables, 1010/1230 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2055 variables, 1/1231 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2055 variables, 0/1231 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 1231 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 6/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 46613ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 140 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 77 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 76 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2024-05-27 20:13:17] [INFO ] Invariant cache hit.
[2024-05-27 20:13:17] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-27 20:13:17] [INFO ] Invariant cache hit.
[2024-05-27 20:13:17] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:13:49] [INFO ] Performed 162/170 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-27 20:14:12] [INFO ] Implicit Places using invariants and state equation in 54581 ms returned []
Implicit Place search using SMT with State Equation took 54667 ms to find 0 implicit places.
[2024-05-27 20:14:12] [INFO ] Redundant transitions in 149 ms returned []
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:14:12] [INFO ] Invariant cache hit.
[2024-05-27 20:14:12] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 43776ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 43809ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98723 ms. Remains : 170/170 places, 1885/1885 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 314 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:14:56] [INFO ] Invariant cache hit.
[2024-05-27 20:14:56] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 33147ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 33167ms
[2024-05-27 20:15:29] [INFO ] Invariant cache hit.
[2024-05-27 20:15:30] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-05-27 20:15:30] [INFO ] Invariant cache hit.
[2024-05-27 20:15:30] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:15:59] [INFO ] Implicit Places using invariants and state equation in 29302 ms returned []
Implicit Place search using SMT with State Equation took 29712 ms to find 0 implicit places.
[2024-05-27 20:15:59] [INFO ] Redundant transitions in 119 ms returned []
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:15:59] [INFO ] Invariant cache hit.
[2024-05-27 20:15:59] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 43420ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 43445ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 106789 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 278 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLCardinality-00
Stuttering criterion allowed to conclude after 15 steps with 1 reset in 3 ms.
FORMULA PhilosophersDyn-COL-10-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-10-LTLCardinality-00 finished in 107143 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(F(p1))) U G(p1)))'
Support contains 50 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 156 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:16:43] [INFO ] Invariant cache hit.
[2024-05-27 20:16:43] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 31701ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 31723ms
[2024-05-27 20:17:15] [INFO ] Invariant cache hit.
[2024-05-27 20:17:15] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-27 20:17:15] [INFO ] Invariant cache hit.
[2024-05-27 20:17:16] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:17:45] [INFO ] Implicit Places using invariants and state equation in 29677 ms returned []
Implicit Place search using SMT with State Equation took 29967 ms to find 0 implicit places.
[2024-05-27 20:17:45] [INFO ] Redundant transitions in 38 ms returned []
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:17:45] [INFO ] Invariant cache hit.
[2024-05-27 20:17:45] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 41745ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 41775ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 103683 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLCardinality-02
Stuttering criterion allowed to conclude after 18 steps with 2 reset in 2 ms.
FORMULA PhilosophersDyn-COL-10-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-10-LTLCardinality-02 finished in 103859 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 149 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:18:27] [INFO ] Invariant cache hit.
[2024-05-27 20:18:27] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 35338ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 35372ms
[2024-05-27 20:19:03] [INFO ] Invariant cache hit.
[2024-05-27 20:19:03] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-27 20:19:03] [INFO ] Invariant cache hit.
[2024-05-27 20:19:03] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:19:32] [INFO ] Implicit Places using invariants and state equation in 29041 ms returned []
Implicit Place search using SMT with State Equation took 29285 ms to find 0 implicit places.
[2024-05-27 20:19:32] [INFO ] Redundant transitions in 55 ms returned []
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:19:32] [INFO ] Invariant cache hit.
[2024-05-27 20:19:32] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 43641ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 43666ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 108560 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLCardinality-03
Product exploration explored 100000 steps with 11928 reset in 804 ms.
Product exploration explored 100000 steps with 11892 reset in 649 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (4756 resets) in 493 ms. (80 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (348 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 386460 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :0 out of 1
Probabilistic random walk after 386460 steps, saw 96546 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
[2024-05-27 20:20:20] [INFO ] Invariant cache hit.
[2024-05-27 20:20:20] [INFO ] State equation strengthened by 1010 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/47 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 123/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2055 variables, 1010/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 974 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/47 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 123/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1739 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2756ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 168 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:20:23] [INFO ] Invariant cache hit.
[2024-05-27 20:20:23] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 32098ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 32131ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32318 ms. Remains : 170/170 places, 1885/1885 transitions.
RANDOM walk for 40000 steps (4755 resets) in 365 ms. (109 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (348 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 400964 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :0 out of 1
Probabilistic random walk after 400964 steps, saw 99892 distinct states, run finished after 3002 ms. (steps per millisecond=133 ) properties seen :0
[2024-05-27 20:20:59] [INFO ] Invariant cache hit.
[2024-05-27 20:20:59] [INFO ] State equation strengthened by 1010 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/47 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 123/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2055 variables, 1010/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 786 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/47 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 123/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9697 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10540ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 140 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 99 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2024-05-27 20:21:09] [INFO ] Invariant cache hit.
[2024-05-27 20:21:10] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-27 20:21:10] [INFO ] Invariant cache hit.
[2024-05-27 20:21:10] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:21:37] [INFO ] Implicit Places using invariants and state equation in 27527 ms returned []
Implicit Place search using SMT with State Equation took 27818 ms to find 0 implicit places.
[2024-05-27 20:21:37] [INFO ] Redundant transitions in 63 ms returned []
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:21:37] [INFO ] Invariant cache hit.
[2024-05-27 20:21:37] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 42104ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 42129ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70126 ms. Remains : 170/170 places, 1885/1885 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0)]
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 95 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:22:20] [INFO ] Invariant cache hit.
[2024-05-27 20:22:20] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 35048ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 35067ms
[2024-05-27 20:22:55] [INFO ] Invariant cache hit.
[2024-05-27 20:22:55] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-05-27 20:22:55] [INFO ] Invariant cache hit.
[2024-05-27 20:22:56] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:23:24] [INFO ] Implicit Places using invariants and state equation in 29259 ms returned []
Implicit Place search using SMT with State Equation took 29539 ms to find 0 implicit places.
[2024-05-27 20:23:24] [INFO ] Redundant transitions in 29 ms returned []
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:23:25] [INFO ] Invariant cache hit.
[2024-05-27 20:23:25] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 45080ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 45098ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 109850 ms. Remains : 170/170 places, 1885/1885 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (4789 resets) in 429 ms. (93 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (348 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 395237 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :0 out of 1
Probabilistic random walk after 395237 steps, saw 98703 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
[2024-05-27 20:24:13] [INFO ] Invariant cache hit.
[2024-05-27 20:24:13] [INFO ] State equation strengthened by 1010 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/47 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 123/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2055 variables, 1010/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 818 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/47 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 123/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1665 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2536ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 92 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:24:16] [INFO ] Invariant cache hit.
[2024-05-27 20:24:16] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 33884ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 33909ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34007 ms. Remains : 170/170 places, 1885/1885 transitions.
RANDOM walk for 40000 steps (4755 resets) in 376 ms. (106 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (348 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 390140 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :0 out of 1
Probabilistic random walk after 390140 steps, saw 97561 distinct states, run finished after 3002 ms. (steps per millisecond=129 ) properties seen :0
[2024-05-27 20:24:53] [INFO ] Invariant cache hit.
[2024-05-27 20:24:53] [INFO ] State equation strengthened by 1010 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/47 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 123/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2055 variables, 1010/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 661 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/47 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 123/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9722 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10479ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 92 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 144 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2024-05-27 20:25:03] [INFO ] Invariant cache hit.
[2024-05-27 20:25:04] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-27 20:25:04] [INFO ] Invariant cache hit.
[2024-05-27 20:25:04] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:25:32] [INFO ] Implicit Places using invariants and state equation in 28764 ms returned []
Implicit Place search using SMT with State Equation took 28972 ms to find 0 implicit places.
[2024-05-27 20:25:32] [INFO ] Redundant transitions in 26 ms returned []
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:25:32] [INFO ] Invariant cache hit.
[2024-05-27 20:25:32] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
(s51 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 42151ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 42168ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71326 ms. Remains : 170/170 places, 1885/1885 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 11955 reset in 744 ms.
Product exploration explored 100000 steps with 11989 reset in 742 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 102 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:26:16] [INFO ] Invariant cache hit.
[2024-05-27 20:26:16] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 36326ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 36351ms
[2024-05-27 20:26:53] [INFO ] Invariant cache hit.
[2024-05-27 20:26:53] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-27 20:26:53] [INFO ] Invariant cache hit.
[2024-05-27 20:26:53] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:27:25] [INFO ] Performed 71/170 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-27 20:27:27] [INFO ] Implicit Places using invariants and state equation in 33585 ms returned []
Implicit Place search using SMT with State Equation took 33845 ms to find 0 implicit places.
[2024-05-27 20:27:27] [INFO ] Redundant transitions in 62 ms returned []
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:27:27] [INFO ] Invariant cache hit.
[2024-05-27 20:27:27] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 44978ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 45002ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 115402 ms. Remains : 170/170 places, 1885/1885 transitions.
Treatment of property PhilosophersDyn-COL-10-LTLCardinality-03 finished in 585227 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&G(p1)))||F(!p0)))'
Support contains 30 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 6 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:28:12] [INFO ] Invariant cache hit.
[2024-05-27 20:28:12] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 33979ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 34002ms
[2024-05-27 20:28:46] [INFO ] Invariant cache hit.
[2024-05-27 20:28:47] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-27 20:28:47] [INFO ] Invariant cache hit.
[2024-05-27 20:28:47] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:29:17] [INFO ] Implicit Places using invariants and state equation in 30897 ms returned []
Implicit Place search using SMT with State Equation took 31223 ms to find 0 implicit places.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:29:17] [INFO ] Invariant cache hit.
[2024-05-27 20:29:17] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 42905ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 42927ms
Finished structural reductions in LTL mode , in 1 iterations and 108168 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 115 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLCardinality-04
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-COL-10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-10-LTLCardinality-04 finished in 108315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 110 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 6 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:30:01] [INFO ] Invariant cache hit.
[2024-05-27 20:30:01] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 33648ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 33672ms
[2024-05-27 20:30:34] [INFO ] Invariant cache hit.
[2024-05-27 20:30:34] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-27 20:30:34] [INFO ] Invariant cache hit.
[2024-05-27 20:30:35] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:31:20] [INFO ] Performed 129/170 implicitness test of which 0 returned IMPLICIT in 43 seconds.
[2024-05-27 20:31:52] [INFO ] Performed 131/170 implicitness test of which 0 returned IMPLICIT in 75 seconds.
[2024-05-27 20:32:24] [INFO ] Performed 133/170 implicitness test of which 0 returned IMPLICIT in 107 seconds.
[2024-05-27 20:32:58] [INFO ] Performed 136/170 implicitness test of which 0 returned IMPLICIT in 141 seconds.
[2024-05-27 20:32:58] [INFO ] Timeout of Implicit test with SMT after 141 seconds.
[2024-05-27 20:32:58] [INFO ] Implicit Places using invariants and state equation in 144007 ms returned []
Implicit Place search using SMT with State Equation took 144176 ms to find 0 implicit places.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:32:58] [INFO ] Invariant cache hit.
[2024-05-27 20:32:58] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 44722ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 44748ms
Finished structural reductions in LTL mode , in 1 iterations and 222613 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLCardinality-05
Product exploration explored 100000 steps with 11960 reset in 795 ms.
Product exploration explored 100000 steps with 11886 reset in 791 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 56 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (4787 resets) in 530 ms. (75 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (360 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 390332 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :0 out of 1
Probabilistic random walk after 390332 steps, saw 97600 distinct states, run finished after 3002 ms. (steps per millisecond=130 ) properties seen :0
[2024-05-27 20:33:48] [INFO ] Invariant cache hit.
[2024-05-27 20:33:48] [INFO ] State equation strengthened by 1010 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/137 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 23/160 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1885/2045 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2045 variables, 1010/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2045 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1764 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
[2024-05-27 20:33:50] [INFO ] Deduced a trap composed of 11 places in 235 ms of which 1 ms to minimize.
[2024-05-27 20:33:50] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 1 ms to minimize.
[2024-05-27 20:33:51] [INFO ] Deduced a trap composed of 11 places in 236 ms of which 1 ms to minimize.
[2024-05-27 20:33:51] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 1 ms to minimize.
[2024-05-27 20:33:51] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 1 ms to minimize.
[2024-05-27 20:33:51] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 1 ms to minimize.
[2024-05-27 20:33:51] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 1 ms to minimize.
[2024-05-27 20:33:51] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 1 ms to minimize.
[2024-05-27 20:33:52] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2024-05-27 20:33:52] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-05-27 20:33:52] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-27 20:33:52] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 27/137 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 19/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/160 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1885/2045 variables, 160/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2045/2055 variables, and 1221 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3211 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 160/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 12/12 constraints]
After SMT, in 5034ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 110 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 195 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
Running 1830 sub problems to find dead transitions.
// Phase 1: matrix 1875 rows 160 cols
[2024-05-27 20:33:53] [INFO ] Computed 39 invariants in 47 ms
[2024-05-27 20:33:54] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 3 (OVERLAPS) 1875/2035 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
SMT process timed out in 32987ms, After SMT, problems are : Problem set: 0 solved, 1830 unsolved
Search for dead transitions found 0 dead transitions in 33031ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33233 ms. Remains : 160/170 places, 1875/1885 transitions.
RANDOM walk for 40000 steps (4752 resets) in 597 ms. (66 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (372 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 395374 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :0 out of 1
Probabilistic random walk after 395374 steps, saw 94122 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
[2024-05-27 20:34:30] [INFO ] Invariant cache hit.
[2024-05-27 20:34:30] [INFO ] State equation strengthened by 1010 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/137 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 13/150 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1875/2025 variables, 150/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2025 variables, 1010/1199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2025 variables, 0/1199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/2035 variables, 10/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2035 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2035 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2035/2035 variables, and 1209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2916 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 160/160 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
[2024-05-27 20:34:33] [INFO ] Deduced a trap composed of 11 places in 264 ms of which 4 ms to minimize.
[2024-05-27 20:34:33] [INFO ] Deduced a trap composed of 11 places in 274 ms of which 2 ms to minimize.
[2024-05-27 20:34:33] [INFO ] Deduced a trap composed of 11 places in 235 ms of which 1 ms to minimize.
[2024-05-27 20:34:34] [INFO ] Deduced a trap composed of 11 places in 214 ms of which 1 ms to minimize.
[2024-05-27 20:34:34] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 1 ms to minimize.
[2024-05-27 20:34:34] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 2 ms to minimize.
[2024-05-27 20:34:34] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 1 ms to minimize.
[2024-05-27 20:34:34] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2024-05-27 20:34:34] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2024-05-27 20:34:34] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
[2024-05-27 20:34:35] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-27 20:34:35] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 27/137 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 19/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/150 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1875/2025 variables, 150/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2025 variables, 1010/1211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2025 variables, 0/1211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/2035 variables, 10/1221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2035 variables, 0/1221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/2035 variables, 0/1221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2035/2035 variables, and 1221 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4123 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 160/160 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 12/12 constraints]
After SMT, in 7134ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 110 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 72 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 70 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2024-05-27 20:34:37] [INFO ] Invariant cache hit.
[2024-05-27 20:34:37] [INFO ] Implicit Places using invariants in 191 ms returned [130, 131, 132, 133, 134, 135, 136, 137, 138, 139]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 195 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 150/160 places, 1875/1875 transitions.
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 1865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 1865
Applied a total of 20 rules in 142 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2024-05-27 20:34:37] [INFO ] Computed 29 invariants in 43 ms
[2024-05-27 20:34:37] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-27 20:34:37] [INFO ] Invariant cache hit.
[2024-05-27 20:34:38] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:35:13] [INFO ] Performed 115/140 implicitness test of which 0 returned IMPLICIT in 34 seconds.
[2024-05-27 20:35:52] [INFO ] Performed 119/140 implicitness test of which 0 returned IMPLICIT in 73 seconds.
[2024-05-27 20:36:24] [INFO ] Performed 121/140 implicitness test of which 0 returned IMPLICIT in 105 seconds.
[2024-05-27 20:36:56] [INFO ] Performed 123/140 implicitness test of which 0 returned IMPLICIT in 137 seconds.
[2024-05-27 20:36:56] [INFO ] Timeout of Implicit test with SMT after 137 seconds.
[2024-05-27 20:36:56] [INFO ] Implicit Places using invariants and state equation in 138254 ms returned []
Implicit Place search using SMT with State Equation took 138449 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 140/160 places, 1865/1875 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 138858 ms. Remains : 140/160 places, 1865/1875 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Support contains 110 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 103 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
// Phase 1: matrix 1885 rows 170 cols
[2024-05-27 20:36:56] [INFO ] Computed 39 invariants in 58 ms
[2024-05-27 20:36:56] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 33159ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 33181ms
[2024-05-27 20:37:29] [INFO ] Invariant cache hit.
[2024-05-27 20:37:29] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-27 20:37:29] [INFO ] Invariant cache hit.
[2024-05-27 20:37:30] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:38:15] [INFO ] Performed 129/170 implicitness test of which 0 returned IMPLICIT in 43 seconds.
[2024-05-27 20:38:47] [INFO ] Performed 131/170 implicitness test of which 0 returned IMPLICIT in 75 seconds.
[2024-05-27 20:39:19] [INFO ] Performed 133/170 implicitness test of which 0 returned IMPLICIT in 107 seconds.
[2024-05-27 20:39:58] [INFO ] Performed 136/170 implicitness test of which 0 returned IMPLICIT in 146 seconds.
[2024-05-27 20:39:58] [INFO ] Timeout of Implicit test with SMT after 146 seconds.
[2024-05-27 20:39:58] [INFO ] Implicit Places using invariants and state equation in 148789 ms returned []
Implicit Place search using SMT with State Equation took 148970 ms to find 0 implicit places.
[2024-05-27 20:39:58] [INFO ] Redundant transitions in 68 ms returned []
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:39:58] [INFO ] Invariant cache hit.
[2024-05-27 20:39:58] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 44984ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 45011ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 227358 ms. Remains : 170/170 places, 1885/1885 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (4758 resets) in 633 ms. (63 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (360 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 344519 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :0 out of 1
Probabilistic random walk after 344519 steps, saw 86492 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
[2024-05-27 20:40:47] [INFO ] Invariant cache hit.
[2024-05-27 20:40:47] [INFO ] State equation strengthened by 1010 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/137 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 23/160 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1885/2045 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2045 variables, 1010/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2045 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1704 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
[2024-05-27 20:40:49] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 2 ms to minimize.
[2024-05-27 20:40:49] [INFO ] Deduced a trap composed of 11 places in 274 ms of which 1 ms to minimize.
[2024-05-27 20:40:49] [INFO ] Deduced a trap composed of 11 places in 248 ms of which 1 ms to minimize.
[2024-05-27 20:40:50] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 1 ms to minimize.
[2024-05-27 20:40:50] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 2 ms to minimize.
[2024-05-27 20:40:50] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 1 ms to minimize.
[2024-05-27 20:40:50] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 1 ms to minimize.
[2024-05-27 20:40:50] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2024-05-27 20:40:50] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 0 ms to minimize.
[2024-05-27 20:40:50] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 15 ms to minimize.
[2024-05-27 20:40:50] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 0 ms to minimize.
[2024-05-27 20:40:50] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 27/137 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 19/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/160 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1885/2045 variables, 160/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2045/2055 variables, and 1221 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3357 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 160/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 12/12 constraints]
After SMT, in 5152ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 110 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 140 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
Running 1830 sub problems to find dead transitions.
// Phase 1: matrix 1875 rows 160 cols
[2024-05-27 20:40:52] [INFO ] Computed 39 invariants in 48 ms
[2024-05-27 20:40:52] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
At refinement iteration 3 (OVERLAPS) 1875/2035 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 1830 unsolved
SMT process timed out in 32085ms, After SMT, problems are : Problem set: 0 solved, 1830 unsolved
Search for dead transitions found 0 dead transitions in 32104ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32249 ms. Remains : 160/170 places, 1875/1885 transitions.
RANDOM walk for 40000 steps (4768 resets) in 469 ms. (85 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (374 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 336731 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 1
Probabilistic random walk after 336731 steps, saw 80670 distinct states, run finished after 3002 ms. (steps per millisecond=112 ) properties seen :0
[2024-05-27 20:41:27] [INFO ] Invariant cache hit.
[2024-05-27 20:41:27] [INFO ] State equation strengthened by 1010 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/137 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 13/150 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1875/2025 variables, 150/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2025 variables, 1010/1199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2025 variables, 0/1199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/2035 variables, 10/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2035 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2035 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2035/2035 variables, and 1209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2581 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 160/160 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
[2024-05-27 20:41:30] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 5 ms to minimize.
[2024-05-27 20:41:31] [INFO ] Deduced a trap composed of 11 places in 283 ms of which 1 ms to minimize.
[2024-05-27 20:41:31] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 1 ms to minimize.
[2024-05-27 20:41:31] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 1 ms to minimize.
[2024-05-27 20:41:31] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 1 ms to minimize.
[2024-05-27 20:41:31] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 2 ms to minimize.
[2024-05-27 20:41:31] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2024-05-27 20:41:32] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 1 ms to minimize.
[2024-05-27 20:41:32] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 0 ms to minimize.
[2024-05-27 20:41:32] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2024-05-27 20:41:32] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-27 20:41:32] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 27/137 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 19/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/150 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1875/2025 variables, 150/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2025 variables, 1010/1211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2025 variables, 0/1211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/2035 variables, 10/1221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2035 variables, 0/1221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/2035 variables, 0/1221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2035/2035 variables, and 1221 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4630 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 160/160 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 12/12 constraints]
After SMT, in 7261ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 110 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 93 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 69 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2024-05-27 20:41:35] [INFO ] Invariant cache hit.
[2024-05-27 20:41:35] [INFO ] Implicit Places using invariants in 258 ms returned [130, 131, 132, 133, 134, 135, 136, 137, 138, 139]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 262 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 150/160 places, 1875/1875 transitions.
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 1865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 1865
Applied a total of 20 rules in 136 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2024-05-27 20:41:35] [INFO ] Computed 29 invariants in 39 ms
[2024-05-27 20:41:35] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-27 20:41:35] [INFO ] Invariant cache hit.
[2024-05-27 20:41:36] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:42:14] [INFO ] Performed 118/140 implicitness test of which 0 returned IMPLICIT in 37 seconds.
[2024-05-27 20:42:46] [INFO ] Performed 120/140 implicitness test of which 0 returned IMPLICIT in 69 seconds.
[2024-05-27 20:43:22] [INFO ] Performed 123/140 implicitness test of which 0 returned IMPLICIT in 105 seconds.
[2024-05-27 20:43:54] [INFO ] Performed 125/140 implicitness test of which 0 returned IMPLICIT in 137 seconds.
[2024-05-27 20:43:54] [INFO ] Timeout of Implicit test with SMT after 137 seconds.
[2024-05-27 20:43:54] [INFO ] Implicit Places using invariants and state equation in 138860 ms returned []
Implicit Place search using SMT with State Equation took 139067 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 140/160 places, 1865/1875 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 139537 ms. Remains : 140/160 places, 1865/1875 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 11930 reset in 962 ms.
Product exploration explored 100000 steps with 11928 reset in 855 ms.
Support contains 110 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 80 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
// Phase 1: matrix 1885 rows 170 cols
[2024-05-27 20:43:57] [INFO ] Computed 39 invariants in 28 ms
[2024-05-27 20:43:57] [INFO ] State equation strengthened by 1010 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PhilosophersDyn-COL-10

IS_COLORED=1
IS_NUPN=

LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 8
TRANSITIONS: 7
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 2
COLOR VARS: 4
ARCS: 33
LOADING TIME: 0.141

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 170
TRANSITIONS: 2310
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 18190
UNFOLDING TIME: 0.582

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.185
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 1.082
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

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

Process ID: 1406
MODEL NAME: /home/mcc/execution/model
170 places, 2310 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA PhilosophersDyn-COL-10-LTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-LTLCardinality-00 CANNOT_COMPUTE
FORMULA PhilosophersDyn-COL-10-LTLCardinality-01 CANNOT_COMPUTE
FORMULA PhilosophersDyn-COL-10-LTLCardinality-02 CANNOT_COMPUTE
FORMULA PhilosophersDyn-COL-10-LTLCardinality-03 CANNOT_COMPUTE
FORMULA PhilosophersDyn-COL-10-LTLCardinality-04 CANNOT_COMPUTE
FORMULA PhilosophersDyn-COL-10-LTLCardinality-05 CANNOT_COMPUTE
FORMULA PhilosophersDyn-COL-10-LTLCardinality-06 CANNOT_COMPUTE
FORMULA PhilosophersDyn-COL-10-LTLCardinality-07 CANNOT_COMPUTE
FORMULA PhilosophersDyn-COL-10-LTLCardinality-09 CANNOT_COMPUTE
FORMULA PhilosophersDyn-COL-10-LTLCardinality-10 CANNOT_COMPUTE
FORMULA PhilosophersDyn-COL-10-LTLCardinality-11 CANNOT_COMPUTE
FORMULA PhilosophersDyn-COL-10-LTLCardinality-12 CANNOT_COMPUTE
FORMULA PhilosophersDyn-COL-10-LTLCardinality-13 CANNOT_COMPUTE
FORMULA PhilosophersDyn-COL-10-LTLCardinality-14 CANNOT_COMPUTE
FORMULA PhilosophersDyn-COL-10-LTLCardinality-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716843567393

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

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

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-COL-10.tgz
mv PhilosophersDyn-COL-10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;