Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r575-smll-171734919700134.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is MedleyA-PT-17, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919700134
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 175K Jun 2 16:33 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 MedleyA-PT-17-ReachabilityCardinality-2024-00
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-01
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-02
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-03
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-04
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-05
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-06
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-07
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-08
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-09
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-10
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-11
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-12
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-13
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-14
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717367784938

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:36:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 22:36:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:36:27] [INFO ] Load time of PNML (sax parser for PT used): 233 ms
[2024-06-02 22:36:27] [INFO ] Transformed 248 places.
[2024-06-02 22:36:28] [INFO ] Transformed 591 transitions.
[2024-06-02 22:36:28] [INFO ] Found NUPN structural information;
[2024-06-02 22:36:28] [INFO ] Parsed PT model containing 248 places and 591 transitions and 2764 arcs in 586 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 49 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (1376 resets) in 2767 ms. (14 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (433 resets) in 560 ms. (71 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (299 resets) in 339 ms. (117 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (366 resets) in 539 ms. (74 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (301 resets) in 98 ms. (404 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (298 resets) in 228 ms. (174 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (304 resets) in 398 ms. (100 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (296 resets) in 159 ms. (250 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (392 resets) in 276 ms. (144 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (298 resets) in 164 ms. (242 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (297 resets) in 177 ms. (224 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (298 resets) in 151 ms. (263 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 460728 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :5 out of 11
Probabilistic random walk after 460728 steps, saw 84593 distinct states, run finished after 3008 ms. (steps per millisecond=153 ) properties seen :5
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 589 rows 248 cols
[2024-06-02 22:36:33] [INFO ] Computed 7 invariants in 40 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 171/248 variables, 7/84 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 171/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 22:36:34] [INFO ] Deduced a trap composed of 19 places in 408 ms of which 29 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 589/837 variables, 248/504 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/837 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 837/837 variables, and 504 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1817 ms.
Refiners :[Domain max(s): 248/248 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem MedleyA-PT-17-ReachabilityCardinality-2024-00 is UNSAT
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-17-ReachabilityCardinality-2024-10 is UNSAT
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 171/248 variables, 7/84 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 171/255 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 1/256 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-06-02 22:36:35] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 10 ms to minimize.
[2024-06-02 22:36:36] [INFO ] Deduced a trap composed of 47 places in 352 ms of which 5 ms to minimize.
[2024-06-02 22:36:36] [INFO ] Deduced a trap composed of 17 places in 372 ms of which 5 ms to minimize.
[2024-06-02 22:36:36] [INFO ] Deduced a trap composed of 31 places in 354 ms of which 5 ms to minimize.
[2024-06-02 22:36:37] [INFO ] Deduced a trap composed of 28 places in 325 ms of which 5 ms to minimize.
[2024-06-02 22:36:37] [INFO ] Deduced a trap composed of 49 places in 389 ms of which 5 ms to minimize.
[2024-06-02 22:36:37] [INFO ] Deduced a trap composed of 52 places in 370 ms of which 5 ms to minimize.
[2024-06-02 22:36:38] [INFO ] Deduced a trap composed of 19 places in 374 ms of which 4 ms to minimize.
[2024-06-02 22:36:38] [INFO ] Deduced a trap composed of 102 places in 316 ms of which 4 ms to minimize.
[2024-06-02 22:36:39] [INFO ] Deduced a trap composed of 21 places in 400 ms of which 4 ms to minimize.
[2024-06-02 22:36:39] [INFO ] Deduced a trap composed of 39 places in 352 ms of which 5 ms to minimize.
[2024-06-02 22:36:39] [INFO ] Deduced a trap composed of 51 places in 341 ms of which 4 ms to minimize.
[2024-06-02 22:36:40] [INFO ] Deduced a trap composed of 56 places in 308 ms of which 4 ms to minimize.
[2024-06-02 22:36:40] [INFO ] Deduced a trap composed of 23 places in 354 ms of which 4 ms to minimize.
SMT process timed out in 7356ms, After SMT, problems are : Problem set: 2 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 63 out of 248 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 248/248 places, 589/589 transitions.
Graph (trivial) has 171 edges and 248 vertex of which 3 / 248 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 246 transition count 571
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 24 rules applied. Total rules applied 40 place count 231 transition count 562
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 48 place count 223 transition count 562
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 48 place count 223 transition count 552
Deduced a syphon composed of 10 places in 5 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 68 place count 213 transition count 552
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 98 place count 183 transition count 499
Iterating global reduction 3 with 30 rules applied. Total rules applied 128 place count 183 transition count 499
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 144 place count 183 transition count 483
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 144 place count 183 transition count 482
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 146 place count 182 transition count 482
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 147 place count 181 transition count 480
Iterating global reduction 4 with 1 rules applied. Total rules applied 148 place count 181 transition count 480
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 166 place count 172 transition count 471
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 200 place count 155 transition count 520
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 201 place count 155 transition count 519
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 203 place count 153 transition count 503
Iterating global reduction 5 with 2 rules applied. Total rules applied 205 place count 153 transition count 503
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 5 with 26 rules applied. Total rules applied 231 place count 153 transition count 477
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 239 place count 149 transition count 473
Free-agglomeration rule applied 17 times.
Iterating global reduction 5 with 17 rules applied. Total rules applied 256 place count 149 transition count 456
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 273 place count 132 transition count 456
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 274 place count 132 transition count 455
Applied a total of 274 rules in 383 ms. Remains 132 /248 variables (removed 116) and now considering 455/589 (removed 134) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 415 ms. Remains : 132/248 places, 455/589 transitions.
RANDOM walk for 40000 steps (15 resets) in 276 ms. (144 steps per ms) remains 3/4 properties
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (18 resets) in 235 ms. (169 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (37 resets) in 737 ms. (54 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (24 resets) in 234 ms. (170 steps per ms) remains 3/3 properties
[2024-06-02 22:36:41] [INFO ] Flow matrix only has 428 transitions (discarded 27 similar events)
// Phase 1: matrix 428 rows 132 cols
[2024-06-02 22:36:41] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 22:36:41] [INFO ] State equation strengthened by 93 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 90/132 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 428/560 variables, 132/139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/560 variables, 93/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/560 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/560 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 560/560 variables, and 232 constraints, problems are : Problem set: 0 solved, 3 unsolved in 461 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 132/132 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 90/132 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:36:42] [INFO ] Deduced a trap composed of 20 places in 212 ms of which 3 ms to minimize.
[2024-06-02 22:36:42] [INFO ] Deduced a trap composed of 31 places in 240 ms of which 3 ms to minimize.
[2024-06-02 22:36:42] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 3 ms to minimize.
[2024-06-02 22:36:43] [INFO ] Deduced a trap composed of 60 places in 208 ms of which 3 ms to minimize.
[2024-06-02 22:36:43] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 2 ms to minimize.
[2024-06-02 22:36:43] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 2 ms to minimize.
[2024-06-02 22:36:43] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 3 ms to minimize.
[2024-06-02 22:36:43] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 3 ms to minimize.
[2024-06-02 22:36:44] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 2 ms to minimize.
[2024-06-02 22:36:44] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:36:44] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:36:44] [INFO ] Deduced a trap composed of 71 places in 198 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 428/560 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/560 variables, 93/244 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/560 variables, 3/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:36:52] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/560 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:36:54] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/560 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/560 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 560/560 variables, and 249 constraints, problems are : Problem set: 0 solved, 3 unsolved in 13017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 132/132 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 14/14 constraints]
After SMT, in 13539ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 11465 ms.
Support contains 42 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 455/455 transitions.
Graph (trivial) has 54 edges and 132 vertex of which 2 / 132 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 131 transition count 452
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 130 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 129 transition count 451
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 9 place count 125 transition count 442
Iterating global reduction 3 with 4 rules applied. Total rules applied 13 place count 125 transition count 442
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 19 place count 122 transition count 439
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 25 place count 119 transition count 455
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 28 place count 119 transition count 452
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 36 place count 119 transition count 444
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 44 place count 111 transition count 444
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 45 place count 111 transition count 458
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 46 place count 110 transition count 458
Applied a total of 46 rules in 109 ms. Remains 110 /132 variables (removed 22) and now considering 458/455 (removed -3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 110/132 places, 458/455 transitions.
RANDOM walk for 40000 steps (16 resets) in 249 ms. (160 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (12 resets) in 132 ms. (300 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (20 resets) in 259 ms. (153 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (20 resets) in 249 ms. (160 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 786426 steps, run timeout after 3001 ms. (steps per millisecond=262 ) properties seen :1 out of 3
Probabilistic random walk after 786426 steps, saw 136715 distinct states, run finished after 3001 ms. (steps per millisecond=262 ) properties seen :1
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 22:37:10] [INFO ] Flow matrix only has 422 transitions (discarded 36 similar events)
// Phase 1: matrix 422 rows 110 cols
[2024-06-02 22:37:10] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 22:37:10] [INFO ] State equation strengthened by 181 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 71/110 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 422/532 variables, 110/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 181/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/532 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 298 constraints, problems are : Problem set: 0 solved, 2 unsolved in 363 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 110/110 constraints, ReadFeed: 181/181 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 71/110 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 22:37:10] [INFO ] Deduced a trap composed of 14 places in 222 ms of which 8 ms to minimize.
[2024-06-02 22:37:10] [INFO ] Deduced a trap composed of 15 places in 217 ms of which 3 ms to minimize.
[2024-06-02 22:37:11] [INFO ] Deduced a trap composed of 17 places in 227 ms of which 2 ms to minimize.
[2024-06-02 22:37:11] [INFO ] Deduced a trap composed of 34 places in 229 ms of which 3 ms to minimize.
[2024-06-02 22:37:11] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 2 ms to minimize.
[2024-06-02 22:37:11] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 2 ms to minimize.
[2024-06-02 22:37:12] [INFO ] Deduced a trap composed of 28 places in 188 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 422/532 variables, 110/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 181/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/532 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 307 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2590 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 110/110 constraints, ReadFeed: 181/181 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 2992ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 801 ms.
Support contains 39 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 458/458 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 109 transition count 457
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 107 transition count 471
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 107 transition count 465
Applied a total of 12 rules in 38 ms. Remains 107 /110 variables (removed 3) and now considering 465/458 (removed -7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 107/110 places, 465/458 transitions.
RANDOM walk for 40000 steps (14 resets) in 289 ms. (137 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (9 resets) in 186 ms. (213 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (15 resets) in 335 ms. (119 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 571528 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :0 out of 2
Probabilistic random walk after 571528 steps, saw 99809 distinct states, run finished after 3001 ms. (steps per millisecond=190 ) properties seen :0
[2024-06-02 22:37:17] [INFO ] Flow matrix only has 429 transitions (discarded 36 similar events)
// Phase 1: matrix 429 rows 107 cols
[2024-06-02 22:37:17] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:37:17] [INFO ] State equation strengthened by 181 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/107 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 429/536 variables, 107/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 181/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/536 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 536/536 variables, and 295 constraints, problems are : Problem set: 0 solved, 2 unsolved in 406 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 107/107 constraints, ReadFeed: 181/181 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/107 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 22:37:17] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 1 ms to minimize.
[2024-06-02 22:37:18] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 2 ms to minimize.
[2024-06-02 22:37:18] [INFO ] Deduced a trap composed of 55 places in 189 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 22:37:18] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-06-02 22:37:18] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 2 ms to minimize.
[2024-06-02 22:37:18] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 2 ms to minimize.
[2024-06-02 22:37:18] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 2 ms to minimize.
[2024-06-02 22:37:18] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 429/536 variables, 107/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 181/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 22:37:19] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 2 ms to minimize.
[2024-06-02 22:37:19] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 1 ms to minimize.
[2024-06-02 22:37:19] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 2 ms to minimize.
[2024-06-02 22:37:20] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 2 ms to minimize.
[2024-06-02 22:37:20] [INFO ] Deduced a trap composed of 46 places in 195 ms of which 2 ms to minimize.
[2024-06-02 22:37:20] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:37:20] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 7/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/536 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 536/536 variables, and 312 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3433 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 107/107 constraints, ReadFeed: 181/181 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 15/15 constraints]
After SMT, in 3878ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 866 ms.
Support contains 39 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 465/465 transitions.
Applied a total of 0 rules in 30 ms. Remains 107 /107 variables (removed 0) and now considering 465/465 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 107/107 places, 465/465 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 465/465 transitions.
Applied a total of 0 rules in 14 ms. Remains 107 /107 variables (removed 0) and now considering 465/465 (removed 0) transitions.
[2024-06-02 22:37:21] [INFO ] Flow matrix only has 429 transitions (discarded 36 similar events)
[2024-06-02 22:37:21] [INFO ] Invariant cache hit.
[2024-06-02 22:37:22] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 22:37:22] [INFO ] Flow matrix only has 429 transitions (discarded 36 similar events)
[2024-06-02 22:37:22] [INFO ] Invariant cache hit.
[2024-06-02 22:37:22] [INFO ] State equation strengthened by 181 read => feed constraints.
[2024-06-02 22:37:22] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
[2024-06-02 22:37:22] [INFO ] Redundant transitions in 33 ms returned []
Running 464 sub problems to find dead transitions.
[2024-06-02 22:37:22] [INFO ] Flow matrix only has 429 transitions (discarded 36 similar events)
[2024-06-02 22:37:22] [INFO ] Invariant cache hit.
[2024-06-02 22:37:22] [INFO ] State equation strengthened by 181 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-02 22:37:28] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 3 ms to minimize.
[2024-06-02 22:37:28] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 1 ms to minimize.
[2024-06-02 22:37:28] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 2 ms to minimize.
[2024-06-02 22:37:28] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 2 ms to minimize.
[2024-06-02 22:37:28] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 2 ms to minimize.
[2024-06-02 22:37:28] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 13 ms to minimize.
[2024-06-02 22:37:29] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-02 22:37:29] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 3 ms to minimize.
[2024-06-02 22:37:29] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 2 ms to minimize.
[2024-06-02 22:37:29] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 2 ms to minimize.
[2024-06-02 22:37:29] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-06-02 22:37:29] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-06-02 22:37:30] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 2 ms to minimize.
[2024-06-02 22:37:30] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-06-02 22:37:30] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-06-02 22:37:30] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 2 ms to minimize.
[2024-06-02 22:37:30] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-06-02 22:37:30] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 1 ms to minimize.
[2024-06-02 22:37:30] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 1 ms to minimize.
[2024-06-02 22:37:30] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 2 ms to minimize.
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 20/27 constraints. Problems are: Problem set: 16 solved, 448 unsolved
[2024-06-02 22:37:31] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 2 ms to minimize.
[2024-06-02 22:37:31] [INFO ] Deduced a trap composed of 35 places in 173 ms of which 1 ms to minimize.
[2024-06-02 22:37:32] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 2 ms to minimize.
[2024-06-02 22:37:32] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 1 ms to minimize.
[2024-06-02 22:37:32] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 2 ms to minimize.
[2024-06-02 22:37:32] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:37:32] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:37:32] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2024-06-02 22:37:33] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 2 ms to minimize.
[2024-06-02 22:37:33] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 1 ms to minimize.
[2024-06-02 22:37:33] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 2 ms to minimize.
[2024-06-02 22:37:34] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 12/39 constraints. Problems are: Problem set: 16 solved, 448 unsolved
[2024-06-02 22:37:37] [INFO ] Deduced a trap composed of 26 places in 179 ms of which 2 ms to minimize.
[2024-06-02 22:37:38] [INFO ] Deduced a trap composed of 35 places in 213 ms of which 2 ms to minimize.
[2024-06-02 22:37:39] [INFO ] Deduced a trap composed of 29 places in 187 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 3/42 constraints. Problems are: Problem set: 16 solved, 448 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/42 constraints. Problems are: Problem set: 16 solved, 448 unsolved
At refinement iteration 6 (OVERLAPS) 429/536 variables, 107/149 constraints. Problems are: Problem set: 16 solved, 448 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 181/330 constraints. Problems are: Problem set: 16 solved, 448 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 536/536 variables, and 330 constraints, problems are : Problem set: 16 solved, 448 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 107/107 constraints, ReadFeed: 181/181 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 16 solved, 448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 16 solved, 448 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 7/7 constraints. Problems are: Problem set: 16 solved, 448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 35/42 constraints. Problems are: Problem set: 16 solved, 448 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/42 constraints. Problems are: Problem set: 16 solved, 448 unsolved
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 4 (OVERLAPS) 429/536 variables, 107/149 constraints. Problems are: Problem set: 66 solved, 398 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 181/330 constraints. Problems are: Problem set: 66 solved, 398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 536/536 variables, and 728 constraints, problems are : Problem set: 66 solved, 398 unsolved in 30291 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 107/107 constraints, ReadFeed: 181/181 constraints, PredecessorRefiner: 398/464 constraints, Known Traps: 35/35 constraints]
After SMT, in 61648ms problems are : Problem set: 66 solved, 398 unsolved
Search for dead transitions found 66 dead transitions in 61658ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 107/107 places, 399/465 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 105 transition count 412
Applied a total of 4 rules in 25 ms. Remains 105 /107 variables (removed 2) and now considering 412/399 (removed -13) transitions.
[2024-06-02 22:38:24] [INFO ] Flow matrix only has 376 transitions (discarded 36 similar events)
// Phase 1: matrix 376 rows 105 cols
[2024-06-02 22:38:24] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 22:38:24] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-06-02 22:38:24] [INFO ] Flow matrix only has 376 transitions (discarded 36 similar events)
[2024-06-02 22:38:24] [INFO ] Invariant cache hit.
[2024-06-02 22:38:24] [INFO ] State equation strengthened by 125 read => feed constraints.
[2024-06-02 22:38:24] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 105/107 places, 412/465 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62928 ms. Remains : 105/107 places, 412/465 transitions.
RANDOM walk for 40000 steps (24 resets) in 336 ms. (118 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (9 resets) in 157 ms. (253 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (13 resets) in 153 ms. (259 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 824213 steps, run timeout after 3001 ms. (steps per millisecond=274 ) properties seen :0 out of 2
Probabilistic random walk after 824213 steps, saw 143176 distinct states, run finished after 3001 ms. (steps per millisecond=274 ) properties seen :0
[2024-06-02 22:38:28] [INFO ] Flow matrix only has 376 transitions (discarded 36 similar events)
[2024-06-02 22:38:28] [INFO ] Invariant cache hit.
[2024-06-02 22:38:28] [INFO ] State equation strengthened by 125 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 66/105 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 376/481 variables, 105/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 125/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/481 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/481 variables, and 237 constraints, problems are : Problem set: 0 solved, 2 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 105/105 constraints, ReadFeed: 125/125 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 66/105 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 22:38:28] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 2 ms to minimize.
[2024-06-02 22:38:28] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 2 ms to minimize.
[2024-06-02 22:38:29] [INFO ] Deduced a trap composed of 15 places in 194 ms of which 2 ms to minimize.
[2024-06-02 22:38:29] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 3 ms to minimize.
[2024-06-02 22:38:29] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:38:29] [INFO ] Deduced a trap composed of 45 places in 171 ms of which 2 ms to minimize.
[2024-06-02 22:38:29] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:38:29] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 2 ms to minimize.
[2024-06-02 22:38:29] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 2 ms to minimize.
[2024-06-02 22:38:30] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 2 ms to minimize.
[2024-06-02 22:38:30] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 22:38:30] [INFO ] Deduced a trap composed of 28 places in 181 ms of which 2 ms to minimize.
[2024-06-02 22:38:30] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 2 ms to minimize.
[2024-06-02 22:38:30] [INFO ] Deduced a trap composed of 58 places in 151 ms of which 2 ms to minimize.
[2024-06-02 22:38:30] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 22:38:31] [INFO ] Deduced a trap composed of 54 places in 179 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 376/481 variables, 105/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 125/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/481 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/481 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/481 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 481/481 variables, and 255 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3572 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 105/105 constraints, ReadFeed: 125/125 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 16/16 constraints]
After SMT, in 3906ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 470 ms.
Support contains 39 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 412/412 transitions.
Applied a total of 0 rules in 18 ms. Remains 105 /105 variables (removed 0) and now considering 412/412 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 105/105 places, 412/412 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 412/412 transitions.
Applied a total of 0 rules in 15 ms. Remains 105 /105 variables (removed 0) and now considering 412/412 (removed 0) transitions.
[2024-06-02 22:38:32] [INFO ] Flow matrix only has 376 transitions (discarded 36 similar events)
[2024-06-02 22:38:32] [INFO ] Invariant cache hit.
[2024-06-02 22:38:32] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-02 22:38:32] [INFO ] Flow matrix only has 376 transitions (discarded 36 similar events)
[2024-06-02 22:38:32] [INFO ] Invariant cache hit.
[2024-06-02 22:38:32] [INFO ] State equation strengthened by 125 read => feed constraints.
[2024-06-02 22:38:33] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
[2024-06-02 22:38:33] [INFO ] Redundant transitions in 6 ms returned []
Running 411 sub problems to find dead transitions.
[2024-06-02 22:38:33] [INFO ] Flow matrix only has 376 transitions (discarded 36 similar events)
[2024-06-02 22:38:33] [INFO ] Invariant cache hit.
[2024-06-02 22:38:33] [INFO ] State equation strengthened by 125 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-06-02 22:38:37] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 3 ms to minimize.
[2024-06-02 22:38:38] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 3 ms to minimize.
[2024-06-02 22:38:38] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 1 ms to minimize.
[2024-06-02 22:38:38] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2024-06-02 22:38:38] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 1 ms to minimize.
[2024-06-02 22:38:38] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 2 ms to minimize.
[2024-06-02 22:38:38] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
[2024-06-02 22:38:38] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-02 22:38:38] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 1 ms to minimize.
[2024-06-02 22:38:39] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 2 ms to minimize.
[2024-06-02 22:38:39] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 1 ms to minimize.
[2024-06-02 22:38:39] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 2 ms to minimize.
[2024-06-02 22:38:39] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 2 ms to minimize.
[2024-06-02 22:38:39] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 2 ms to minimize.
[2024-06-02 22:38:39] [INFO ] Deduced a trap composed of 19 places in 196 ms of which 2 ms to minimize.
[2024-06-02 22:38:40] [INFO ] Deduced a trap composed of 13 places in 199 ms of which 2 ms to minimize.
[2024-06-02 22:38:40] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 2 ms to minimize.
[2024-06-02 22:38:40] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 2 ms to minimize.
[2024-06-02 22:38:40] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 2 ms to minimize.
[2024-06-02 22:38:40] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-06-02 22:38:41] [INFO ] Deduced a trap composed of 20 places in 181 ms of which 3 ms to minimize.
[2024-06-02 22:38:41] [INFO ] Deduced a trap composed of 29 places in 191 ms of which 2 ms to minimize.
[2024-06-02 22:38:41] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:38:41] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 2 ms to minimize.
[2024-06-02 22:38:42] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 2 ms to minimize.
[2024-06-02 22:38:42] [INFO ] Deduced a trap composed of 45 places in 193 ms of which 2 ms to minimize.
[2024-06-02 22:38:42] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 2 ms to minimize.
[2024-06-02 22:38:42] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 1 ms to minimize.
[2024-06-02 22:38:42] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 1 ms to minimize.
[2024-06-02 22:38:43] [INFO ] Deduced a trap composed of 20 places in 263 ms of which 2 ms to minimize.
[2024-06-02 22:38:43] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 2 ms to minimize.
[2024-06-02 22:38:43] [INFO ] Deduced a trap composed of 21 places in 180 ms of which 2 ms to minimize.
[2024-06-02 22:38:44] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 2 ms to minimize.
[2024-06-02 22:38:44] [INFO ] Deduced a trap composed of 33 places in 184 ms of which 2 ms to minimize.
[2024-06-02 22:38:44] [INFO ] Deduced a trap composed of 34 places in 198 ms of which 2 ms to minimize.
[2024-06-02 22:38:45] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 2 ms to minimize.
[2024-06-02 22:38:45] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-06-02 22:38:48] [INFO ] Deduced a trap composed of 33 places in 173 ms of which 2 ms to minimize.
[2024-06-02 22:38:48] [INFO ] Deduced a trap composed of 31 places in 177 ms of which 2 ms to minimize.
[2024-06-02 22:38:48] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 2 ms to minimize.
[2024-06-02 22:38:49] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 3 ms to minimize.
[2024-06-02 22:38:49] [INFO ] Deduced a trap composed of 56 places in 178 ms of which 2 ms to minimize.
[2024-06-02 22:38:49] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 2 ms to minimize.
[2024-06-02 22:38:49] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 2 ms to minimize.
[2024-06-02 22:38:51] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-06-02 22:38:52] [INFO ] Deduced a trap composed of 27 places in 187 ms of which 2 ms to minimize.
[2024-06-02 22:38:52] [INFO ] Deduced a trap composed of 28 places in 174 ms of which 2 ms to minimize.
[2024-06-02 22:38:52] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 2 ms to minimize.
[2024-06-02 22:38:53] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 7 (OVERLAPS) 376/481 variables, 105/161 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/481 variables, 125/286 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/481 variables, and 286 constraints, problems are : Problem set: 0 solved, 411 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 105/105 constraints, ReadFeed: 125/125 constraints, PredecessorRefiner: 411/411 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 411 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 4 (OVERLAPS) 376/481 variables, 105/161 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 125/286 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 411/697 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/481 variables, and 697 constraints, problems are : Problem set: 0 solved, 411 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 105/105 constraints, ReadFeed: 125/125 constraints, PredecessorRefiner: 411/411 constraints, Known Traps: 49/49 constraints]
After SMT, in 60780ms problems are : Problem set: 0 solved, 411 unsolved
Search for dead transitions found 0 dead transitions in 60788ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61482 ms. Remains : 105/105 places, 412/412 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 47 edges and 105 vertex of which 2 / 105 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 38 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 104 transition count 367
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 104 transition count 367
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 104 transition count 366
Applied a total of 13 rules in 61 ms. Remains 104 /105 variables (removed 1) and now considering 366/412 (removed 46) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 366 rows 104 cols
[2024-06-02 22:39:34] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:39:34] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 22:39:34] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-02 22:39:35] [INFO ] After 914ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 22:39:35] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-06-02 22:39:35] [INFO ] After 113ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 22:39:35] [INFO ] Deduced a trap composed of 36 places in 169 ms of which 3 ms to minimize.
[2024-06-02 22:39:35] [INFO ] Deduced a trap composed of 54 places in 178 ms of which 2 ms to minimize.
[2024-06-02 22:39:36] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 2 ms to minimize.
[2024-06-02 22:39:36] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 2 ms to minimize.
[2024-06-02 22:39:40] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-06-02 22:40:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 27619 ms
[2024-06-02 22:40:03] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-02 22:40:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
TRAPS : Iteration 1
[2024-06-02 22:40:03] [INFO ] After 28149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 22:40:06] [INFO ] After 31985ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 32127 ms.
[2024-06-02 22:40:06] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-06-02 22:40:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 105 places, 412 transitions and 2118 arcs took 8 ms.
[2024-06-02 22:40:06] [INFO ] Flatten gal took : 145 ms
Total runtime 219177 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MedleyA-PT-17

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 1110
MODEL NAME: /home/mcc/execution/415/model
105 places, 412 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 MedleyA-PT-17-ReachabilityCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717368012887

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-17"
export BK_EXAMINATION="ReachabilityCardinality"
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 MedleyA-PT-17, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r575-smll-171734919700134"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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