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.r105-tall-167814481200454.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 ltsminxred
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 r105-tall-167814481200454
=====================================================================

--------------------
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 1678303104922

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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-30b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 19:18:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 19:18:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 19:18:26] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2023-03-08 19:18:26] [INFO ] Transformed 399 places.
[2023-03-08 19:18:26] [INFO ] Transformed 350 transitions.
[2023-03-08 19:18:26] [INFO ] Found NUPN structural information;
[2023-03-08 19:18:26] [INFO ] Parsed PT model containing 399 places and 350 transitions and 1143 arcs in 129 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 86 resets, run finished after 408 ms. (steps per millisecond=24 ) 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 10 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 350 rows 399 cols
[2023-03-08 19:18:27] [INFO ] Computed 65 place invariants in 23 ms
[2023-03-08 19:18:27] [INFO ] After 401ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-08 19:18:27] [INFO ] [Nat]Absence check using 39 positive place invariants in 14 ms returned sat
[2023-03-08 19:18:27] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 22 ms returned sat
[2023-03-08 19:18:30] [INFO ] After 1229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-08 19:18:30] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 5 ms to minimize.
[2023-03-08 19:18:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2023-03-08 19:18:30] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 0 ms to minimize.
[2023-03-08 19:18:30] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 1 ms to minimize.
[2023-03-08 19:18:30] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 1 ms to minimize.
[2023-03-08 19:18:30] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 0 ms to minimize.
[2023-03-08 19:18:31] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 0 ms to minimize.
[2023-03-08 19:18:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 623 ms
[2023-03-08 19:18:31] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 0 ms to minimize.
[2023-03-08 19:18:31] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2023-03-08 19:18:31] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2023-03-08 19:18:31] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 0 ms to minimize.
[2023-03-08 19:18:31] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2023-03-08 19:18:31] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2023-03-08 19:18:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 579 ms
[2023-03-08 19:18:32] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2023-03-08 19:18:32] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2023-03-08 19:18:32] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2023-03-08 19:18:32] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 0 ms to minimize.
[2023-03-08 19:18:32] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 0 ms to minimize.
[2023-03-08 19:18:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 699 ms
[2023-03-08 19:18:33] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 0 ms to minimize.
[2023-03-08 19:18:33] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 0 ms to minimize.
[2023-03-08 19:18:33] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 0 ms to minimize.
[2023-03-08 19:18:33] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 1 ms to minimize.
[2023-03-08 19:18:33] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2023-03-08 19:18:33] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 0 ms to minimize.
[2023-03-08 19:18:33] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
[2023-03-08 19:18:33] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 0 ms to minimize.
[2023-03-08 19:18:33] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 908 ms
[2023-03-08 19:18:33] [INFO ] After 5027ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 682 ms.
[2023-03-08 19:18:34] [INFO ] After 6913ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 575 ms.
Support contains 59 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 389 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 389 transition count 335
Reduce places removed 10 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 13 rules applied. Total rules applied 25 place count 379 transition count 332
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 28 place count 376 transition count 332
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 28 place count 376 transition count 326
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 40 place count 370 transition count 326
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 56 place count 354 transition count 310
Iterating global reduction 3 with 16 rules applied. Total rules applied 72 place count 354 transition count 310
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 82 place count 344 transition count 300
Iterating global reduction 3 with 10 rules applied. Total rules applied 92 place count 344 transition count 300
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 9 rules applied. Total rules applied 101 place count 344 transition count 291
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 102 place count 343 transition count 291
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 5 with 100 rules applied. Total rules applied 202 place count 293 transition count 241
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 210 place count 289 transition count 243
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 211 place count 289 transition count 242
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 215 place count 289 transition count 238
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 219 place count 285 transition count 238
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 221 place count 285 transition count 236
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 223 place count 283 transition count 236
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 226 place count 283 transition count 236
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 227 place count 282 transition count 235
Applied a total of 227 rules in 165 ms. Remains 282 /399 variables (removed 117) and now considering 235/350 (removed 115) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 282/399 places, 235/350 transitions.
Incomplete random walk after 10000 steps, including 162 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :1
FORMULA DES-PT-30b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 235 rows 282 cols
[2023-03-08 19:18:35] [INFO ] Computed 60 place invariants in 23 ms
[2023-03-08 19:18:35] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 19:18:35] [INFO ] [Nat]Absence check using 34 positive place invariants in 12 ms returned sat
[2023-03-08 19:18:35] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 13 ms returned sat
[2023-03-08 19:18:36] [INFO ] After 288ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 19:18:36] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2023-03-08 19:18:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-08 19:18:36] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
[2023-03-08 19:18:36] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2023-03-08 19:18:36] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2023-03-08 19:18:36] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2023-03-08 19:18:36] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2023-03-08 19:18:36] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2023-03-08 19:18:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 337 ms
[2023-03-08 19:18:36] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2023-03-08 19:18:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-08 19:18:36] [INFO ] After 1019ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 174 ms.
[2023-03-08 19:18:37] [INFO ] After 1342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 128 ms.
Support contains 41 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 235/235 transitions.
Graph (complete) has 782 edges and 282 vertex of which 281 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 281 transition count 231
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 279 transition count 231
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 279 transition count 230
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 8 place count 278 transition count 230
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 276 transition count 228
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 276 transition count 228
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 275 transition count 227
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 275 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 275 transition count 226
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 30 place count 267 transition count 219
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 267 transition count 218
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 34 place count 266 transition count 216
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 36 place count 264 transition count 214
Applied a total of 36 rules in 56 ms. Remains 264 /282 variables (removed 18) and now considering 214/235 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 264/282 places, 214/235 transitions.
Incomplete random walk after 10000 steps, including 203 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 880819 steps, run timeout after 3001 ms. (steps per millisecond=293 ) properties seen :{}
Probabilistic random walk after 880819 steps, saw 129365 distinct states, run finished after 3002 ms. (steps per millisecond=293 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 214 rows 264 cols
[2023-03-08 19:18:40] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 19:18:40] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 19:18:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 13 ms returned sat
[2023-03-08 19:18:40] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 85 ms returned sat
[2023-03-08 19:18:41] [INFO ] After 284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 19:18:41] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2023-03-08 19:18:41] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2023-03-08 19:18:41] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2023-03-08 19:18:41] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2023-03-08 19:18:41] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2023-03-08 19:18:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 315 ms
[2023-03-08 19:18:41] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2023-03-08 19:18:41] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2023-03-08 19:18:41] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-08 19:18:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 136 ms
[2023-03-08 19:18:41] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2023-03-08 19:18:41] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2023-03-08 19:18:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 115 ms
[2023-03-08 19:18:42] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 0 ms to minimize.
[2023-03-08 19:18:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-03-08 19:18:42] [INFO ] After 1172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 194 ms.
[2023-03-08 19:18:42] [INFO ] After 1597ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 109 ms.
Support contains 41 out of 264 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 214/214 transitions.
Applied a total of 0 rules in 9 ms. Remains 264 /264 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 264/264 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 214/214 transitions.
Applied a total of 0 rules in 8 ms. Remains 264 /264 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-08 19:18:42] [INFO ] Invariant cache hit.
[2023-03-08 19:18:42] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-08 19:18:42] [INFO ] Invariant cache hit.
[2023-03-08 19:18:42] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2023-03-08 19:18:42] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-08 19:18:42] [INFO ] Invariant cache hit.
[2023-03-08 19:18:42] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 536 ms. Remains : 264/264 places, 214/214 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 264 transition count 214
Applied a total of 1 rules in 18 ms. Remains 264 /264 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 214 rows 264 cols
[2023-03-08 19:18:42] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-08 19:18:42] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 19:18:43] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 19:18:43] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 91 ms returned sat
[2023-03-08 19:18:43] [INFO ] After 278ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 19:18:43] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2023-03-08 19:18:43] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2023-03-08 19:18:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 161 ms
[2023-03-08 19:18:43] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 0 ms to minimize.
[2023-03-08 19:18:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-08 19:18:43] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2023-03-08 19:18:43] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2023-03-08 19:18:43] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2023-03-08 19:18:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 154 ms
[2023-03-08 19:18:44] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2023-03-08 19:18:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-03-08 19:18:44] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2023-03-08 19:18:44] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 0 ms to minimize.
[2023-03-08 19:18:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 158 ms
[2023-03-08 19:18:44] [INFO ] After 1072ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 210 ms.
[2023-03-08 19:18:44] [INFO ] After 1514ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-08 19:18:44] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2023-03-08 19:18:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 264 places, 214 transitions and 936 arcs took 2 ms.
[2023-03-08 19:18:44] [INFO ] Flatten gal took : 49 ms
Total runtime 18360 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/659/inv_0_ --invariant=/tmp/659/inv_1_ --invariant=/tmp/659/inv_2_ --invariant=/tmp/659/inv_3_ --invariant=/tmp/659/inv_4_ --inv-par
FORMULA DES-PT-30b-ReachabilityCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-30b-ReachabilityCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-30b-ReachabilityCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-30b-ReachabilityCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-30b-ReachabilityCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678303209088

--------------------
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
mcc2023
rfs formula name DES-PT-30b-ReachabilityCardinality-07
rfs formula type AG
rfs formula formula --invariant=/tmp/659/inv_0_
rfs formula name DES-PT-30b-ReachabilityCardinality-11
rfs formula type AG
rfs formula formula --invariant=/tmp/659/inv_1_
rfs formula name DES-PT-30b-ReachabilityCardinality-12
rfs formula type AG
rfs formula formula --invariant=/tmp/659/inv_2_
rfs formula name DES-PT-30b-ReachabilityCardinality-13
rfs formula type EF
rfs formula formula --invariant=/tmp/659/inv_3_
rfs formula name DES-PT-30b-ReachabilityCardinality-15
rfs formula type EF
rfs formula formula --invariant=/tmp/659/inv_4_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 264 places, 214 transitions and 936 arcs
pnml2lts-sym: Petri net DES_PT_30b analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 214->211 groups
pnml2lts-sym: Regrouping took 0.030 real 0.040 user 0.000 sys
pnml2lts-sym: state vector length is 264; there are 211 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/659/inv_2_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/659/inv_3_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/659/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/659/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 14021114 group checks and 0 next state calls
pnml2lts-sym: reachability took 82.880 real 325.230 user 6.020 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.280 real 1.110 user 0.000 sys
pnml2lts-sym: state space has 2.34372340513729e+15 states, 4207086 nodes
pnml2lts-sym: group_next: 2155 nodes total
pnml2lts-sym: group_explored: 2512 nodes, 3828 short vectors total
pnml2lts-sym: max token count: 1

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="ltsminxred"
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 ltsminxred"
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 r105-tall-167814481200454"
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 ;