Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.3K Feb 26 13:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 13:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 13:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 13:12 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.5K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 15K Feb 26 13:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Feb 26 13:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 13:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 13:12 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 669K 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-04b-ReachabilityCardinality-00
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-01
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-02
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-03
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-04
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-05
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-06
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-07
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-08
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-09
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-10
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-11
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-12
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-13
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-14
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678606465837

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-04b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 07:34:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 07:34:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 07:34:28] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2023-03-12 07:34:28] [INFO ] Transformed 2034 places.
[2023-03-12 07:34:28] [INFO ] Transformed 2567 transitions.
[2023-03-12 07:34:28] [INFO ] Found NUPN structural information;
[2023-03-12 07:34:28] [INFO ] Parsed PT model containing 2034 places and 2567 transitions and 7875 arcs in 275 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-04b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 24 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 13) seen :7
FORMULA ASLink-PT-04b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 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 3 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :1
FORMULA ASLink-PT-04b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 5 properties.
// Phase 1: matrix 2567 rows 2034 cols
[2023-03-12 07:34:29] [INFO ] Computed 199 place invariants in 130 ms
[2023-03-12 07:34:30] [INFO ] After 822ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 07:34:31] [INFO ] [Nat]Absence check using 48 positive place invariants in 19 ms returned sat
[2023-03-12 07:34:31] [INFO ] [Nat]Absence check using 48 positive and 151 generalized place invariants in 169 ms returned sat
[2023-03-12 07:34:55] [INFO ] After 24250ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 07:34:55] [INFO ] After 24262ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-12 07:34:55] [INFO ] After 25061ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 151 out of 2034 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2034/2034 places, 2567/2567 transitions.
Drop transitions removed 362 transitions
Trivial Post-agglo rules discarded 362 transitions
Performed 362 trivial Post agglomeration. Transition count delta: 362
Iterating post reduction 0 with 362 rules applied. Total rules applied 362 place count 2034 transition count 2205
Reduce places removed 362 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 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 1 with 374 rules applied. Total rules applied 736 place count 1672 transition count 2193
Reduce places removed 1 places and 0 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Iterating post reduction 2 with 40 rules applied. Total rules applied 776 place count 1671 transition count 2154
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 43 rules applied. Total rules applied 819 place count 1632 transition count 2150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 820 place count 1631 transition count 2150
Performed 406 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 406 Pre rules applied. Total rules applied 820 place count 1631 transition count 1744
Deduced a syphon composed of 406 places in 4 ms
Ensure Unique test removed 26 places
Reduce places removed 432 places and 0 transitions.
Iterating global reduction 5 with 838 rules applied. Total rules applied 1658 place count 1199 transition count 1744
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 5 with 29 rules applied. Total rules applied 1687 place count 1188 transition count 1726
Reduce places removed 18 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 6 with 21 rules applied. Total rules applied 1708 place count 1170 transition count 1723
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1711 place count 1167 transition count 1723
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 8 Pre rules applied. Total rules applied 1711 place count 1167 transition count 1715
Deduced a syphon composed of 8 places in 7 ms
Ensure Unique test removed 5 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 21 rules applied. Total rules applied 1732 place count 1154 transition count 1715
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 5 Pre rules applied. Total rules applied 1732 place count 1154 transition count 1710
Deduced a syphon composed of 5 places in 7 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 1742 place count 1149 transition count 1710
Discarding 54 places :
Symmetric choice reduction at 8 with 54 rule applications. Total rules 1796 place count 1095 transition count 1656
Iterating global reduction 8 with 54 rules applied. Total rules applied 1850 place count 1095 transition count 1656
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1851 place count 1095 transition count 1655
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 16 Pre rules applied. Total rules applied 1851 place count 1095 transition count 1639
Deduced a syphon composed of 16 places in 4 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 9 with 32 rules applied. Total rules applied 1883 place count 1079 transition count 1639
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1888 place count 1074 transition count 1606
Iterating global reduction 9 with 5 rules applied. Total rules applied 1893 place count 1074 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1894 place count 1073 transition count 1598
Iterating global reduction 9 with 1 rules applied. Total rules applied 1895 place count 1073 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1896 place count 1072 transition count 1590
Iterating global reduction 9 with 1 rules applied. Total rules applied 1897 place count 1072 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1898 place count 1071 transition count 1582
Iterating global reduction 9 with 1 rules applied. Total rules applied 1899 place count 1071 transition count 1582
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1900 place count 1070 transition count 1574
Iterating global reduction 9 with 1 rules applied. Total rules applied 1901 place count 1070 transition count 1574
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1902 place count 1069 transition count 1566
Iterating global reduction 9 with 1 rules applied. Total rules applied 1903 place count 1069 transition count 1566
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1904 place count 1068 transition count 1558
Iterating global reduction 9 with 1 rules applied. Total rules applied 1905 place count 1068 transition count 1558
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1906 place count 1067 transition count 1550
Iterating global reduction 9 with 1 rules applied. Total rules applied 1907 place count 1067 transition count 1550
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1908 place count 1066 transition count 1542
Iterating global reduction 9 with 1 rules applied. Total rules applied 1909 place count 1066 transition count 1542
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1910 place count 1065 transition count 1534
Iterating global reduction 9 with 1 rules applied. Total rules applied 1911 place count 1065 transition count 1534
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 3 ms
Ensure Unique test removed 3 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 9 with 223 rules applied. Total rules applied 2134 place count 952 transition count 1424
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 9 with 1 rules applied. Total rules applied 2135 place count 951 transition count 1424
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2137 place count 950 transition count 1433
Free-agglomeration rule applied 8 times.
Iterating global reduction 10 with 8 rules applied. Total rules applied 2145 place count 950 transition count 1425
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 2153 place count 942 transition count 1425
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 11 with 8 rules applied. Total rules applied 2161 place count 942 transition count 1417
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 2169 place count 934 transition count 1417
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 12 with 6 rules applied. Total rules applied 2175 place count 934 transition count 1417
Applied a total of 2175 rules in 1323 ms. Remains 934 /2034 variables (removed 1100) and now considering 1417/2567 (removed 1150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1324 ms. Remains : 934/2034 places, 1417/2567 transitions.
Incomplete random walk after 10000 steps, including 60 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 167658 steps, run timeout after 3010 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 167658 steps, saw 40839 distinct states, run finished after 3014 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1417 rows 934 cols
[2023-03-12 07:35:00] [INFO ] Computed 153 place invariants in 50 ms
[2023-03-12 07:35:01] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 07:35:01] [INFO ] [Nat]Absence check using 41 positive place invariants in 14 ms returned sat
[2023-03-12 07:35:01] [INFO ] [Nat]Absence check using 41 positive and 112 generalized place invariants in 28 ms returned sat
[2023-03-12 07:35:12] [INFO ] After 10989ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 07:35:12] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 07:35:22] [INFO ] After 10223ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 07:35:23] [INFO ] Deduced a trap composed of 66 places in 168 ms of which 4 ms to minimize.
[2023-03-12 07:35:23] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 1 ms to minimize.
[2023-03-12 07:35:23] [INFO ] Deduced a trap composed of 55 places in 213 ms of which 5 ms to minimize.
[2023-03-12 07:35:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 893 ms
[2023-03-12 07:35:24] [INFO ] After 12131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1525 ms.
[2023-03-12 07:35:26] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 212 ms.
Support contains 151 out of 934 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 934/934 places, 1417/1417 transitions.
Applied a total of 0 rules in 46 ms. Remains 934 /934 variables (removed 0) and now considering 1417/1417 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 934/934 places, 1417/1417 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 934/934 places, 1417/1417 transitions.
Applied a total of 0 rules in 32 ms. Remains 934 /934 variables (removed 0) and now considering 1417/1417 (removed 0) transitions.
[2023-03-12 07:35:26] [INFO ] Invariant cache hit.
[2023-03-12 07:35:27] [INFO ] Implicit Places using invariants in 604 ms returned [3, 24, 25, 26, 30, 46, 67, 86, 127, 146, 177, 213, 217, 218, 225, 265, 329, 349, 390, 391, 392, 393, 395, 416, 436, 509, 523, 548, 565, 566, 567, 570, 589, 611, 671, 691, 692, 707, 729, 745, 746, 748, 774, 776, 780, 800, 801, 804, 805, 832, 838, 844, 850, 856, 862, 870, 876, 883, 889, 930, 933]
Discarding 61 places :
Implicit Place search using SMT only with invariants took 608 ms to find 61 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 873/934 places, 1417/1417 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 873 transition count 1362
Reduce places removed 55 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 75 rules applied. Total rules applied 130 place count 818 transition count 1342
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 150 place count 798 transition count 1342
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 150 place count 798 transition count 1319
Deduced a syphon composed of 23 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 197 place count 774 transition count 1319
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 11 rules applied. Total rules applied 208 place count 768 transition count 1314
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 213 place count 763 transition count 1314
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 222 place count 754 transition count 1305
Iterating global reduction 5 with 9 rules applied. Total rules applied 231 place count 754 transition count 1305
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 234 place count 751 transition count 1301
Iterating global reduction 5 with 3 rules applied. Total rules applied 237 place count 751 transition count 1301
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 239 place count 751 transition count 1299
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 291 place count 725 transition count 1273
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 293 place count 724 transition count 1273
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 294 place count 724 transition count 1272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 295 place count 723 transition count 1272
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 7 with 29 rules applied. Total rules applied 324 place count 723 transition count 1243
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 353 place count 694 transition count 1243
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 354 place count 694 transition count 1242
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 364 place count 694 transition count 1242
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 367 place count 694 transition count 1242
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 368 place count 693 transition count 1241
Iterating global reduction 8 with 1 rules applied. Total rules applied 369 place count 693 transition count 1241
Applied a total of 369 rules in 190 ms. Remains 693 /873 variables (removed 180) and now considering 1241/1417 (removed 176) transitions.
// Phase 1: matrix 1241 rows 693 cols
[2023-03-12 07:35:27] [INFO ] Computed 85 place invariants in 24 ms
[2023-03-12 07:35:27] [INFO ] Implicit Places using invariants in 351 ms returned [127, 299, 311, 316, 317, 424, 428, 437, 576, 665, 691]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 355 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 682/934 places, 1241/1417 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 682 transition count 1239
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 680 transition count 1239
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 679 transition count 1238
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 679 transition count 1236
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 677 transition count 1236
Applied a total of 10 rules in 49 ms. Remains 677 /682 variables (removed 5) and now considering 1236/1241 (removed 5) transitions.
// Phase 1: matrix 1236 rows 677 cols
[2023-03-12 07:35:27] [INFO ] Computed 74 place invariants in 8 ms
[2023-03-12 07:35:27] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-12 07:35:27] [INFO ] Invariant cache hit.
[2023-03-12 07:35:28] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-12 07:35:29] [INFO ] Implicit Places using invariants and state equation in 1596 ms returned []
Implicit Place search using SMT with State Equation took 1880 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 677/934 places, 1236/1417 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3114 ms. Remains : 677/934 places, 1236/1417 transitions.
Incomplete random walk after 10000 steps, including 78 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 159426 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 159426 steps, saw 51127 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-12 07:35:33] [INFO ] Invariant cache hit.
[2023-03-12 07:35:33] [INFO ] After 249ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 07:35:33] [INFO ] [Nat]Absence check using 22 positive place invariants in 7 ms returned sat
[2023-03-12 07:35:33] [INFO ] [Nat]Absence check using 22 positive and 52 generalized place invariants in 29 ms returned sat
[2023-03-12 07:35:47] [INFO ] After 14206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 07:35:47] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-12 07:35:58] [INFO ] After 10508ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 07:35:58] [INFO ] After 10510ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-12 07:35:58] [INFO ] After 25011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 124 ms.
Support contains 151 out of 677 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 677/677 places, 1236/1236 transitions.
Applied a total of 0 rules in 18 ms. Remains 677 /677 variables (removed 0) and now considering 1236/1236 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 677/677 places, 1236/1236 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 677/677 places, 1236/1236 transitions.
Applied a total of 0 rules in 14 ms. Remains 677 /677 variables (removed 0) and now considering 1236/1236 (removed 0) transitions.
[2023-03-12 07:35:58] [INFO ] Invariant cache hit.
[2023-03-12 07:35:58] [INFO ] Implicit Places using invariants in 357 ms returned []
[2023-03-12 07:35:58] [INFO ] Invariant cache hit.
[2023-03-12 07:35:59] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-12 07:36:01] [INFO ] Implicit Places using invariants and state equation in 2504 ms returned []
Implicit Place search using SMT with State Equation took 2867 ms to find 0 implicit places.
[2023-03-12 07:36:01] [INFO ] Redundant transitions in 64 ms returned []
[2023-03-12 07:36:01] [INFO ] Invariant cache hit.
[2023-03-12 07:36:01] [INFO ] Dead Transitions using invariants and state equation in 478 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3449 ms. Remains : 677/677 places, 1236/1236 transitions.
Graph (complete) has 2764 edges and 677 vertex of which 676 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 676 transition count 1235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 675 transition count 1235
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 675 transition count 1233
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 673 transition count 1233
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 671 transition count 1233
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 13 place count 669 transition count 1231
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 14 place count 669 transition count 1230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 15 place count 668 transition count 1230
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 17 place count 668 transition count 1228
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 19 place count 666 transition count 1228
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 20 place count 666 transition count 1227
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 21 place count 666 transition count 1227
Applied a total of 21 rules in 132 ms. Remains 666 /677 variables (removed 11) and now considering 1227/1236 (removed 9) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 1227 rows 666 cols
[2023-03-12 07:36:02] [INFO ] Computed 71 place invariants in 8 ms
[2023-03-12 07:36:02] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 07:36:02] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2023-03-12 07:36:02] [INFO ] [Nat]Absence check using 19 positive and 52 generalized place invariants in 13 ms returned sat
[2023-03-12 07:36:13] [INFO ] After 11229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 07:36:18] [INFO ] Deduced a trap composed of 47 places in 233 ms of which 4 ms to minimize.
[2023-03-12 07:36:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 432 ms
[2023-03-12 07:36:19] [INFO ] Deduced a trap composed of 33 places in 209 ms of which 1 ms to minimize.
[2023-03-12 07:36:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2023-03-12 07:36:20] [INFO ] Deduced a trap composed of 76 places in 273 ms of which 13 ms to minimize.
[2023-03-12 07:36:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 368 ms
[2023-03-12 07:36:20] [INFO ] After 17804ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 10798 ms.
[2023-03-12 07:36:31] [INFO ] After 28801ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-12 07:36:31] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-12 07:36:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 677 places, 1236 transitions and 4573 arcs took 17 ms.
[2023-03-12 07:36:31] [INFO ] Flatten gal took : 154 ms
Total runtime 123089 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/553/inv_0_ --invariant=/tmp/553/inv_1_ --invariant=/tmp/553/inv_2_ --invariant=/tmp/553/inv_3_ --invariant=/tmp/553/inv_4_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 157660 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16275596 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-04b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ASLink-PT-04b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r009-oct2-167813597400070"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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