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.r245-tall-171654350200598.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 NoC3x3-PT-3B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654350200598
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 07:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 12 07:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 12 07:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 12 07:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 581K 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 NoC3x3-PT-3B-ReachabilityCardinality-2024-00
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-01
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-02
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-03
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-04
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-05
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-06
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-07
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-08
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-09
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-10
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-11
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-12
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-13
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-14
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716686187046

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-3B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 01:16:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-26 01:16:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 01:16:28] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2024-05-26 01:16:28] [INFO ] Transformed 2117 places.
[2024-05-26 01:16:28] [INFO ] Transformed 2435 transitions.
[2024-05-26 01:16:28] [INFO ] Found NUPN structural information;
[2024-05-26 01:16:28] [INFO ] Parsed PT model containing 2117 places and 2435 transitions and 6177 arcs in 300 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (65 resets) in 1713 ms. (23 steps per ms) remains 4/12 properties
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 604 ms. (66 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 184 ms. (216 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 164 ms. (242 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 87 ms. (454 steps per ms) remains 4/4 properties
// Phase 1: matrix 2435 rows 2117 cols
[2024-05-26 01:16:29] [INFO ] Computed 66 invariants in 36 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem NoC3x3-PT-3B-ReachabilityCardinality-2024-05 is UNSAT
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1824/1895 variables, 52/123 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1895 variables, 1824/1947 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1895 variables, 0/1947 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 222/2117 variables, 14/1961 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2117 variables, 222/2183 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2117 variables, 0/2183 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2435/4552 variables, 2117/4300 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4552 variables, 0/4300 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/4552 variables, 0/4300 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4552/4552 variables, and 4300 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1858 ms.
Refiners :[Domain max(s): 2117/2117 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 2117/2117 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1614/1652 variables, 45/83 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1652 variables, 1614/1697 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-26 01:16:32] [INFO ] Deduced a trap composed of 117 places in 262 ms of which 36 ms to minimize.
[2024-05-26 01:16:32] [INFO ] Deduced a trap composed of 69 places in 225 ms of which 5 ms to minimize.
[2024-05-26 01:16:32] [INFO ] Deduced a trap composed of 59 places in 182 ms of which 4 ms to minimize.
[2024-05-26 01:16:32] [INFO ] Deduced a trap composed of 128 places in 152 ms of which 4 ms to minimize.
[2024-05-26 01:16:33] [INFO ] Deduced a trap composed of 98 places in 177 ms of which 3 ms to minimize.
[2024-05-26 01:16:33] [INFO ] Deduced a trap composed of 97 places in 162 ms of which 3 ms to minimize.
[2024-05-26 01:16:33] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 1 ms to minimize.
[2024-05-26 01:16:33] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 2 ms to minimize.
[2024-05-26 01:16:33] [INFO ] Deduced a trap composed of 67 places in 96 ms of which 2 ms to minimize.
[2024-05-26 01:16:33] [INFO ] Deduced a trap composed of 85 places in 84 ms of which 2 ms to minimize.
[2024-05-26 01:16:33] [INFO ] Deduced a trap composed of 104 places in 69 ms of which 2 ms to minimize.
[2024-05-26 01:16:34] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 3 ms to minimize.
[2024-05-26 01:16:34] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 2 ms to minimize.
[2024-05-26 01:16:34] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 2 ms to minimize.
[2024-05-26 01:16:34] [INFO ] Deduced a trap composed of 85 places in 77 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1652 variables, 15/1712 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1652 variables, 0/1712 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 465/2117 variables, 21/1733 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2117 variables, 465/2198 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-26 01:16:34] [INFO ] Deduced a trap composed of 64 places in 251 ms of which 5 ms to minimize.
[2024-05-26 01:16:35] [INFO ] Deduced a trap composed of 42 places in 215 ms of which 4 ms to minimize.
[2024-05-26 01:16:35] [INFO ] Deduced a trap composed of 56 places in 217 ms of which 3 ms to minimize.
[2024-05-26 01:16:35] [INFO ] Deduced a trap composed of 75 places in 215 ms of which 3 ms to minimize.
[2024-05-26 01:16:35] [INFO ] Deduced a trap composed of 36 places in 185 ms of which 4 ms to minimize.
[2024-05-26 01:16:36] [INFO ] Deduced a trap composed of 45 places in 198 ms of which 4 ms to minimize.
[2024-05-26 01:16:36] [INFO ] Deduced a trap composed of 59 places in 172 ms of which 3 ms to minimize.
[2024-05-26 01:16:36] [INFO ] Deduced a trap composed of 53 places in 168 ms of which 4 ms to minimize.
[2024-05-26 01:16:36] [INFO ] Deduced a trap composed of 75 places in 165 ms of which 3 ms to minimize.
SMT process timed out in 7185ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 38 out of 2117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2117/2117 places, 2435/2435 transitions.
Graph (trivial) has 1675 edges and 2117 vertex of which 56 / 2117 are part of one of the 7 SCC in 8 ms
Free SCC test removed 49 places
Drop transitions (Empty/Sink Transition effects.) removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 422 transitions
Trivial Post-agglo rules discarded 422 transitions
Performed 422 trivial Post agglomeration. Transition count delta: 422
Iterating post reduction 0 with 427 rules applied. Total rules applied 428 place count 2063 transition count 1957
Reduce places removed 422 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 428 rules applied. Total rules applied 856 place count 1641 transition count 1951
Reduce places removed 3 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 14 rules applied. Total rules applied 870 place count 1638 transition count 1940
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 881 place count 1627 transition count 1940
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 881 place count 1627 transition count 1916
Deduced a syphon composed of 24 places in 4 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 929 place count 1603 transition count 1916
Discarding 351 places :
Symmetric choice reduction at 4 with 351 rule applications. Total rules 1280 place count 1252 transition count 1565
Iterating global reduction 4 with 351 rules applied. Total rules applied 1631 place count 1252 transition count 1565
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 33 Pre rules applied. Total rules applied 1631 place count 1252 transition count 1532
Deduced a syphon composed of 33 places in 10 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 1697 place count 1219 transition count 1532
Discarding 127 places :
Symmetric choice reduction at 4 with 127 rule applications. Total rules 1824 place count 1092 transition count 1368
Iterating global reduction 4 with 127 rules applied. Total rules applied 1951 place count 1092 transition count 1368
Discarding 121 places :
Symmetric choice reduction at 4 with 121 rule applications. Total rules 2072 place count 971 transition count 1234
Iterating global reduction 4 with 121 rules applied. Total rules applied 2193 place count 971 transition count 1234
Discarding 49 places :
Symmetric choice reduction at 4 with 49 rule applications. Total rules 2242 place count 922 transition count 1147
Iterating global reduction 4 with 49 rules applied. Total rules applied 2291 place count 922 transition count 1147
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 4 with 14 rules applied. Total rules applied 2305 place count 921 transition count 1134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2306 place count 920 transition count 1134
Discarding 37 places :
Symmetric choice reduction at 6 with 37 rule applications. Total rules 2343 place count 883 transition count 1097
Iterating global reduction 6 with 37 rules applied. Total rules applied 2380 place count 883 transition count 1097
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 6 with 8 rules applied. Total rules applied 2388 place count 879 transition count 1093
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2392 place count 875 transition count 1093
Discarding 25 places :
Symmetric choice reduction at 8 with 25 rule applications. Total rules 2417 place count 850 transition count 1043
Iterating global reduction 8 with 25 rules applied. Total rules applied 2442 place count 850 transition count 1043
Discarding 24 places :
Symmetric choice reduction at 8 with 24 rule applications. Total rules 2466 place count 826 transition count 1019
Iterating global reduction 8 with 24 rules applied. Total rules applied 2490 place count 826 transition count 1019
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 8 with 29 rules applied. Total rules applied 2519 place count 823 transition count 993
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 2522 place count 820 transition count 993
Performed 312 Post agglomeration using F-continuation condition.Transition count delta: 312
Deduced a syphon composed of 312 places in 1 ms
Reduce places removed 312 places and 0 transitions.
Iterating global reduction 10 with 624 rules applied. Total rules applied 3146 place count 508 transition count 681
Discarding 14 places :
Symmetric choice reduction at 10 with 14 rule applications. Total rules 3160 place count 494 transition count 665
Iterating global reduction 10 with 14 rules applied. Total rules applied 3174 place count 494 transition count 665
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 3183 place count 485 transition count 647
Iterating global reduction 10 with 9 rules applied. Total rules applied 3192 place count 485 transition count 647
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 3193 place count 485 transition count 646
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 3194 place count 484 transition count 644
Iterating global reduction 11 with 1 rules applied. Total rules applied 3195 place count 484 transition count 644
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 3197 place count 483 transition count 643
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -53
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 11 with 40 rules applied. Total rules applied 3237 place count 463 transition count 696
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 3238 place count 462 transition count 694
Iterating global reduction 11 with 1 rules applied. Total rules applied 3239 place count 462 transition count 694
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 3240 place count 462 transition count 693
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 3241 place count 462 transition count 692
Free-agglomeration rule applied 18 times.
Iterating global reduction 12 with 18 rules applied. Total rules applied 3259 place count 462 transition count 674
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 24 rules applied. Total rules applied 3283 place count 444 transition count 668
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 3285 place count 444 transition count 666
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 13 with 4 rules applied. Total rules applied 3289 place count 444 transition count 662
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 3293 place count 440 transition count 662
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 14 with 3 rules applied. Total rules applied 3296 place count 440 transition count 662
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 14 with 4 rules applied. Total rules applied 3300 place count 440 transition count 662
Applied a total of 3300 rules in 1030 ms. Remains 440 /2117 variables (removed 1677) and now considering 662/2435 (removed 1773) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1041 ms. Remains : 440/2117 places, 662/2435 transitions.
RANDOM walk for 40000 steps (392 resets) in 1181 ms. (33 steps per ms) remains 1/3 properties
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (26 resets) in 117 ms. (339 steps per ms) remains 1/1 properties
// Phase 1: matrix 662 rows 440 cols
[2024-05-26 01:16:38] [INFO ] Computed 55 invariants in 10 ms
[2024-05-26 01:16:38] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 255/277 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 116/393 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 652/1045 variables, 393/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1045 variables, 61/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1045 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 57/1102 variables, 47/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1102 variables, 10/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1102 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1102 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1102/1102 variables, and 566 constraints, problems are : Problem set: 0 solved, 1 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 440/440 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 255/277 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 01:16:38] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-26 01:16:38] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-26 01:16:38] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-26 01:16:38] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-26 01:16:38] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 116/393 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 01:16:38] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-26 01:16:39] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-26 01:16:39] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-26 01:16:39] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-26 01:16:39] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-26 01:16:39] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 652/1045 variables, 393/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1045 variables, 61/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1045 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 57/1102 variables, 47/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1102 variables, 10/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1102 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1102 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1102 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1102/1102 variables, and 578 constraints, problems are : Problem set: 0 solved, 1 unsolved in 946 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 440/440 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 1291ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 76 ms.
Support contains 22 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 662/662 transitions.
Graph (trivial) has 34 edges and 440 vertex of which 2 / 440 are part of one of the 1 SCC in 0 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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 439 transition count 657
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 436 transition count 657
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 7 place count 436 transition count 652
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 17 place count 431 transition count 652
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 20 place count 428 transition count 648
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 428 transition count 648
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 428 transition count 647
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 40 place count 420 transition count 639
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 47 place count 413 transition count 626
Iterating global reduction 3 with 7 rules applied. Total rules applied 54 place count 413 transition count 626
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 55 place count 413 transition count 625
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 57 place count 411 transition count 621
Iterating global reduction 4 with 2 rules applied. Total rules applied 59 place count 411 transition count 621
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 61 place count 411 transition count 619
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -16
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 69 place count 407 transition count 635
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 73 place count 403 transition count 625
Iterating global reduction 5 with 4 rules applied. Total rules applied 77 place count 403 transition count 625
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 78 place count 402 transition count 621
Iterating global reduction 5 with 1 rules applied. Total rules applied 79 place count 402 transition count 621
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 80 place count 401 transition count 619
Iterating global reduction 5 with 1 rules applied. Total rules applied 81 place count 401 transition count 619
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 87 place count 401 transition count 613
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 89 place count 401 transition count 613
Applied a total of 89 rules in 122 ms. Remains 401 /440 variables (removed 39) and now considering 613/662 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 401/440 places, 613/662 transitions.
RANDOM walk for 40000 steps (470 resets) in 223 ms. (178 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (32 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 625854 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :0 out of 1
Probabilistic random walk after 625854 steps, saw 119691 distinct states, run finished after 3007 ms. (steps per millisecond=208 ) properties seen :0
// Phase 1: matrix 613 rows 401 cols
[2024-05-26 01:16:42] [INFO ] Computed 55 invariants in 8 ms
[2024-05-26 01:16:42] [INFO ] State equation strengthened by 69 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 233/255 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 99/354 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 603/957 variables, 354/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/957 variables, 59/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/957 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 57/1014 variables, 47/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1014 variables, 10/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1014 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1014 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1014/1014 variables, and 525 constraints, problems are : Problem set: 0 solved, 1 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 401/401 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 233/255 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 01:16:43] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-26 01:16:43] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2024-05-26 01:16:43] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-26 01:16:43] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 99/354 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 603/957 variables, 354/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/957 variables, 59/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/957 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 57/1014 variables, 47/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1014 variables, 10/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1014 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1014 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1014 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1014/1014 variables, and 530 constraints, problems are : Problem set: 0 solved, 1 unsolved in 538 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 401/401 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 843ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 57 ms.
Support contains 22 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 613/613 transitions.
Applied a total of 0 rules in 11 ms. Remains 401 /401 variables (removed 0) and now considering 613/613 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 401/401 places, 613/613 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 613/613 transitions.
Applied a total of 0 rules in 11 ms. Remains 401 /401 variables (removed 0) and now considering 613/613 (removed 0) transitions.
[2024-05-26 01:16:43] [INFO ] Invariant cache hit.
[2024-05-26 01:16:43] [INFO ] Implicit Places using invariants in 222 ms returned [11, 43, 87, 178, 248, 307, 337, 386]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 230 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 393/401 places, 613/613 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 393 transition count 611
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 391 transition count 609
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 40 place count 374 transition count 592
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 57 place count 374 transition count 575
Applied a total of 57 rules in 21 ms. Remains 374 /393 variables (removed 19) and now considering 575/613 (removed 38) transitions.
// Phase 1: matrix 575 rows 374 cols
[2024-05-26 01:16:44] [INFO ] Computed 47 invariants in 7 ms
[2024-05-26 01:16:44] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-26 01:16:44] [INFO ] Invariant cache hit.
[2024-05-26 01:16:44] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-26 01:16:44] [INFO ] Implicit Places using invariants and state equation in 529 ms returned [6, 10, 29, 30, 33, 34, 38, 39, 74, 75, 78, 79, 97, 98, 103, 104, 107, 108, 146, 147, 148, 149, 152, 153, 154, 158, 159, 160, 164, 165, 167, 220, 221, 222, 225, 226, 227, 230, 231, 232, 282, 283, 287, 304, 305, 306, 309, 310, 314, 315, 358, 361]
Discarding 52 places :
Implicit Place search using SMT with State Equation took 723 ms to find 52 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 322/401 places, 575/613 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 322 transition count 568
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 315 transition count 568
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 82 place count 281 transition count 534
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 106 place count 269 transition count 547
Free-agglomeration rule (complex) applied 55 times.
Iterating global reduction 2 with 55 rules applied. Total rules applied 161 place count 269 transition count 520
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 62 rules applied. Total rules applied 223 place count 214 transition count 513
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 225 place count 214 transition count 511
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 233 place count 214 transition count 511
Applied a total of 233 rules in 65 ms. Remains 214 /322 variables (removed 108) and now considering 511/575 (removed 64) transitions.
[2024-05-26 01:16:44] [INFO ] Flow matrix only has 503 transitions (discarded 8 similar events)
// Phase 1: matrix 503 rows 214 cols
[2024-05-26 01:16:44] [INFO ] Computed 34 invariants in 3 ms
[2024-05-26 01:16:44] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-26 01:16:44] [INFO ] Flow matrix only has 503 transitions (discarded 8 similar events)
[2024-05-26 01:16:44] [INFO ] Invariant cache hit.
[2024-05-26 01:16:45] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-26 01:16:45] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 214/401 places, 511/613 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1530 ms. Remains : 214/401 places, 511/613 transitions.
RANDOM walk for 40000 steps (550 resets) in 702 ms. (56 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (34 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 799652 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :0 out of 1
Probabilistic random walk after 799652 steps, saw 136063 distinct states, run finished after 3001 ms. (steps per millisecond=266 ) properties seen :0
[2024-05-26 01:16:48] [INFO ] Flow matrix only has 503 transitions (discarded 8 similar events)
[2024-05-26 01:16:48] [INFO ] Invariant cache hit.
[2024-05-26 01:16:48] [INFO ] State equation strengthened by 110 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/117 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/153 variables, 9/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 424/577 variables, 153/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 8/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 140/717 variables, 61/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/717 variables, 102/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/717 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/717 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 717/717 variables, and 358 constraints, problems are : Problem set: 0 solved, 1 unsolved in 365 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 214/214 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/117 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/153 variables, 9/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 424/577 variables, 153/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 8/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 140/717 variables, 61/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/717 variables, 102/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/717 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/717 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/717 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 717/717 variables, and 359 constraints, problems are : Problem set: 0 solved, 1 unsolved in 352 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 214/214 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 737ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 74 ms.
Support contains 22 out of 214 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 511/511 transitions.
Applied a total of 0 rules in 8 ms. Remains 214 /214 variables (removed 0) and now considering 511/511 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 214/214 places, 511/511 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 511/511 transitions.
Applied a total of 0 rules in 18 ms. Remains 214 /214 variables (removed 0) and now considering 511/511 (removed 0) transitions.
[2024-05-26 01:16:49] [INFO ] Flow matrix only has 503 transitions (discarded 8 similar events)
[2024-05-26 01:16:49] [INFO ] Invariant cache hit.
[2024-05-26 01:16:50] [INFO ] Implicit Places using invariants in 692 ms returned []
[2024-05-26 01:16:50] [INFO ] Flow matrix only has 503 transitions (discarded 8 similar events)
[2024-05-26 01:16:50] [INFO ] Invariant cache hit.
[2024-05-26 01:16:50] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-26 01:16:50] [INFO ] Implicit Places using invariants and state equation in 594 ms returned []
Implicit Place search using SMT with State Equation took 1291 ms to find 0 implicit places.
[2024-05-26 01:16:50] [INFO ] Redundant transitions in 54 ms returned []
Running 495 sub problems to find dead transitions.
[2024-05-26 01:16:50] [INFO ] Flow matrix only has 503 transitions (discarded 8 similar events)
[2024-05-26 01:16:50] [INFO ] Invariant cache hit.
[2024-05-26 01:16:50] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 3 (OVERLAPS) 503/717 variables, 214/248 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/717 variables, 110/358 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/717 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 495 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/717 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 495 unsolved
No progress, stopping.
After SMT solving in domain Real declared 717/717 variables, and 358 constraints, problems are : Problem set: 0 solved, 495 unsolved in 25852 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 214/214 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 495/495 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 495 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 3 (OVERLAPS) 503/717 variables, 214/248 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/717 variables, 110/358 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/717 variables, 495/853 constraints. Problems are: Problem set: 0 solved, 495 unsolved
[2024-05-26 01:17:28] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/717 variables, 1/854 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/717 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 495 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 717/717 variables, and 854 constraints, problems are : Problem set: 0 solved, 495 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 214/214 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 495/495 constraints, Known Traps: 1/1 constraints]
After SMT, in 56436ms problems are : Problem set: 0 solved, 495 unsolved
Search for dead transitions found 0 dead transitions in 56443ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57815 ms. Remains : 214/214 places, 511/511 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 66 edges and 214 vertex of which 34 / 214 are part of one of the 17 SCC in 0 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Graph (complete) has 675 edges and 197 vertex of which 183 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 38 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 183 transition count 388
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 72 place count 181 transition count 386
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 74 place count 181 transition count 384
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 180 transition count 392
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 2 with 22 rules applied. Total rules applied 98 place count 180 transition count 370
Partial Free-agglomeration rule applied 19 times.
Drop transitions (Partial Free agglomeration) removed 19 transitions
Iterating global reduction 2 with 19 rules applied. Total rules applied 117 place count 180 transition count 370
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 119 place count 180 transition count 368
Applied a total of 119 rules in 25 ms. Remains 180 /214 variables (removed 34) and now considering 368/511 (removed 143) transitions.
Running SMT prover for 1 properties.
[2024-05-26 01:17:47] [INFO ] Flow matrix only has 364 transitions (discarded 4 similar events)
// Phase 1: matrix 364 rows 180 cols
[2024-05-26 01:17:47] [INFO ] Computed 28 invariants in 2 ms
[2024-05-26 01:17:47] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 01:17:47] [INFO ] [Nat]Absence check using 28 positive place invariants in 4 ms returned sat
[2024-05-26 01:17:48] [INFO ] After 718ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 01:17:48] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-26 01:17:48] [INFO ] After 36ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-26 01:17:48] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-26 01:17:48] [INFO ] After 969ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1115 ms.
[2024-05-26 01:17:48] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2024-05-26 01:17:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 214 places, 511 transitions and 2632 arcs took 6 ms.
[2024-05-26 01:17:49] [INFO ] Flatten gal took : 223 ms
Total runtime 80892 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running NoC3x3-PT-3B

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/405/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 214
TRANSITIONS: 511
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.014s, Sys 0.000s]


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


----------------------------------------------------------------------
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: 731
MODEL NAME: /home/mcc/execution/405/model
214 places, 511 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 NoC3x3-PT-3B-ReachabilityCardinality-2024-03 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716686882510

--------------------
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
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="NoC3x3-PT-3B"
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 NoC3x3-PT-3B, 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 r245-tall-171654350200598"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-3B.tgz
mv NoC3x3-PT-3B 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 ;