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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 7.3K Feb 26 09:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 09:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 09:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 09:52 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 16K Feb 25 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 09:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Feb 26 09:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 09:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 09:53 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 362K 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-1B-ReachabilityFireability-00
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-01
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-02
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-03
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-04
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-05
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-06
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-07
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-08
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-09
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-10
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-11
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-12
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-13
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-14
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678808670556

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-1B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 15:44:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 15:44:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 15:44:33] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2023-03-14 15:44:33] [INFO ] Transformed 1416 places.
[2023-03-14 15:44:33] [INFO ] Transformed 1640 transitions.
[2023-03-14 15:44:33] [INFO ] Found NUPN structural information;
[2023-03-14 15:44:33] [INFO ] Parsed PT model containing 1416 places and 1640 transitions and 3639 arcs in 342 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 7 resets, run finished after 665 ms. (steps per millisecond=15 ) properties (out of 16) seen :7
FORMULA NoC3x3-PT-1B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 1640 rows 1416 cols
[2023-03-14 15:44:35] [INFO ] Computed 40 place invariants in 42 ms
[2023-03-14 15:44:36] [INFO ] After 1383ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-14 15:44:37] [INFO ] [Nat]Absence check using 40 positive place invariants in 45 ms returned sat
[2023-03-14 15:44:39] [INFO ] After 2251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-14 15:44:40] [INFO ] Deduced a trap composed of 102 places in 174 ms of which 10 ms to minimize.
[2023-03-14 15:44:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 402 ms
[2023-03-14 15:44:41] [INFO ] Deduced a trap composed of 94 places in 153 ms of which 2 ms to minimize.
[2023-03-14 15:44:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 427 ms
[2023-03-14 15:44:42] [INFO ] Deduced a trap composed of 90 places in 196 ms of which 2 ms to minimize.
[2023-03-14 15:44:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 406 ms
[2023-03-14 15:44:42] [INFO ] Deduced a trap composed of 83 places in 180 ms of which 3 ms to minimize.
[2023-03-14 15:44:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 385 ms
[2023-03-14 15:44:43] [INFO ] Deduced a trap composed of 82 places in 194 ms of which 0 ms to minimize.
[2023-03-14 15:44:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 375 ms
[2023-03-14 15:44:43] [INFO ] After 6014ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1190 ms.
[2023-03-14 15:44:44] [INFO ] After 8337ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
FORMULA NoC3x3-PT-1B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 7 properties in 402 ms.
Support contains 89 out of 1416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1416/1416 places, 1640/1640 transitions.
Graph (trivial) has 1230 edges and 1416 vertex of which 449 / 1416 are part of one of the 16 SCC in 14 ms
Free SCC test removed 433 places
Drop transitions removed 514 transitions
Reduce isomorphic transitions removed 514 transitions.
Drop transitions removed 265 transitions
Trivial Post-agglo rules discarded 265 transitions
Performed 265 trivial Post agglomeration. Transition count delta: 265
Iterating post reduction 0 with 265 rules applied. Total rules applied 266 place count 983 transition count 861
Reduce places removed 265 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 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 1 with 303 rules applied. Total rules applied 569 place count 718 transition count 823
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 with 10 rules applied. Total rules applied 579 place count 710 transition count 821
Reduce places removed 1 places and 0 transitions.
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Iterating post reduction 3 with 63 rules applied. Total rules applied 642 place count 709 transition count 759
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 83 rules applied. Total rules applied 725 place count 647 transition count 738
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 727 place count 645 transition count 738
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 727 place count 645 transition count 730
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 743 place count 637 transition count 730
Discarding 148 places :
Symmetric choice reduction at 6 with 148 rule applications. Total rules 891 place count 489 transition count 582
Iterating global reduction 6 with 148 rules applied. Total rules applied 1039 place count 489 transition count 582
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1041 place count 489 transition count 580
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 19 Pre rules applied. Total rules applied 1041 place count 489 transition count 561
Deduced a syphon composed of 19 places in 4 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 1079 place count 470 transition count 561
Discarding 19 places :
Symmetric choice reduction at 7 with 19 rule applications. Total rules 1098 place count 451 transition count 537
Iterating global reduction 7 with 19 rules applied. Total rules applied 1117 place count 451 transition count 537
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 106
Deduced a syphon composed of 106 places in 1 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 7 with 212 rules applied. Total rules applied 1329 place count 345 transition count 431
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1333 place count 345 transition count 427
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1335 place count 343 transition count 423
Iterating global reduction 8 with 2 rules applied. Total rules applied 1337 place count 343 transition count 423
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -53
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1363 place count 330 transition count 476
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1369 place count 330 transition count 470
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 1382 place count 330 transition count 457
Free-agglomeration rule applied 54 times.
Iterating global reduction 9 with 54 rules applied. Total rules applied 1436 place count 330 transition count 403
Reduce places removed 54 places and 0 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 63 rules applied. Total rules applied 1499 place count 276 transition count 394
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 1502 place count 276 transition count 391
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1503 place count 275 transition count 391
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 1506 place count 275 transition count 391
Applied a total of 1506 rules in 471 ms. Remains 275 /1416 variables (removed 1141) and now considering 391/1640 (removed 1249) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 472 ms. Remains : 275/1416 places, 391/1640 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 264828 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 264828 steps, saw 228482 distinct states, run finished after 3004 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-14 15:44:49] [INFO ] Flow matrix only has 390 transitions (discarded 1 similar events)
// Phase 1: matrix 390 rows 275 cols
[2023-03-14 15:44:49] [INFO ] Computed 39 place invariants in 2 ms
[2023-03-14 15:44:49] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 15:44:49] [INFO ] [Nat]Absence check using 39 positive place invariants in 13 ms returned sat
[2023-03-14 15:44:49] [INFO ] After 276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 15:44:49] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-14 15:44:49] [INFO ] After 129ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 15:44:49] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2023-03-14 15:44:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-03-14 15:44:49] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2023-03-14 15:44:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-14 15:44:49] [INFO ] After 396ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 138 ms.
[2023-03-14 15:44:50] [INFO ] After 949ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 89 out of 275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 391/391 transitions.
Applied a total of 0 rules in 12 ms. Remains 275 /275 variables (removed 0) and now considering 391/391 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 275/275 places, 391/391 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 391/391 transitions.
Applied a total of 0 rules in 11 ms. Remains 275 /275 variables (removed 0) and now considering 391/391 (removed 0) transitions.
[2023-03-14 15:44:50] [INFO ] Flow matrix only has 390 transitions (discarded 1 similar events)
[2023-03-14 15:44:50] [INFO ] Invariant cache hit.
[2023-03-14 15:44:50] [INFO ] Implicit Places using invariants in 174 ms returned [134, 245]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 177 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 273/275 places, 391/391 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 273 transition count 388
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 9 place count 270 transition count 385
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 269 transition count 384
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 15 place count 269 transition count 380
Applied a total of 15 rules in 24 ms. Remains 269 /273 variables (removed 4) and now considering 380/391 (removed 11) transitions.
[2023-03-14 15:44:50] [INFO ] Flow matrix only has 379 transitions (discarded 1 similar events)
// Phase 1: matrix 379 rows 269 cols
[2023-03-14 15:44:50] [INFO ] Computed 37 place invariants in 2 ms
[2023-03-14 15:44:50] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-14 15:44:50] [INFO ] Flow matrix only has 379 transitions (discarded 1 similar events)
[2023-03-14 15:44:50] [INFO ] Invariant cache hit.
[2023-03-14 15:44:50] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-14 15:44:50] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 269/275 places, 380/391 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 708 ms. Remains : 269/275 places, 380/391 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 307162 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 307162 steps, saw 261065 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-14 15:44:54] [INFO ] Flow matrix only has 379 transitions (discarded 1 similar events)
[2023-03-14 15:44:54] [INFO ] Invariant cache hit.
[2023-03-14 15:44:54] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 15:44:54] [INFO ] [Nat]Absence check using 37 positive place invariants in 11 ms returned sat
[2023-03-14 15:44:54] [INFO ] After 248ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 15:44:54] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-14 15:44:54] [INFO ] After 141ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 15:44:54] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2023-03-14 15:44:54] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2023-03-14 15:44:54] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2023-03-14 15:44:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 174 ms
[2023-03-14 15:44:54] [INFO ] After 448ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 192 ms.
[2023-03-14 15:44:55] [INFO ] After 983ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 89 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 380/380 transitions.
Applied a total of 0 rules in 10 ms. Remains 269 /269 variables (removed 0) and now considering 380/380 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 269/269 places, 380/380 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 380/380 transitions.
Applied a total of 0 rules in 10 ms. Remains 269 /269 variables (removed 0) and now considering 380/380 (removed 0) transitions.
[2023-03-14 15:44:55] [INFO ] Flow matrix only has 379 transitions (discarded 1 similar events)
[2023-03-14 15:44:55] [INFO ] Invariant cache hit.
[2023-03-14 15:44:55] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-14 15:44:55] [INFO ] Flow matrix only has 379 transitions (discarded 1 similar events)
[2023-03-14 15:44:55] [INFO ] Invariant cache hit.
[2023-03-14 15:44:55] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-14 15:44:55] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
[2023-03-14 15:44:55] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-14 15:44:55] [INFO ] Flow matrix only has 379 transitions (discarded 1 similar events)
[2023-03-14 15:44:55] [INFO ] Invariant cache hit.
[2023-03-14 15:44:56] [INFO ] Dead Transitions using invariants and state equation in 346 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 970 ms. Remains : 269/269 places, 380/380 transitions.
Graph (trivial) has 33 edges and 269 vertex of which 4 / 269 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 652 edges and 266 vertex of which 264 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 7 place count 264 transition count 369
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 259 transition count 367
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 257 transition count 366
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 17 place count 257 transition count 365
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 256 transition count 365
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 29 place count 251 transition count 360
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 31 place count 250 transition count 363
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 250 transition count 361
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 39 place count 250 transition count 355
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 45 place count 244 transition count 355
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 48 place count 244 transition count 355
Applied a total of 48 rules in 91 ms. Remains 244 /269 variables (removed 25) and now considering 355/380 (removed 25) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 355 rows 244 cols
[2023-03-14 15:44:56] [INFO ] Computed 35 place invariants in 1 ms
[2023-03-14 15:44:56] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 15:44:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2023-03-14 15:44:56] [INFO ] After 266ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 15:44:56] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-14 15:44:56] [INFO ] After 118ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 15:44:56] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2023-03-14 15:44:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-14 15:44:56] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2023-03-14 15:44:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-03-14 15:44:57] [INFO ] After 380ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 121 ms.
[2023-03-14 15:44:57] [INFO ] After 873ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-14 15:44:57] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2023-03-14 15:44:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 269 places, 380 transitions and 1132 arcs took 4 ms.
[2023-03-14 15:44:57] [INFO ] Flatten gal took : 126 ms
Total runtime 24403 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running NoC3x3 (PT), instance 1B
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: 269 places, 380 transitions, 1132 arcs.
Final Score: 6833.166
Took : 14 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678808713753

--------------------
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 1788:
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-1B"
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-1B, 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-167863541600239"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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