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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
435.707 72397.00 107786.00 662.20 TTFTFFTFF?TFFFTT 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-167863541600255.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-167863541600255
=====================================================================

--------------------
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-ReachabilityFireability-00
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-01
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-02
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-03
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-04
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-05
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-06
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-07
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-08
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-09
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-10
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-11
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-12
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-13
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-14
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678815940241

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=ReachabilityFireability
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:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 17:45:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 17:45:44] [INFO ] Load time of PNML (sax parser for PT used): 379 ms
[2023-03-14 17:45:44] [INFO ] Transformed 2003 places.
[2023-03-14 17:45:44] [INFO ] Transformed 2292 transitions.
[2023-03-14 17:45:44] [INFO ] Found NUPN structural information;
[2023-03-14 17:45:44] [INFO ] Parsed PT model containing 2003 places and 2292 transitions and 5835 arcs in 584 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 16 resets, run finished after 908 ms. (steps per millisecond=11 ) properties (out of 16) seen :7
FORMULA NoC3x3-PT-2B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 9) seen :1
FORMULA NoC3x3-PT-2B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2292 rows 2003 cols
[2023-03-14 17:45:46] [INFO ] Computed 66 place invariants in 60 ms
[2023-03-14 17:45:48] [INFO ] After 1650ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-14 17:45:49] [INFO ] [Nat]Absence check using 66 positive place invariants in 70 ms returned sat
[2023-03-14 17:45:52] [INFO ] After 3171ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2023-03-14 17:45:54] [INFO ] Deduced a trap composed of 72 places in 1335 ms of which 10 ms to minimize.
[2023-03-14 17:45:55] [INFO ] Deduced a trap composed of 128 places in 785 ms of which 3 ms to minimize.
[2023-03-14 17:45:55] [INFO ] Deduced a trap composed of 134 places in 637 ms of which 2 ms to minimize.
[2023-03-14 17:45:56] [INFO ] Deduced a trap composed of 89 places in 570 ms of which 4 ms to minimize.
[2023-03-14 17:45:57] [INFO ] Deduced a trap composed of 113 places in 442 ms of which 1 ms to minimize.
[2023-03-14 17:45:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 4681 ms
[2023-03-14 17:45:57] [INFO ] Deduced a trap composed of 77 places in 345 ms of which 1 ms to minimize.
[2023-03-14 17:45:58] [INFO ] Deduced a trap composed of 70 places in 468 ms of which 1 ms to minimize.
[2023-03-14 17:45:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1149 ms
[2023-03-14 17:45:59] [INFO ] Deduced a trap composed of 93 places in 232 ms of which 2 ms to minimize.
[2023-03-14 17:45:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 448 ms
[2023-03-14 17:46:00] [INFO ] Deduced a trap composed of 64 places in 322 ms of which 1 ms to minimize.
[2023-03-14 17:46:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 546 ms
[2023-03-14 17:46:00] [INFO ] Deduced a trap composed of 111 places in 239 ms of which 1 ms to minimize.
[2023-03-14 17:46:01] [INFO ] Deduced a trap composed of 106 places in 414 ms of which 1 ms to minimize.
[2023-03-14 17:46:02] [INFO ] Deduced a trap composed of 110 places in 442 ms of which 1 ms to minimize.
[2023-03-14 17:46:02] [INFO ] Deduced a trap composed of 119 places in 215 ms of which 1 ms to minimize.
[2023-03-14 17:46:02] [INFO ] Deduced a trap composed of 111 places in 190 ms of which 1 ms to minimize.
[2023-03-14 17:46:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2393 ms
[2023-03-14 17:46:03] [INFO ] Deduced a trap composed of 60 places in 175 ms of which 1 ms to minimize.
[2023-03-14 17:46:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 493 ms
[2023-03-14 17:46:04] [INFO ] After 14739ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 1996 ms.
[2023-03-14 17:46:06] [INFO ] After 18040ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
FORMULA NoC3x3-PT-2B-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 7 different solutions.
FORMULA NoC3x3-PT-2B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 5 properties in 266 ms.
Support contains 35 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2292/2292 transitions.
Graph (trivial) has 1584 edges and 2003 vertex of which 72 / 2003 are part of one of the 9 SCC in 15 ms
Free SCC test removed 63 places
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 395 transitions
Trivial Post-agglo rules discarded 395 transitions
Performed 395 trivial Post agglomeration. Transition count delta: 395
Iterating post reduction 0 with 404 rules applied. Total rules applied 405 place count 1931 transition count 1825
Reduce places removed 395 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 401 rules applied. Total rules applied 806 place count 1536 transition count 1819
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 812 place count 1530 transition count 1819
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 812 place count 1530 transition count 1795
Deduced a syphon composed of 24 places in 19 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 860 place count 1506 transition count 1795
Discarding 345 places :
Symmetric choice reduction at 3 with 345 rule applications. Total rules 1205 place count 1161 transition count 1450
Iterating global reduction 3 with 345 rules applied. Total rules applied 1550 place count 1161 transition count 1450
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 1550 place count 1161 transition count 1409
Deduced a syphon composed of 41 places in 13 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 1632 place count 1120 transition count 1409
Discarding 131 places :
Symmetric choice reduction at 3 with 131 rule applications. Total rules 1763 place count 989 transition count 1238
Iterating global reduction 3 with 131 rules applied. Total rules applied 1894 place count 989 transition count 1238
Discarding 117 places :
Symmetric choice reduction at 3 with 117 rule applications. Total rules 2011 place count 872 transition count 1109
Iterating global reduction 3 with 117 rules applied. Total rules applied 2128 place count 872 transition count 1109
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 2172 place count 828 transition count 1031
Iterating global reduction 3 with 44 rules applied. Total rules applied 2216 place count 828 transition count 1031
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 16 rules applied. Total rules applied 2232 place count 826 transition count 1017
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2234 place count 824 transition count 1017
Discarding 30 places :
Symmetric choice reduction at 5 with 30 rule applications. Total rules 2264 place count 794 transition count 987
Iterating global reduction 5 with 30 rules applied. Total rules applied 2294 place count 794 transition count 987
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 2298 place count 792 transition count 985
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2300 place count 790 transition count 985
Discarding 21 places :
Symmetric choice reduction at 7 with 21 rule applications. Total rules 2321 place count 769 transition count 943
Iterating global reduction 7 with 21 rules applied. Total rules applied 2342 place count 769 transition count 943
Discarding 20 places :
Symmetric choice reduction at 7 with 20 rule applications. Total rules 2362 place count 749 transition count 923
Iterating global reduction 7 with 20 rules applied. Total rules applied 2382 place count 749 transition count 923
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 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 7 with 24 rules applied. Total rules applied 2406 place count 747 transition count 901
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 2408 place count 745 transition count 901
Performed 278 Post agglomeration using F-continuation condition.Transition count delta: 278
Deduced a syphon composed of 278 places in 1 ms
Reduce places removed 278 places and 0 transitions.
Iterating global reduction 9 with 556 rules applied. Total rules applied 2964 place count 467 transition count 623
Discarding 11 places :
Symmetric choice reduction at 9 with 11 rule applications. Total rules 2975 place count 456 transition count 612
Iterating global reduction 9 with 11 rules applied. Total rules applied 2986 place count 456 transition count 612
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 2993 place count 449 transition count 598
Iterating global reduction 9 with 7 rules applied. Total rules applied 3000 place count 449 transition count 598
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3001 place count 448 transition count 596
Iterating global reduction 9 with 1 rules applied. Total rules applied 3002 place count 448 transition count 596
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 9 with 38 rules applied. Total rules applied 3040 place count 429 transition count 629
Free-agglomeration rule applied 25 times.
Iterating global reduction 9 with 25 rules applied. Total rules applied 3065 place count 429 transition count 604
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 30 rules applied. Total rules applied 3095 place count 404 transition count 599
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 3098 place count 404 transition count 596
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3100 place count 404 transition count 594
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 3102 place count 402 transition count 594
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 3105 place count 402 transition count 594
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 3109 place count 402 transition count 594
Applied a total of 3109 rules in 1339 ms. Remains 402 /2003 variables (removed 1601) and now considering 594/2292 (removed 1698) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1341 ms. Remains : 402/2003 places, 594/2292 transitions.
Incomplete random walk after 10000 steps, including 115 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :1
FORMULA NoC3x3-PT-2B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 594 rows 402 cols
[2023-03-14 17:46:07] [INFO ] Computed 54 place invariants in 15 ms
[2023-03-14 17:46:07] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 17:46:08] [INFO ] [Nat]Absence check using 54 positive place invariants in 36 ms returned sat
[2023-03-14 17:46:08] [INFO ] After 388ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 17:46:08] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-14 17:46:08] [INFO ] After 88ms SMT Verify possible using 65 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 17:46:08] [INFO ] After 152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-14 17:46:08] [INFO ] After 738ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 24 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 594/594 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 402 transition count 593
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 401 transition count 593
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 401 transition count 592
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 400 transition count 592
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 8 place count 396 transition count 584
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 396 transition count 584
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 396 transition count 583
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 29 place count 388 transition count 575
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 31 place count 386 transition count 572
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 386 transition count 572
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 35 place count 386 transition count 570
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 36 place count 386 transition count 570
Applied a total of 36 rules in 88 ms. Remains 386 /402 variables (removed 16) and now considering 570/594 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 386/402 places, 570/594 transitions.
Incomplete random walk after 10000 steps, including 129 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 381893 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :{}
Probabilistic random walk after 381893 steps, saw 85523 distinct states, run finished after 3002 ms. (steps per millisecond=127 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 570 rows 386 cols
[2023-03-14 17:46:11] [INFO ] Computed 54 place invariants in 9 ms
[2023-03-14 17:46:12] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 17:46:12] [INFO ] [Nat]Absence check using 54 positive place invariants in 22 ms returned sat
[2023-03-14 17:46:12] [INFO ] After 440ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 17:46:12] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 17:46:12] [INFO ] After 177ms SMT Verify possible using 66 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 17:46:12] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
[2023-03-14 17:46:13] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2023-03-14 17:46:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 303 ms
[2023-03-14 17:46:13] [INFO ] After 553ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-14 17:46:13] [INFO ] After 1184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 24 out of 386 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 570/570 transitions.
Applied a total of 0 rules in 20 ms. Remains 386 /386 variables (removed 0) and now considering 570/570 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 386/386 places, 570/570 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 570/570 transitions.
Applied a total of 0 rules in 18 ms. Remains 386 /386 variables (removed 0) and now considering 570/570 (removed 0) transitions.
[2023-03-14 17:46:13] [INFO ] Invariant cache hit.
[2023-03-14 17:46:13] [INFO ] Implicit Places using invariants in 524 ms returned [14, 87, 117, 170, 248, 291, 319]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 528 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 379/386 places, 570/570 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 361 transition count 552
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 50 place count 361 transition count 538
Applied a total of 50 rules in 26 ms. Remains 361 /379 variables (removed 18) and now considering 538/570 (removed 32) transitions.
// Phase 1: matrix 538 rows 361 cols
[2023-03-14 17:46:13] [INFO ] Computed 47 place invariants in 7 ms
[2023-03-14 17:46:14] [INFO ] Implicit Places using invariants in 351 ms returned []
[2023-03-14 17:46:14] [INFO ] Invariant cache hit.
[2023-03-14 17:46:14] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-14 17:46:15] [INFO ] Implicit Places using invariants and state equation in 1032 ms returned [9, 13, 31, 35, 36, 40, 41, 79, 82, 83, 100, 101, 106, 107, 110, 138, 139, 140, 141, 144, 145, 151, 152, 153, 157, 158, 159, 221, 222, 223, 226, 227, 228, 231, 232, 233, 268, 272, 287, 288, 289, 292, 296, 297, 331, 335, 336]
Discarding 47 places :
Implicit Place search using SMT with State Equation took 1390 ms to find 47 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 314/386 places, 538/570 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 314 transition count 535
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 311 transition count 535
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 80 place count 274 transition count 498
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 273 transition count 496
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 273 transition count 496
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 273 transition count 495
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 101 place count 264 transition count 504
Free-agglomeration rule (complex) applied 40 times.
Iterating global reduction 3 with 40 rules applied. Total rules applied 141 place count 264 transition count 478
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 45 rules applied. Total rules applied 186 place count 224 transition count 473
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 190 place count 224 transition count 469
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 196 place count 224 transition count 469
Applied a total of 196 rules in 99 ms. Remains 224 /314 variables (removed 90) and now considering 469/538 (removed 69) transitions.
[2023-03-14 17:46:15] [INFO ] Flow matrix only has 465 transitions (discarded 4 similar events)
// Phase 1: matrix 465 rows 224 cols
[2023-03-14 17:46:15] [INFO ] Computed 35 place invariants in 5 ms
[2023-03-14 17:46:15] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-14 17:46:15] [INFO ] Flow matrix only has 465 transitions (discarded 4 similar events)
[2023-03-14 17:46:15] [INFO ] Invariant cache hit.
[2023-03-14 17:46:15] [INFO ] State equation strengthened by 108 read => feed constraints.
[2023-03-14 17:46:16] [INFO ] Implicit Places using invariants and state equation in 802 ms returned [93]
Discarding 1 places :
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT with State Equation took 1116 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 223/386 places, 467/570 transitions.
Applied a total of 0 rules in 16 ms. Remains 223 /223 variables (removed 0) and now considering 467/467 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 3196 ms. Remains : 223/386 places, 467/570 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 538526 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :{}
Probabilistic random walk after 538526 steps, saw 103664 distinct states, run finished after 3004 ms. (steps per millisecond=179 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 17:46:19] [INFO ] Flow matrix only has 463 transitions (discarded 4 similar events)
// Phase 1: matrix 463 rows 223 cols
[2023-03-14 17:46:19] [INFO ] Computed 34 place invariants in 3 ms
[2023-03-14 17:46:19] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 17:46:19] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-14 17:46:19] [INFO ] After 256ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 17:46:19] [INFO ] State equation strengthened by 99 read => feed constraints.
[2023-03-14 17:46:20] [INFO ] After 159ms SMT Verify possible using 99 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 17:46:20] [INFO ] After 246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-14 17:46:20] [INFO ] After 629ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 24 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 467/467 transitions.
Applied a total of 0 rules in 13 ms. Remains 223 /223 variables (removed 0) and now considering 467/467 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 223/223 places, 467/467 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 467/467 transitions.
Applied a total of 0 rules in 12 ms. Remains 223 /223 variables (removed 0) and now considering 467/467 (removed 0) transitions.
[2023-03-14 17:46:20] [INFO ] Flow matrix only has 463 transitions (discarded 4 similar events)
[2023-03-14 17:46:20] [INFO ] Invariant cache hit.
[2023-03-14 17:46:20] [INFO ] Implicit Places using invariants in 205 ms returned []
[2023-03-14 17:46:20] [INFO ] Flow matrix only has 463 transitions (discarded 4 similar events)
[2023-03-14 17:46:20] [INFO ] Invariant cache hit.
[2023-03-14 17:46:20] [INFO ] State equation strengthened by 99 read => feed constraints.
[2023-03-14 17:46:21] [INFO ] Implicit Places using invariants and state equation in 757 ms returned []
Implicit Place search using SMT with State Equation took 970 ms to find 0 implicit places.
[2023-03-14 17:46:21] [INFO ] Redundant transitions in 79 ms returned []
[2023-03-14 17:46:21] [INFO ] Flow matrix only has 463 transitions (discarded 4 similar events)
[2023-03-14 17:46:21] [INFO ] Invariant cache hit.
[2023-03-14 17:46:21] [INFO ] Dead Transitions using invariants and state equation in 442 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1511 ms. Remains : 223/223 places, 467/467 transitions.
Graph (trivial) has 67 edges and 223 vertex of which 38 / 223 are part of one of the 19 SCC in 0 ms
Free SCC test removed 19 places
Drop transitions removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Graph (complete) has 660 edges and 204 vertex of which 169 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.2 ms
Discarding 35 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Drop transitions removed 54 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 169 transition count 340
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 74 place count 165 transition count 336
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 78 place count 165 transition count 332
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 94 place count 165 transition count 316
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 107 place count 165 transition count 316
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 165 transition count 315
Applied a total of 108 rules in 35 ms. Remains 165 /223 variables (removed 58) and now considering 315/467 (removed 152) transitions.
Running SMT prover for 1 properties.
[2023-03-14 17:46:21] [INFO ] Flow matrix only has 314 transitions (discarded 1 similar events)
// Phase 1: matrix 314 rows 165 cols
[2023-03-14 17:46:21] [INFO ] Computed 24 place invariants in 1 ms
[2023-03-14 17:46:21] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 17:46:21] [INFO ] [Nat]Absence check using 24 positive place invariants in 9 ms returned sat
[2023-03-14 17:46:22] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 17:46:22] [INFO ] State equation strengthened by 92 read => feed constraints.
[2023-03-14 17:46:22] [INFO ] After 63ms SMT Verify possible using 92 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 17:46:22] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2023-03-14 17:46:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-03-14 17:46:22] [INFO ] After 177ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-14 17:46:22] [INFO ] After 447ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-14 17:46:22] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-14 17:46:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 223 places, 467 transitions and 1968 arcs took 12 ms.
[2023-03-14 17:46:22] [INFO ] Flatten gal took : 158 ms
Total runtime 39173 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 ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 223 places, 467 transitions, 1968 arcs.
Final Score: 6178.078
Took : 28 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678816012638

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 2665:
syntax error

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="ReachabilityFireability"
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 ReachabilityFireability"
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-167863541600255"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;