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-167813599700094.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-06a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-oct2-167813599700094
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 13:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 13:08 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.7K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 13:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 13:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 13:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 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 597K 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-06a-ReachabilityCardinality-00
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-01
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-02
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-03
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-04
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-05
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-06
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-07
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-08
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-09
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-10
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-11
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-12
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-13
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-14
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678723589683

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-06a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 16:06:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 16:06:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 16:06:32] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2023-03-13 16:06:32] [INFO ] Transformed 1406 places.
[2023-03-13 16:06:32] [INFO ] Transformed 2100 transitions.
[2023-03-13 16:06:32] [INFO ] Found NUPN structural information;
[2023-03-13 16:06:32] [INFO ] Parsed PT model containing 1406 places and 2100 transitions and 7896 arcs in 262 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 22 transitions
Reduce redundant transitions removed 22 transitions.
Incomplete random walk after 10000 steps, including 61 resets, run finished after 463 ms. (steps per millisecond=21 ) properties (out of 16) seen :6
FORMULA ASLink-PT-06a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2078 rows 1406 cols
[2023-03-13 16:06:34] [INFO ] Computed 270 place invariants in 122 ms
[2023-03-13 16:06:35] [INFO ] After 1033ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-13 16:06:36] [INFO ] [Nat]Absence check using 66 positive place invariants in 28 ms returned sat
[2023-03-13 16:06:36] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 200 ms returned sat
[2023-03-13 16:07:00] [INFO ] After 23639ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-13 16:07:00] [INFO ] After 23660ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-13 16:07:00] [INFO ] After 25044ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 10 Parikh solutions to 2 different solutions.
FORMULA ASLink-PT-06a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-06a-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 105 ms.
Support contains 81 out of 1406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1406/1406 places, 2078/2078 transitions.
Ensure Unique test removed 24 places
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 1370 transition count 1974
Reduce places removed 104 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 114 rules applied. Total rules applied 254 place count 1266 transition count 1964
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 264 place count 1256 transition count 1964
Performed 117 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 117 Pre rules applied. Total rules applied 264 place count 1256 transition count 1847
Deduced a syphon composed of 117 places in 2 ms
Ensure Unique test removed 38 places
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 3 with 272 rules applied. Total rules applied 536 place count 1101 transition count 1847
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 537 place count 1100 transition count 1847
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 537 place count 1100 transition count 1846
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 539 place count 1099 transition count 1846
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 548 place count 1090 transition count 1799
Ensure Unique test removed 1 places
Iterating global reduction 4 with 10 rules applied. Total rules applied 558 place count 1089 transition count 1799
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 6 rules applied. Total rules applied 564 place count 1088 transition count 1794
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 567 place count 1085 transition count 1794
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 568 place count 1084 transition count 1786
Iterating global reduction 6 with 1 rules applied. Total rules applied 569 place count 1084 transition count 1786
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 570 place count 1083 transition count 1778
Iterating global reduction 6 with 1 rules applied. Total rules applied 571 place count 1083 transition count 1778
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 572 place count 1082 transition count 1770
Iterating global reduction 6 with 1 rules applied. Total rules applied 573 place count 1082 transition count 1770
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 574 place count 1081 transition count 1762
Iterating global reduction 6 with 1 rules applied. Total rules applied 575 place count 1081 transition count 1762
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 3 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 6 with 78 rules applied. Total rules applied 653 place count 1042 transition count 1723
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 654 place count 1042 transition count 1722
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 655 place count 1041 transition count 1722
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 660 place count 1041 transition count 1717
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 665 place count 1036 transition count 1717
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 672 place count 1036 transition count 1717
Applied a total of 672 rules in 771 ms. Remains 1036 /1406 variables (removed 370) and now considering 1717/2078 (removed 361) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 773 ms. Remains : 1036/1406 places, 1717/2078 transitions.
Incomplete random walk after 10000 steps, including 72 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 8) seen :1
FORMULA ASLink-PT-06a-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 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 15 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 7) seen :1
FORMULA ASLink-PT-06a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1717 rows 1036 cols
[2023-03-13 16:07:01] [INFO ] Computed 193 place invariants in 33 ms
[2023-03-13 16:07:02] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 16:07:02] [INFO ] [Nat]Absence check using 53 positive place invariants in 20 ms returned sat
[2023-03-13 16:07:02] [INFO ] [Nat]Absence check using 53 positive and 140 generalized place invariants in 83 ms returned sat
[2023-03-13 16:07:22] [INFO ] After 19605ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-13 16:07:22] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-13 16:07:27] [INFO ] After 4809ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-13 16:07:27] [INFO ] After 4812ms 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-13 16:07:27] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 461 ms.
Support contains 68 out of 1036 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1036/1036 places, 1717/1717 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 1036 transition count 1716
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1035 transition count 1716
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 1035 transition count 1713
Deduced a syphon composed of 3 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 1030 transition count 1713
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 1029 transition count 1705
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 1029 transition count 1705
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 1028 transition count 1697
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 1028 transition count 1697
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 1027 transition count 1689
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 1027 transition count 1689
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 1026 transition count 1681
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 1026 transition count 1681
Applied a total of 18 rules in 284 ms. Remains 1026 /1036 variables (removed 10) and now considering 1681/1717 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 285 ms. Remains : 1026/1036 places, 1681/1717 transitions.
Incomplete random walk after 10000 steps, including 89 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 151861 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 151861 steps, saw 42563 distinct states, run finished after 3003 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1681 rows 1026 cols
[2023-03-13 16:07:31] [INFO ] Computed 191 place invariants in 23 ms
[2023-03-13 16:07:32] [INFO ] After 301ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 16:07:32] [INFO ] [Nat]Absence check using 53 positive place invariants in 32 ms returned sat
[2023-03-13 16:07:32] [INFO ] [Nat]Absence check using 53 positive and 138 generalized place invariants in 53 ms returned sat
[2023-03-13 16:07:46] [INFO ] After 14326ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-13 16:07:46] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-13 16:07:57] [INFO ] After 10214ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-13 16:07:57] [INFO ] After 10228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-13 16:07:57] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 305 ms.
Support contains 68 out of 1026 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1026/1026 places, 1681/1681 transitions.
Applied a total of 0 rules in 30 ms. Remains 1026 /1026 variables (removed 0) and now considering 1681/1681 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 1026/1026 places, 1681/1681 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1026/1026 places, 1681/1681 transitions.
Applied a total of 0 rules in 29 ms. Remains 1026 /1026 variables (removed 0) and now considering 1681/1681 (removed 0) transitions.
[2023-03-13 16:07:57] [INFO ] Invariant cache hit.
[2023-03-13 16:07:58] [INFO ] Implicit Places using invariants in 1215 ms returned [1, 19, 20, 22, 32, 50, 68, 148, 162, 163, 164, 165, 166, 184, 202, 238, 274, 286, 299, 300, 301, 302, 303, 339, 377, 394, 414, 429, 442, 443, 444, 445, 446, 464, 482, 545, 565, 578, 579, 580, 581, 582, 600, 618, 705, 719, 722, 723, 724, 742, 760, 823, 843, 848, 859, 860, 861, 862, 863, 889, 891, 894, 912, 913, 915, 916, 929, 935, 941, 947, 965, 971, 977, 983, 989]
Discarding 75 places :
Implicit Place search using SMT only with invariants took 1232 ms to find 75 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 951/1026 places, 1681/1681 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 951 transition count 1586
Reduce places removed 95 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 105 rules applied. Total rules applied 200 place count 856 transition count 1576
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 210 place count 846 transition count 1576
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 210 place count 846 transition count 1541
Deduced a syphon composed of 35 places in 3 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 280 place count 811 transition count 1541
Discarding 13 places :
Implicit places reduction removed 13 places
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 23 rules applied. Total rules applied 303 place count 798 transition count 1531
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 11 rules applied. Total rules applied 314 place count 788 transition count 1530
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 315 place count 787 transition count 1530
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 326 place count 776 transition count 1519
Iterating global reduction 6 with 11 rules applied. Total rules applied 337 place count 776 transition count 1519
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 338 place count 776 transition count 1518
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 341 place count 773 transition count 1515
Iterating global reduction 7 with 3 rules applied. Total rules applied 344 place count 773 transition count 1515
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 345 place count 772 transition count 1514
Iterating global reduction 7 with 1 rules applied. Total rules applied 346 place count 772 transition count 1514
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 347 place count 771 transition count 1513
Iterating global reduction 7 with 1 rules applied. Total rules applied 348 place count 771 transition count 1513
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 7 with 100 rules applied. Total rules applied 448 place count 721 transition count 1463
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 450 place count 719 transition count 1461
Iterating global reduction 7 with 2 rules applied. Total rules applied 452 place count 719 transition count 1461
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 454 place count 719 transition count 1459
Free-agglomeration rule applied 5 times.
Iterating global reduction 8 with 5 rules applied. Total rules applied 459 place count 719 transition count 1454
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 465 place count 714 transition count 1453
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 466 place count 714 transition count 1452
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 9 with 23 rules applied. Total rules applied 489 place count 714 transition count 1429
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 9 with 23 rules applied. Total rules applied 512 place count 691 transition count 1429
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 514 place count 691 transition count 1427
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 10 with 14 rules applied. Total rules applied 528 place count 691 transition count 1427
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 529 place count 691 transition count 1427
Applied a total of 529 rules in 408 ms. Remains 691 /951 variables (removed 260) and now considering 1427/1681 (removed 254) transitions.
// Phase 1: matrix 1427 rows 691 cols
[2023-03-13 16:07:59] [INFO ] Computed 103 place invariants in 29 ms
[2023-03-13 16:07:59] [INFO ] Implicit Places using invariants in 478 ms returned [90, 96, 99, 101, 107, 108, 181, 187, 190, 199, 200, 205, 206, 259, 296, 306, 311, 312, 364, 383, 394, 396, 397, 490, 493, 495, 499, 583, 597, 600, 672, 675, 682, 685]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 489 ms to find 34 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 657/1026 places, 1427/1681 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 646 transition count 1416
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 646 transition count 1416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 645 transition count 1415
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 645 transition count 1415
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 36 place count 639 transition count 1409
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 37 place count 639 transition count 1408
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 639 transition count 1399
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 55 place count 630 transition count 1399
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 630 transition count 1397
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 59 place count 628 transition count 1397
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 62 place count 628 transition count 1397
Applied a total of 62 rules in 188 ms. Remains 628 /657 variables (removed 29) and now considering 1397/1427 (removed 30) transitions.
// Phase 1: matrix 1397 rows 628 cols
[2023-03-13 16:07:59] [INFO ] Computed 69 place invariants in 13 ms
[2023-03-13 16:08:00] [INFO ] Implicit Places using invariants in 444 ms returned []
[2023-03-13 16:08:00] [INFO ] Invariant cache hit.
[2023-03-13 16:08:00] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 16:08:02] [INFO ] Implicit Places using invariants and state equation in 1920 ms returned []
Implicit Place search using SMT with State Equation took 2394 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 628/1026 places, 1397/1681 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4741 ms. Remains : 628/1026 places, 1397/1681 transitions.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 210448 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{2=1}
Probabilistic random walk after 210448 steps, saw 62536 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :1
FORMULA ASLink-PT-06a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 5 properties.
[2023-03-13 16:08:05] [INFO ] Invariant cache hit.
[2023-03-13 16:08:05] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 16:08:05] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-13 16:08:05] [INFO ] [Nat]Absence check using 15 positive and 54 generalized place invariants in 30 ms returned sat
[2023-03-13 16:08:18] [INFO ] After 12874ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 16:08:18] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 16:08:25] [INFO ] After 6638ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 16:08:30] [INFO ] After 11880ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-13 16:08:30] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 253 ms.
Support contains 30 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1397/1397 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 628 transition count 1389
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 620 transition count 1389
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 16 place count 620 transition count 1376
Deduced a syphon composed of 13 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 44 place count 605 transition count 1376
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 604 transition count 1376
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 45 place count 604 transition count 1374
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 49 place count 602 transition count 1374
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 51 place count 600 transition count 1365
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 600 transition count 1365
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 54 place count 600 transition count 1364
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 55 place count 599 transition count 1356
Iterating global reduction 4 with 1 rules applied. Total rules applied 56 place count 599 transition count 1356
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 57 place count 598 transition count 1348
Iterating global reduction 4 with 1 rules applied. Total rules applied 58 place count 598 transition count 1348
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 59 place count 597 transition count 1340
Iterating global reduction 4 with 1 rules applied. Total rules applied 60 place count 597 transition count 1340
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 68 place count 593 transition count 1336
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 70 place count 593 transition count 1334
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 74 place count 593 transition count 1330
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 78 place count 589 transition count 1330
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 79 place count 589 transition count 1329
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 84 place count 589 transition count 1324
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 89 place count 584 transition count 1324
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 90 place count 583 transition count 1323
Iterating global reduction 6 with 1 rules applied. Total rules applied 91 place count 583 transition count 1323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 92 place count 583 transition count 1322
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 93 place count 583 transition count 1321
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 94 place count 583 transition count 1321
Applied a total of 94 rules in 195 ms. Remains 583 /628 variables (removed 45) and now considering 1321/1397 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 583/628 places, 1321/1397 transitions.
Incomplete random walk after 10000 steps, including 150 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 236787 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{3=1}
Probabilistic random walk after 236787 steps, saw 64971 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :1
FORMULA ASLink-PT-06a-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 4 properties.
// Phase 1: matrix 1321 rows 583 cols
[2023-03-13 16:08:34] [INFO ] Computed 66 place invariants in 11 ms
[2023-03-13 16:08:34] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 16:08:34] [INFO ] [Nat]Absence check using 15 positive place invariants in 35 ms returned sat
[2023-03-13 16:08:35] [INFO ] [Nat]Absence check using 15 positive and 51 generalized place invariants in 267 ms returned sat
[2023-03-13 16:08:44] [INFO ] After 9877ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 16:08:44] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-13 16:08:47] [INFO ] After 2737ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 16:08:50] [INFO ] After 5633ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 266 ms.
[2023-03-13 16:08:50] [INFO ] After 16292ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 10 ms.
Support contains 29 out of 583 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 583/583 places, 1321/1321 transitions.
Applied a total of 0 rules in 14 ms. Remains 583 /583 variables (removed 0) and now considering 1321/1321 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 583/583 places, 1321/1321 transitions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 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 33 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 241582 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 241582 steps, saw 66144 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-13 16:08:54] [INFO ] Invariant cache hit.
[2023-03-13 16:08:54] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 16:08:54] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 16:08:54] [INFO ] [Nat]Absence check using 15 positive and 51 generalized place invariants in 13 ms returned sat
[2023-03-13 16:09:04] [INFO ] After 9771ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 16:09:04] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-13 16:09:11] [INFO ] After 7263ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 16:09:12] [INFO ] After 7791ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 497 ms.
[2023-03-13 16:09:12] [INFO ] After 18292ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 92 ms.
Support contains 29 out of 583 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 583/583 places, 1321/1321 transitions.
Applied a total of 0 rules in 17 ms. Remains 583 /583 variables (removed 0) and now considering 1321/1321 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 583/583 places, 1321/1321 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 583/583 places, 1321/1321 transitions.
Applied a total of 0 rules in 22 ms. Remains 583 /583 variables (removed 0) and now considering 1321/1321 (removed 0) transitions.
[2023-03-13 16:09:12] [INFO ] Invariant cache hit.
[2023-03-13 16:09:13] [INFO ] Implicit Places using invariants in 475 ms returned [72, 259, 415, 427, 428, 429, 501, 505, 506, 578]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 491 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 573/583 places, 1321/1321 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 573 transition count 1319
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 571 transition count 1319
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 7 place count 568 transition count 1316
Iterating global reduction 0 with 3 rules applied. Total rules applied 10 place count 568 transition count 1316
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 566 transition count 1314
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 566 transition count 1314
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 24 place count 561 transition count 1309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 560 transition count 1308
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 560 transition count 1308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 559 transition count 1307
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 559 transition count 1307
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 31 place count 559 transition count 1304
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 34 place count 556 transition count 1304
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 556 transition count 1302
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 38 place count 554 transition count 1302
Applied a total of 38 rules in 149 ms. Remains 554 /573 variables (removed 19) and now considering 1302/1321 (removed 19) transitions.
// Phase 1: matrix 1302 rows 554 cols
[2023-03-13 16:09:13] [INFO ] Computed 56 place invariants in 9 ms
[2023-03-13 16:09:13] [INFO ] Implicit Places using invariants in 411 ms returned [406, 407]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 413 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 552/583 places, 1302/1321 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 551 transition count 1301
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 551 transition count 1300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 550 transition count 1300
Applied a total of 4 rules in 73 ms. Remains 550 /552 variables (removed 2) and now considering 1300/1302 (removed 2) transitions.
// Phase 1: matrix 1300 rows 550 cols
[2023-03-13 16:09:14] [INFO ] Computed 54 place invariants in 19 ms
[2023-03-13 16:09:14] [INFO ] Implicit Places using invariants in 489 ms returned []
[2023-03-13 16:09:14] [INFO ] Invariant cache hit.
[2023-03-13 16:09:14] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 16:09:15] [INFO ] Implicit Places using invariants and state equation in 1355 ms returned []
Implicit Place search using SMT with State Equation took 1858 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 550/583 places, 1300/1321 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3006 ms. Remains : 550/583 places, 1300/1321 transitions.
Incomplete random walk after 10000 steps, including 159 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 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 36 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 152228 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 152228 steps, saw 101234 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-13 16:09:19] [INFO ] Invariant cache hit.
[2023-03-13 16:09:19] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 16:09:19] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-13 16:09:19] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 27 ms returned sat
[2023-03-13 16:09:28] [INFO ] After 8908ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 16:09:28] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 16:09:38] [INFO ] After 10108ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 16:09:42] [INFO ] Deduced a trap composed of 33 places in 247 ms of which 35 ms to minimize.
[2023-03-13 16:09:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 324 ms
[2023-03-13 16:09:43] [INFO ] Deduced a trap composed of 32 places in 187 ms of which 21 ms to minimize.
[2023-03-13 16:09:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2023-03-13 16:09:44] [INFO ] After 15610ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 215 ms.
[2023-03-13 16:09:44] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 96 ms.
Support contains 29 out of 550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 1300/1300 transitions.
Applied a total of 0 rules in 16 ms. Remains 550 /550 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 550/550 places, 1300/1300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 1300/1300 transitions.
Applied a total of 0 rules in 24 ms. Remains 550 /550 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
[2023-03-13 16:09:44] [INFO ] Invariant cache hit.
[2023-03-13 16:09:45] [INFO ] Implicit Places using invariants in 434 ms returned []
[2023-03-13 16:09:45] [INFO ] Invariant cache hit.
[2023-03-13 16:09:45] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 16:09:46] [INFO ] Implicit Places using invariants and state equation in 1472 ms returned []
Implicit Place search using SMT with State Equation took 1923 ms to find 0 implicit places.
[2023-03-13 16:09:46] [INFO ] Redundant transitions in 80 ms returned []
[2023-03-13 16:09:46] [INFO ] Invariant cache hit.
[2023-03-13 16:09:47] [INFO ] Dead Transitions using invariants and state equation in 508 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2540 ms. Remains : 550/550 places, 1300/1300 transitions.
Applied a total of 0 rules in 15 ms. Remains 550 /550 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-13 16:09:47] [INFO ] Invariant cache hit.
[2023-03-13 16:09:47] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 16:09:47] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-13 16:09:47] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 30 ms returned sat
[2023-03-13 16:09:56] [INFO ] After 8790ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 16:09:57] [INFO ] Deduced a trap composed of 39 places in 315 ms of which 1 ms to minimize.
[2023-03-13 16:09:57] [INFO ] Deduced a trap composed of 35 places in 207 ms of which 1 ms to minimize.
[2023-03-13 16:09:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 720 ms
[2023-03-13 16:09:58] [INFO ] After 10553ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 4986 ms.
[2023-03-13 16:10:03] [INFO ] After 15733ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-13 16:10:03] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 31 ms.
[2023-03-13 16:10:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 550 places, 1300 transitions and 5251 arcs took 22 ms.
[2023-03-13 16:10:03] [INFO ] Flatten gal took : 124 ms
Total runtime 210899 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ASLink (PT), instance 06a
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: 550 places, 1300 transitions, 5251 arcs.
Final Score: 43830.856
Took : 61 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ASLink-PT-06a-ReachabilityCardinality-01 (reachable &!potential( ( ( ( (tk(P87)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P87)) ) ) | ( ( (tk(P500)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P500)) ) ) )))
PROPERTY: ASLink-PT-06a-ReachabilityCardinality-04 (reachable & potential(( ( ( (tk(P314)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P314)) ) ) & ( ( (tk(P152)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P152)) ) ) )))
PROPERTY: ASLink-PT-06a-ReachabilityCardinality-11 (reachable &!potential( ( ( ( (tk(P231)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P231)) ) ) | ( ( (tk(P406)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P406)) ) ) )))
PROPERTY: ASLink-PT-06a-ReachabilityCardinality-15 (reachable & potential(( ( ( (tk(P135)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P135)) ) ) & ( ( ( ( ( ( (tk(P265)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P265)) ) ) & ( ( (tk(P314)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P314)) ) ) ) & ( ( ( (tk(P533)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P533)) ) ) & ( ( (tk(P548)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P548)) ) ) ) ) & ( ( ( ( (tk(P156)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P156)) ) ) & ( ( (tk(P474)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P474)) ) ) ) & ( ( ( (tk(P165)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P165)) ) ) & ( ( ( ( (tk(P528)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P528)) ) ) & ( ( (tk(P166)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P166)) ) ) ) | ( ( ( (tk(P245)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P245)) ) ) & ( ( (tk(P188)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P188)) ) ) ) ) ) ) ) | ( ( ( ( (tk(P543)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P543)) ) ) | ( ( ( (tk(P424)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P424)) ) ) & ( ( ( (tk(P253)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P253)) ) ) | ( ( (tk(P378)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P378)) ) ) ) ) ) & ( ( ( (tk(P246)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P246)) ) ) | ( ( ( ( (tk(P466)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P466)) ) ) & ( ( ( (tk(P292)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P292)) ) ) & ( ( (tk(P9)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P9)) ) ) ) ) | ( ( ( (tk(P370)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P370)) ) ) & ( ( ( (tk(P550)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P550)) ) ) | ( ( ( (tk(P330)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P330)) ) ) & ( ( (tk(P84)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P84)) ) ) ) ) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 5820024 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16101608 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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-06a"
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-06a, 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-167813599700094"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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