Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r009-oct2-167813597500150.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ASLink-PT-09b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597500150
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 5.9K Feb 26 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 13:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 13:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.3M Mar 5 18:22 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 ASLink-PT-09b-ReachabilityCardinality-00
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-01
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-02
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-03
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-04
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-05
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-06
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-07
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-08
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-09
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-10
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-11
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-12
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-13
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-14
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678617645216

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-09b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 10:40:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 10:40:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 10:40:48] [INFO ] Load time of PNML (sax parser for PT used): 227 ms
[2023-03-12 10:40:48] [INFO ] Transformed 4014 places.
[2023-03-12 10:40:48] [INFO ] Transformed 4932 transitions.
[2023-03-12 10:40:48] [INFO ] Found NUPN structural information;
[2023-03-12 10:40:48] [INFO ] Parsed PT model containing 4014 places and 4932 transitions and 14960 arcs in 405 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-09b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 13 resets, run finished after 658 ms. (steps per millisecond=15 ) properties (out of 15) seen :5
FORMULA ASLink-PT-09b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 4932 rows 4014 cols
[2023-03-12 10:40:50] [INFO ] Computed 394 place invariants in 291 ms
[2023-03-12 10:40:52] [INFO ] After 1636ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 10:40:54] [INFO ] [Nat]Absence check using 93 positive place invariants in 60 ms returned sat
[2023-03-12 10:40:54] [INFO ] [Nat]Absence check using 93 positive and 301 generalized place invariants in 351 ms returned sat
[2023-03-12 10:41:17] [INFO ] After 21794ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2023-03-12 10:41:17] [INFO ] After 21823ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-12 10:41:17] [INFO ] After 25069ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
FORMULA ASLink-PT-09b-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 65 out of 4014 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4014/4014 places, 4932/4932 transitions.
Drop transitions removed 902 transitions
Trivial Post-agglo rules discarded 902 transitions
Performed 902 trivial Post agglomeration. Transition count delta: 902
Iterating post reduction 0 with 902 rules applied. Total rules applied 902 place count 4014 transition count 4030
Reduce places removed 902 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 944 rules applied. Total rules applied 1846 place count 3112 transition count 3988
Reduce places removed 11 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 2 with 24 rules applied. Total rules applied 1870 place count 3101 transition count 3975
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 1883 place count 3088 transition count 3975
Performed 901 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 901 Pre rules applied. Total rules applied 1883 place count 3088 transition count 3074
Deduced a syphon composed of 901 places in 11 ms
Ensure Unique test removed 85 places
Reduce places removed 986 places and 0 transitions.
Iterating global reduction 4 with 1887 rules applied. Total rules applied 3770 place count 2102 transition count 3074
Discarding 14 places :
Implicit places reduction removed 14 places
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 4 with 71 rules applied. Total rules applied 3841 place count 2088 transition count 3017
Reduce places removed 57 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 5 with 61 rules applied. Total rules applied 3902 place count 2031 transition count 3013
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 3906 place count 2027 transition count 3013
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 28 Pre rules applied. Total rules applied 3906 place count 2027 transition count 2985
Deduced a syphon composed of 28 places in 19 ms
Ensure Unique test removed 22 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 7 with 78 rules applied. Total rules applied 3984 place count 1977 transition count 2985
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 22 Pre rules applied. Total rules applied 3984 place count 1977 transition count 2963
Deduced a syphon composed of 22 places in 18 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 4028 place count 1955 transition count 2963
Discarding 126 places :
Symmetric choice reduction at 7 with 126 rule applications. Total rules 4154 place count 1829 transition count 2837
Iterating global reduction 7 with 126 rules applied. Total rules applied 4280 place count 1829 transition count 2837
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 39 Pre rules applied. Total rules applied 4280 place count 1829 transition count 2798
Deduced a syphon composed of 39 places in 9 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 78 rules applied. Total rules applied 4358 place count 1790 transition count 2798
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 4367 place count 1781 transition count 2741
Iterating global reduction 7 with 9 rules applied. Total rules applied 4376 place count 1781 transition count 2741
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 8 Pre rules applied. Total rules applied 4376 place count 1781 transition count 2733
Deduced a syphon composed of 8 places in 8 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 4392 place count 1773 transition count 2733
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4393 place count 1772 transition count 2725
Iterating global reduction 7 with 1 rules applied. Total rules applied 4394 place count 1772 transition count 2725
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4395 place count 1771 transition count 2717
Iterating global reduction 7 with 1 rules applied. Total rules applied 4396 place count 1771 transition count 2717
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4397 place count 1770 transition count 2709
Iterating global reduction 7 with 1 rules applied. Total rules applied 4398 place count 1770 transition count 2709
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4399 place count 1769 transition count 2701
Iterating global reduction 7 with 1 rules applied. Total rules applied 4400 place count 1769 transition count 2701
Performed 241 Post agglomeration using F-continuation condition.Transition count delta: 241
Deduced a syphon composed of 241 places in 6 ms
Ensure Unique test removed 6 places
Reduce places removed 247 places and 0 transitions.
Iterating global reduction 7 with 488 rules applied. Total rules applied 4888 place count 1522 transition count 2460
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4889 place count 1521 transition count 2459
Ensure Unique test removed 1 places
Iterating global reduction 7 with 2 rules applied. Total rules applied 4891 place count 1520 transition count 2459
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4892 place count 1519 transition count 2458
Iterating global reduction 7 with 1 rules applied. Total rules applied 4893 place count 1519 transition count 2458
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 4895 place count 1519 transition count 2456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4896 place count 1518 transition count 2456
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 4900 place count 1516 transition count 2468
Free-agglomeration rule applied 15 times.
Iterating global reduction 9 with 15 rules applied. Total rules applied 4915 place count 1516 transition count 2453
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 4930 place count 1501 transition count 2453
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 10 with 9 rules applied. Total rules applied 4939 place count 1501 transition count 2444
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 4948 place count 1492 transition count 2444
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4949 place count 1491 transition count 2443
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 11 with 23 rules applied. Total rules applied 4972 place count 1475 transition count 2436
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 4979 place count 1468 transition count 2436
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 23 Pre rules applied. Total rules applied 4979 place count 1468 transition count 2413
Deduced a syphon composed of 23 places in 18 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 13 with 46 rules applied. Total rules applied 5025 place count 1445 transition count 2413
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 13 with 8 rules applied. Total rules applied 5033 place count 1437 transition count 2413
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 7 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 14 with 34 rules applied. Total rules applied 5067 place count 1420 transition count 2396
Discarding 8 places :
Symmetric choice reduction at 14 with 8 rule applications. Total rules 5075 place count 1412 transition count 2388
Iterating global reduction 14 with 8 rules applied. Total rules applied 5083 place count 1412 transition count 2388
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 5084 place count 1411 transition count 2387
Iterating global reduction 14 with 1 rules applied. Total rules applied 5085 place count 1411 transition count 2387
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 5086 place count 1411 transition count 2386
Free-agglomeration rule applied 7 times.
Iterating global reduction 15 with 7 rules applied. Total rules applied 5093 place count 1411 transition count 2379
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 15 with 7 rules applied. Total rules applied 5100 place count 1404 transition count 2379
Applied a total of 5100 rules in 2683 ms. Remains 1404 /4014 variables (removed 2610) and now considering 2379/4932 (removed 2553) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2684 ms. Remains : 1404/4014 places, 2379/4932 transitions.
Incomplete random walk after 10000 steps, including 81 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 9) seen :2
FORMULA ASLink-PT-09b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2379 rows 1404 cols
[2023-03-12 10:41:20] [INFO ] Computed 242 place invariants in 24 ms
[2023-03-12 10:41:21] [INFO ] After 430ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 10:41:21] [INFO ] [Nat]Absence check using 60 positive place invariants in 51 ms returned sat
[2023-03-12 10:41:21] [INFO ] [Nat]Absence check using 60 positive and 182 generalized place invariants in 102 ms returned sat
[2023-03-12 10:41:40] [INFO ] After 18386ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 10:41:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 10:41:42] [INFO ] After 1523ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 10:41:46] [INFO ] After 5625ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-12 10:41:46] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 355 ms.
Support contains 54 out of 1404 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1404/1404 places, 2379/2379 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1404 transition count 2377
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1402 transition count 2377
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4 place count 1402 transition count 2370
Deduced a syphon composed of 7 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 19 place count 1394 transition count 2370
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 19 place count 1394 transition count 2369
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 1393 transition count 2369
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 27 place count 1390 transition count 2366
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 1390 transition count 2366
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 1388 transition count 2364
Applied a total of 30 rules in 333 ms. Remains 1388 /1404 variables (removed 16) and now considering 2364/2379 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 345 ms. Remains : 1388/1404 places, 2364/2379 transitions.
Incomplete random walk after 10000 steps, including 88 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 7) seen :1
FORMULA ASLink-PT-09b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2364 rows 1388 cols
[2023-03-12 10:41:47] [INFO ] Computed 241 place invariants in 50 ms
[2023-03-12 10:41:48] [INFO ] After 314ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 10:41:48] [INFO ] [Nat]Absence check using 59 positive place invariants in 21 ms returned sat
[2023-03-12 10:41:48] [INFO ] [Nat]Absence check using 59 positive and 182 generalized place invariants in 61 ms returned sat
[2023-03-12 10:42:09] [INFO ] After 20293ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 10:42:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 10:42:13] [INFO ] After 4076ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 10:42:13] [INFO ] After 4092ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-12 10:42:13] [INFO ] After 25038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 423 ms.
Support contains 53 out of 1388 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1388/1388 places, 2364/2364 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1388 transition count 2363
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1387 transition count 2363
Applied a total of 2 rules in 61 ms. Remains 1387 /1388 variables (removed 1) and now considering 2363/2364 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 1387/1388 places, 2363/2364 transitions.
Incomplete random walk after 10000 steps, including 86 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 105268 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 105268 steps, saw 27106 distinct states, run finished after 3003 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2363 rows 1387 cols
[2023-03-12 10:42:17] [INFO ] Computed 241 place invariants in 22 ms
[2023-03-12 10:42:17] [INFO ] After 368ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 10:42:18] [INFO ] [Nat]Absence check using 59 positive place invariants in 53 ms returned sat
[2023-03-12 10:42:18] [INFO ] [Nat]Absence check using 59 positive and 182 generalized place invariants in 112 ms returned sat
[2023-03-12 10:42:31] [INFO ] After 13212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 10:42:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 10:42:39] [INFO ] After 8242ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 10:42:42] [INFO ] After 11076ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-12 10:42:42] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 927 ms.
Support contains 53 out of 1387 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1387/1387 places, 2363/2363 transitions.
Applied a total of 0 rules in 49 ms. Remains 1387 /1387 variables (removed 0) and now considering 2363/2363 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 1387/1387 places, 2363/2363 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1387/1387 places, 2363/2363 transitions.
Applied a total of 0 rules in 49 ms. Remains 1387 /1387 variables (removed 0) and now considering 2363/2363 (removed 0) transitions.
[2023-03-12 10:42:43] [INFO ] Invariant cache hit.
[2023-03-12 10:42:45] [INFO ] Implicit Places using invariants in 1374 ms returned [1, 18, 19, 49, 67, 119, 143, 147, 160, 161, 164, 182, 200, 253, 266, 281, 286, 300, 301, 303, 320, 338, 408, 413, 414, 425, 426, 466, 485, 519, 543, 544, 549, 550, 561, 562, 564, 582, 600, 640, 675, 677, 681, 682, 693, 694, 696, 713, 732, 772, 786, 814, 829, 830, 832, 849, 867, 902, 929, 946, 950, 951, 962, 963, 965, 982, 1000, 1070, 1074, 1075, 1086, 1087, 1089, 1106, 1124, 1195, 1199, 1200, 1203, 1214, 1216, 1217, 1248, 1250, 1254, 1272, 1273, 1274, 1275, 1287, 1293, 1299, 1305, 1311, 1317, 1323, 1329, 1335, 1342, 1348, 1386]
Discarding 101 places :
Implicit Place search using SMT only with invariants took 1392 ms to find 101 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1286/1387 places, 2363/2363 transitions.
Drop transitions removed 134 transitions
Trivial Post-agglo rules discarded 134 transitions
Performed 134 trivial Post agglomeration. Transition count delta: 134
Iterating post reduction 0 with 134 rules applied. Total rules applied 134 place count 1286 transition count 2229
Reduce places removed 134 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 149 rules applied. Total rules applied 283 place count 1152 transition count 2214
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 296 place count 1139 transition count 2214
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 296 place count 1139 transition count 2172
Deduced a syphon composed of 42 places in 10 ms
Ensure Unique test removed 1 places
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 85 rules applied. Total rules applied 381 place count 1096 transition count 2172
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 393 place count 1084 transition count 2160
Iterating global reduction 3 with 12 rules applied. Total rules applied 405 place count 1084 transition count 2160
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 409 place count 1080 transition count 2153
Iterating global reduction 3 with 4 rules applied. Total rules applied 413 place count 1080 transition count 2153
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 415 place count 1078 transition count 2151
Iterating global reduction 3 with 2 rules applied. Total rules applied 417 place count 1078 transition count 2151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 418 place count 1078 transition count 2150
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 419 place count 1077 transition count 2148
Iterating global reduction 4 with 1 rules applied. Total rules applied 420 place count 1077 transition count 2148
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 5 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 4 with 130 rules applied. Total rules applied 550 place count 1012 transition count 2083
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 557 place count 1005 transition count 2075
Iterating global reduction 4 with 7 rules applied. Total rules applied 564 place count 1005 transition count 2075
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 569 place count 1005 transition count 2070
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 573 place count 1003 transition count 2071
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 580 place count 1003 transition count 2064
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 582 place count 1003 transition count 2062
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 584 place count 1001 transition count 2062
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 6 with 25 rules applied. Total rules applied 609 place count 1001 transition count 2037
Ensure Unique test removed 5 places
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 6 with 30 rules applied. Total rules applied 639 place count 971 transition count 2037
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 642 place count 968 transition count 2034
Iterating global reduction 7 with 3 rules applied. Total rules applied 645 place count 968 transition count 2034
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 648 place count 968 transition count 2031
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 649 place count 968 transition count 2030
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 8 with 24 rules applied. Total rules applied 673 place count 968 transition count 2030
Applied a total of 673 rules in 715 ms. Remains 968 /1286 variables (removed 318) and now considering 2030/2363 (removed 333) transitions.
// Phase 1: matrix 2030 rows 968 cols
[2023-03-12 10:42:45] [INFO ] Computed 134 place invariants in 18 ms
[2023-03-12 10:42:46] [INFO ] Implicit Places using invariants in 700 ms returned [74, 107, 110, 181, 211, 213, 226, 299, 305, 308, 310, 317, 318, 412, 427, 428, 483, 502, 508, 511, 521, 522, 603, 606, 608, 611, 618, 619, 674, 693, 704, 716, 717, 770, 787, 793, 796, 798, 803, 804, 857, 874, 881, 884, 886]
Discarding 45 places :
Implicit Place search using SMT only with invariants took 704 ms to find 45 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 923/1387 places, 2030/2363 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 910 transition count 2017
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 910 transition count 2017
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 906 transition count 2013
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 906 transition count 2013
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 62 place count 892 transition count 1999
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 63 place count 892 transition count 1998
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 78 place count 892 transition count 1983
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 93 place count 877 transition count 1983
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 98 place count 877 transition count 1978
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 103 place count 872 transition count 1978
Applied a total of 103 rules in 240 ms. Remains 872 /923 variables (removed 51) and now considering 1978/2030 (removed 52) transitions.
// Phase 1: matrix 1978 rows 872 cols
[2023-03-12 10:42:46] [INFO ] Computed 89 place invariants in 34 ms
[2023-03-12 10:42:47] [INFO ] Implicit Places using invariants in 825 ms returned []
[2023-03-12 10:42:47] [INFO ] Invariant cache hit.
[2023-03-12 10:42:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 10:42:50] [INFO ] Implicit Places using invariants and state equation in 2916 ms returned []
Implicit Place search using SMT with State Equation took 3760 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 872/1387 places, 1978/2363 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6873 ms. Remains : 872/1387 places, 1978/2363 transitions.
Incomplete random walk after 10000 steps, including 128 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 6) seen :1
FORMULA ASLink-PT-09b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-12 10:42:51] [INFO ] Invariant cache hit.
[2023-03-12 10:42:51] [INFO ] After 285ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 10:42:51] [INFO ] [Nat]Absence check using 19 positive place invariants in 29 ms returned sat
[2023-03-12 10:42:51] [INFO ] [Nat]Absence check using 19 positive and 70 generalized place invariants in 94 ms returned sat
[2023-03-12 10:43:06] [INFO ] After 14162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 10:43:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 10:43:07] [INFO ] After 1698ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 10:43:08] [INFO ] Deduced a trap composed of 52 places in 651 ms of which 15 ms to minimize.
[2023-03-12 10:43:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 793 ms
[2023-03-12 10:43:16] [INFO ] After 10314ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-12 10:43:16] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 121 ms.
Support contains 52 out of 872 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 872/872 places, 1978/1978 transitions.
Applied a total of 0 rules in 33 ms. Remains 872 /872 variables (removed 0) and now considering 1978/1978 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 872/872 places, 1978/1978 transitions.
Incomplete random walk after 10000 steps, including 115 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 126337 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{4=1}
Probabilistic random walk after 126337 steps, saw 57501 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :1
FORMULA ASLink-PT-09b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 4 properties.
[2023-03-12 10:43:20] [INFO ] Invariant cache hit.
[2023-03-12 10:43:20] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 10:43:20] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2023-03-12 10:43:20] [INFO ] [Nat]Absence check using 19 positive and 70 generalized place invariants in 26 ms returned sat
[2023-03-12 10:43:35] [INFO ] After 15140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 10:43:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 10:43:36] [INFO ] After 778ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 10:43:37] [INFO ] After 1356ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 8297 ms.
[2023-03-12 10:43:45] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 135 ms.
Support contains 51 out of 872 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 872/872 places, 1978/1978 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 872 transition count 1977
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 871 transition count 1977
Applied a total of 2 rules in 42 ms. Remains 871 /872 variables (removed 1) and now considering 1977/1978 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 871/872 places, 1977/1978 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 77827 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77827 steps, saw 35365 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1977 rows 871 cols
[2023-03-12 10:43:49] [INFO ] Computed 89 place invariants in 20 ms
[2023-03-12 10:43:49] [INFO ] After 289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 10:43:49] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2023-03-12 10:43:49] [INFO ] [Nat]Absence check using 21 positive and 68 generalized place invariants in 221 ms returned sat
[2023-03-12 10:44:05] [INFO ] After 15627ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 10:44:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 10:44:05] [INFO ] After 326ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 10:44:06] [INFO ] After 854ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7915 ms.
[2023-03-12 10:44:14] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 44 ms.
Support contains 51 out of 871 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 871/871 places, 1977/1977 transitions.
Applied a total of 0 rules in 44 ms. Remains 871 /871 variables (removed 0) and now considering 1977/1977 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 871/871 places, 1977/1977 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 871/871 places, 1977/1977 transitions.
Applied a total of 0 rules in 33 ms. Remains 871 /871 variables (removed 0) and now considering 1977/1977 (removed 0) transitions.
[2023-03-12 10:44:14] [INFO ] Invariant cache hit.
[2023-03-12 10:44:15] [INFO ] Implicit Places using invariants in 1259 ms returned []
[2023-03-12 10:44:15] [INFO ] Invariant cache hit.
[2023-03-12 10:44:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 10:44:19] [INFO ] Implicit Places using invariants and state equation in 3703 ms returned []
Implicit Place search using SMT with State Equation took 4969 ms to find 0 implicit places.
[2023-03-12 10:44:19] [INFO ] Redundant transitions in 159 ms returned []
[2023-03-12 10:44:19] [INFO ] Invariant cache hit.
[2023-03-12 10:44:21] [INFO ] Dead Transitions using invariants and state equation in 1665 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6865 ms. Remains : 871/871 places, 1977/1977 transitions.
Graph (complete) has 4753 edges and 871 vertex of which 870 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 870 transition count 1974
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 867 transition count 1974
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 866 transition count 1974
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 865 transition count 1973
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 865 transition count 1972
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 864 transition count 1972
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 864 transition count 1971
Applied a total of 13 rules in 211 ms. Remains 864 /871 variables (removed 7) and now considering 1971/1977 (removed 6) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1971 rows 864 cols
[2023-03-12 10:44:21] [INFO ] Computed 87 place invariants in 29 ms
[2023-03-12 10:44:21] [INFO ] After 273ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 10:44:22] [INFO ] [Nat]Absence check using 20 positive place invariants in 96 ms returned sat
[2023-03-12 10:44:22] [INFO ] [Nat]Absence check using 20 positive and 67 generalized place invariants in 31 ms returned sat
[2023-03-12 10:44:39] [INFO ] After 17102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 10:44:49] [INFO ] Deduced a trap composed of 53 places in 369 ms of which 2 ms to minimize.
[2023-03-12 10:44:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 488 ms
[2023-03-12 10:44:49] [INFO ] Deduced a trap composed of 59 places in 334 ms of which 23 ms to minimize.
[2023-03-12 10:44:50] [INFO ] Deduced a trap composed of 50 places in 394 ms of which 0 ms to minimize.
[2023-03-12 10:44:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 925 ms
[2023-03-12 10:44:50] [INFO ] After 27994ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 508 ms.
[2023-03-12 10:44:50] [INFO ] After 29043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-12 10:44:50] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 10 ms.
[2023-03-12 10:44:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 871 places, 1977 transitions and 7874 arcs took 16 ms.
[2023-03-12 10:44:51] [INFO ] Flatten gal took : 262 ms
Total runtime 243232 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/583/inv_0_ --invariant=/tmp/583/inv_1_ --invariant=/tmp/583/inv_2_ --invariant=/tmp/583/inv_3_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 13283468 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16095224 kB

BK_TIME_CONFINEMENT_REACHED

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

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

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="ASLink-PT-09b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is ASLink-PT-09b, 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 r009-oct2-167813597500150"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-09b.tgz
mv ASLink-PT-09b 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 ;