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-167863539800270.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-3B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863539800270
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 952K
-rw-r--r-- 1 mcc users 7.7K Feb 26 09:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 09:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 09:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 09:54 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:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 09:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 09:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 09:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 09:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:28 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 581K 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-3B-ReachabilityCardinality-00
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-01
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-02
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-03
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-04
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-05
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-06
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-07
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-08
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-09
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-10
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-11
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-12
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-13
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-14
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678889118529

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-3B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 14:05:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 14:05:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 14:05:21] [INFO ] Load time of PNML (sax parser for PT used): 322 ms
[2023-03-15 14:05:21] [INFO ] Transformed 2117 places.
[2023-03-15 14:05:21] [INFO ] Transformed 2435 transitions.
[2023-03-15 14:05:21] [INFO ] Found NUPN structural information;
[2023-03-15 14:05:21] [INFO ] Parsed PT model containing 2117 places and 2435 transitions and 6177 arcs in 505 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 37 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 17 resets, run finished after 785 ms. (steps per millisecond=12 ) properties (out of 13) seen :9
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2435 rows 2117 cols
[2023-03-15 14:05:23] [INFO ] Computed 66 place invariants in 42 ms
[2023-03-15 14:05:24] [INFO ] [Real]Absence check using 66 positive place invariants in 185 ms returned sat
[2023-03-15 14:05:24] [INFO ] After 1821ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-15 14:05:25] [INFO ] [Nat]Absence check using 66 positive place invariants in 107 ms returned sat
[2023-03-15 14:05:28] [INFO ] After 2138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-15 14:05:29] [INFO ] Deduced a trap composed of 84 places in 752 ms of which 10 ms to minimize.
[2023-03-15 14:05:29] [INFO ] Deduced a trap composed of 52 places in 633 ms of which 2 ms to minimize.
[2023-03-15 14:05:30] [INFO ] Deduced a trap composed of 105 places in 519 ms of which 2 ms to minimize.
[2023-03-15 14:05:31] [INFO ] Deduced a trap composed of 100 places in 353 ms of which 3 ms to minimize.
[2023-03-15 14:05:31] [INFO ] Deduced a trap composed of 82 places in 301 ms of which 2 ms to minimize.
[2023-03-15 14:05:31] [INFO ] Deduced a trap composed of 78 places in 381 ms of which 1 ms to minimize.
[2023-03-15 14:05:32] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3697 ms
[2023-03-15 14:05:32] [INFO ] Deduced a trap composed of 28 places in 413 ms of which 1 ms to minimize.
[2023-03-15 14:05:33] [INFO ] Deduced a trap composed of 70 places in 392 ms of which 2 ms to minimize.
[2023-03-15 14:05:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1114 ms
[2023-03-15 14:05:33] [INFO ] After 7534ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 426 ms.
[2023-03-15 14:05:34] [INFO ] After 9208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 130 ms.
Support contains 31 out of 2117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2117/2117 places, 2435/2435 transitions.
Graph (trivial) has 1702 edges and 2117 vertex of which 72 / 2117 are part of one of the 9 SCC in 12 ms
Free SCC test removed 63 places
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 423 transitions
Trivial Post-agglo rules discarded 423 transitions
Performed 423 trivial Post agglomeration. Transition count delta: 423
Iterating post reduction 0 with 428 rules applied. Total rules applied 429 place count 2049 transition count 1940
Reduce places removed 423 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 427 rules applied. Total rules applied 856 place count 1626 transition count 1936
Reduce places removed 2 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 9 rules applied. Total rules applied 865 place count 1624 transition count 1929
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 872 place count 1617 transition count 1929
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 872 place count 1617 transition count 1905
Deduced a syphon composed of 24 places in 6 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 920 place count 1593 transition count 1905
Discarding 360 places :
Symmetric choice reduction at 4 with 360 rule applications. Total rules 1280 place count 1233 transition count 1545
Iterating global reduction 4 with 360 rules applied. Total rules applied 1640 place count 1233 transition count 1545
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 40 Pre rules applied. Total rules applied 1640 place count 1233 transition count 1505
Deduced a syphon composed of 40 places in 9 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 1720 place count 1193 transition count 1505
Discarding 130 places :
Symmetric choice reduction at 4 with 130 rule applications. Total rules 1850 place count 1063 transition count 1336
Iterating global reduction 4 with 130 rules applied. Total rules applied 1980 place count 1063 transition count 1336
Discarding 131 places :
Symmetric choice reduction at 4 with 131 rule applications. Total rules 2111 place count 932 transition count 1191
Iterating global reduction 4 with 131 rules applied. Total rules applied 2242 place count 932 transition count 1191
Discarding 48 places :
Symmetric choice reduction at 4 with 48 rule applications. Total rules 2290 place count 884 transition count 1105
Iterating global reduction 4 with 48 rules applied. Total rules applied 2338 place count 884 transition count 1105
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 14 rules applied. Total rules applied 2352 place count 883 transition count 1092
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2353 place count 882 transition count 1092
Discarding 36 places :
Symmetric choice reduction at 6 with 36 rule applications. Total rules 2389 place count 846 transition count 1056
Iterating global reduction 6 with 36 rules applied. Total rules applied 2425 place count 846 transition count 1056
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 6 rules applied. Total rules applied 2431 place count 843 transition count 1053
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 2434 place count 840 transition count 1053
Discarding 25 places :
Symmetric choice reduction at 8 with 25 rule applications. Total rules 2459 place count 815 transition count 1003
Iterating global reduction 8 with 25 rules applied. Total rules applied 2484 place count 815 transition count 1003
Discarding 24 places :
Symmetric choice reduction at 8 with 24 rule applications. Total rules 2508 place count 791 transition count 979
Iterating global reduction 8 with 24 rules applied. Total rules applied 2532 place count 791 transition count 979
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 8 with 30 rules applied. Total rules applied 2562 place count 787 transition count 953
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 2566 place count 783 transition count 953
Performed 299 Post agglomeration using F-continuation condition.Transition count delta: 299
Deduced a syphon composed of 299 places in 1 ms
Reduce places removed 299 places and 0 transitions.
Iterating global reduction 10 with 598 rules applied. Total rules applied 3164 place count 484 transition count 654
Discarding 16 places :
Symmetric choice reduction at 10 with 16 rule applications. Total rules 3180 place count 468 transition count 637
Iterating global reduction 10 with 16 rules applied. Total rules applied 3196 place count 468 transition count 637
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 3203 place count 461 transition count 623
Iterating global reduction 10 with 7 rules applied. Total rules applied 3210 place count 461 transition count 623
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 3212 place count 459 transition count 619
Iterating global reduction 10 with 2 rules applied. Total rules applied 3214 place count 459 transition count 619
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3216 place count 458 transition count 618
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 10 with 38 rules applied. Total rules applied 3254 place count 439 transition count 647
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 3255 place count 438 transition count 645
Iterating global reduction 10 with 1 rules applied. Total rules applied 3256 place count 438 transition count 645
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 3259 place count 438 transition count 642
Free-agglomeration rule applied 30 times.
Iterating global reduction 10 with 30 rules applied. Total rules applied 3289 place count 438 transition count 612
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 35 rules applied. Total rules applied 3324 place count 408 transition count 607
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 3329 place count 408 transition count 602
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 3333 place count 408 transition count 598
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 3337 place count 404 transition count 598
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 12 with 6 rules applied. Total rules applied 3343 place count 404 transition count 598
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 3346 place count 404 transition count 598
Applied a total of 3346 rules in 1427 ms. Remains 404 /2117 variables (removed 1713) and now considering 598/2435 (removed 1837) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1428 ms. Remains : 404/2117 places, 598/2435 transitions.
Incomplete random walk after 10000 steps, including 116 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 283965 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{}
Probabilistic random walk after 283965 steps, saw 64329 distinct states, run finished after 3007 ms. (steps per millisecond=94 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 598 rows 404 cols
[2023-03-15 14:05:39] [INFO ] Computed 57 place invariants in 11 ms
[2023-03-15 14:05:39] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 14:05:39] [INFO ] [Nat]Absence check using 57 positive place invariants in 21 ms returned sat
[2023-03-15 14:05:39] [INFO ] After 324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 14:05:39] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-15 14:05:39] [INFO ] After 102ms SMT Verify possible using 69 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 14:05:39] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-15 14:05:39] [INFO ] After 734ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 6 ms.
Support contains 22 out of 404 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 404/404 places, 598/598 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 404 transition count 597
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 403 transition count 597
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 403 transition count 596
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 402 transition count 596
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 400 transition count 592
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 400 transition count 592
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 16 place count 400 transition count 584
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 22 place count 397 transition count 581
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 24 place count 395 transition count 575
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 395 transition count 575
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 27 place count 394 transition count 573
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 394 transition count 573
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 29 place count 394 transition count 572
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 32 place count 394 transition count 569
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 37 place count 391 transition count 567
Applied a total of 37 rules in 240 ms. Remains 391 /404 variables (removed 13) and now considering 567/598 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 241 ms. Remains : 391/404 places, 567/598 transitions.
Incomplete random walk after 10000 steps, including 115 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 398962 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :{}
Probabilistic random walk after 398962 steps, saw 91745 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 567 rows 391 cols
[2023-03-15 14:05:43] [INFO ] Computed 57 place invariants in 9 ms
[2023-03-15 14:05:43] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:05:43] [INFO ] [Nat]Absence check using 57 positive place invariants in 14 ms returned sat
[2023-03-15 14:05:43] [INFO ] After 267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:05:43] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 14:05:43] [INFO ] After 90ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:05:43] [INFO ] After 146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-15 14:05:43] [INFO ] After 558ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 22 out of 391 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 391/391 places, 567/567 transitions.
Applied a total of 0 rules in 12 ms. Remains 391 /391 variables (removed 0) and now considering 567/567 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 391/391 places, 567/567 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 391/391 places, 567/567 transitions.
Applied a total of 0 rules in 37 ms. Remains 391 /391 variables (removed 0) and now considering 567/567 (removed 0) transitions.
[2023-03-15 14:05:43] [INFO ] Invariant cache hit.
[2023-03-15 14:05:44] [INFO ] Implicit Places using invariants in 353 ms returned [11, 41, 80, 114, 165, 297, 331, 378]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 366 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 383/391 places, 567/567 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 366 transition count 550
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 51 place count 366 transition count 533
Applied a total of 51 rules in 66 ms. Remains 366 /383 variables (removed 17) and now considering 533/567 (removed 34) transitions.
// Phase 1: matrix 533 rows 366 cols
[2023-03-15 14:05:44] [INFO ] Computed 49 place invariants in 5 ms
[2023-03-15 14:05:44] [INFO ] Implicit Places using invariants in 572 ms returned []
[2023-03-15 14:05:44] [INFO ] Invariant cache hit.
[2023-03-15 14:05:45] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-15 14:05:45] [INFO ] Implicit Places using invariants and state equation in 821 ms returned [6, 10, 27, 28, 31, 32, 36, 37, 69, 71, 74, 75, 96, 97, 102, 103, 106, 133, 134, 135, 136, 139, 140, 141, 145, 146, 147, 151, 152, 153, 219, 220, 221, 224, 225, 226, 227, 230, 231, 232, 276, 277, 281, 301, 302, 303, 306, 310, 311, 312, 352, 355]
Discarding 52 places :
Implicit Place search using SMT with State Equation took 1404 ms to find 52 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 314/391 places, 533/567 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 314 transition count 524
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 305 transition count 524
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 96 place count 266 transition count 485
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 110 place count 259 transition count 487
Free-agglomeration rule (complex) applied 56 times.
Iterating global reduction 2 with 56 rules applied. Total rules applied 166 place count 259 transition count 448
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 67 rules applied. Total rules applied 233 place count 203 transition count 437
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 236 place count 203 transition count 434
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 243 place count 203 transition count 434
Applied a total of 243 rules in 56 ms. Remains 203 /314 variables (removed 111) and now considering 434/533 (removed 99) transitions.
[2023-03-15 14:05:45] [INFO ] Flow matrix only has 430 transitions (discarded 4 similar events)
// Phase 1: matrix 430 rows 203 cols
[2023-03-15 14:05:45] [INFO ] Computed 34 place invariants in 5 ms
[2023-03-15 14:05:46] [INFO ] Implicit Places using invariants in 523 ms returned []
[2023-03-15 14:05:46] [INFO ] Flow matrix only has 430 transitions (discarded 4 similar events)
[2023-03-15 14:05:46] [INFO ] Invariant cache hit.
[2023-03-15 14:05:46] [INFO ] State equation strengthened by 115 read => feed constraints.
[2023-03-15 14:05:46] [INFO ] Implicit Places using invariants and state equation in 592 ms returned [41, 79]
Discarding 2 places :
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Implicit Place search using SMT with State Equation took 1125 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 201/391 places, 430/567 transitions.
Applied a total of 0 rules in 7 ms. Remains 201 /201 variables (removed 0) and now considering 430/430 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 3064 ms. Remains : 201/391 places, 430/567 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 488731 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :{}
Probabilistic random walk after 488731 steps, saw 117717 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:05:50] [INFO ] Flow matrix only has 426 transitions (discarded 4 similar events)
// Phase 1: matrix 426 rows 201 cols
[2023-03-15 14:05:50] [INFO ] Computed 32 place invariants in 8 ms
[2023-03-15 14:05:50] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:05:50] [INFO ] [Nat]Absence check using 32 positive place invariants in 10 ms returned sat
[2023-03-15 14:05:50] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:05:50] [INFO ] State equation strengthened by 97 read => feed constraints.
[2023-03-15 14:05:50] [INFO ] After 70ms SMT Verify possible using 97 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:05:50] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-15 14:05:50] [INFO ] After 391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 22 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 430/430 transitions.
Applied a total of 0 rules in 9 ms. Remains 201 /201 variables (removed 0) and now considering 430/430 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 201/201 places, 430/430 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 430/430 transitions.
Applied a total of 0 rules in 7 ms. Remains 201 /201 variables (removed 0) and now considering 430/430 (removed 0) transitions.
[2023-03-15 14:05:50] [INFO ] Flow matrix only has 426 transitions (discarded 4 similar events)
[2023-03-15 14:05:50] [INFO ] Invariant cache hit.
[2023-03-15 14:05:50] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-15 14:05:50] [INFO ] Flow matrix only has 426 transitions (discarded 4 similar events)
[2023-03-15 14:05:50] [INFO ] Invariant cache hit.
[2023-03-15 14:05:51] [INFO ] State equation strengthened by 97 read => feed constraints.
[2023-03-15 14:05:51] [INFO ] Implicit Places using invariants and state equation in 577 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
[2023-03-15 14:05:51] [INFO ] Redundant transitions in 131 ms returned []
[2023-03-15 14:05:51] [INFO ] Flow matrix only has 426 transitions (discarded 4 similar events)
[2023-03-15 14:05:51] [INFO ] Invariant cache hit.
[2023-03-15 14:05:51] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1399 ms. Remains : 201/201 places, 430/430 transitions.
Graph (trivial) has 63 edges and 201 vertex of which 40 / 201 are part of one of the 20 SCC in 1 ms
Free SCC test removed 20 places
Drop transitions removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Graph (complete) has 567 edges and 181 vertex of which 161 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Discarding 20 places :
Also discarding 0 output transitions
Drop transitions removed 44 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 161 transition count 309
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 158 transition count 306
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 76 place count 158 transition count 304
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 158 transition count 302
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 2 with 15 rules applied. Total rules applied 93 place count 158 transition count 302
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 158 transition count 300
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 157 transition count 299
Applied a total of 96 rules in 45 ms. Remains 157 /201 variables (removed 44) and now considering 299/430 (removed 131) transitions.
Running SMT prover for 1 properties.
[2023-03-15 14:05:52] [INFO ] Flow matrix only has 292 transitions (discarded 7 similar events)
// Phase 1: matrix 292 rows 157 cols
[2023-03-15 14:05:52] [INFO ] Computed 24 place invariants in 1 ms
[2023-03-15 14:05:52] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:05:52] [INFO ] [Nat]Absence check using 24 positive place invariants in 8 ms returned sat
[2023-03-15 14:05:52] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:05:52] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-15 14:05:52] [INFO ] After 36ms SMT Verify possible using 81 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:05:52] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
[2023-03-15 14:05:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-15 14:05:52] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-15 14:05:52] [INFO ] After 342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:05:52] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-15 14:05:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 201 places, 430 transitions and 1927 arcs took 9 ms.
[2023-03-15 14:05:52] [INFO ] Flatten gal took : 108 ms
Total runtime 31689 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/558/inv_0_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8124804 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16098924 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-3B"
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-3B, 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-167863539800270"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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