Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r510-tall-171654365200363.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is NoC3x3-PT-2B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r510-tall-171654365200363
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1000K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 06:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 12 06:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 06:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Apr 12 06:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 548K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717232082719

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=NoC3x3-PT-2B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:54:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 08:54:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:54:44] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2024-06-01 08:54:44] [INFO ] Transformed 2003 places.
[2024-06-01 08:54:44] [INFO ] Transformed 2292 transitions.
[2024-06-01 08:54:44] [INFO ] Found NUPN structural information;
[2024-06-01 08:54:44] [INFO ] Parsed PT model containing 2003 places and 2292 transitions and 5835 arcs in 303 ms.
Graph (trivial) has 1634 edges and 2003 vertex of which 72 / 2003 are part of one of the 9 SCC in 8 ms
Free SCC test removed 63 places
Structural test allowed to assert that 332 places are NOT stable. Took 41 ms.
Ensure Unique test removed 63 transitions
Reduce redundant transitions removed 63 transitions.
RANDOM walk for 40000 steps (101 resets) in 3635 ms. (11 steps per ms) remains 211/1671 properties
BEST_FIRST walk for 404 steps (8 resets) in 20 ms. (19 steps per ms) remains 211/211 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 211/211 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 211/211 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 211/211 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 211/211 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 211/211 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 211/211 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 211/211 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 211/211 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 211/211 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 211/211 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 211/211 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 211/211 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 211/211 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 211/211 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 211/211 properties
BEST_FIRST walk for 403 steps (8 resets) in 20 ms. (19 steps per ms) remains 211/211 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 211/211 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 211/211 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 211/211 properties
BEST_FIRST walk for 401 steps (8 resets) in 17 ms. (22 steps per ms) remains 211/211 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 211/211 properties
BEST_FIRST walk for 402 steps (8 resets) in 16 ms. (23 steps per ms) remains 211/211 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 211/211 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 211/211 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 211/211 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 211/211 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 211/211 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 211/211 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 211/211 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 211/211 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 211/211 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 211/211 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 211/211 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 211/211 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 211/211 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 211/211 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 211/211 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 211/211 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 211/211 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 211/211 properties
BEST_FIRST walk for 402 steps (8 resets) in 5 ms. (67 steps per ms) remains 211/211 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 211/211 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 211/211 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 211/211 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 211/211 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 211/211 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 211/211 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 211/211 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 211/211 properties
[2024-06-01 08:54:45] [INFO ] Flow matrix only has 2221 transitions (discarded 8 similar events)
// Phase 1: matrix 2221 rows 1940 cols
[2024-06-01 08:54:45] [INFO ] Computed 66 invariants in 33 ms
[2024-06-01 08:54:46] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 211/211 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 988/1199 variables, 30/241 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1199 variables, 988/1229 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 (/ 1.0 40.0))
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 (/ 39.0 40.0))
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s143 0.0)
(s144 (/ 1.0 40.0))
(s145 (/ 1.0 40.0))
(s146 (/ 1.0 40.0))
(s147 (/ 1.0 40.0))
(s148 (/ 1.0 40.0))
(s149 0.0)
(s150 (/ 1.0 40.0))
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 (/ 1.0 40.0))
(s157 (/ 1.0 40.0))
(s158 (/ 1.0 40.0))
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 (/ 31.0 40.0))
(s167 0.0)
(s178 0.0)
(s179 (/ 39.0 40.0))
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 (/ 1.0 40.0))
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 (/ 1.0 40.0))
(s202 (/ 1.0 40.0))
(s203 0.0)
(s204 0.0)
(s205 (/ 1.0 40.0))
(s206 (/ 1.0 40.0))
(s207 0.0)
(s208 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1199/4161 variables, and 1229 constraints, problems are : Problem set: 0 solved, 211 unsolved in 5058 ms.
Refiners :[Domain max(s): 1199/1940 constraints, Positive P Invariants (semi-flows): 30/66 constraints, State Equation: 0/1940 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 211/211 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 988/1199 variables, 30/241 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1199 variables, 988/1229 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-01 08:54:52] [INFO ] Deduced a trap composed of 34 places in 440 ms of which 91 ms to minimize.
[2024-06-01 08:54:53] [INFO ] Deduced a trap composed of 16 places in 422 ms of which 6 ms to minimize.
[2024-06-01 08:54:53] [INFO ] Deduced a trap composed of 15 places in 302 ms of which 5 ms to minimize.
[2024-06-01 08:54:54] [INFO ] Deduced a trap composed of 45 places in 274 ms of which 4 ms to minimize.
[2024-06-01 08:54:54] [INFO ] Deduced a trap composed of 34 places in 270 ms of which 4 ms to minimize.
[2024-06-01 08:54:54] [INFO ] Deduced a trap composed of 61 places in 254 ms of which 5 ms to minimize.
[2024-06-01 08:54:54] [INFO ] Deduced a trap composed of 61 places in 207 ms of which 4 ms to minimize.
[2024-06-01 08:54:55] [INFO ] Deduced a trap composed of 73 places in 174 ms of which 3 ms to minimize.
[2024-06-01 08:54:55] [INFO ] Deduced a trap composed of 81 places in 137 ms of which 3 ms to minimize.
[2024-06-01 08:54:55] [INFO ] Deduced a trap composed of 61 places in 145 ms of which 3 ms to minimize.
[2024-06-01 08:54:55] [INFO ] Deduced a trap composed of 69 places in 133 ms of which 3 ms to minimize.
[2024-06-01 08:54:55] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 2 ms to minimize.
[2024-06-01 08:54:55] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 2 ms to minimize.
[2024-06-01 08:54:55] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 2 ms to minimize.
[2024-06-01 08:54:56] [INFO ] Deduced a trap composed of 121 places in 99 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1199/4161 variables, and 1244 constraints, problems are : Problem set: 0 solved, 211 unsolved in 5013 ms.
Refiners :[Domain max(s): 1199/1940 constraints, Positive P Invariants (semi-flows): 30/66 constraints, State Equation: 0/1940 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/211 constraints, Known Traps: 15/15 constraints]
After SMT, in 10278ms problems are : Problem set: 0 solved, 211 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 211 out of 1940 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1940/1940 places, 2229/2229 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 349 transitions
Trivial Post-agglo rules discarded 349 transitions
Performed 349 trivial Post agglomeration. Transition count delta: 349
Iterating post reduction 0 with 365 rules applied. Total rules applied 365 place count 1933 transition count 1871
Reduce places removed 349 places and 0 transitions.
Iterating post reduction 1 with 349 rules applied. Total rules applied 714 place count 1584 transition count 1871
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 714 place count 1584 transition count 1847
Deduced a syphon composed of 24 places in 4 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 762 place count 1560 transition count 1847
Discarding 271 places :
Symmetric choice reduction at 2 with 271 rule applications. Total rules 1033 place count 1289 transition count 1576
Iterating global reduction 2 with 271 rules applied. Total rules applied 1304 place count 1289 transition count 1576
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 1304 place count 1289 transition count 1561
Deduced a syphon composed of 15 places in 11 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 1334 place count 1274 transition count 1561
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1435 place count 1173 transition count 1460
Iterating global reduction 2 with 101 rules applied. Total rules applied 1536 place count 1173 transition count 1460
Discarding 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 1626 place count 1083 transition count 1359
Iterating global reduction 2 with 90 rules applied. Total rules applied 1716 place count 1083 transition count 1359
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 1741 place count 1058 transition count 1316
Iterating global reduction 2 with 25 rules applied. Total rules applied 1766 place count 1058 transition count 1316
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 1779 place count 1057 transition count 1304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1780 place count 1056 transition count 1304
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 1794 place count 1042 transition count 1290
Iterating global reduction 4 with 14 rules applied. Total rules applied 1808 place count 1042 transition count 1290
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1814 place count 1036 transition count 1278
Iterating global reduction 4 with 6 rules applied. Total rules applied 1820 place count 1036 transition count 1278
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1826 place count 1030 transition count 1272
Iterating global reduction 4 with 6 rules applied. Total rules applied 1832 place count 1030 transition count 1272
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 8 rules applied. Total rules applied 1840 place count 1029 transition count 1265
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1841 place count 1028 transition count 1265
Performed 298 Post agglomeration using F-continuation condition.Transition count delta: 298
Deduced a syphon composed of 298 places in 1 ms
Reduce places removed 298 places and 0 transitions.
Iterating global reduction 6 with 596 rules applied. Total rules applied 2437 place count 730 transition count 967
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 2446 place count 721 transition count 958
Iterating global reduction 6 with 9 rules applied. Total rules applied 2455 place count 721 transition count 958
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 2460 place count 716 transition count 948
Iterating global reduction 6 with 5 rules applied. Total rules applied 2465 place count 716 transition count 948
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 2467 place count 714 transition count 938
Iterating global reduction 6 with 2 rules applied. Total rules applied 2469 place count 714 transition count 938
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -147
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 2525 place count 686 transition count 1085
Free-agglomeration rule applied 39 times.
Iterating global reduction 6 with 39 rules applied. Total rules applied 2564 place count 686 transition count 1046
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 49 rules applied. Total rules applied 2613 place count 647 transition count 1036
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 2614 place count 647 transition count 1035
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2616 place count 647 transition count 1033
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 2618 place count 645 transition count 1033
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 2628 place count 645 transition count 1033
Partial Post-agglomeration rule applied 19 times.
Drop transitions (Partial Post agglomeration) removed 19 transitions
Iterating global reduction 8 with 19 rules applied. Total rules applied 2647 place count 645 transition count 1033
Applied a total of 2647 rules in 1064 ms. Remains 645 /1940 variables (removed 1295) and now considering 1033/2229 (removed 1196) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1087 ms. Remains : 645/1940 places, 1033/2229 transitions.
RANDOM walk for 4000000 steps (54599 resets) in 32647 ms. (122 steps per ms) remains 3/211 properties
BEST_FIRST walk for 4000004 steps (3105 resets) in 5469 ms. (731 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (3101 resets) in 5514 ms. (725 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (3122 resets) in 5406 ms. (739 steps per ms) remains 3/3 properties
[2024-06-01 08:55:09] [INFO ] Flow matrix only has 1031 transitions (discarded 2 similar events)
// Phase 1: matrix 1031 rows 645 cols
[2024-06-01 08:55:09] [INFO ] Computed 59 invariants in 14 ms
[2024-06-01 08:55:09] [INFO ] State equation strengthened by 80 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 576/613 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/613 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1021/1634 variables, 613/672 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1634 variables, 73/745 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1634 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 42/1676 variables, 32/777 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1676 variables, 7/784 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1676 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1676 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1676/1676 variables, and 784 constraints, problems are : Problem set: 0 solved, 3 unsolved in 609 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 645/645 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 576/613 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:55:10] [INFO ] Deduced a trap composed of 6 places in 224 ms of which 3 ms to minimize.
[2024-06-01 08:55:11] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 3 ms to minimize.
[2024-06-01 08:55:11] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 2 ms to minimize.
[2024-06-01 08:55:11] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 3 ms to minimize.
[2024-06-01 08:55:11] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 3 ms to minimize.
[2024-06-01 08:55:11] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 3 ms to minimize.
[2024-06-01 08:55:11] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 3 ms to minimize.
[2024-06-01 08:55:12] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 2 ms to minimize.
[2024-06-01 08:55:12] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 2 ms to minimize.
[2024-06-01 08:55:12] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 2 ms to minimize.
[2024-06-01 08:55:12] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 2 ms to minimize.
[2024-06-01 08:55:12] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 2 ms to minimize.
[2024-06-01 08:55:12] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 2 ms to minimize.
[2024-06-01 08:55:12] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-06-01 08:55:12] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2024-06-01 08:55:12] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/613 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/613 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1021/1634 variables, 613/688 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1634 variables, 73/761 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1634 variables, 2/763 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1634 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem smplace_144 is UNSAT
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST SMT_REFINEMENT TOPOLOGICAL
SMT process timed out in 3329ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 645 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 645/645 places, 1033/1033 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 643 transition count 977
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 114 place count 587 transition count 977
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 114 place count 587 transition count 958
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 152 place count 568 transition count 958
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 187 place count 533 transition count 922
Iterating global reduction 2 with 35 rules applied. Total rules applied 222 place count 533 transition count 922
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 222 place count 533 transition count 921
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 224 place count 532 transition count 921
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 239 place count 517 transition count 906
Iterating global reduction 2 with 15 rules applied. Total rules applied 254 place count 517 transition count 906
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 260 place count 511 transition count 894
Iterating global reduction 2 with 6 rules applied. Total rules applied 266 place count 511 transition count 894
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 271 place count 506 transition count 887
Iterating global reduction 2 with 5 rules applied. Total rules applied 276 place count 506 transition count 887
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 282 place count 505 transition count 882
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 283 place count 504 transition count 882
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 284 place count 503 transition count 880
Iterating global reduction 4 with 1 rules applied. Total rules applied 285 place count 503 transition count 880
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 288 place count 503 transition count 877
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 5 with 118 rules applied. Total rules applied 406 place count 444 transition count 818
Discarding 47 places :
Symmetric choice reduction at 5 with 47 rule applications. Total rules 453 place count 397 transition count 623
Iterating global reduction 5 with 47 rules applied. Total rules applied 500 place count 397 transition count 623
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 502 place count 397 transition count 621
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 511 place count 388 transition count 603
Iterating global reduction 6 with 9 rules applied. Total rules applied 520 place count 388 transition count 603
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 524 place count 388 transition count 599
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 527 place count 385 transition count 593
Iterating global reduction 7 with 3 rules applied. Total rules applied 530 place count 385 transition count 593
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 533 place count 385 transition count 590
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 535 place count 384 transition count 590
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 536 place count 384 transition count 589
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 537 place count 384 transition count 588
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 538 place count 383 transition count 588
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 544 place count 383 transition count 588
Applied a total of 544 rules in 151 ms. Remains 383 /645 variables (removed 262) and now considering 588/1033 (removed 445) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 383/645 places, 588/1033 transitions.
Total runtime 29330 ms.
ITS solved all properties within timeout

BK_STOP 1717232113761

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML

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-2B"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is NoC3x3-PT-2B, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r510-tall-171654365200363"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-2B.tgz
mv NoC3x3-PT-2B execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;