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.r011-oct2-167813599800166.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 smartxred
Input is ASLink-PT-10b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-oct2-167813599800166
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 7.5K Feb 26 13:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 13:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 13:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 13:10 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.6K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 17K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 13:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Feb 26 13:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 13:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 26 13:11 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.4M 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-10b-ReachabilityCardinality-00
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-01
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-02
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-03
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-04
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-05
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-06
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-07
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-08
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-09
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-10
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-11
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-12
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-13
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-14
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678730408699

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-10b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 18:00:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 18:00:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 18:00:12] [INFO ] Load time of PNML (sax parser for PT used): 245 ms
[2023-03-13 18:00:12] [INFO ] Transformed 4410 places.
[2023-03-13 18:00:12] [INFO ] Transformed 5405 transitions.
[2023-03-13 18:00:12] [INFO ] Found NUPN structural information;
[2023-03-13 18:00:12] [INFO ] Parsed PT model containing 4410 places and 5405 transitions and 16377 arcs in 452 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-10b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 10 resets, run finished after 577 ms. (steps per millisecond=17 ) properties (out of 14) seen :7
FORMULA ASLink-PT-10b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 5405 rows 4410 cols
[2023-03-13 18:00:13] [INFO ] Computed 433 place invariants in 204 ms
[2023-03-13 18:00:15] [INFO ] After 1586ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-13 18:00:17] [INFO ] [Nat]Absence check using 102 positive place invariants in 184 ms returned sat
[2023-03-13 18:00:17] [INFO ] [Nat]Absence check using 102 positive and 331 generalized place invariants in 355 ms returned sat
[2023-03-13 18:00:40] [INFO ] After 21923ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-13 18:00:40] [INFO ] After 21937ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-13 18:00:40] [INFO ] After 25086ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA ASLink-PT-10b-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 3 different solutions.
FORMULA ASLink-PT-10b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 159 ms.
Support contains 67 out of 4410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4410/4410 places, 5405/5405 transitions.
Drop transitions removed 1003 transitions
Trivial Post-agglo rules discarded 1003 transitions
Performed 1003 trivial Post agglomeration. Transition count delta: 1003
Iterating post reduction 0 with 1003 rules applied. Total rules applied 1003 place count 4410 transition count 4402
Reduce places removed 1003 places and 0 transitions.
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 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 1047 rules applied. Total rules applied 2050 place count 3407 transition count 4358
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 2074 place count 3396 transition count 4345
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 2087 place count 3383 transition count 4345
Performed 994 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 994 Pre rules applied. Total rules applied 2087 place count 3383 transition count 3351
Deduced a syphon composed of 994 places in 49 ms
Ensure Unique test removed 92 places
Reduce places removed 1086 places and 0 transitions.
Iterating global reduction 4 with 2080 rules applied. Total rules applied 4167 place count 2297 transition count 3351
Discarding 17 places :
Implicit places reduction removed 17 places
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 4 with 72 rules applied. Total rules applied 4239 place count 2280 transition count 3296
Reduce places removed 55 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 5 with 58 rules applied. Total rules applied 4297 place count 2225 transition count 3293
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 4300 place count 2222 transition count 3293
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 36 Pre rules applied. Total rules applied 4300 place count 2222 transition count 3257
Deduced a syphon composed of 36 places in 10 ms
Ensure Unique test removed 33 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 7 with 105 rules applied. Total rules applied 4405 place count 2153 transition count 3257
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 4406 place count 2152 transition count 3257
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 33 Pre rules applied. Total rules applied 4406 place count 2152 transition count 3224
Deduced a syphon composed of 33 places in 43 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 8 with 66 rules applied. Total rules applied 4472 place count 2119 transition count 3224
Discarding 139 places :
Symmetric choice reduction at 8 with 139 rule applications. Total rules 4611 place count 1980 transition count 3085
Iterating global reduction 8 with 139 rules applied. Total rules applied 4750 place count 1980 transition count 3085
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4751 place count 1980 transition count 3084
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 43 Pre rules applied. Total rules applied 4751 place count 1980 transition count 3041
Deduced a syphon composed of 43 places in 23 ms
Ensure Unique test removed 1 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 9 with 87 rules applied. Total rules applied 4838 place count 1936 transition count 3041
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 4838 place count 1936 transition count 3040
Deduced a syphon composed of 1 places in 33 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 4841 place count 1934 transition count 3040
Discarding 11 places :
Symmetric choice reduction at 9 with 11 rule applications. Total rules 4852 place count 1923 transition count 2971
Iterating global reduction 9 with 11 rules applied. Total rules applied 4863 place count 1923 transition count 2971
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 9 Pre rules applied. Total rules applied 4863 place count 1923 transition count 2962
Deduced a syphon composed of 9 places in 22 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 9 with 18 rules applied. Total rules applied 4881 place count 1914 transition count 2962
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4882 place count 1913 transition count 2954
Iterating global reduction 9 with 1 rules applied. Total rules applied 4883 place count 1913 transition count 2954
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4884 place count 1912 transition count 2946
Iterating global reduction 9 with 1 rules applied. Total rules applied 4885 place count 1912 transition count 2946
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4886 place count 1911 transition count 2938
Iterating global reduction 9 with 1 rules applied. Total rules applied 4887 place count 1911 transition count 2938
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4888 place count 1910 transition count 2930
Iterating global reduction 9 with 1 rules applied. Total rules applied 4889 place count 1910 transition count 2930
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4890 place count 1909 transition count 2922
Iterating global reduction 9 with 1 rules applied. Total rules applied 4891 place count 1909 transition count 2922
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4892 place count 1908 transition count 2914
Iterating global reduction 9 with 1 rules applied. Total rules applied 4893 place count 1908 transition count 2914
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4894 place count 1907 transition count 2906
Iterating global reduction 9 with 1 rules applied. Total rules applied 4895 place count 1907 transition count 2906
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4896 place count 1906 transition count 2898
Iterating global reduction 9 with 1 rules applied. Total rules applied 4897 place count 1906 transition count 2898
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4898 place count 1905 transition count 2890
Iterating global reduction 9 with 1 rules applied. Total rules applied 4899 place count 1905 transition count 2890
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4900 place count 1904 transition count 2882
Iterating global reduction 9 with 1 rules applied. Total rules applied 4901 place count 1904 transition count 2882
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4902 place count 1903 transition count 2874
Iterating global reduction 9 with 1 rules applied. Total rules applied 4903 place count 1903 transition count 2874
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4904 place count 1902 transition count 2866
Iterating global reduction 9 with 1 rules applied. Total rules applied 4905 place count 1902 transition count 2866
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4906 place count 1901 transition count 2858
Iterating global reduction 9 with 1 rules applied. Total rules applied 4907 place count 1901 transition count 2858
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4908 place count 1900 transition count 2850
Iterating global reduction 9 with 1 rules applied. Total rules applied 4909 place count 1900 transition count 2850
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4910 place count 1899 transition count 2842
Iterating global reduction 9 with 1 rules applied. Total rules applied 4911 place count 1899 transition count 2842
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4912 place count 1898 transition count 2834
Iterating global reduction 9 with 1 rules applied. Total rules applied 4913 place count 1898 transition count 2834
Performed 253 Post agglomeration using F-continuation condition.Transition count delta: 253
Deduced a syphon composed of 253 places in 7 ms
Ensure Unique test removed 2 places
Reduce places removed 255 places and 0 transitions.
Iterating global reduction 9 with 508 rules applied. Total rules applied 5421 place count 1643 transition count 2581
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 5422 place count 1642 transition count 2580
Ensure Unique test removed 1 places
Iterating global reduction 9 with 2 rules applied. Total rules applied 5424 place count 1641 transition count 2580
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 5425 place count 1640 transition count 2579
Iterating global reduction 9 with 1 rules applied. Total rules applied 5426 place count 1640 transition count 2579
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 9 with 2 rules applied. Total rules applied 5428 place count 1640 transition count 2577
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 5429 place count 1639 transition count 2577
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 5431 place count 1638 transition count 2586
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 5432 place count 1638 transition count 2585
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 11 with 2 rules applied. Total rules applied 5434 place count 1637 transition count 2584
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 5435 place count 1636 transition count 2584
Free-agglomeration rule applied 14 times.
Iterating global reduction 13 with 14 rules applied. Total rules applied 5449 place count 1636 transition count 2570
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 13 with 14 rules applied. Total rules applied 5463 place count 1622 transition count 2570
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 14 with 16 rules applied. Total rules applied 5479 place count 1622 transition count 2554
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 14 with 16 rules applied. Total rules applied 5495 place count 1606 transition count 2554
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 5496 place count 1605 transition count 2553
Reduce places removed 7 places and 0 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 15 with 8 rules applied. Total rules applied 5504 place count 1598 transition count 2552
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 5505 place count 1597 transition count 2552
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 17 with 11 Pre rules applied. Total rules applied 5505 place count 1597 transition count 2541
Deduced a syphon composed of 11 places in 6 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 17 with 22 rules applied. Total rules applied 5527 place count 1586 transition count 2541
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 17 with 2 rules applied. Total rules applied 5529 place count 1584 transition count 2541
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 6 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 18 with 14 rules applied. Total rules applied 5543 place count 1577 transition count 2534
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 5544 place count 1576 transition count 2533
Iterating global reduction 18 with 1 rules applied. Total rules applied 5545 place count 1576 transition count 2533
Free-agglomeration rule applied 2 times.
Iterating global reduction 18 with 2 rules applied. Total rules applied 5547 place count 1576 transition count 2531
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 5549 place count 1574 transition count 2531
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 5550 place count 1574 transition count 2531
Applied a total of 5550 rules in 3761 ms. Remains 1574 /4410 variables (removed 2836) and now considering 2531/5405 (removed 2874) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3762 ms. Remains : 1574/4410 places, 2531/5405 transitions.
Incomplete random walk after 10000 steps, including 81 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 5) seen :1
FORMULA ASLink-PT-10b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2531 rows 1574 cols
[2023-03-13 18:00:44] [INFO ] Computed 275 place invariants in 32 ms
[2023-03-13 18:00:45] [INFO ] [Real]Absence check using 69 positive place invariants in 61 ms returned sat
[2023-03-13 18:00:45] [INFO ] [Real]Absence check using 69 positive and 206 generalized place invariants in 79 ms returned sat
[2023-03-13 18:00:45] [INFO ] After 511ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 18:00:45] [INFO ] [Nat]Absence check using 69 positive place invariants in 17 ms returned sat
[2023-03-13 18:00:45] [INFO ] [Nat]Absence check using 69 positive and 206 generalized place invariants in 140 ms returned sat
[2023-03-13 18:00:56] [INFO ] After 10919ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 18:00:56] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-13 18:00:57] [INFO ] After 763ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 18:01:04] [INFO ] Deduced a trap composed of 12 places in 715 ms of which 6 ms to minimize.
[2023-03-13 18:01:04] [INFO ] Deduced a trap composed of 8 places in 336 ms of which 1 ms to minimize.
[2023-03-13 18:01:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1686 ms
[2023-03-13 18:01:05] [INFO ] After 8192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 5239 ms.
[2023-03-13 18:01:10] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 92 ms.
Support contains 42 out of 1574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1574/1574 places, 2531/2531 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 0 with 7 rules applied. Total rules applied 7 place count 1574 transition count 2524
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 1566 transition count 2524
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 15 place count 1566 transition count 2510
Deduced a syphon composed of 14 places in 7 ms
Ensure Unique test removed 2 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 45 place count 1550 transition count 2510
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 1549 transition count 2510
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 46 place count 1549 transition count 2508
Deduced a syphon composed of 2 places in 7 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 52 place count 1545 transition count 2508
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 6 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 67 place count 1537 transition count 2501
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 67 place count 1537 transition count 2500
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 1536 transition count 2500
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 70 place count 1535 transition count 2500
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 72 place count 1533 transition count 2498
Iterating global reduction 4 with 2 rules applied. Total rules applied 74 place count 1533 transition count 2498
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 76 place count 1532 transition count 2497
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 78 place count 1532 transition count 2495
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 80 place count 1530 transition count 2495
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 81 place count 1530 transition count 2495
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 82 place count 1529 transition count 2494
Applied a total of 82 rules in 512 ms. Remains 1529 /1574 variables (removed 45) and now considering 2494/2531 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 513 ms. Remains : 1529/1574 places, 2494/2531 transitions.
Incomplete random walk after 10000 steps, including 76 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 91813 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 91813 steps, saw 21194 distinct states, run finished after 3004 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2494 rows 1529 cols
[2023-03-13 18:01:14] [INFO ] Computed 267 place invariants in 105 ms
[2023-03-13 18:01:14] [INFO ] [Real]Absence check using 68 positive place invariants in 16 ms returned sat
[2023-03-13 18:01:14] [INFO ] [Real]Absence check using 68 positive and 199 generalized place invariants in 100 ms returned sat
[2023-03-13 18:01:14] [INFO ] After 434ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 18:01:15] [INFO ] [Nat]Absence check using 68 positive place invariants in 28 ms returned sat
[2023-03-13 18:01:15] [INFO ] [Nat]Absence check using 68 positive and 199 generalized place invariants in 87 ms returned sat
[2023-03-13 18:01:27] [INFO ] After 12099ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 18:01:27] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-13 18:01:37] [INFO ] After 10021ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 18:01:39] [INFO ] After 12360ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-13 18:01:39] [INFO ] After 25048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 141 ms.
Support contains 42 out of 1529 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1529/1529 places, 2494/2494 transitions.
Applied a total of 0 rules in 62 ms. Remains 1529 /1529 variables (removed 0) and now considering 2494/2494 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 1529/1529 places, 2494/2494 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1529/1529 places, 2494/2494 transitions.
Applied a total of 0 rules in 59 ms. Remains 1529 /1529 variables (removed 0) and now considering 2494/2494 (removed 0) transitions.
[2023-03-13 18:01:40] [INFO ] Invariant cache hit.
[2023-03-13 18:01:42] [INFO ] Implicit Places using invariants in 1953 ms returned [2, 20, 21, 24, 34, 51, 69, 151, 164, 167, 168, 171, 208, 290, 303, 304, 305, 306, 311, 328, 346, 420, 446, 447, 448, 449, 451, 468, 486, 563, 567, 568, 579, 581, 582, 584, 603, 621, 660, 696, 700, 701, 712, 713, 715, 732, 750, 819, 823, 824, 835, 836, 838, 855, 875, 953, 967, 968, 970, 989, 1008, 1061, 1081, 1085, 1086, 1097, 1098, 1119, 1137, 1233, 1236, 1237, 1239, 1256, 1274, 1351, 1355, 1356, 1359, 1371, 1372, 1373, 1374, 1392, 1394, 1398, 1416, 1417, 1418, 1420, 1433, 1439, 1445, 1451, 1457, 1463, 1469, 1475, 1481, 1487, 1493]
Discarding 101 places :
Implicit Place search using SMT only with invariants took 1966 ms to find 101 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1428/1529 places, 2494/2494 transitions.
Drop transitions removed 174 transitions
Trivial Post-agglo rules discarded 174 transitions
Performed 174 trivial Post agglomeration. Transition count delta: 174
Iterating post reduction 0 with 174 rules applied. Total rules applied 174 place count 1428 transition count 2320
Reduce places removed 174 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 182 rules applied. Total rules applied 356 place count 1254 transition count 2312
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 362 place count 1248 transition count 2312
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 362 place count 1248 transition count 2258
Deduced a syphon composed of 54 places in 6 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 470 place count 1194 transition count 2258
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 17 rules applied. Total rules applied 487 place count 1185 transition count 2250
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 9 rules applied. Total rules applied 496 place count 1177 transition count 2249
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 497 place count 1176 transition count 2249
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 511 place count 1162 transition count 2235
Iterating global reduction 6 with 14 rules applied. Total rules applied 525 place count 1162 transition count 2235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 526 place count 1162 transition count 2234
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 526 place count 1162 transition count 2233
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 528 place count 1161 transition count 2233
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 531 place count 1158 transition count 2227
Iterating global reduction 7 with 3 rules applied. Total rules applied 534 place count 1158 transition count 2227
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 535 place count 1157 transition count 2226
Iterating global reduction 7 with 1 rules applied. Total rules applied 536 place count 1157 transition count 2226
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 537 place count 1156 transition count 2224
Iterating global reduction 7 with 1 rules applied. Total rules applied 538 place count 1156 transition count 2224
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 5 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 7 with 154 rules applied. Total rules applied 692 place count 1079 transition count 2147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 693 place count 1079 transition count 2146
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 701 place count 1071 transition count 2138
Iterating global reduction 8 with 8 rules applied. Total rules applied 709 place count 1071 transition count 2138
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 715 place count 1071 transition count 2132
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 719 place count 1069 transition count 2133
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 720 place count 1069 transition count 2132
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 723 place count 1069 transition count 2129
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 727 place count 1066 transition count 2128
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 10 with 24 rules applied. Total rules applied 751 place count 1066 transition count 2104
Ensure Unique test removed 2 places
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 10 with 26 rules applied. Total rules applied 777 place count 1040 transition count 2104
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 779 place count 1040 transition count 2102
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 11 with 29 rules applied. Total rules applied 808 place count 1040 transition count 2102
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 809 place count 1040 transition count 2102
Applied a total of 809 rules in 809 ms. Remains 1040 /1428 variables (removed 388) and now considering 2102/2494 (removed 392) transitions.
// Phase 1: matrix 2102 rows 1040 cols
[2023-03-13 18:01:43] [INFO ] Computed 155 place invariants in 56 ms
[2023-03-13 18:01:43] [INFO ] Implicit Places using invariants in 842 ms returned [91, 97, 101, 104, 107, 114, 115, 174, 195, 203, 209, 211, 276, 293, 300, 303, 310, 315, 316, 368, 393, 396, 398, 407, 408, 466, 485, 491, 494, 496, 501, 502, 554, 571, 577, 580, 582, 587, 588, 660, 666, 669, 671, 675, 682, 683, 739, 764, 767, 769, 858, 864, 867, 870, 873, 881, 882, 937, 954, 960, 963, 965, 1037]
Discarding 63 places :
Implicit Place search using SMT only with invariants took 845 ms to find 63 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 977/1529 places, 2102/2494 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 977 transition count 2101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 976 transition count 2101
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 27 place count 951 transition count 2076
Iterating global reduction 2 with 25 rules applied. Total rules applied 52 place count 951 transition count 2076
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 60 place count 943 transition count 2068
Iterating global reduction 2 with 8 rules applied. Total rules applied 68 place count 943 transition count 2068
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 941 transition count 2066
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 941 transition count 2066
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 940 transition count 2065
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 940 transition count 2065
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 939 transition count 2064
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 939 transition count 2064
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 108 place count 923 transition count 2048
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 111 place count 923 transition count 2045
Free-agglomeration rule applied 27 times.
Iterating global reduction 2 with 27 rules applied. Total rules applied 138 place count 923 transition count 2018
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 165 place count 896 transition count 2018
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 171 place count 896 transition count 2012
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 177 place count 890 transition count 2012
Applied a total of 177 rules in 343 ms. Remains 890 /977 variables (removed 87) and now considering 2012/2102 (removed 90) transitions.
// Phase 1: matrix 2012 rows 890 cols
[2023-03-13 18:01:44] [INFO ] Computed 92 place invariants in 42 ms
[2023-03-13 18:01:44] [INFO ] Implicit Places using invariants in 577 ms returned []
[2023-03-13 18:01:44] [INFO ] Invariant cache hit.
[2023-03-13 18:01:46] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-13 18:01:48] [INFO ] Implicit Places using invariants and state equation in 3493 ms returned []
Implicit Place search using SMT with State Equation took 4087 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 890/1529 places, 2012/2494 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 8119 ms. Remains : 890/1529 places, 2012/2494 transitions.
Incomplete random walk after 10000 steps, including 123 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 144961 steps, run timeout after 3004 ms. (steps per millisecond=48 ) properties seen :{0=1}
Probabilistic random walk after 144961 steps, saw 55169 distinct states, run finished after 3004 ms. (steps per millisecond=48 ) properties seen :1
FORMULA ASLink-PT-10b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
[2023-03-13 18:01:51] [INFO ] Invariant cache hit.
[2023-03-13 18:01:51] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2023-03-13 18:01:51] [INFO ] [Real]Absence check using 20 positive and 72 generalized place invariants in 65 ms returned sat
[2023-03-13 18:01:51] [INFO ] After 242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 18:01:52] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-13 18:01:52] [INFO ] [Nat]Absence check using 20 positive and 72 generalized place invariants in 149 ms returned sat
[2023-03-13 18:02:11] [INFO ] After 18804ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 18:02:11] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-13 18:02:11] [INFO ] After 536ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 18:02:12] [INFO ] After 905ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 908 ms.
[2023-03-13 18:02:13] [INFO ] After 21091ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 39 ms.
Support contains 41 out of 890 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 890/890 places, 2012/2012 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 0 with 1 rules applied. Total rules applied 1 place count 890 transition count 2011
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 889 transition count 2011
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 889 transition count 2010
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 888 transition count 2010
Applied a total of 4 rules in 47 ms. Remains 888 /890 variables (removed 2) and now considering 2010/2012 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 888/890 places, 2010/2012 transitions.
Incomplete random walk after 10000 steps, including 114 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 189004 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 189004 steps, saw 86240 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2010 rows 888 cols
[2023-03-13 18:02:16] [INFO ] Computed 92 place invariants in 20 ms
[2023-03-13 18:02:16] [INFO ] [Real]Absence check using 21 positive place invariants in 6 ms returned sat
[2023-03-13 18:02:16] [INFO ] [Real]Absence check using 21 positive and 71 generalized place invariants in 35 ms returned sat
[2023-03-13 18:02:16] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 18:02:16] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2023-03-13 18:02:17] [INFO ] [Nat]Absence check using 21 positive and 71 generalized place invariants in 439 ms returned sat
[2023-03-13 18:02:28] [INFO ] After 11047ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 18:02:28] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-13 18:02:29] [INFO ] After 596ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 18:02:41] [INFO ] After 13046ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-13 18:02:41] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 79 ms.
Support contains 41 out of 888 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 888/888 places, 2010/2010 transitions.
Applied a total of 0 rules in 62 ms. Remains 888 /888 variables (removed 0) and now considering 2010/2010 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 888/888 places, 2010/2010 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 888/888 places, 2010/2010 transitions.
Applied a total of 0 rules in 35 ms. Remains 888 /888 variables (removed 0) and now considering 2010/2010 (removed 0) transitions.
[2023-03-13 18:02:41] [INFO ] Invariant cache hit.
[2023-03-13 18:02:42] [INFO ] Implicit Places using invariants in 724 ms returned []
[2023-03-13 18:02:42] [INFO ] Invariant cache hit.
[2023-03-13 18:02:43] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-13 18:02:46] [INFO ] Implicit Places using invariants and state equation in 3670 ms returned []
Implicit Place search using SMT with State Equation took 4411 ms to find 0 implicit places.
[2023-03-13 18:02:46] [INFO ] Redundant transitions in 226 ms returned []
[2023-03-13 18:02:46] [INFO ] Invariant cache hit.
[2023-03-13 18:02:47] [INFO ] Dead Transitions using invariants and state equation in 1070 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5780 ms. Remains : 888/888 places, 2010/2010 transitions.
Graph (complete) has 4921 edges and 888 vertex of which 887 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 887 transition count 2005
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 882 transition count 2005
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 13 place count 881 transition count 2004
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 881 transition count 2003
Applied a total of 14 rules in 111 ms. Remains 881 /888 variables (removed 7) and now considering 2003/2010 (removed 7) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 2003 rows 881 cols
[2023-03-13 18:02:47] [INFO ] Computed 91 place invariants in 15 ms
[2023-03-13 18:02:47] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-13 18:02:47] [INFO ] [Real]Absence check using 21 positive and 70 generalized place invariants in 56 ms returned sat
[2023-03-13 18:02:47] [INFO ] After 312ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 18:02:48] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2023-03-13 18:02:48] [INFO ] [Nat]Absence check using 21 positive and 70 generalized place invariants in 54 ms returned sat
[2023-03-13 18:02:58] [INFO ] After 10331ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 18:02:58] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 1 ms to minimize.
[2023-03-13 18:02:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2023-03-13 18:03:08] [INFO ] After 19675ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3348 ms.
[2023-03-13 18:03:11] [INFO ] After 23367ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-13 18:03:11] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 13 ms.
[2023-03-13 18:03:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 888 places, 2010 transitions and 8087 arcs took 10 ms.
[2023-03-13 18:03:11] [INFO ] Flatten gal took : 206 ms
Total runtime 180226 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ASLink (PT), instance 10b
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 888 places, 2010 transitions, 8087 arcs.
Final Score: 48297.634
Took : 97 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ASLink-PT-10b-ReachabilityCardinality-05 (reachable & potential(( ( ( (tk(P570)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P570)) ) ) | ( ( (tk(P403)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P403)) ) ) )))
PROPERTY: ASLink-PT-10b-ReachabilityCardinality-08 (reachable &!potential( ( ( ( ( (tk(P48)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P48)) ) ) | ( ( ( (tk(P605)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P605)) ) ) & ( ( ( (tk(P156)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P156)) ) ) | ( ( ( ( (tk(P386)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P386)) ) ) & ( ( ( (tk(P263)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P263)) ) ) | ( ( (tk(P528)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P528)) ) ) ) ) & ( ( ( ( (tk(P770)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P770)) ) ) | ( ( ( (tk(P262)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P262)) ) ) | ( ( (tk(P521)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P521)) ) ) ) ) & ( ( ( (tk(P101)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P101)) ) ) | ( ( ( (tk(P415)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P415)) ) ) | ( ( (tk(P740)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P740)) ) ) ) ) ) ) ) ) ) | ( ( ( ( ( (tk(P749)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P749)) ) ) & ( ( (tk(P367)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P367)) ) ) ) & ( ( ( ( (tk(P647)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P647)) ) ) | ( ( ( (tk(P7)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P7)) ) ) & ( ( ( (tk(P870)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P870)) ) ) & ( ( (tk(P723)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P723)) ) ) ) ) ) & ( ( ( (tk(P875)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P875)) ) ) | ( ( ( (tk(P255)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P255)) ) ) | ( ( (tk(P461)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P461)) ) ) ) ) ) ) | ( ( ( (tk(P349)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P349)) ) ) & ( ( ( (tk(P619)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P619)) ) ) & ( ( ( (tk(P121)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P121)) ) ) | ( ( (tk(P790)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P790)) ) ) ) ) ) ) )))
PROPERTY: ASLink-PT-10b-ReachabilityCardinality-09 (reachable & potential(( ( ( (tk(P218)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P218)) ) ) & ( ( ( ( ( (tk(P190)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P190)) ) ) | ( ( (tk(P91)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P91)) ) ) ) | ( ( ( (tk(P188)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P188)) ) ) | ( ( (tk(P831)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P831)) ) ) ) ) | ( ( ( ( (tk(P818)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P818)) ) ) | ( ( (tk(P553)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P553)) ) ) ) | ( ( ( (tk(P404)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P404)) ) ) | ( ( ( ( (tk(P665)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P665)) ) ) & ( ( (tk(P336)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P336)) ) ) ) & ( ( ( (tk(P18)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P18)) ) ) & ( ( ( (tk(P117)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P117)) ) ) & ( ( ( (tk(P86)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P86)) ) ) | ( ( (tk(P138)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P138)) ) ) ) ) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 153396 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16250672 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
Caught signal 15, terminating.

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-10b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is ASLink-PT-10b, 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 r011-oct2-167813599800166"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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