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.r267-smll-167863541600254.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 smartxred
Input is NoC3x3-PT-2B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-167863541600254
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 972K
-rw-r--r-- 1 mcc users 5.8K Feb 26 10:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 26 10:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 10:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 10:05 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.5K Feb 25 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 12K Feb 26 10:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 26 10:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 10:06 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 548K 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-2B-ReachabilityCardinality-00
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-01
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-02
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-03
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-04
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-05
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-06
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-07
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-08
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-09
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-10
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-11
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-12
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-13
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-14
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678815914849

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-2B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 17:45:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 17:45:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 17:45:18] [INFO ] Load time of PNML (sax parser for PT used): 258 ms
[2023-03-14 17:45:18] [INFO ] Transformed 2003 places.
[2023-03-14 17:45:18] [INFO ] Transformed 2292 transitions.
[2023-03-14 17:45:18] [INFO ] Found NUPN structural information;
[2023-03-14 17:45:18] [INFO ] Parsed PT model containing 2003 places and 2292 transitions and 5835 arcs in 428 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 15 resets, run finished after 906 ms. (steps per millisecond=11 ) properties (out of 15) seen :7
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :1
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2292 rows 2003 cols
[2023-03-14 17:45:20] [INFO ] Computed 66 place invariants in 44 ms
[2023-03-14 17:45:22] [INFO ] After 1293ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-14 17:45:23] [INFO ] [Nat]Absence check using 66 positive place invariants in 63 ms returned sat
[2023-03-14 17:45:26] [INFO ] After 3109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-14 17:45:29] [INFO ] Deduced a trap composed of 104 places in 2405 ms of which 17 ms to minimize.
[2023-03-14 17:45:31] [INFO ] Deduced a trap composed of 28 places in 2219 ms of which 4 ms to minimize.
[2023-03-14 17:45:32] [INFO ] Deduced a trap composed of 107 places in 1000 ms of which 1 ms to minimize.
[2023-03-14 17:45:33] [INFO ] Deduced a trap composed of 114 places in 1049 ms of which 4 ms to minimize.
[2023-03-14 17:45:35] [INFO ] Deduced a trap composed of 60 places in 954 ms of which 5 ms to minimize.
[2023-03-14 17:45:35] [INFO ] Deduced a trap composed of 75 places in 819 ms of which 1 ms to minimize.
[2023-03-14 17:45:37] [INFO ] Deduced a trap composed of 177 places in 901 ms of which 2 ms to minimize.
[2023-03-14 17:45:37] [INFO ] Deduced a trap composed of 85 places in 709 ms of which 2 ms to minimize.
[2023-03-14 17:45:38] [INFO ] Deduced a trap composed of 88 places in 617 ms of which 1 ms to minimize.
[2023-03-14 17:45:38] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 12105 ms
[2023-03-14 17:45:39] [INFO ] Deduced a trap composed of 45 places in 268 ms of which 2 ms to minimize.
[2023-03-14 17:45:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 580 ms
[2023-03-14 17:45:40] [INFO ] Deduced a trap composed of 103 places in 439 ms of which 2 ms to minimize.
[2023-03-14 17:45:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 759 ms
[2023-03-14 17:45:41] [INFO ] Deduced a trap composed of 17 places in 519 ms of which 2 ms to minimize.
[2023-03-14 17:45:42] [INFO ] Deduced a trap composed of 87 places in 445 ms of which 2 ms to minimize.
[2023-03-14 17:45:42] [INFO ] Deduced a trap composed of 77 places in 350 ms of which 1 ms to minimize.
[2023-03-14 17:45:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1928 ms
[2023-03-14 17:45:43] [INFO ] Deduced a trap composed of 162 places in 418 ms of which 1 ms to minimize.
[2023-03-14 17:45:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 729 ms
[2023-03-14 17:45:44] [INFO ] Deduced a trap composed of 51 places in 258 ms of which 1 ms to minimize.
[2023-03-14 17:45:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 560 ms
[2023-03-14 17:45:44] [INFO ] After 21278ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1147 ms.
[2023-03-14 17:45:45] [INFO ] After 23820ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 4 properties in 525 ms.
Support contains 42 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2292/2292 transitions.
Graph (trivial) has 1564 edges and 2003 vertex of which 64 / 2003 are part of one of the 8 SCC in 14 ms
Free SCC test removed 56 places
Drop transitions removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 382 transitions
Trivial Post-agglo rules discarded 382 transitions
Performed 382 trivial Post agglomeration. Transition count delta: 382
Iterating post reduction 0 with 391 rules applied. Total rules applied 392 place count 1938 transition count 1846
Reduce places removed 382 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 390 rules applied. Total rules applied 782 place count 1556 transition count 1838
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 790 place count 1548 transition count 1838
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 790 place count 1548 transition count 1811
Deduced a syphon composed of 27 places in 13 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 844 place count 1521 transition count 1811
Discarding 348 places :
Symmetric choice reduction at 3 with 348 rule applications. Total rules 1192 place count 1173 transition count 1463
Iterating global reduction 3 with 348 rules applied. Total rules applied 1540 place count 1173 transition count 1463
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 1540 place count 1173 transition count 1424
Deduced a syphon composed of 39 places in 12 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 1618 place count 1134 transition count 1424
Discarding 125 places :
Symmetric choice reduction at 3 with 125 rule applications. Total rules 1743 place count 1009 transition count 1262
Iterating global reduction 3 with 125 rules applied. Total rules applied 1868 place count 1009 transition count 1262
Discarding 113 places :
Symmetric choice reduction at 3 with 113 rule applications. Total rules 1981 place count 896 transition count 1140
Iterating global reduction 3 with 113 rules applied. Total rules applied 2094 place count 896 transition count 1140
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 2132 place count 858 transition count 1071
Iterating global reduction 3 with 38 rules applied. Total rules applied 2170 place count 858 transition count 1071
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 13 rules applied. Total rules applied 2183 place count 856 transition count 1060
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2185 place count 854 transition count 1060
Discarding 27 places :
Symmetric choice reduction at 5 with 27 rule applications. Total rules 2212 place count 827 transition count 1033
Iterating global reduction 5 with 27 rules applied. Total rules applied 2239 place count 827 transition count 1033
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 2243 place count 825 transition count 1031
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2245 place count 823 transition count 1031
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 2260 place count 808 transition count 1001
Iterating global reduction 7 with 15 rules applied. Total rules applied 2275 place count 808 transition count 1001
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 2290 place count 793 transition count 986
Iterating global reduction 7 with 15 rules applied. Total rules applied 2305 place count 793 transition count 986
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 2320 place count 793 transition count 971
Performed 298 Post agglomeration using F-continuation condition.Transition count delta: 298
Deduced a syphon composed of 298 places in 0 ms
Reduce places removed 298 places and 0 transitions.
Iterating global reduction 8 with 596 rules applied. Total rules applied 2916 place count 495 transition count 673
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 2927 place count 484 transition count 662
Iterating global reduction 8 with 11 rules applied. Total rules applied 2938 place count 484 transition count 662
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 2946 place count 476 transition count 646
Iterating global reduction 8 with 8 rules applied. Total rules applied 2954 place count 476 transition count 646
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2955 place count 475 transition count 644
Iterating global reduction 8 with 1 rules applied. Total rules applied 2956 place count 475 transition count 644
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 8 with 38 rules applied. Total rules applied 2994 place count 456 transition count 684
Free-agglomeration rule applied 21 times.
Iterating global reduction 8 with 21 rules applied. Total rules applied 3015 place count 456 transition count 663
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 25 rules applied. Total rules applied 3040 place count 435 transition count 659
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 3041 place count 435 transition count 658
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 3042 place count 435 transition count 657
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3043 place count 434 transition count 657
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 3048 place count 434 transition count 657
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 3052 place count 434 transition count 657
Applied a total of 3052 rules in 1198 ms. Remains 434 /2003 variables (removed 1569) and now considering 657/2292 (removed 1635) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1200 ms. Remains : 434/2003 places, 657/2292 transitions.
Incomplete random walk after 10000 steps, including 112 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 237197 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 237197 steps, saw 65023 distinct states, run finished after 3002 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-14 17:45:51] [INFO ] Flow matrix only has 655 transitions (discarded 2 similar events)
// Phase 1: matrix 655 rows 434 cols
[2023-03-14 17:45:51] [INFO ] Computed 55 place invariants in 17 ms
[2023-03-14 17:45:51] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 17:45:51] [INFO ] [Nat]Absence check using 55 positive place invariants in 29 ms returned sat
[2023-03-14 17:45:52] [INFO ] After 571ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-14 17:45:52] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 17:45:52] [INFO ] After 209ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-14 17:45:52] [INFO ] After 484ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 165 ms.
[2023-03-14 17:45:52] [INFO ] After 1449ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 40 ms.
Support contains 42 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 657/657 transitions.
Applied a total of 0 rules in 24 ms. Remains 434 /434 variables (removed 0) and now considering 657/657 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 434/434 places, 657/657 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 657/657 transitions.
Applied a total of 0 rules in 28 ms. Remains 434 /434 variables (removed 0) and now considering 657/657 (removed 0) transitions.
[2023-03-14 17:45:52] [INFO ] Flow matrix only has 655 transitions (discarded 2 similar events)
[2023-03-14 17:45:52] [INFO ] Invariant cache hit.
[2023-03-14 17:45:53] [INFO ] Implicit Places using invariants in 504 ms returned [11, 45, 122, 268, 326, 357, 410]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 509 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 427/434 places, 657/657 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 410 transition count 640
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 49 place count 410 transition count 625
Applied a total of 49 rules in 49 ms. Remains 410 /427 variables (removed 17) and now considering 625/657 (removed 32) transitions.
[2023-03-14 17:45:53] [INFO ] Flow matrix only has 623 transitions (discarded 2 similar events)
// Phase 1: matrix 623 rows 410 cols
[2023-03-14 17:45:53] [INFO ] Computed 48 place invariants in 7 ms
[2023-03-14 17:45:53] [INFO ] Implicit Places using invariants in 431 ms returned []
[2023-03-14 17:45:53] [INFO ] Flow matrix only has 623 transitions (discarded 2 similar events)
[2023-03-14 17:45:53] [INFO ] Invariant cache hit.
[2023-03-14 17:45:54] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-14 17:45:55] [INFO ] Implicit Places using invariants and state equation in 1226 ms returned [6, 10, 31, 32, 35, 36, 40, 41, 75, 78, 103, 104, 109, 110, 114, 145, 146, 147, 148, 151, 152, 153, 158, 159, 163, 164, 165, 243, 244, 245, 249, 251, 252, 255, 256, 257, 307, 311, 327, 328, 329, 332, 333, 338, 339, 383, 384, 387, 388]
Discarding 49 places :
Implicit Place search using SMT with State Equation took 1672 ms to find 49 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 361/434 places, 625/657 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 361 transition count 617
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 353 transition count 617
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 86 place count 318 transition count 582
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 100 place count 311 transition count 584
Free-agglomeration rule (complex) applied 56 times.
Iterating global reduction 2 with 56 rules applied. Total rules applied 156 place count 311 transition count 537
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 61 rules applied. Total rules applied 217 place count 255 transition count 532
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 255 transition count 531
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 222 place count 255 transition count 531
Applied a total of 222 rules in 124 ms. Remains 255 /361 variables (removed 106) and now considering 531/625 (removed 94) transitions.
[2023-03-14 17:45:55] [INFO ] Flow matrix only has 528 transitions (discarded 3 similar events)
// Phase 1: matrix 528 rows 255 cols
[2023-03-14 17:45:55] [INFO ] Computed 35 place invariants in 5 ms
[2023-03-14 17:45:55] [INFO ] Implicit Places using invariants in 292 ms returned []
[2023-03-14 17:45:55] [INFO ] Flow matrix only has 528 transitions (discarded 3 similar events)
[2023-03-14 17:45:55] [INFO ] Invariant cache hit.
[2023-03-14 17:45:55] [INFO ] State equation strengthened by 103 read => feed constraints.
[2023-03-14 17:45:56] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 1247 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 255/434 places, 531/657 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3630 ms. Remains : 255/434 places, 531/657 transitions.
Incomplete random walk after 10000 steps, including 141 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 313253 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 313253 steps, saw 74899 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-14 17:45:59] [INFO ] Flow matrix only has 528 transitions (discarded 3 similar events)
[2023-03-14 17:45:59] [INFO ] Invariant cache hit.
[2023-03-14 17:45:59] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 17:45:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2023-03-14 17:46:00] [INFO ] After 322ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-14 17:46:00] [INFO ] State equation strengthened by 103 read => feed constraints.
[2023-03-14 17:46:00] [INFO ] After 214ms SMT Verify possible using 103 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-14 17:46:00] [INFO ] After 461ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 185 ms.
[2023-03-14 17:46:00] [INFO ] After 1094ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 46 ms.
Support contains 40 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 531/531 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 254 transition count 530
Applied a total of 2 rules in 23 ms. Remains 254 /255 variables (removed 1) and now considering 530/531 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 254/255 places, 530/531 transitions.
Incomplete random walk after 10000 steps, including 138 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 264930 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 264930 steps, saw 66179 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-14 17:46:04] [INFO ] Flow matrix only has 527 transitions (discarded 3 similar events)
// Phase 1: matrix 527 rows 254 cols
[2023-03-14 17:46:04] [INFO ] Computed 35 place invariants in 6 ms
[2023-03-14 17:46:04] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 17:46:04] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned sat
[2023-03-14 17:46:04] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 17:46:04] [INFO ] State equation strengthened by 103 read => feed constraints.
[2023-03-14 17:46:04] [INFO ] After 150ms SMT Verify possible using 103 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 17:46:05] [INFO ] After 269ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-14 17:46:05] [INFO ] After 695ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 40 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 530/530 transitions.
Applied a total of 0 rules in 12 ms. Remains 254 /254 variables (removed 0) and now considering 530/530 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 254/254 places, 530/530 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 530/530 transitions.
Applied a total of 0 rules in 12 ms. Remains 254 /254 variables (removed 0) and now considering 530/530 (removed 0) transitions.
[2023-03-14 17:46:05] [INFO ] Flow matrix only has 527 transitions (discarded 3 similar events)
[2023-03-14 17:46:05] [INFO ] Invariant cache hit.
[2023-03-14 17:46:05] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-14 17:46:05] [INFO ] Flow matrix only has 527 transitions (discarded 3 similar events)
[2023-03-14 17:46:05] [INFO ] Invariant cache hit.
[2023-03-14 17:46:05] [INFO ] State equation strengthened by 103 read => feed constraints.
[2023-03-14 17:46:06] [INFO ] Implicit Places using invariants and state equation in 807 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1069 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 253/254 places, 530/530 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 252 transition count 530
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 252 transition count 529
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 251 transition count 529
Applied a total of 4 rules in 33 ms. Remains 251 /253 variables (removed 2) and now considering 529/530 (removed 1) transitions.
[2023-03-14 17:46:06] [INFO ] Flow matrix only has 525 transitions (discarded 4 similar events)
// Phase 1: matrix 525 rows 251 cols
[2023-03-14 17:46:06] [INFO ] Computed 35 place invariants in 3 ms
[2023-03-14 17:46:06] [INFO ] Implicit Places using invariants in 237 ms returned []
[2023-03-14 17:46:06] [INFO ] Flow matrix only has 525 transitions (discarded 4 similar events)
[2023-03-14 17:46:06] [INFO ] Invariant cache hit.
[2023-03-14 17:46:06] [INFO ] State equation strengthened by 106 read => feed constraints.
[2023-03-14 17:46:07] [INFO ] Implicit Places using invariants and state equation in 695 ms returned []
Implicit Place search using SMT with State Equation took 937 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 251/254 places, 529/530 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2051 ms. Remains : 251/254 places, 529/530 transitions.
Incomplete random walk after 10000 steps, including 141 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 324769 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 324769 steps, saw 71383 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-14 17:46:10] [INFO ] Flow matrix only has 525 transitions (discarded 4 similar events)
[2023-03-14 17:46:10] [INFO ] Invariant cache hit.
[2023-03-14 17:46:10] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 17:46:10] [INFO ] [Nat]Absence check using 35 positive place invariants in 11 ms returned sat
[2023-03-14 17:46:10] [INFO ] After 239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 17:46:10] [INFO ] State equation strengthened by 106 read => feed constraints.
[2023-03-14 17:46:11] [INFO ] After 142ms SMT Verify possible using 106 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 17:46:11] [INFO ] After 279ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-14 17:46:11] [INFO ] After 701ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 40 out of 251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 529/529 transitions.
Applied a total of 0 rules in 7 ms. Remains 251 /251 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 251/251 places, 529/529 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 529/529 transitions.
Applied a total of 0 rules in 6 ms. Remains 251 /251 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2023-03-14 17:46:11] [INFO ] Flow matrix only has 525 transitions (discarded 4 similar events)
[2023-03-14 17:46:11] [INFO ] Invariant cache hit.
[2023-03-14 17:46:11] [INFO ] Implicit Places using invariants in 208 ms returned []
[2023-03-14 17:46:11] [INFO ] Flow matrix only has 525 transitions (discarded 4 similar events)
[2023-03-14 17:46:11] [INFO ] Invariant cache hit.
[2023-03-14 17:46:11] [INFO ] State equation strengthened by 106 read => feed constraints.
[2023-03-14 17:46:12] [INFO ] Implicit Places using invariants and state equation in 689 ms returned []
Implicit Place search using SMT with State Equation took 900 ms to find 0 implicit places.
[2023-03-14 17:46:12] [INFO ] Redundant transitions in 101 ms returned []
[2023-03-14 17:46:12] [INFO ] Flow matrix only has 525 transitions (discarded 4 similar events)
[2023-03-14 17:46:12] [INFO ] Invariant cache hit.
[2023-03-14 17:46:13] [INFO ] Dead Transitions using invariants and state equation in 619 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1639 ms. Remains : 251/251 places, 529/529 transitions.
Graph (trivial) has 66 edges and 251 vertex of which 32 / 251 are part of one of the 16 SCC in 0 ms
Free SCC test removed 16 places
Drop transitions removed 46 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (complete) has 786 edges and 235 vertex of which 224 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Discarding 11 places :
Also discarding 0 output transitions
Drop transitions removed 20 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 224 transition count 448
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 45 place count 219 transition count 443
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 50 place count 219 transition count 438
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 59 place count 219 transition count 429
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 73 place count 219 transition count 429
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 219 transition count 428
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 219 transition count 427
Applied a total of 75 rules in 75 ms. Remains 219 /251 variables (removed 32) and now considering 427/529 (removed 102) transitions.
Running SMT prover for 2 properties.
[2023-03-14 17:46:13] [INFO ] Flow matrix only has 425 transitions (discarded 2 similar events)
// Phase 1: matrix 425 rows 219 cols
[2023-03-14 17:46:13] [INFO ] Computed 30 place invariants in 3 ms
[2023-03-14 17:46:13] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 17:46:13] [INFO ] [Nat]Absence check using 30 positive place invariants in 11 ms returned sat
[2023-03-14 17:46:13] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 17:46:13] [INFO ] State equation strengthened by 140 read => feed constraints.
[2023-03-14 17:46:13] [INFO ] After 91ms SMT Verify possible using 140 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 17:46:13] [INFO ] After 185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-14 17:46:13] [INFO ] After 582ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-14 17:46:13] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2023-03-14 17:46:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 251 places, 529 transitions and 2407 arcs took 6 ms.
[2023-03-14 17:46:14] [INFO ] Flatten gal took : 129 ms
Total runtime 55713 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running NoC3x3 (PT), instance 2B
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 251 places, 529 transitions, 2407 arcs.
Final Score: 10989.038
Took : 37 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: NoC3x3-PT-2B-ReachabilityCardinality-04 (reachable & potential(( ( ( ( (tk(P184)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P184)) ) ) & ( ( (tk(P60)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P60)) ) ) ) & ( ( ( (tk(P186)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P186)) ) ) & ( ( ( ( (tk(P245)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P245)) ) ) | ( ( ( ( (tk(P46)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P46)) ) ) & ( ( (tk(P88)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P88)) ) ) ) & ( ( ( (tk(P132)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P132)) ) ) & ( ( ( (tk(P63)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P63)) ) ) | ( ( (tk(P97)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P97)) ) ) ) ) ) ) & ( ( ( ( (tk(P106)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P106)) ) ) & ( ( (tk(P148)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P148)) ) ) ) | ( ( ( ( (tk(P3)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P3)) ) ) & ( ( ( ( (tk(P61)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P61)) ) ) | ( ( (tk(P248)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P248)) ) ) ) | ( ( ( (tk(P138)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P138)) ) ) | ( ( ( (tk(P135)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P135)) ) ) | ( ( (tk(P190)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P190)) ) ) ) ) ) ) | ( ( ( (tk(P213)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P213)) ) ) & ( ( ( ( (tk(P226)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P226)) ) ) | ( ( (tk(P158)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P158)) ) ) ) & ( ( ( ( (tk(P180)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P180)) ) ) | ( ( (tk(P173)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P173)) ) ) ) | ( ( ( (tk(P168)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P168)) ) ) | ( ( (tk(P19)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P19)) ) ) ) ) ) ) ) ) ) ) )))
PROPERTY: NoC3x3-PT-2B-ReachabilityCardinality-06 (reachable &!potential( ( ( ( ( (tk(P178)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P178)) ) ) | ( ( ( (tk(P114)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P114)) ) ) | ( ( (tk(P151)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P151)) ) ) ) ) | ( ( ( ( ( (tk(P48)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P48)) ) ) & ( ( (tk(P208)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P208)) ) ) ) | ( ( ( (tk(P98)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P98)) ) ) & ( ( (tk(P249)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P249)) ) ) ) ) | ( ( ( ( (tk(P23)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P23)) ) ) & ( ( ( (tk(P91)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P91)) ) ) & ( ( ( (tk(P35)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P35)) ) ) | ( ( (tk(P55)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P55)) ) ) ) ) ) | ( ( ( ( (tk(P222)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P222)) ) ) | ( ( (tk(P51)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P51)) ) ) ) & ( ( ( (tk(P122)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P122)) ) ) | ( ( ( (tk(P162)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P162)) ) ) | ( ( (tk(P77)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P77)) ) ) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 154576 kB
After kill :
MemTotal: 16393216 kB
MemFree: 14597176 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
Caught signal 15, terminating.

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is NoC3x3-PT-2B, 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 r267-smll-167863541600254"
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 [ "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 ;