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.r265-smll-167863539800302.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 NoC3x3-PT-5B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863539800302
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 980K
-rw-r--r-- 1 mcc users 5.5K Feb 26 10:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 10:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 10:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 10:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 10:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Feb 26 10:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 10:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 10:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 525K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-00
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-01
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-02
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-03
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-04
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-05
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-06
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-07
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-08
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-09
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-10
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-11
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-12
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-13
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-14
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678925699254

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=NoC3x3-PT-5B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 00:15:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-16 00:15:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 00:15:02] [INFO ] Load time of PNML (sax parser for PT used): 236 ms
[2023-03-16 00:15:02] [INFO ] Transformed 1571 places.
[2023-03-16 00:15:02] [INFO ] Transformed 2173 transitions.
[2023-03-16 00:15:02] [INFO ] Found NUPN structural information;
[2023-03-16 00:15:02] [INFO ] Parsed PT model containing 1571 places and 2173 transitions and 6109 arcs in 373 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 13 resets, run finished after 750 ms. (steps per millisecond=13 ) properties (out of 14) seen :8
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2173 rows 1571 cols
[2023-03-16 00:15:04] [INFO ] Computed 66 place invariants in 42 ms
[2023-03-16 00:15:05] [INFO ] After 1048ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-16 00:15:06] [INFO ] [Nat]Absence check using 66 positive place invariants in 69 ms returned sat
[2023-03-16 00:15:30] [INFO ] After 24038ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 00:15:30] [INFO ] After 24044ms 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-16 00:15:30] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 113 out of 1571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1571/1571 places, 2173/2173 transitions.
Drop transitions removed 263 transitions
Trivial Post-agglo rules discarded 263 transitions
Performed 263 trivial Post agglomeration. Transition count delta: 263
Iterating post reduction 0 with 263 rules applied. Total rules applied 263 place count 1571 transition count 1910
Reduce places removed 263 places and 0 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 1 with 290 rules applied. Total rules applied 553 place count 1308 transition count 1883
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 580 place count 1281 transition count 1883
Discarding 256 places :
Symmetric choice reduction at 3 with 256 rule applications. Total rules 836 place count 1025 transition count 1627
Iterating global reduction 3 with 256 rules applied. Total rules applied 1092 place count 1025 transition count 1627
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 1092 place count 1025 transition count 1598
Deduced a syphon composed of 29 places in 10 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 1150 place count 996 transition count 1598
Discarding 88 places :
Symmetric choice reduction at 3 with 88 rule applications. Total rules 1238 place count 908 transition count 1446
Iterating global reduction 3 with 88 rules applied. Total rules applied 1326 place count 908 transition count 1446
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 1366 place count 868 transition count 1361
Iterating global reduction 3 with 40 rules applied. Total rules applied 1406 place count 868 transition count 1361
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1417 place count 857 transition count 1339
Iterating global reduction 3 with 11 rules applied. Total rules applied 1428 place count 857 transition count 1339
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1431 place count 854 transition count 1333
Iterating global reduction 3 with 3 rules applied. Total rules applied 1434 place count 854 transition count 1333
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1436 place count 852 transition count 1329
Iterating global reduction 3 with 2 rules applied. Total rules applied 1438 place count 852 transition count 1329
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1439 place count 851 transition count 1326
Iterating global reduction 3 with 1 rules applied. Total rules applied 1440 place count 851 transition count 1326
Performed 157 Post agglomeration using F-continuation condition.Transition count delta: 157
Deduced a syphon composed of 157 places in 3 ms
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 3 with 314 rules applied. Total rules applied 1754 place count 694 transition count 1169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1755 place count 694 transition count 1168
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1756 place count 693 transition count 1164
Iterating global reduction 4 with 1 rules applied. Total rules applied 1757 place count 693 transition count 1164
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 1959 place count 592 transition count 1186
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1965 place count 592 transition count 1180
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 1993 place count 578 transition count 1180
Drop transitions removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 5 with 49 rules applied. Total rules applied 2042 place count 578 transition count 1131
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 2047 place count 573 transition count 1131
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 2047 place count 573 transition count 1128
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 2053 place count 570 transition count 1128
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 6 with 12 rules applied. Total rules applied 2065 place count 564 transition count 1122
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 2077 place count 558 transition count 1123
Free-agglomeration rule applied 19 times.
Iterating global reduction 6 with 19 rules applied. Total rules applied 2096 place count 558 transition count 1104
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 2121 place count 539 transition count 1098
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 2128 place count 539 transition count 1091
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 2129 place count 539 transition count 1090
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2130 place count 538 transition count 1090
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 2143 place count 538 transition count 1090
Applied a total of 2143 rules in 953 ms. Remains 538 /1571 variables (removed 1033) and now considering 1090/2173 (removed 1083) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 954 ms. Remains : 538/1571 places, 1090/2173 transitions.
Incomplete random walk after 10000 steps, including 33 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 6) seen :2
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :1
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :1
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 00:15:31] [INFO ] Flow matrix only has 1079 transitions (discarded 11 similar events)
// Phase 1: matrix 1079 rows 538 cols
[2023-03-16 00:15:31] [INFO ] Computed 61 place invariants in 13 ms
[2023-03-16 00:15:31] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 00:15:32] [INFO ] [Nat]Absence check using 61 positive place invariants in 24 ms returned sat
[2023-03-16 00:15:33] [INFO ] After 1030ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 00:15:33] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-16 00:15:33] [INFO ] After 505ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 00:15:33] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 7 ms to minimize.
[2023-03-16 00:15:34] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2023-03-16 00:15:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 441 ms
[2023-03-16 00:15:34] [INFO ] After 1327ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 339 ms.
[2023-03-16 00:15:34] [INFO ] After 2880ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 21 ms.
Support contains 55 out of 538 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 538/538 places, 1090/1090 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 538 transition count 1076
Reduce places removed 14 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 16 rules applied. Total rules applied 30 place count 524 transition count 1074
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 522 transition count 1074
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 32 place count 522 transition count 1071
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 38 place count 519 transition count 1071
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 46 place count 511 transition count 1061
Iterating global reduction 3 with 8 rules applied. Total rules applied 54 place count 511 transition count 1061
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 88 place count 494 transition count 1044
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 101 place count 481 transition count 1013
Iterating global reduction 3 with 13 rules applied. Total rules applied 114 place count 481 transition count 1013
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 148 place count 464 transition count 1025
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 150 place count 464 transition count 1023
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 151 place count 463 transition count 1019
Iterating global reduction 4 with 1 rules applied. Total rules applied 152 place count 463 transition count 1019
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 166 place count 463 transition count 1005
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 167 place count 462 transition count 1005
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 169 place count 460 transition count 997
Iterating global reduction 5 with 2 rules applied. Total rules applied 171 place count 460 transition count 997
Free-agglomeration rule applied 9 times.
Iterating global reduction 5 with 9 rules applied. Total rules applied 180 place count 460 transition count 988
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 194 place count 451 transition count 983
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 200 place count 451 transition count 977
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 201 place count 451 transition count 976
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 202 place count 450 transition count 976
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 204 place count 450 transition count 974
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 207 place count 450 transition count 974
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 208 place count 449 transition count 973
Applied a total of 208 rules in 207 ms. Remains 449 /538 variables (removed 89) and now considering 973/1090 (removed 117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207 ms. Remains : 449/538 places, 973/1090 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 146434 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 146434 steps, saw 79819 distinct states, run finished after 3004 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-16 00:15:38] [INFO ] Flow matrix only has 963 transitions (discarded 10 similar events)
// Phase 1: matrix 963 rows 449 cols
[2023-03-16 00:15:38] [INFO ] Computed 60 place invariants in 18 ms
[2023-03-16 00:15:38] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 00:15:38] [INFO ] [Nat]Absence check using 60 positive place invariants in 19 ms returned sat
[2023-03-16 00:15:39] [INFO ] After 776ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 00:15:39] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-16 00:15:39] [INFO ] After 440ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 00:15:39] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 2 ms to minimize.
[2023-03-16 00:15:40] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2023-03-16 00:15:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 329 ms
[2023-03-16 00:15:40] [INFO ] After 1017ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 213 ms.
[2023-03-16 00:15:40] [INFO ] After 2174ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 55 out of 449 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 449/449 places, 973/973 transitions.
Applied a total of 0 rules in 16 ms. Remains 449 /449 variables (removed 0) and now considering 973/973 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 449/449 places, 973/973 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 449/449 places, 973/973 transitions.
Applied a total of 0 rules in 14 ms. Remains 449 /449 variables (removed 0) and now considering 973/973 (removed 0) transitions.
[2023-03-16 00:15:40] [INFO ] Flow matrix only has 963 transitions (discarded 10 similar events)
[2023-03-16 00:15:40] [INFO ] Invariant cache hit.
[2023-03-16 00:15:40] [INFO ] Implicit Places using invariants in 384 ms returned [94]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 387 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 448/449 places, 973/973 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 448 transition count 972
Applied a total of 1 rules in 26 ms. Remains 448 /448 variables (removed 0) and now considering 972/973 (removed 1) transitions.
[2023-03-16 00:15:40] [INFO ] Flow matrix only has 962 transitions (discarded 10 similar events)
// Phase 1: matrix 962 rows 448 cols
[2023-03-16 00:15:40] [INFO ] Computed 59 place invariants in 10 ms
[2023-03-16 00:15:41] [INFO ] Implicit Places using invariants in 342 ms returned []
[2023-03-16 00:15:41] [INFO ] Flow matrix only has 962 transitions (discarded 10 similar events)
[2023-03-16 00:15:41] [INFO ] Invariant cache hit.
[2023-03-16 00:15:41] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-16 00:15:42] [INFO ] Implicit Places using invariants and state equation in 874 ms returned []
Implicit Place search using SMT with State Equation took 1220 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 448/449 places, 972/973 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1648 ms. Remains : 448/449 places, 972/973 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 155579 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 155579 steps, saw 82294 distinct states, run finished after 3006 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-16 00:15:45] [INFO ] Flow matrix only has 962 transitions (discarded 10 similar events)
[2023-03-16 00:15:45] [INFO ] Invariant cache hit.
[2023-03-16 00:15:45] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 00:15:45] [INFO ] [Nat]Absence check using 59 positive place invariants in 24 ms returned sat
[2023-03-16 00:15:46] [INFO ] After 756ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 00:15:46] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-16 00:15:46] [INFO ] After 280ms SMT Verify possible using 33 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 00:15:47] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 2 ms to minimize.
[2023-03-16 00:15:47] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 2 ms to minimize.
[2023-03-16 00:15:47] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 0 ms to minimize.
[2023-03-16 00:15:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 616 ms
[2023-03-16 00:15:47] [INFO ] After 1119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 405 ms.
[2023-03-16 00:15:47] [INFO ] After 2429ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 21 ms.
Support contains 55 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 972/972 transitions.
Applied a total of 0 rules in 16 ms. Remains 448 /448 variables (removed 0) and now considering 972/972 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 448/448 places, 972/972 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 972/972 transitions.
Applied a total of 0 rules in 15 ms. Remains 448 /448 variables (removed 0) and now considering 972/972 (removed 0) transitions.
[2023-03-16 00:15:47] [INFO ] Flow matrix only has 962 transitions (discarded 10 similar events)
[2023-03-16 00:15:47] [INFO ] Invariant cache hit.
[2023-03-16 00:15:48] [INFO ] Implicit Places using invariants in 325 ms returned []
[2023-03-16 00:15:48] [INFO ] Flow matrix only has 962 transitions (discarded 10 similar events)
[2023-03-16 00:15:48] [INFO ] Invariant cache hit.
[2023-03-16 00:15:48] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-16 00:15:49] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1223 ms to find 0 implicit places.
[2023-03-16 00:15:49] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-16 00:15:49] [INFO ] Flow matrix only has 962 transitions (discarded 10 similar events)
[2023-03-16 00:15:49] [INFO ] Invariant cache hit.
[2023-03-16 00:15:50] [INFO ] Dead Transitions using invariants and state equation in 748 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2066 ms. Remains : 448/448 places, 972/972 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 448 transition count 962
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 28 place count 448 transition count 944
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 446 transition count 938
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 446 transition count 938
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 446 transition count 938
Applied a total of 35 rules in 54 ms. Remains 446 /448 variables (removed 2) and now considering 938/972 (removed 34) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 938 rows 446 cols
[2023-03-16 00:15:50] [INFO ] Computed 59 place invariants in 8 ms
[2023-03-16 00:15:50] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 00:15:50] [INFO ] [Nat]Absence check using 59 positive place invariants in 222 ms returned sat
[2023-03-16 00:15:51] [INFO ] After 634ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 00:15:51] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 0 ms to minimize.
[2023-03-16 00:15:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2023-03-16 00:15:51] [INFO ] After 1136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 227 ms.
[2023-03-16 00:15:52] [INFO ] After 1900ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-16 00:15:52] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-16 00:15:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 448 places, 972 transitions and 3676 arcs took 7 ms.
[2023-03-16 00:15:52] [INFO ] Flatten gal took : 173 ms
Total runtime 50305 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/544/inv_0_ --invariant=/tmp/544/inv_1_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11488552 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16098620 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="NoC3x3-PT-5B"
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 NoC3x3-PT-5B, 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 r265-smll-167863539800302"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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