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-167814484200454.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-30b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-tall-167814484200454
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.1K Feb 26 15:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 15:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 15:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 15:40 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.8K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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 12K Feb 26 15:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 26 15:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 15:41 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 103K 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-30b-ReachabilityCardinality-00
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-01
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-02
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-03
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-04
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-05
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-06
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-07
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-08
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-09
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-10
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-11
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-12
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-13
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-14
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678372610980

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=DES-PT-30b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 14:36:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 14:36:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 14:36:52] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-03-09 14:36:52] [INFO ] Transformed 399 places.
[2023-03-09 14:36:52] [INFO ] Transformed 350 transitions.
[2023-03-09 14:36:52] [INFO ] Found NUPN structural information;
[2023-03-09 14:36:52] [INFO ] Parsed PT model containing 399 places and 350 transitions and 1143 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-30b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 82 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 14) seen :8
FORMULA DES-PT-30b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 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 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 350 rows 399 cols
[2023-03-09 14:36:53] [INFO ] Computed 65 place invariants in 36 ms
[2023-03-09 14:36:53] [INFO ] After 299ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 14:36:53] [INFO ] [Nat]Absence check using 39 positive place invariants in 16 ms returned sat
[2023-03-09 14:36:53] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 21 ms returned sat
[2023-03-09 14:36:56] [INFO ] After 1286ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 14:36:56] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 4 ms to minimize.
[2023-03-09 14:36:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2023-03-09 14:36:56] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2023-03-09 14:36:56] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
[2023-03-09 14:36:56] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 2 ms to minimize.
[2023-03-09 14:36:57] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 1 ms to minimize.
[2023-03-09 14:36:57] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 1 ms to minimize.
[2023-03-09 14:36:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 655 ms
[2023-03-09 14:36:57] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 1 ms to minimize.
[2023-03-09 14:36:57] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 0 ms to minimize.
[2023-03-09 14:36:57] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2023-03-09 14:36:57] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2023-03-09 14:36:57] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 0 ms to minimize.
[2023-03-09 14:36:57] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2023-03-09 14:36:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 563 ms
[2023-03-09 14:36:58] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 0 ms to minimize.
[2023-03-09 14:36:58] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2023-03-09 14:36:58] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2023-03-09 14:36:58] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2023-03-09 14:36:58] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2023-03-09 14:36:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 738 ms
[2023-03-09 14:36:59] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 1 ms to minimize.
[2023-03-09 14:36:59] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 0 ms to minimize.
[2023-03-09 14:36:59] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 1 ms to minimize.
[2023-03-09 14:36:59] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 0 ms to minimize.
[2023-03-09 14:36:59] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2023-03-09 14:36:59] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2023-03-09 14:36:59] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2023-03-09 14:36:59] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 0 ms to minimize.
[2023-03-09 14:36:59] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 862 ms
[2023-03-09 14:36:59] [INFO ] After 5104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 671 ms.
[2023-03-09 14:37:00] [INFO ] After 6981ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA DES-PT-30b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 497 ms.
Support contains 41 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 350/350 transitions.
Graph (complete) has 858 edges and 399 vertex of which 388 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 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 388 transition count 330
Reduce places removed 13 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 375 transition count 327
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 35 place count 372 transition count 327
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 35 place count 372 transition count 319
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 51 place count 364 transition count 319
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 69 place count 346 transition count 301
Iterating global reduction 3 with 18 rules applied. Total rules applied 87 place count 346 transition count 301
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 99 place count 334 transition count 289
Iterating global reduction 3 with 12 rules applied. Total rules applied 111 place count 334 transition count 289
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 3 with 11 rules applied. Total rules applied 122 place count 334 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 123 place count 333 transition count 278
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 5 with 114 rules applied. Total rules applied 237 place count 276 transition count 221
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 247 place count 271 transition count 231
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 248 place count 271 transition count 230
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 250 place count 271 transition count 228
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 252 place count 269 transition count 228
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 254 place count 269 transition count 226
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 256 place count 267 transition count 226
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 259 place count 267 transition count 226
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 260 place count 266 transition count 225
Applied a total of 260 rules in 171 ms. Remains 266 /399 variables (removed 133) and now considering 225/350 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 266/399 places, 225/350 transitions.
Incomplete random walk after 10000 steps, including 209 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 752734 steps, run timeout after 3001 ms. (steps per millisecond=250 ) properties seen :{}
Probabilistic random walk after 752734 steps, saw 126784 distinct states, run finished after 3002 ms. (steps per millisecond=250 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 225 rows 266 cols
[2023-03-09 14:37:04] [INFO ] Computed 61 place invariants in 8 ms
[2023-03-09 14:37:04] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 14:37:04] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-09 14:37:04] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 94 ms returned sat
[2023-03-09 14:37:05] [INFO ] After 322ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-09 14:37:05] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:37:05] [INFO ] After 194ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-09 14:37:05] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2023-03-09 14:37:05] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2023-03-09 14:37:05] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2023-03-09 14:37:05] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2023-03-09 14:37:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 203 ms
[2023-03-09 14:37:05] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2023-03-09 14:37:05] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2023-03-09 14:37:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 155 ms
[2023-03-09 14:37:06] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2023-03-09 14:37:06] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2023-03-09 14:37:06] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2023-03-09 14:37:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 223 ms
[2023-03-09 14:37:06] [INFO ] After 993ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 267 ms.
[2023-03-09 14:37:06] [INFO ] After 1791ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 153 ms.
Support contains 41 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 225/225 transitions.
Applied a total of 0 rules in 9 ms. Remains 266 /266 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 266/266 places, 225/225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 225/225 transitions.
Applied a total of 0 rules in 10 ms. Remains 266 /266 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2023-03-09 14:37:06] [INFO ] Invariant cache hit.
[2023-03-09 14:37:06] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-09 14:37:06] [INFO ] Invariant cache hit.
[2023-03-09 14:37:06] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:37:07] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
[2023-03-09 14:37:07] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-09 14:37:07] [INFO ] Invariant cache hit.
[2023-03-09 14:37:07] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 644 ms. Remains : 266/266 places, 225/225 transitions.
Graph (complete) has 793 edges and 266 vertex of which 265 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 265 transition count 225
Applied a total of 2 rules in 14 ms. Remains 265 /266 variables (removed 1) and now considering 225/225 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 225 rows 265 cols
[2023-03-09 14:37:07] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-09 14:37:07] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 14:37:07] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 14:37:07] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-09 14:37:07] [INFO ] After 342ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-09 14:37:08] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2023-03-09 14:37:08] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2023-03-09 14:37:08] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2023-03-09 14:37:08] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2023-03-09 14:37:08] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2023-03-09 14:37:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 300 ms
[2023-03-09 14:37:08] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 0 ms to minimize.
[2023-03-09 14:37:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-09 14:37:08] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2023-03-09 14:37:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-09 14:37:08] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2023-03-09 14:37:08] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 0 ms to minimize.
[2023-03-09 14:37:08] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2023-03-09 14:37:08] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
[2023-03-09 14:37:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 279 ms
[2023-03-09 14:37:08] [INFO ] After 1311ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 270 ms.
[2023-03-09 14:37:09] [INFO ] After 1769ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-09 14:37:09] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-09 14:37:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 266 places, 225 transitions and 1086 arcs took 2 ms.
[2023-03-09 14:37:09] [INFO ] Flatten gal took : 51 ms
Total runtime 16961 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DES (PT), instance 30b
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: 266 places, 225 transitions, 1086 arcs.
Final Score: 3321.458
Took : 12 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: DES-PT-30b-ReachabilityCardinality-07 (reachable &!potential( ( ( ( ( ( (tk(P35)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P35)) ) ) | ( ( ( (tk(P72)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P72)) ) ) | ( ( (tk(P182)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P182)) ) ) ) ) & ( ( ( ( (tk(P123)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P123)) ) ) | ( ( (tk(P255)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P255)) ) ) ) | ( ( ( (tk(P96)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P96)) ) ) | ( ( ( ( (tk(P248)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P248)) ) ) | ( ( (tk(P214)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P214)) ) ) ) & ( ( ( (tk(P31)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P31)) ) ) | ( ( ( (tk(P21)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P21)) ) ) & ( ( (tk(P51)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P51)) ) ) ) ) ) ) ) ) | ( ( ( ( (tk(P64)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P64)) ) ) | ( ( (tk(P40)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P40)) ) ) ) & ( ( ( ( (tk(P136)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P136)) ) ) & ( ( ( ( (tk(P142)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P142)) ) ) | ( ( ( (tk(P77)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P77)) ) ) & ( ( ( (tk(P147)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P147)) ) ) | ( ( (tk(P110)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P110)) ) ) ) ) ) & ( ( ( (tk(P226)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P226)) ) ) | ( ( ( (tk(P6)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P6)) ) ) & ( ( ( (tk(P29)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P29)) ) ) & ( ( (tk(P84)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P84)) ) ) ) ) ) ) ) | ( ( ( (tk(P41)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P41)) ) ) & ( ( ( (tk(P169)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P169)) ) ) & ( ( ( (tk(P131)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P131)) ) ) | ( ( ( (tk(P129)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P129)) ) ) & ( ( (tk(P150)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P150)) ) ) ) ) ) ) ) ) )))
PROPERTY: DES-PT-30b-ReachabilityCardinality-11 (reachable &!potential( ( ( ( (tk(P17)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P17)) ) ) | ( ( (tk(P159)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P159)) ) ) )))
PROPERTY: DES-PT-30b-ReachabilityCardinality-12 (reachable &!potential( ( ( (tk(P27)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P27)) ) )))
PROPERTY: DES-PT-30b-ReachabilityCardinality-13 (reachable & potential(( ( (tk(P44)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P44)) ) )))
PROPERTY: DES-PT-30b-ReachabilityCardinality-15 (reachable & potential(( ( ( ( (tk(P180)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P180)) ) ) & ( ( (tk(P19)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P19)) ) ) ) & ( ( ( ( ( (tk(P150)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P150)) ) ) & ( ( (tk(P123)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P123)) ) ) ) | ( ( ( ( (tk(P108)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P108)) ) ) | ( ( (tk(P184)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P184)) ) ) ) & ( ( ( (tk(P133)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P133)) ) ) | ( ( (tk(P86)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P86)) ) ) ) ) ) & ( ( ( (tk(P34)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P34)) ) ) | ( ( ( (tk(P161)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P161)) ) ) & ( ( ( (tk(P246)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P246)) ) ) & ( ( (tk(P144)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P144)) ) ) ) ) ) ) )))
FORMULA DES-PT-30b-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DES-PT-30b-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DES-PT-30b-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DES-PT-30b-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DES-PT-30b-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678372806359

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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-30b"
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 DES-PT-30b, 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 r107-tall-167814484200454"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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