fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r267-smll-167863541600270
Last Updated
May 14, 2023

About the Execution of Smart+red for NoC3x3-PT-3B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16189.304 3600000.00 3658272.00 11940.80 TFFFT?FFTTFFFTFT normal

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

--------------------
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 1678823480089

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-3B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 19:51:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 19:51:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 19:51:23] [INFO ] Load time of PNML (sax parser for PT used): 358 ms
[2023-03-14 19:51:23] [INFO ] Transformed 2117 places.
[2023-03-14 19:51:23] [INFO ] Transformed 2435 transitions.
[2023-03-14 19:51:23] [INFO ] Found NUPN structural information;
[2023-03-14 19:51:23] [INFO ] Parsed PT model containing 2117 places and 2435 transitions and 6177 arcs in 614 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 28 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 16 resets, run finished after 851 ms. (steps per millisecond=11 ) properties (out of 13) seen :7
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-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-04 TRUE 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 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 6) seen :1
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :1
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 4 properties.
// Phase 1: matrix 2435 rows 2117 cols
[2023-03-14 19:51:25] [INFO ] Computed 66 place invariants in 45 ms
[2023-03-14 19:51:27] [INFO ] After 1535ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 19:51:28] [INFO ] [Nat]Absence check using 66 positive place invariants in 92 ms returned sat
[2023-03-14 19:51:30] [INFO ] After 2384ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-14 19:51:31] [INFO ] Deduced a trap composed of 59 places in 443 ms of which 17 ms to minimize.
[2023-03-14 19:51:31] [INFO ] Deduced a trap composed of 87 places in 380 ms of which 2 ms to minimize.
[2023-03-14 19:51:32] [INFO ] Deduced a trap composed of 119 places in 217 ms of which 2 ms to minimize.
[2023-03-14 19:51:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1663 ms
[2023-03-14 19:51:33] [INFO ] After 5214ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 731 ms.
[2023-03-14 19:51:34] [INFO ] After 7162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 199 ms.
Support contains 9 out of 2117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2117/2117 places, 2435/2435 transitions.
Graph (trivial) has 1739 edges and 2117 vertex of which 72 / 2117 are part of one of the 9 SCC in 16 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 440 transitions
Trivial Post-agglo rules discarded 440 transitions
Performed 440 trivial Post agglomeration. Transition count delta: 440
Iterating post reduction 0 with 445 rules applied. Total rules applied 446 place count 2049 transition count 1923
Reduce places removed 440 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 446 rules applied. Total rules applied 892 place count 1609 transition count 1917
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 896 place count 1606 transition count 1916
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 897 place count 1605 transition count 1916
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 897 place count 1605 transition count 1892
Deduced a syphon composed of 24 places in 12 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 945 place count 1581 transition count 1892
Discarding 363 places :
Symmetric choice reduction at 4 with 363 rule applications. Total rules 1308 place count 1218 transition count 1529
Iterating global reduction 4 with 363 rules applied. Total rules applied 1671 place count 1218 transition count 1529
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 1671 place count 1218 transition count 1488
Deduced a syphon composed of 41 places in 11 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 1753 place count 1177 transition count 1488
Discarding 135 places :
Symmetric choice reduction at 4 with 135 rule applications. Total rules 1888 place count 1042 transition count 1313
Iterating global reduction 4 with 135 rules applied. Total rules applied 2023 place count 1042 transition count 1313
Discarding 140 places :
Symmetric choice reduction at 4 with 140 rule applications. Total rules 2163 place count 902 transition count 1157
Iterating global reduction 4 with 140 rules applied. Total rules applied 2303 place count 902 transition count 1157
Discarding 55 places :
Symmetric choice reduction at 4 with 55 rule applications. Total rules 2358 place count 847 transition count 1059
Iterating global reduction 4 with 55 rules applied. Total rules applied 2413 place count 847 transition count 1059
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 16 rules applied. Total rules applied 2429 place count 846 transition count 1044
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2430 place count 845 transition count 1044
Discarding 41 places :
Symmetric choice reduction at 6 with 41 rule applications. Total rules 2471 place count 804 transition count 1003
Iterating global reduction 6 with 41 rules applied. Total rules applied 2512 place count 804 transition count 1003
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 6 with 8 rules applied. Total rules applied 2520 place count 800 transition count 999
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2524 place count 796 transition count 999
Discarding 30 places :
Symmetric choice reduction at 8 with 30 rule applications. Total rules 2554 place count 766 transition count 939
Iterating global reduction 8 with 30 rules applied. Total rules applied 2584 place count 766 transition count 939
Discarding 29 places :
Symmetric choice reduction at 8 with 29 rule applications. Total rules 2613 place count 737 transition count 910
Iterating global reduction 8 with 29 rules applied. Total rules applied 2642 place count 737 transition count 910
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 8 with 39 rules applied. Total rules applied 2681 place count 732 transition count 876
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 2686 place count 727 transition count 876
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 10 with 596 rules applied. Total rules applied 3282 place count 429 transition count 578
Discarding 15 places :
Symmetric choice reduction at 10 with 15 rule applications. Total rules 3297 place count 414 transition count 563
Iterating global reduction 10 with 15 rules applied. Total rules applied 3312 place count 414 transition count 563
Discarding 10 places :
Symmetric choice reduction at 10 with 10 rule applications. Total rules 3322 place count 404 transition count 543
Iterating global reduction 10 with 10 rules applied. Total rules applied 3332 place count 404 transition count 543
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 3334 place count 404 transition count 541
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 3336 place count 402 transition count 537
Iterating global reduction 11 with 2 rules applied. Total rules applied 3338 place count 402 transition count 537
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 11 with 36 rules applied. Total rules applied 3374 place count 384 transition count 552
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 3375 place count 383 transition count 550
Iterating global reduction 11 with 1 rules applied. Total rules applied 3376 place count 383 transition count 550
Free-agglomeration rule applied 36 times.
Iterating global reduction 11 with 36 rules applied. Total rules applied 3412 place count 383 transition count 514
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 11 with 44 rules applied. Total rules applied 3456 place count 347 transition count 506
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 12 with 4 rules applied. Total rules applied 3460 place count 347 transition count 502
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 12 with 3 rules applied. Total rules applied 3463 place count 347 transition count 499
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 3466 place count 344 transition count 499
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 13 with 4 rules applied. Total rules applied 3470 place count 344 transition count 499
Applied a total of 3470 rules in 1190 ms. Remains 344 /2117 variables (removed 1773) and now considering 499/2435 (removed 1936) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1191 ms. Remains : 344/2117 places, 499/2435 transitions.
Incomplete random walk after 10000 steps, including 128 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 420676 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :{}
Probabilistic random walk after 420676 steps, saw 84625 distinct states, run finished after 3002 ms. (steps per millisecond=140 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 499 rows 344 cols
[2023-03-14 19:51:38] [INFO ] Computed 55 place invariants in 9 ms
[2023-03-14 19:51:38] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 19:51:38] [INFO ] [Nat]Absence check using 55 positive place invariants in 16 ms returned sat
[2023-03-14 19:51:39] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 19:51:39] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-14 19:51:39] [INFO ] After 49ms SMT Verify possible using 69 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 19:51:39] [INFO ] After 88ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-14 19:51:39] [INFO ] After 427ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 9 out of 344 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 499/499 transitions.
Applied a total of 0 rules in 22 ms. Remains 344 /344 variables (removed 0) and now considering 499/499 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 344/344 places, 499/499 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 499/499 transitions.
Applied a total of 0 rules in 51 ms. Remains 344 /344 variables (removed 0) and now considering 499/499 (removed 0) transitions.
[2023-03-14 19:51:39] [INFO ] Invariant cache hit.
[2023-03-14 19:51:39] [INFO ] Implicit Places using invariants in 389 ms returned [9, 40, 80, 111, 160, 226, 265, 295, 331]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 394 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 335/344 places, 499/499 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 314 transition count 478
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 64 place count 314 transition count 456
Applied a total of 64 rules in 66 ms. Remains 314 /335 variables (removed 21) and now considering 456/499 (removed 43) transitions.
// Phase 1: matrix 456 rows 314 cols
[2023-03-14 19:51:39] [INFO ] Computed 46 place invariants in 4 ms
[2023-03-14 19:51:40] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-14 19:51:40] [INFO ] Invariant cache hit.
[2023-03-14 19:51:40] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-14 19:51:40] [INFO ] Implicit Places using invariants and state equation in 651 ms returned [4, 8, 26, 27, 30, 31, 35, 36, 67, 68, 72, 74, 92, 93, 98, 99, 102, 127, 128, 129, 130, 133, 134, 135, 139, 140, 141, 145, 146, 147, 198, 199, 202, 203, 204, 207, 208, 209, 239, 240, 244, 260, 261, 262, 265, 270, 271, 300, 303]
Discarding 49 places :
Implicit Place search using SMT with State Equation took 889 ms to find 49 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 265/344 places, 456/499 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 265 transition count 453
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 262 transition count 453
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 86 place count 222 transition count 413
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 98 place count 216 transition count 413
Free-agglomeration rule (complex) applied 42 times.
Iterating global reduction 2 with 42 rules applied. Total rules applied 140 place count 216 transition count 384
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 196 place count 174 transition count 370
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 197 place count 174 transition count 369
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 203 place count 174 transition count 369
Applied a total of 203 rules in 51 ms. Remains 174 /265 variables (removed 91) and now considering 369/456 (removed 87) transitions.
[2023-03-14 19:51:40] [INFO ] Flow matrix only has 366 transitions (discarded 3 similar events)
// Phase 1: matrix 366 rows 174 cols
[2023-03-14 19:51:40] [INFO ] Computed 33 place invariants in 2 ms
[2023-03-14 19:51:41] [INFO ] Implicit Places using invariants in 444 ms returned []
[2023-03-14 19:51:41] [INFO ] Flow matrix only has 366 transitions (discarded 3 similar events)
[2023-03-14 19:51:41] [INFO ] Invariant cache hit.
[2023-03-14 19:51:41] [INFO ] State equation strengthened by 121 read => feed constraints.
[2023-03-14 19:51:42] [INFO ] Implicit Places using invariants and state equation in 820 ms returned [39, 75, 108, 126, 162]
Discarding 5 places :
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Implicit Place search using SMT with State Equation took 1289 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 169/344 places, 357/499 transitions.
Applied a total of 0 rules in 17 ms. Remains 169 /169 variables (removed 0) and now considering 357/357 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 2771 ms. Remains : 169/344 places, 357/499 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 765914 steps, run timeout after 3001 ms. (steps per millisecond=255 ) properties seen :{}
Probabilistic random walk after 765914 steps, saw 139580 distinct states, run finished after 3001 ms. (steps per millisecond=255 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 19:51:45] [INFO ] Flow matrix only has 354 transitions (discarded 3 similar events)
// Phase 1: matrix 354 rows 169 cols
[2023-03-14 19:51:45] [INFO ] Computed 28 place invariants in 6 ms
[2023-03-14 19:51:45] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 19:51:45] [INFO ] [Nat]Absence check using 28 positive place invariants in 13 ms returned sat
[2023-03-14 19:51:45] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 19:51:45] [INFO ] State equation strengthened by 70 read => feed constraints.
[2023-03-14 19:51:45] [INFO ] After 47ms SMT Verify possible using 70 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 19:51:45] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-14 19:51:45] [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 9 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 357/357 transitions.
Applied a total of 0 rules in 10 ms. Remains 169 /169 variables (removed 0) and now considering 357/357 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 169/169 places, 357/357 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 357/357 transitions.
Applied a total of 0 rules in 10 ms. Remains 169 /169 variables (removed 0) and now considering 357/357 (removed 0) transitions.
[2023-03-14 19:51:45] [INFO ] Flow matrix only has 354 transitions (discarded 3 similar events)
[2023-03-14 19:51:45] [INFO ] Invariant cache hit.
[2023-03-14 19:51:45] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-14 19:51:45] [INFO ] Flow matrix only has 354 transitions (discarded 3 similar events)
[2023-03-14 19:51:45] [INFO ] Invariant cache hit.
[2023-03-14 19:51:46] [INFO ] State equation strengthened by 70 read => feed constraints.
[2023-03-14 19:51:46] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
[2023-03-14 19:51:46] [INFO ] Redundant transitions in 113 ms returned []
[2023-03-14 19:51:46] [INFO ] Flow matrix only has 354 transitions (discarded 3 similar events)
[2023-03-14 19:51:46] [INFO ] Invariant cache hit.
[2023-03-14 19:51:46] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1027 ms. Remains : 169/169 places, 357/357 transitions.
Graph (trivial) has 64 edges and 169 vertex of which 48 / 169 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Graph (complete) has 437 edges and 145 vertex of which 88 are kept as prefixes of interest. Removing 57 places using SCC suffix rule.2 ms
Discarding 57 places :
Also discarding 45 output transitions
Drop transitions removed 45 transitions
Drop transitions removed 70 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 0 with 90 rules applied. Total rules applied 92 place count 88 transition count 167
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 88 transition count 166
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 88 transition count 165
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 252 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 2 rules applied. Total rules applied 96 place count 86 transition count 165
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 99 place count 86 transition count 162
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 109 place count 86 transition count 162
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 111 place count 86 transition count 160
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 112 place count 85 transition count 159
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 113 place count 84 transition count 159
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 113 place count 84 transition count 158
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 115 place count 83 transition count 158
Applied a total of 115 rules in 39 ms. Remains 83 /169 variables (removed 86) and now considering 158/357 (removed 199) transitions.
Running SMT prover for 1 properties.
[2023-03-14 19:51:46] [INFO ] Flow matrix only has 149 transitions (discarded 9 similar events)
// Phase 1: matrix 149 rows 83 cols
[2023-03-14 19:51:46] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-14 19:51:46] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 19:51:46] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 19:51:46] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 19:51:46] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-14 19:51:46] [INFO ] After 146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-14 19:51:46] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2023-03-14 19:51:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 169 places, 357 transitions and 1776 arcs took 6 ms.
[2023-03-14 19:51:47] [INFO ] Flatten gal took : 116 ms
Total runtime 24111 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running NoC3x3 (PT), instance 3B
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: 169 places, 357 transitions, 1776 arcs.
Final Score: 5366.231
Took : 26 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: NoC3x3-PT-3B-ReachabilityCardinality-05 (reachable & potential(( ( ( ( (tk(P27)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P27)) ) ) & ( ( (tk(P88)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P88)) ) ) ) & ( ( ( (tk(P8)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P8)) ) ) & ( ( ( (tk(P97)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P97)) ) ) & ( ( ( (tk(P32)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P32)) ) ) | ( ( ( (tk(P169)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P169)) ) ) & ( ( ( (tk(P30)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P30)) ) ) & ( ( ( (tk(P44)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P44)) ) ) | ( ( (tk(P144)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P144)) ) ) ) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 168200 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16285944 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-3B"
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-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 r267-smll-167863541600270"
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 ;