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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1004K
-rw-r--r-- 1 mcc users 7.9K Feb 26 09:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 09:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 09:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 09:47 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.7K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 09:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 09:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 09:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 09:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:29 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 552K 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-6B-ReachabilityCardinality-00
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-01
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-02
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-03
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-04
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-05
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-06
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-07
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-08
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-09
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-10
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-11
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-12
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-13
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-14
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678996594192

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-6B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-16 19:56:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-16 19:56:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 19:56:37] [INFO ] Load time of PNML (sax parser for PT used): 240 ms
[2023-03-16 19:56:37] [INFO ] Transformed 1544 places.
[2023-03-16 19:56:37] [INFO ] Transformed 2229 transitions.
[2023-03-16 19:56:37] [INFO ] Found NUPN structural information;
[2023-03-16 19:56:37] [INFO ] Parsed PT model containing 1544 places and 2229 transitions and 6663 arcs in 378 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 21 resets, run finished after 714 ms. (steps per millisecond=14 ) properties (out of 13) seen :10
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2229 rows 1544 cols
[2023-03-16 19:56:38] [INFO ] Computed 66 place invariants in 54 ms
[2023-03-16 19:56:39] [INFO ] After 916ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 19:56:40] [INFO ] [Nat]Absence check using 66 positive place invariants in 58 ms returned sat
[2023-03-16 19:57:01] [INFO ] After 21434ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-16 19:57:04] [INFO ] After 24355ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2023-03-16 19:57:04] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 32 ms.
Support contains 39 out of 1544 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1544/1544 places, 2229/2229 transitions.
Drop transitions removed 208 transitions
Trivial Post-agglo rules discarded 208 transitions
Performed 208 trivial Post agglomeration. Transition count delta: 208
Iterating post reduction 0 with 208 rules applied. Total rules applied 208 place count 1544 transition count 2021
Reduce places removed 208 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 214 rules applied. Total rules applied 422 place count 1336 transition count 2015
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 428 place count 1330 transition count 2015
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 428 place count 1330 transition count 1955
Deduced a syphon composed of 60 places in 9 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 548 place count 1270 transition count 1955
Discarding 265 places :
Symmetric choice reduction at 3 with 265 rule applications. Total rules 813 place count 1005 transition count 1690
Iterating global reduction 3 with 265 rules applied. Total rules applied 1078 place count 1005 transition count 1690
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 1078 place count 1005 transition count 1656
Deduced a syphon composed of 34 places in 20 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 1146 place count 971 transition count 1656
Discarding 106 places :
Symmetric choice reduction at 3 with 106 rule applications. Total rules 1252 place count 865 transition count 1310
Iterating global reduction 3 with 106 rules applied. Total rules applied 1358 place count 865 transition count 1310
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 1403 place count 820 transition count 1217
Iterating global reduction 3 with 45 rules applied. Total rules applied 1448 place count 820 transition count 1217
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 1468 place count 800 transition count 1177
Iterating global reduction 3 with 20 rules applied. Total rules applied 1488 place count 800 transition count 1177
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1501 place count 787 transition count 1149
Iterating global reduction 3 with 13 rules applied. Total rules applied 1514 place count 787 transition count 1149
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1517 place count 784 transition count 1143
Iterating global reduction 3 with 3 rules applied. Total rules applied 1520 place count 784 transition count 1143
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1523 place count 781 transition count 1137
Iterating global reduction 3 with 3 rules applied. Total rules applied 1526 place count 781 transition count 1137
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1529 place count 781 transition count 1134
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 4 with 300 rules applied. Total rules applied 1829 place count 631 transition count 984
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2031 place count 530 transition count 1013
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 2101 place count 495 transition count 1034
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 4 with 21 rules applied. Total rules applied 2122 place count 495 transition count 1013
Free-agglomeration rule applied 24 times.
Iterating global reduction 4 with 24 rules applied. Total rules applied 2146 place count 495 transition count 989
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 36 rules applied. Total rules applied 2182 place count 471 transition count 977
Applied a total of 2182 rules in 1221 ms. Remains 471 /1544 variables (removed 1073) and now considering 977/2229 (removed 1252) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1221 ms. Remains : 471/1544 places, 977/2229 transitions.
Incomplete random walk after 10000 steps, including 68 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 195864 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 195864 steps, saw 102282 distinct states, run finished after 3005 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-16 19:57:09] [INFO ] Flow matrix only has 975 transitions (discarded 2 similar events)
// Phase 1: matrix 975 rows 471 cols
[2023-03-16 19:57:09] [INFO ] Computed 66 place invariants in 11 ms
[2023-03-16 19:57:09] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 19:57:09] [INFO ] [Nat]Absence check using 66 positive place invariants in 23 ms returned sat
[2023-03-16 19:57:09] [INFO ] After 561ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 19:57:09] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-16 19:57:10] [INFO ] After 233ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 19:57:10] [INFO ] After 561ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 280 ms.
[2023-03-16 19:57:10] [INFO ] After 1565ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 39 out of 471 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 471/471 places, 977/977 transitions.
Applied a total of 0 rules in 19 ms. Remains 471 /471 variables (removed 0) and now considering 977/977 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 471/471 places, 977/977 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 471/471 places, 977/977 transitions.
Applied a total of 0 rules in 23 ms. Remains 471 /471 variables (removed 0) and now considering 977/977 (removed 0) transitions.
[2023-03-16 19:57:10] [INFO ] Flow matrix only has 975 transitions (discarded 2 similar events)
[2023-03-16 19:57:10] [INFO ] Invariant cache hit.
[2023-03-16 19:57:11] [INFO ] Implicit Places using invariants in 451 ms returned [14, 49, 103, 151, 210, 295, 356, 450]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 455 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 463/471 places, 977/977 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 442 transition count 956
Applied a total of 42 rules in 26 ms. Remains 442 /463 variables (removed 21) and now considering 956/977 (removed 21) transitions.
[2023-03-16 19:57:11] [INFO ] Flow matrix only has 954 transitions (discarded 2 similar events)
// Phase 1: matrix 954 rows 442 cols
[2023-03-16 19:57:11] [INFO ] Computed 58 place invariants in 7 ms
[2023-03-16 19:57:11] [INFO ] Implicit Places using invariants in 386 ms returned []
[2023-03-16 19:57:11] [INFO ] Flow matrix only has 954 transitions (discarded 2 similar events)
[2023-03-16 19:57:11] [INFO ] Invariant cache hit.
[2023-03-16 19:57:12] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-16 19:57:12] [INFO ] Implicit Places using invariants and state equation in 1001 ms returned []
Implicit Place search using SMT with State Equation took 1390 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 442/471 places, 956/977 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1898 ms. Remains : 442/471 places, 956/977 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 19:57:12] [INFO ] Flow matrix only has 954 transitions (discarded 2 similar events)
[2023-03-16 19:57:12] [INFO ] Invariant cache hit.
[2023-03-16 19:57:12] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 19:57:13] [INFO ] [Nat]Absence check using 58 positive place invariants in 20 ms returned sat
[2023-03-16 19:57:13] [INFO ] After 485ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 19:57:13] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-16 19:57:13] [INFO ] After 218ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 19:57:14] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 2 ms to minimize.
[2023-03-16 19:57:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2023-03-16 19:57:14] [INFO ] After 944ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 130 ms.
[2023-03-16 19:57:14] [INFO ] After 1681ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 31 out of 442 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 956/956 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 442 transition count 955
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 441 transition count 955
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 441 transition count 953
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 439 transition count 953
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 437 transition count 951
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 436 transition count 949
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 436 transition count 949
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 434 transition count 949
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 433 transition count 945
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 433 transition count 945
Applied a total of 18 rules in 164 ms. Remains 433 /442 variables (removed 9) and now considering 945/956 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 433/442 places, 945/956 transitions.
Incomplete random walk after 10000 steps, including 69 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 192081 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 192081 steps, saw 77816 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 19:57:18] [INFO ] Flow matrix only has 943 transitions (discarded 2 similar events)
// Phase 1: matrix 943 rows 433 cols
[2023-03-16 19:57:18] [INFO ] Computed 58 place invariants in 7 ms
[2023-03-16 19:57:18] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 19:57:18] [INFO ] [Nat]Absence check using 58 positive place invariants in 20 ms returned sat
[2023-03-16 19:57:18] [INFO ] After 435ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 19:57:18] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-16 19:57:18] [INFO ] After 167ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 19:57:19] [INFO ] After 376ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 340 ms.
[2023-03-16 19:57:19] [INFO ] After 1267ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 31 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 945/945 transitions.
Applied a total of 0 rules in 25 ms. Remains 433 /433 variables (removed 0) and now considering 945/945 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 433/433 places, 945/945 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 945/945 transitions.
Applied a total of 0 rules in 26 ms. Remains 433 /433 variables (removed 0) and now considering 945/945 (removed 0) transitions.
[2023-03-16 19:57:19] [INFO ] Flow matrix only has 943 transitions (discarded 2 similar events)
[2023-03-16 19:57:19] [INFO ] Invariant cache hit.
[2023-03-16 19:57:20] [INFO ] Implicit Places using invariants in 499 ms returned []
[2023-03-16 19:57:20] [INFO ] Flow matrix only has 943 transitions (discarded 2 similar events)
[2023-03-16 19:57:20] [INFO ] Invariant cache hit.
[2023-03-16 19:57:20] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-16 19:57:21] [INFO ] Implicit Places using invariants and state equation in 1100 ms returned []
Implicit Place search using SMT with State Equation took 1605 ms to find 0 implicit places.
[2023-03-16 19:57:21] [INFO ] Redundant transitions in 102 ms returned []
[2023-03-16 19:57:21] [INFO ] Flow matrix only has 943 transitions (discarded 2 similar events)
[2023-03-16 19:57:21] [INFO ] Invariant cache hit.
[2023-03-16 19:57:22] [INFO ] Dead Transitions using invariants and state equation in 880 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2630 ms. Remains : 433/433 places, 945/945 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 433 transition count 943
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 431 transition count 941
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 16 place count 431 transition count 931
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 431 transition count 931
Applied a total of 18 rules in 91 ms. Remains 431 /433 variables (removed 2) and now considering 931/945 (removed 14) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 931 rows 431 cols
[2023-03-16 19:57:22] [INFO ] Computed 58 place invariants in 9 ms
[2023-03-16 19:57:22] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 19:57:22] [INFO ] [Nat]Absence check using 58 positive place invariants in 20 ms returned sat
[2023-03-16 19:57:22] [INFO ] After 409ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 19:57:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-16 19:57:22] [INFO ] After 76ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 19:57:23] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2023-03-16 19:57:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2023-03-16 19:57:23] [INFO ] After 373ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 110 ms.
[2023-03-16 19:57:23] [INFO ] After 1032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-16 19:57:23] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2023-03-16 19:57:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 433 places, 945 transitions and 3862 arcs took 7 ms.
[2023-03-16 19:57:23] [INFO ] Flatten gal took : 177 ms
Total runtime 47018 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: NoC3x3_PT_6B
(NrP: 433 NrTr: 945 NrArc: 3862)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.050sec

net check time: 0m 0.001sec

init dd package: 0m 3.496sec


before gc: list nodes free: 1231883

after gc: idd nodes used:6509, unused:63993491; list nodes free:266307081

before gc: list nodes free: 1683092

after gc: idd nodes used:4365, unused:63995635; list nodes free:268414066

before gc: list nodes free: 1846287

after gc: idd nodes used:11934, unused:63988066; list nodes free:270476662

before gc: list nodes free: 1028885

after gc: idd nodes used:15290, unused:63984710; list nodes free:270462165
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6487608 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16096444 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.005sec

2552 3325 2599 2948 2496 3179 4747 3920 4457 4376 4002 5173 4338 4175 4685 5474 3124 4159 4980 3873 4897 4643 4039 5495 4606 5692 5567 5112 4684 5101 4961 6028 4967 5615 4855 5374 5627 6051 6900 4901 5748 6804 6057 5649 5771 5157 6366 5662 5289 5555 6613 5135 5851 6318 7130 6536 6735 7731 6535 6056 5312 6793 5677 5366 6386 5981 5486 6202 7120 7588 7308 6376 8044 7063 6316 6182 6229 6771 6199 7108 7031 5146 5346 6509 5554 5038 5889 6657 7261 6657 6754 7805 6741 6203 5330 6955 5522 5318 5872 4565 4179 5921 5573 6251 6114 6593 4810 6321 5752 5471 6076 5314 6453 6542 4431 6749 6970 5379 7328 6282 5717 5451 6280 6542 6078 7007 5509 5065 5863 5842 9571 8632 9480 9739 9367 11099 11795 10803 11218 13479 11571 12610 11611 12899 12419 13058 13764 12551 10087 11446 12071 11016 12410 13495 12230 12270 13342 14213 12947 13386 13800 14957 15864 15606 16147 16216 16589 15356 15411 18269 16096 16854 14879 15894 16541 16260 16972 16038 17474 15616 15256 14499 15122 16470 14698 14680 15571 15239 15207 15922 15468

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-6B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is NoC3x3-PT-6B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r266-smll-167863540800318"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-6B.tgz
mv NoC3x3-PT-6B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;