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-167987247800263.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-08, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r523-tall-167987247800263
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 23 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.0K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 23 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 23 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 1.7M 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-08-ReachabilityFireability-00
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-01
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-02
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-03
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-04
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-05
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-06
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-07
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-08
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-09
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-10
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-11
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-12
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-13
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-14
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1680814974317

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=EisenbergMcGuire-PT-08
Applying reductions before tool smart
Invoking reducer
Running Version 202304061127
[2023-04-06 21:02:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-04-06 21:02:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 21:02:56] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2023-04-06 21:02:56] [INFO ] Transformed 712 places.
[2023-04-06 21:02:56] [INFO ] Transformed 2816 transitions.
[2023-04-06 21:02:56] [INFO ] Found NUPN structural information;
[2023-04-06 21:02:56] [INFO ] Parsed PT model containing 712 places and 2816 transitions and 13440 arcs in 313 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 565 ms. (steps per millisecond=17 ) properties (out of 16) seen :1
FORMULA EisenbergMcGuire-PT-08-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 143271 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{14=1}
Probabilistic random walk after 143271 steps, saw 111809 distinct states, run finished after 3002 ms. (steps per millisecond=47 ) properties seen :1
FORMULA EisenbergMcGuire-PT-08-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 14 properties.
[2023-04-06 21:03:00] [INFO ] Flow matrix only has 1368 transitions (discarded 1448 similar events)
// Phase 1: matrix 1368 rows 712 cols
[2023-04-06 21:03:00] [INFO ] Computed 25 invariants in 26 ms
[2023-04-06 21:03:01] [INFO ] After 616ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-04-06 21:03:01] [INFO ] [Nat]Absence check using 17 positive place invariants in 32 ms returned sat
[2023-04-06 21:03:01] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 6 ms returned sat
[2023-04-06 21:03:02] [INFO ] After 1128ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :9
[2023-04-06 21:03:02] [INFO ] State equation strengthened by 676 read => feed constraints.
[2023-04-06 21:03:03] [INFO ] After 981ms SMT Verify possible using 676 Read/Feed constraints in natural domain returned unsat :5 sat :9
[2023-04-06 21:03:03] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 10 ms to minimize.
[2023-04-06 21:03:04] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 1 ms to minimize.
[2023-04-06 21:03:04] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 2 ms to minimize.
[2023-04-06 21:03:04] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 2 ms to minimize.
[2023-04-06 21:03:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 659 ms
[2023-04-06 21:03:04] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 0 ms to minimize.
[2023-04-06 21:03:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2023-04-06 21:03:05] [INFO ] Deduced a trap composed of 37 places in 305 ms of which 0 ms to minimize.
[2023-04-06 21:03:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 427 ms
[2023-04-06 21:03:05] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 0 ms to minimize.
[2023-04-06 21:03:05] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2023-04-06 21:03:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 300 ms
[2023-04-06 21:03:06] [INFO ] Deduced a trap composed of 23 places in 289 ms of which 1 ms to minimize.
[2023-04-06 21:03:06] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 1 ms to minimize.
[2023-04-06 21:03:06] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 0 ms to minimize.
[2023-04-06 21:03:06] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 0 ms to minimize.
[2023-04-06 21:03:06] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2023-04-06 21:03:06] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2023-04-06 21:03:07] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 0 ms to minimize.
[2023-04-06 21:03:07] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1356 ms
[2023-04-06 21:03:07] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 0 ms to minimize.
[2023-04-06 21:03:07] [INFO ] Deduced a trap composed of 3 places in 172 ms of which 0 ms to minimize.
[2023-04-06 21:03:07] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 1 ms to minimize.
[2023-04-06 21:03:08] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 1 ms to minimize.
[2023-04-06 21:03:08] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 1 ms to minimize.
[2023-04-06 21:03:08] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 2 ms to minimize.
[2023-04-06 21:03:08] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 1 ms to minimize.
[2023-04-06 21:03:08] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1432 ms
[2023-04-06 21:03:09] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 0 ms to minimize.
[2023-04-06 21:03:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2023-04-06 21:03:09] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 1 ms to minimize.
[2023-04-06 21:03:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2023-04-06 21:03:09] [INFO ] After 6775ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :9
Attempting to minimize the solution found.
Minimization took 1226 ms.
[2023-04-06 21:03:10] [INFO ] After 9665ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :9
FORMULA EisenbergMcGuire-PT-08-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA EisenbergMcGuire-PT-08-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA EisenbergMcGuire-PT-08-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA EisenbergMcGuire-PT-08-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA EisenbergMcGuire-PT-08-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 322 ms.
Support contains 113 out of 712 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 712/712 places, 2816/2816 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 712 transition count 2813
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 709 transition count 2813
Performed 177 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 177 Pre rules applied. Total rules applied 6 place count 709 transition count 2636
Deduced a syphon composed of 177 places in 6 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 2 with 354 rules applied. Total rules applied 360 place count 532 transition count 2636
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 402 place count 490 transition count 2300
Iterating global reduction 2 with 42 rules applied. Total rules applied 444 place count 490 transition count 2300
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 4 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 546 place count 439 transition count 2249
Applied a total of 546 rules in 274 ms. Remains 439 /712 variables (removed 273) and now considering 2249/2816 (removed 567) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 275 ms. Remains : 439/712 places, 2249/2816 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) 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 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 101 ms. (steps per millisecond=99 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) 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 9) seen :0
Interrupted probabilistic random walk after 165132 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{5=1, 6=1}
Probabilistic random walk after 165132 steps, saw 109837 distinct states, run finished after 3002 ms. (steps per millisecond=55 ) properties seen :2
FORMULA EisenbergMcGuire-PT-08-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-08-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 7 properties.
[2023-04-06 21:03:15] [INFO ] Flow matrix only has 801 transitions (discarded 1448 similar events)
// Phase 1: matrix 801 rows 439 cols
[2023-04-06 21:03:15] [INFO ] Computed 25 invariants in 7 ms
[2023-04-06 21:03:15] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-04-06 21:03:15] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2023-04-06 21:03:15] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-04-06 21:03:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-04-06 21:03:15] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-06 21:03:16] [INFO ] After 564ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-04-06 21:03:16] [INFO ] State equation strengthened by 382 read => feed constraints.
[2023-04-06 21:03:16] [INFO ] After 546ms SMT Verify possible using 382 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-04-06 21:03:16] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 0 ms to minimize.
[2023-04-06 21:03:17] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 0 ms to minimize.
[2023-04-06 21:03:17] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 1 ms to minimize.
[2023-04-06 21:03:17] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 1 ms to minimize.
[2023-04-06 21:03:17] [INFO ] Deduced a trap composed of 50 places in 132 ms of which 0 ms to minimize.
[2023-04-06 21:03:17] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 0 ms to minimize.
[2023-04-06 21:03:17] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 1 ms to minimize.
[2023-04-06 21:03:18] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 0 ms to minimize.
[2023-04-06 21:03:18] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 0 ms to minimize.
[2023-04-06 21:03:18] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 4 ms to minimize.
[2023-04-06 21:03:18] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 0 ms to minimize.
[2023-04-06 21:03:18] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1713 ms
[2023-04-06 21:03:18] [INFO ] Deduced a trap composed of 3 places in 195 ms of which 1 ms to minimize.
[2023-04-06 21:03:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2023-04-06 21:03:18] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2023-04-06 21:03:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-04-06 21:03:19] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 1 ms to minimize.
[2023-04-06 21:03:19] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 1 ms to minimize.
[2023-04-06 21:03:19] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2023-04-06 21:03:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 354 ms
[2023-04-06 21:03:19] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 1 ms to minimize.
[2023-04-06 21:03:19] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 0 ms to minimize.
[2023-04-06 21:03:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 391 ms
[2023-04-06 21:03:20] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 0 ms to minimize.
[2023-04-06 21:03:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2023-04-06 21:03:20] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 0 ms to minimize.
[2023-04-06 21:03:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2023-04-06 21:03:20] [INFO ] After 4150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 465 ms.
[2023-04-06 21:03:20] [INFO ] After 5389ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 85 ms.
Support contains 83 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2249/2249 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 439 transition count 2239
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 429 transition count 2239
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 423 transition count 2191
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 423 transition count 2191
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 422 transition count 2190
Applied a total of 34 rules in 131 ms. Remains 422 /439 variables (removed 17) and now considering 2190/2249 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 422/439 places, 2190/2249 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 208125 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 208125 steps, saw 129159 distinct states, run finished after 3002 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 7 properties.
[2023-04-06 21:03:24] [INFO ] Flow matrix only has 742 transitions (discarded 1448 similar events)
// Phase 1: matrix 742 rows 422 cols
[2023-04-06 21:03:24] [INFO ] Computed 25 invariants in 3 ms
[2023-04-06 21:03:24] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-04-06 21:03:24] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-06 21:03:24] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-04-06 21:03:24] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-04-06 21:03:24] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-06 21:03:25] [INFO ] After 502ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-04-06 21:03:25] [INFO ] State equation strengthened by 340 read => feed constraints.
[2023-04-06 21:03:25] [INFO ] After 492ms SMT Verify possible using 340 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-04-06 21:03:25] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 0 ms to minimize.
[2023-04-06 21:03:26] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 0 ms to minimize.
[2023-04-06 21:03:26] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 0 ms to minimize.
[2023-04-06 21:03:26] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 1 ms to minimize.
[2023-04-06 21:03:26] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 1 ms to minimize.
[2023-04-06 21:03:26] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 1 ms to minimize.
[2023-04-06 21:03:26] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 0 ms to minimize.
[2023-04-06 21:03:26] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2023-04-06 21:03:27] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 0 ms to minimize.
[2023-04-06 21:03:27] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 0 ms to minimize.
[2023-04-06 21:03:27] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 0 ms to minimize.
[2023-04-06 21:03:27] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 0 ms to minimize.
[2023-04-06 21:03:27] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2023-04-06 21:03:27] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1810 ms
[2023-04-06 21:03:27] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2023-04-06 21:03:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-04-06 21:03:28] [INFO ] Deduced a trap composed of 41 places in 210 ms of which 0 ms to minimize.
[2023-04-06 21:03:28] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 0 ms to minimize.
[2023-04-06 21:03:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 439 ms
[2023-04-06 21:03:28] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 0 ms to minimize.
[2023-04-06 21:03:28] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 1 ms to minimize.
[2023-04-06 21:03:28] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 0 ms to minimize.
[2023-04-06 21:03:28] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 2 ms to minimize.
[2023-04-06 21:03:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 518 ms
[2023-04-06 21:03:29] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 0 ms to minimize.
[2023-04-06 21:03:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2023-04-06 21:03:29] [INFO ] After 3932ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 450 ms.
[2023-04-06 21:03:29] [INFO ] After 5072ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 32 ms.
Support contains 83 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 2190/2190 transitions.
Applied a total of 0 rules in 76 ms. Remains 422 /422 variables (removed 0) and now considering 2190/2190 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 422/422 places, 2190/2190 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 2190/2190 transitions.
Applied a total of 0 rules in 71 ms. Remains 422 /422 variables (removed 0) and now considering 2190/2190 (removed 0) transitions.
[2023-04-06 21:03:29] [INFO ] Flow matrix only has 742 transitions (discarded 1448 similar events)
[2023-04-06 21:03:29] [INFO ] Invariant cache hit.
[2023-04-06 21:03:30] [INFO ] Implicit Places using invariants in 247 ms returned []
[2023-04-06 21:03:30] [INFO ] Flow matrix only has 742 transitions (discarded 1448 similar events)
[2023-04-06 21:03:30] [INFO ] Invariant cache hit.
[2023-04-06 21:03:30] [INFO ] State equation strengthened by 340 read => feed constraints.
[2023-04-06 21:03:31] [INFO ] Implicit Places using invariants and state equation in 1349 ms returned []
Implicit Place search using SMT with State Equation took 1621 ms to find 0 implicit places.
[2023-04-06 21:03:31] [INFO ] Redundant transitions in 127 ms returned []
[2023-04-06 21:03:31] [INFO ] Flow matrix only has 742 transitions (discarded 1448 similar events)
[2023-04-06 21:03:31] [INFO ] Invariant cache hit.
[2023-04-06 21:03:32] [INFO ] Dead Transitions using invariants and state equation in 766 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2601 ms. Remains : 422/422 places, 2190/2190 transitions.
Graph (trivial) has 1306 edges and 422 vertex of which 59 / 422 are part of one of the 8 SCC in 4 ms
Free SCC test removed 51 places
Drop transitions removed 182 transitions
Ensure Unique test removed 1450 transitions
Reduce isomorphic transitions removed 1632 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 371 transition count 507
Reduce places removed 51 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 56 rules applied. Total rules applied 108 place count 320 transition count 502
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 113 place count 315 transition count 502
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 113 place count 315 transition count 494
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 130 place count 306 transition count 494
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 288 place count 227 transition count 415
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 306 place count 227 transition count 397
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 308 place count 226 transition count 410
Drop transitions removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 4 with 31 rules applied. Total rules applied 339 place count 226 transition count 379
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 339 place count 226 transition count 378
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 341 place count 225 transition count 378
Free-agglomeration rule applied 70 times.
Iterating global reduction 4 with 70 rules applied. Total rules applied 411 place count 225 transition count 308
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 4 with 70 rules applied. Total rules applied 481 place count 155 transition count 308
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 490 place count 155 transition count 308
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 491 place count 155 transition count 308
Applied a total of 491 rules in 60 ms. Remains 155 /422 variables (removed 267) and now considering 308/2190 (removed 1882) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 308 rows 155 cols
[2023-04-06 21:03:32] [INFO ] Computed 24 invariants in 4 ms
[2023-04-06 21:03:32] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-04-06 21:03:32] [INFO ] [Real]Absence check using 17 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 21:03:32] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-04-06 21:03:32] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-04-06 21:03:32] [INFO ] [Nat]Absence check using 17 positive and 7 generalized place invariants in 1 ms returned sat
[2023-04-06 21:03:32] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-04-06 21:03:32] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-04-06 21:03:32] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2023-04-06 21:03:32] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-04-06 21:03:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 124 ms
[2023-04-06 21:03:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-04-06 21:03:33] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-04-06 21:03:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 91 ms
[2023-04-06 21:03:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-04-06 21:03:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-04-06 21:03:33] [INFO ] After 702ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 180 ms.
[2023-04-06 21:03:33] [INFO ] After 953ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2023-04-06 21:03:33] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-04-06 21:03:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 422 places, 2190 transitions and 11420 arcs took 13 ms.
[2023-04-06 21:03:34] [INFO ] Flatten gal took : 193 ms
Total runtime 38062 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running EisenbergMcGuire (PT), instance 08
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: 422 places, 2190 transitions, 11420 arcs.
Final Score: 69970.221
Took : 28 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1680815044172

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 14055:
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="EisenbergMcGuire-PT-08"
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 EisenbergMcGuire-PT-08, 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 r523-tall-167987247800263"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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