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.r107-tall-167814484100391.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 DES-PT-02b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-tall-167814484100391
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 15:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 15:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 26 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 26 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 69K Mar 5 18:22 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 DES-PT-02b-ReachabilityFireability-00
FORMULA_NAME DES-PT-02b-ReachabilityFireability-01
FORMULA_NAME DES-PT-02b-ReachabilityFireability-02
FORMULA_NAME DES-PT-02b-ReachabilityFireability-03
FORMULA_NAME DES-PT-02b-ReachabilityFireability-04
FORMULA_NAME DES-PT-02b-ReachabilityFireability-05
FORMULA_NAME DES-PT-02b-ReachabilityFireability-06
FORMULA_NAME DES-PT-02b-ReachabilityFireability-07
FORMULA_NAME DES-PT-02b-ReachabilityFireability-08
FORMULA_NAME DES-PT-02b-ReachabilityFireability-09
FORMULA_NAME DES-PT-02b-ReachabilityFireability-10
FORMULA_NAME DES-PT-02b-ReachabilityFireability-11
FORMULA_NAME DES-PT-02b-ReachabilityFireability-12
FORMULA_NAME DES-PT-02b-ReachabilityFireability-13
FORMULA_NAME DES-PT-02b-ReachabilityFireability-14
FORMULA_NAME DES-PT-02b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678367402985

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=DES-PT-02b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 13:10:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 13:10:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 13:10:04] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2023-03-09 13:10:04] [INFO ] Transformed 288 places.
[2023-03-09 13:10:04] [INFO ] Transformed 239 transitions.
[2023-03-09 13:10:04] [INFO ] Found NUPN structural information;
[2023-03-09 13:10:04] [INFO ] Parsed PT model containing 288 places and 239 transitions and 699 arcs in 117 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 86 resets, run finished after 429 ms. (steps per millisecond=23 ) properties (out of 16) seen :10
FORMULA DES-PT-02b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :1
FORMULA DES-PT-02b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 5 properties.
// Phase 1: matrix 239 rows 288 cols
[2023-03-09 13:10:05] [INFO ] Computed 65 place invariants in 20 ms
[2023-03-09 13:10:05] [INFO ] After 267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 13:10:06] [INFO ] [Nat]Absence check using 39 positive place invariants in 11 ms returned sat
[2023-03-09 13:10:06] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 10 ms returned sat
[2023-03-09 13:10:06] [INFO ] After 305ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-09 13:10:06] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 4 ms to minimize.
[2023-03-09 13:10:06] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2023-03-09 13:10:06] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2023-03-09 13:10:06] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2023-03-09 13:10:06] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 0 ms to minimize.
[2023-03-09 13:10:07] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
[2023-03-09 13:10:07] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 0 ms to minimize.
[2023-03-09 13:10:07] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 1 ms to minimize.
[2023-03-09 13:10:07] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2023-03-09 13:10:07] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 0 ms to minimize.
[2023-03-09 13:10:07] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 0 ms to minimize.
[2023-03-09 13:10:07] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2023-03-09 13:10:07] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2023-03-09 13:10:07] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2023-03-09 13:10:07] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 3 ms to minimize.
[2023-03-09 13:10:07] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 0 ms to minimize.
[2023-03-09 13:10:07] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1395 ms
[2023-03-09 13:10:07] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 0 ms to minimize.
[2023-03-09 13:10:08] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 0 ms to minimize.
[2023-03-09 13:10:08] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2023-03-09 13:10:08] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2023-03-09 13:10:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 298 ms
[2023-03-09 13:10:08] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2023-03-09 13:10:08] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2023-03-09 13:10:08] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2023-03-09 13:10:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 244 ms
[2023-03-09 13:10:08] [INFO ] After 2478ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 228 ms.
[2023-03-09 13:10:08] [INFO ] After 2895ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA DES-PT-02b-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 29 ms.
Support contains 75 out of 288 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 288/288 places, 239/239 transitions.
Graph (complete) has 525 edges and 288 vertex of which 277 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 277 transition count 224
Reduce places removed 9 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 268 transition count 221
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 26 place count 265 transition count 221
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 26 place count 265 transition count 216
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 36 place count 260 transition count 216
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 49 place count 247 transition count 203
Iterating global reduction 3 with 13 rules applied. Total rules applied 62 place count 247 transition count 203
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 71 place count 238 transition count 194
Iterating global reduction 3 with 9 rules applied. Total rules applied 80 place count 238 transition count 194
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 88 place count 238 transition count 186
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 166 place count 199 transition count 147
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 167 place count 199 transition count 146
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 171 place count 199 transition count 142
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 175 place count 195 transition count 142
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 177 place count 195 transition count 142
Applied a total of 177 rules in 88 ms. Remains 195 /288 variables (removed 93) and now considering 142/239 (removed 97) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 195/288 places, 142/239 transitions.
Incomplete random walk after 10000 steps, including 140 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 763259 steps, run timeout after 3001 ms. (steps per millisecond=254 ) properties seen :{}
Probabilistic random walk after 763259 steps, saw 126303 distinct states, run finished after 3007 ms. (steps per millisecond=253 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 142 rows 195 cols
[2023-03-09 13:10:12] [INFO ] Computed 60 place invariants in 12 ms
[2023-03-09 13:10:12] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 13:10:12] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2023-03-09 13:10:12] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 6 ms returned sat
[2023-03-09 13:10:12] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 13:10:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 13:10:12] [INFO ] After 125ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-09 13:10:12] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2023-03-09 13:10:12] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2023-03-09 13:10:12] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2023-03-09 13:10:12] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2023-03-09 13:10:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 200 ms
[2023-03-09 13:10:12] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2023-03-09 13:10:12] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2023-03-09 13:10:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 104 ms
[2023-03-09 13:10:13] [INFO ] After 556ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 113 ms.
[2023-03-09 13:10:13] [INFO ] After 908ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA DES-PT-02b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 43 ms.
Support contains 57 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 142/142 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 195 transition count 140
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 194 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 193 transition count 139
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 5 place count 193 transition count 138
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 192 transition count 138
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 8 place count 191 transition count 137
Iterating global reduction 3 with 1 rules applied. Total rules applied 9 place count 191 transition count 137
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 31 place count 180 transition count 126
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 32 place count 179 transition count 125
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 179 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 34 place count 179 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 36 place count 178 transition count 124
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 38 place count 178 transition count 122
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 41 place count 176 transition count 121
Applied a total of 41 rules in 39 ms. Remains 176 /195 variables (removed 19) and now considering 121/142 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 176/195 places, 121/142 transitions.
Incomplete random walk after 10000 steps, including 170 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 3) seen :1
FORMULA DES-PT-02b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :1
FORMULA DES-PT-02b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 121 rows 176 cols
[2023-03-09 13:10:13] [INFO ] Computed 61 place invariants in 11 ms
[2023-03-09 13:10:13] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 13:10:13] [INFO ] [Nat]Absence check using 36 positive place invariants in 9 ms returned sat
[2023-03-09 13:10:13] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 5 ms returned sat
[2023-03-09 13:10:13] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 13:10:13] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 13:10:13] [INFO ] After 33ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 13:10:13] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2023-03-09 13:10:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-09 13:10:13] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-09 13:10:13] [INFO ] After 286ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 20 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 121/121 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 176 transition count 117
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 172 transition count 117
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 8 place count 172 transition count 114
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 169 transition count 114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 168 transition count 113
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 168 transition count 113
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 46 place count 153 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 152 transition count 100
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 152 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 151 transition count 99
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 151 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 52 place count 150 transition count 98
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 54 place count 150 transition count 98
Applied a total of 54 rules in 32 ms. Remains 150 /176 variables (removed 26) and now considering 98/121 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 150/176 places, 98/121 transitions.
Incomplete random walk after 10000 steps, including 187 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1811278 steps, run timeout after 3001 ms. (steps per millisecond=603 ) properties seen :{}
Probabilistic random walk after 1811278 steps, saw 257367 distinct states, run finished after 3001 ms. (steps per millisecond=603 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 98 rows 150 cols
[2023-03-09 13:10:16] [INFO ] Computed 61 place invariants in 3 ms
[2023-03-09 13:10:16] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 13:10:16] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 13:10:16] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 5 ms returned sat
[2023-03-09 13:10:17] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 13:10:17] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-09 13:10:17] [INFO ] After 30ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 13:10:17] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2023-03-09 13:10:17] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2023-03-09 13:10:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 92 ms
[2023-03-09 13:10:17] [INFO ] After 148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-09 13:10:17] [INFO ] After 298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 20 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 98/98 transitions.
Applied a total of 0 rules in 6 ms. Remains 150 /150 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 150/150 places, 98/98 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 98/98 transitions.
Applied a total of 0 rules in 4 ms. Remains 150 /150 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-09 13:10:17] [INFO ] Invariant cache hit.
[2023-03-09 13:10:17] [INFO ] Implicit Places using invariants in 77 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 79 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 149/150 places, 98/98 transitions.
Applied a total of 0 rules in 4 ms. Remains 149 /149 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 87 ms. Remains : 149/150 places, 98/98 transitions.
Incomplete random walk after 10000 steps, including 183 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1954445 steps, run timeout after 3001 ms. (steps per millisecond=651 ) properties seen :{}
Probabilistic random walk after 1954445 steps, saw 275359 distinct states, run finished after 3001 ms. (steps per millisecond=651 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 98 rows 149 cols
[2023-03-09 13:10:20] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-09 13:10:20] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 13:10:20] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 13:10:20] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 5 ms returned sat
[2023-03-09 13:10:20] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 13:10:20] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-09 13:10:20] [INFO ] After 26ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 13:10:20] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2023-03-09 13:10:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-09 13:10:20] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-09 13:10:20] [INFO ] After 258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 20 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 98/98 transitions.
Applied a total of 0 rules in 6 ms. Remains 149 /149 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 149/149 places, 98/98 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 98/98 transitions.
Applied a total of 0 rules in 5 ms. Remains 149 /149 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-09 13:10:20] [INFO ] Invariant cache hit.
[2023-03-09 13:10:20] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-09 13:10:20] [INFO ] Invariant cache hit.
[2023-03-09 13:10:20] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-09 13:10:20] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2023-03-09 13:10:20] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 13:10:20] [INFO ] Invariant cache hit.
[2023-03-09 13:10:21] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 305 ms. Remains : 149/149 places, 98/98 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 98
Applied a total of 1 rules in 7 ms. Remains 149 /149 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 98 rows 149 cols
[2023-03-09 13:10:21] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-09 13:10:21] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 13:10:21] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 13:10:21] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-09 13:10:21] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 13:10:21] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-09 13:10:21] [INFO ] After 200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-09 13:10:21] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-09 13:10:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 149 places, 98 transitions and 460 arcs took 3 ms.
[2023-03-09 13:10:21] [INFO ] Flatten gal took : 51 ms
Total runtime 17066 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DES (PT), instance 02b
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: 149 places, 98 transitions, 460 arcs.
Final Score: 1555.926
Took : 3 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678367426966

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 714:
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="DES-PT-02b"
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 DES-PT-02b, 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 r107-tall-167814484100391"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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