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.r523-tall-167987247800270.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 EisenbergMcGuire-PT-09, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r523-tall-167987247800270
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 6.3K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 16K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 2.3M Mar 31 16:48 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 EisenbergMcGuire-PT-09-ReachabilityCardinality-00
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-01
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-02
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-03
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-04
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-05
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-06
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-07
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-08
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-09
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-10
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-11
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-12
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-13
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-14
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1680815220952

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-09
Applying reductions before tool smart
Invoking reducer
Running Version 202304061127
[2023-04-06 21:07:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-04-06 21:07:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 21:07:02] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2023-04-06 21:07:02] [INFO ] Transformed 891 places.
[2023-04-06 21:07:02] [INFO ] Transformed 3888 transitions.
[2023-04-06 21:07:02] [INFO ] Found NUPN structural information;
[2023-04-06 21:07:02] [INFO ] Parsed PT model containing 891 places and 3888 transitions and 18792 arcs in 294 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 453 ms. (steps per millisecond=22 ) properties (out of 14) seen :5
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) 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 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-04-06 21:07:03] [INFO ] Flow matrix only has 1809 transitions (discarded 2079 similar events)
// Phase 1: matrix 1809 rows 891 cols
[2023-04-06 21:07:03] [INFO ] Computed 28 invariants in 30 ms
[2023-04-06 21:07:04] [INFO ] After 457ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-06 21:07:04] [INFO ] [Nat]Absence check using 19 positive place invariants in 27 ms returned sat
[2023-04-06 21:07:04] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2023-04-06 21:07:06] [INFO ] After 1042ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-04-06 21:07:06] [INFO ] State equation strengthened by 932 read => feed constraints.
[2023-04-06 21:07:07] [INFO ] After 998ms SMT Verify possible using 932 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-04-06 21:07:07] [INFO ] Deduced a trap composed of 13 places in 494 ms of which 8 ms to minimize.
[2023-04-06 21:07:08] [INFO ] Deduced a trap composed of 3 places in 403 ms of which 1 ms to minimize.
[2023-04-06 21:07:08] [INFO ] Deduced a trap composed of 17 places in 382 ms of which 1 ms to minimize.
[2023-04-06 21:07:09] [INFO ] Deduced a trap composed of 3 places in 444 ms of which 1 ms to minimize.
[2023-04-06 21:07:09] [INFO ] Deduced a trap composed of 3 places in 421 ms of which 1 ms to minimize.
[2023-04-06 21:07:10] [INFO ] Deduced a trap composed of 33 places in 414 ms of which 0 ms to minimize.
[2023-04-06 21:07:10] [INFO ] Deduced a trap composed of 27 places in 393 ms of which 1 ms to minimize.
[2023-04-06 21:07:10] [INFO ] Deduced a trap composed of 3 places in 385 ms of which 2 ms to minimize.
[2023-04-06 21:07:11] [INFO ] Deduced a trap composed of 3 places in 227 ms of which 1 ms to minimize.
[2023-04-06 21:07:11] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 1 ms to minimize.
[2023-04-06 21:07:11] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 0 ms to minimize.
[2023-04-06 21:07:11] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4567 ms
[2023-04-06 21:07:12] [INFO ] Deduced a trap composed of 64 places in 199 ms of which 1 ms to minimize.
[2023-04-06 21:07:12] [INFO ] Deduced a trap composed of 3 places in 190 ms of which 1 ms to minimize.
[2023-04-06 21:07:12] [INFO ] Deduced a trap composed of 47 places in 180 ms of which 0 ms to minimize.
[2023-04-06 21:07:12] [INFO ] Deduced a trap composed of 41 places in 177 ms of which 0 ms to minimize.
[2023-04-06 21:07:13] [INFO ] Deduced a trap composed of 26 places in 197 ms of which 0 ms to minimize.
[2023-04-06 21:07:13] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 0 ms to minimize.
[2023-04-06 21:07:13] [INFO ] Deduced a trap composed of 53 places in 135 ms of which 1 ms to minimize.
[2023-04-06 21:07:13] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 0 ms to minimize.
[2023-04-06 21:07:13] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1893 ms
[2023-04-06 21:07:14] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 1 ms to minimize.
[2023-04-06 21:07:14] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 0 ms to minimize.
[2023-04-06 21:07:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 409 ms
[2023-04-06 21:07:14] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 1 ms to minimize.
[2023-04-06 21:07:14] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 1 ms to minimize.
[2023-04-06 21:07:15] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 0 ms to minimize.
[2023-04-06 21:07:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 614 ms
[2023-04-06 21:07:15] [INFO ] Deduced a trap composed of 3 places in 326 ms of which 0 ms to minimize.
[2023-04-06 21:07:15] [INFO ] Deduced a trap composed of 16 places in 266 ms of which 1 ms to minimize.
[2023-04-06 21:07:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 760 ms
[2023-04-06 21:07:16] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 0 ms to minimize.
[2023-04-06 21:07:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2023-04-06 21:07:16] [INFO ] After 10403ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 917 ms.
[2023-04-06 21:07:17] [INFO ] After 12926ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 247 ms.
Support contains 133 out of 891 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 891/891 places, 3888/3888 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 891 transition count 3882
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 14 place count 885 transition count 3880
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 883 transition count 3880
Performed 175 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 175 Pre rules applied. Total rules applied 16 place count 883 transition count 3705
Deduced a syphon composed of 175 places in 3 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 3 with 350 rules applied. Total rules applied 366 place count 708 transition count 3705
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 427 place count 647 transition count 3156
Iterating global reduction 3 with 61 rules applied. Total rules applied 488 place count 647 transition count 3156
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 3 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 582 place count 600 transition count 3109
Applied a total of 582 rules in 369 ms. Remains 600 /891 variables (removed 291) and now considering 3109/3888 (removed 779) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 370 ms. Remains : 600/891 places, 3109/3888 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 8) seen :2
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-04-06 21:07:18] [INFO ] Flow matrix only has 1030 transitions (discarded 2079 similar events)
// Phase 1: matrix 1030 rows 600 cols
[2023-04-06 21:07:18] [INFO ] Computed 28 invariants in 4 ms
[2023-04-06 21:07:18] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-06 21:07:18] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-04-06 21:07:18] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2023-04-06 21:07:19] [INFO ] After 540ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-06 21:07:19] [INFO ] State equation strengthened by 444 read => feed constraints.
[2023-04-06 21:07:19] [INFO ] After 500ms SMT Verify possible using 444 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-06 21:07:20] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 1 ms to minimize.
[2023-04-06 21:07:20] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 0 ms to minimize.
[2023-04-06 21:07:20] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 1 ms to minimize.
[2023-04-06 21:07:20] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 0 ms to minimize.
[2023-04-06 21:07:20] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 0 ms to minimize.
[2023-04-06 21:07:20] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2023-04-06 21:07:20] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 855 ms
[2023-04-06 21:07:21] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 4 ms to minimize.
[2023-04-06 21:07:21] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 1 ms to minimize.
[2023-04-06 21:07:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 365 ms
[2023-04-06 21:07:21] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 1 ms to minimize.
[2023-04-06 21:07:21] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 0 ms to minimize.
[2023-04-06 21:07:21] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 0 ms to minimize.
[2023-04-06 21:07:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 566 ms
[2023-04-06 21:07:22] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 5 ms to minimize.
[2023-04-06 21:07:22] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-06 21:07:22] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 0 ms to minimize.
[2023-04-06 21:07:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 364 ms
[2023-04-06 21:07:22] [INFO ] After 3057ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 344 ms.
[2023-04-06 21:07:22] [INFO ] After 4158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 64 ms.
Support contains 102 out of 600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 600/600 places, 3109/3109 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 600 transition count 3092
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 583 transition count 3092
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 582 transition count 3083
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 582 transition count 3083
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 576 transition count 3077
Applied a total of 48 rules in 218 ms. Remains 576 /600 variables (removed 24) and now considering 3077/3109 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 218 ms. Remains : 576/600 places, 3077/3109 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 275650 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{0=1, 1=1, 2=1, 4=1, 5=1}
Probabilistic random walk after 275650 steps, saw 185935 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :5
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
[2023-04-06 21:07:26] [INFO ] Flow matrix only has 998 transitions (discarded 2079 similar events)
// Phase 1: matrix 998 rows 576 cols
[2023-04-06 21:07:26] [INFO ] Computed 28 invariants in 9 ms
[2023-04-06 21:07:26] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:07:26] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-04-06 21:07:26] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 21:07:26] [INFO ] After 269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:07:27] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:07:27] [INFO ] After 132ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:07:27] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 1 ms to minimize.
[2023-04-06 21:07:27] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 0 ms to minimize.
[2023-04-06 21:07:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 298 ms
[2023-04-06 21:07:27] [INFO ] After 467ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-04-06 21:07:27] [INFO ] After 898ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 576 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 3077/3077 transitions.
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 59 Pre rules applied. Total rules applied 0 place count 576 transition count 3018
Deduced a syphon composed of 59 places in 2 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 0 with 118 rules applied. Total rules applied 118 place count 517 transition count 3018
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 127 place count 508 transition count 2937
Iterating global reduction 0 with 9 rules applied. Total rules applied 136 place count 508 transition count 2937
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 170 place count 491 transition count 2920
Applied a total of 170 rules in 139 ms. Remains 491 /576 variables (removed 85) and now considering 2920/3077 (removed 157) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 491/576 places, 2920/3077 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 430620 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :{}
Probabilistic random walk after 430620 steps, saw 259978 distinct states, run finished after 3003 ms. (steps per millisecond=143 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:07:30] [INFO ] Flow matrix only has 841 transitions (discarded 2079 similar events)
// Phase 1: matrix 841 rows 491 cols
[2023-04-06 21:07:30] [INFO ] Computed 28 invariants in 5 ms
[2023-04-06 21:07:30] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:07:30] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-04-06 21:07:30] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-06 21:07:31] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:07:31] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-06 21:07:31] [INFO ] After 87ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:07:31] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 0 ms to minimize.
[2023-04-06 21:07:31] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 0 ms to minimize.
[2023-04-06 21:07:31] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 0 ms to minimize.
[2023-04-06 21:07:31] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
[2023-04-06 21:07:32] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2023-04-06 21:07:32] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2023-04-06 21:07:32] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 932 ms
[2023-04-06 21:07:32] [INFO ] After 1046ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-04-06 21:07:32] [INFO ] After 1411ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 491 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 491/491 places, 2920/2920 transitions.
Applied a total of 0 rules in 95 ms. Remains 491 /491 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 491/491 places, 2920/2920 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 491/491 places, 2920/2920 transitions.
Applied a total of 0 rules in 84 ms. Remains 491 /491 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
[2023-04-06 21:07:32] [INFO ] Flow matrix only has 841 transitions (discarded 2079 similar events)
[2023-04-06 21:07:32] [INFO ] Invariant cache hit.
[2023-04-06 21:07:32] [INFO ] Implicit Places using invariants in 519 ms returned []
[2023-04-06 21:07:32] [INFO ] Flow matrix only has 841 transitions (discarded 2079 similar events)
[2023-04-06 21:07:32] [INFO ] Invariant cache hit.
[2023-04-06 21:07:33] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-06 21:07:35] [INFO ] Implicit Places using invariants and state equation in 2376 ms returned []
Implicit Place search using SMT with State Equation took 2900 ms to find 0 implicit places.
[2023-04-06 21:07:35] [INFO ] Redundant transitions in 161 ms returned []
[2023-04-06 21:07:35] [INFO ] Flow matrix only has 841 transitions (discarded 2079 similar events)
[2023-04-06 21:07:35] [INFO ] Invariant cache hit.
[2023-04-06 21:07:36] [INFO ] Dead Transitions using invariants and state equation in 962 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4116 ms. Remains : 491/491 places, 2920/2920 transitions.
Graph (trivial) has 2695 edges and 491 vertex of which 80 / 491 are part of one of the 9 SCC in 5 ms
Free SCC test removed 71 places
Drop transitions removed 271 transitions
Ensure Unique test removed 2025 transitions
Reduce isomorphic transitions removed 2296 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 420 transition count 528
Reduce places removed 96 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 98 rules applied. Total rules applied 195 place count 324 transition count 526
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 197 place count 322 transition count 526
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 197 place count 322 transition count 509
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 41 rules applied. Total rules applied 238 place count 298 transition count 509
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 3 with 284 rules applied. Total rules applied 522 place count 156 transition count 367
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 3 with 69 rules applied. Total rules applied 591 place count 156 transition count 298
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 605 place count 149 transition count 298
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 612 place count 149 transition count 291
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 623 place count 149 transition count 280
Free-agglomeration rule applied 75 times.
Iterating global reduction 5 with 75 rules applied. Total rules applied 698 place count 149 transition count 205
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 5 with 75 rules applied. Total rules applied 773 place count 74 transition count 205
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 774 place count 74 transition count 204
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 783 place count 74 transition count 204
Applied a total of 783 rules in 61 ms. Remains 74 /491 variables (removed 417) and now considering 204/2920 (removed 2716) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 204 rows 74 cols
[2023-04-06 21:07:36] [INFO ] Computed 21 invariants in 1 ms
[2023-04-06 21:07:36] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:07:36] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-04-06 21:07:36] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-06 21:07:36] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:07:36] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-04-06 21:07:36] [INFO ] After 6ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:07:36] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-04-06 21:07:36] [INFO ] After 88ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:07:36] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-04-06 21:07:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 491 places, 2920 transitions and 15578 arcs took 15 ms.
[2023-04-06 21:07:37] [INFO ] Flatten gal took : 223 ms
Total runtime 34475 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running EisenbergMcGuire (PT), instance 09
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 491 places, 2920 transitions, 15578 arcs.
Final Score: 101699.662
Took : 46 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: EisenbergMcGuire-PT-09-ReachabilityCardinality-09 (reachable &!potential( ( ( ( (tk(P346)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P346)) ) ) | ( ( ( (tk(P62)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P62)) ) ) | ( ( ( (tk(P139)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P139)) ) ) & ( ( ( (tk(P221)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P221)) ) ) | ( ( (tk(P137)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P137)) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 3194056 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16107196 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
Caught signal 15, terminating.

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is EisenbergMcGuire-PT-09, 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 r523-tall-167987247800270"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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