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-167814481300494.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-60a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481300494
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 8.8K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 15:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 15:41 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.4K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 15:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 15:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Feb 26 15:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 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 110K 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-60a-ReachabilityCardinality-00
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-01
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-02
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-03
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-04
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-05
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-06
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-07
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-08
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-09
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-10
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-11
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-12
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-13
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-14
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678312286035

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-60a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 21:51:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 21:51:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 21:51:27] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2023-03-08 21:51:27] [INFO ] Transformed 354 places.
[2023-03-08 21:51:27] [INFO ] Transformed 311 transitions.
[2023-03-08 21:51:27] [INFO ] Found NUPN structural information;
[2023-03-08 21:51:27] [INFO ] Parsed PT model containing 354 places and 311 transitions and 1496 arcs in 135 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-60a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 218 resets, run finished after 487 ms. (steps per millisecond=20 ) properties (out of 14) seen :4
FORMULA DES-PT-60a-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60a-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 297 rows 354 cols
[2023-03-08 21:51:28] [INFO ] Computed 59 place invariants in 39 ms
[2023-03-08 21:51:29] [INFO ] [Real]Absence check using 34 positive place invariants in 18 ms returned sat
[2023-03-08 21:51:29] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 25 ms returned sat
[2023-03-08 21:51:29] [INFO ] After 359ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-08 21:51:29] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 21:51:29] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 57 ms returned sat
[2023-03-08 21:51:35] [INFO ] After 4416ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :8
[2023-03-08 21:51:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 21:51:37] [INFO ] After 2195ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :2 sat :8
[2023-03-08 21:51:41] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 4 ms to minimize.
[2023-03-08 21:51:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2023-03-08 21:51:41] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2023-03-08 21:51:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-03-08 21:51:41] [INFO ] After 6744ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 7623 ms.
[2023-03-08 21:51:49] [INFO ] After 20211ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
FORMULA DES-PT-60a-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-60a-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 8 different solutions.
FORMULA DES-PT-60a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-60a-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 513 ms.
Support contains 23 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 297/297 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 354 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 353 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 353 transition count 294
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 353 transition count 294
Applied a total of 9 rules in 93 ms. Remains 353 /354 variables (removed 1) and now considering 294/297 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 353/354 places, 294/297 transitions.
Incomplete random walk after 10000 steps, including 163 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 830652 steps, run timeout after 3001 ms. (steps per millisecond=276 ) properties seen :{}
Probabilistic random walk after 830652 steps, saw 118349 distinct states, run finished after 3003 ms. (steps per millisecond=276 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 294 rows 353 cols
[2023-03-08 21:51:53] [INFO ] Computed 61 place invariants in 11 ms
[2023-03-08 21:51:53] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2023-03-08 21:51:53] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-08 21:51:53] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-08 21:51:53] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 21:51:53] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-08 21:51:54] [INFO ] After 600ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-08 21:51:54] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-08 21:51:54] [INFO ] After 291ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-08 21:51:55] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 2 ms to minimize.
[2023-03-08 21:51:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-03-08 21:51:55] [INFO ] After 744ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 366 ms.
[2023-03-08 21:51:55] [INFO ] After 1951ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA DES-PT-60a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 191 ms.
Support contains 17 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 294/294 transitions.
Applied a total of 0 rules in 16 ms. Remains 353 /353 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 353/353 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 294/294 transitions.
Applied a total of 0 rules in 15 ms. Remains 353 /353 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2023-03-08 21:51:55] [INFO ] Invariant cache hit.
[2023-03-08 21:51:56] [INFO ] Implicit Places using invariants in 228 ms returned [251]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 230 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 352/353 places, 294/294 transitions.
Applied a total of 0 rules in 15 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 261 ms. Remains : 352/353 places, 294/294 transitions.
Incomplete random walk after 10000 steps, including 157 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 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 31 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 747377 steps, run timeout after 3001 ms. (steps per millisecond=249 ) properties seen :{}
Probabilistic random walk after 747377 steps, saw 107291 distinct states, run finished after 3001 ms. (steps per millisecond=249 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 294 rows 352 cols
[2023-03-08 21:51:59] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-08 21:51:59] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 21:51:59] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 21:51:59] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 21:51:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 21:51:59] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 127 ms returned sat
[2023-03-08 21:52:00] [INFO ] After 459ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 21:52:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 21:52:00] [INFO ] After 269ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-08 21:52:00] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 0 ms to minimize.
[2023-03-08 21:52:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-08 21:52:00] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2023-03-08 21:52:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-03-08 21:52:01] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2023-03-08 21:52:01] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2023-03-08 21:52:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 159 ms
[2023-03-08 21:52:01] [INFO ] After 874ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 220 ms.
[2023-03-08 21:52:01] [INFO ] After 1902ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA DES-PT-60a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-60a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-60a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-60a-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 4 properties in 114 ms.
Support contains 4 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 22 ms. Remains 351 /352 variables (removed 1) and now considering 293/294 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 351/352 places, 293/294 transitions.
Incomplete random walk after 10000 steps, including 155 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1455732 steps, run timeout after 3001 ms. (steps per millisecond=485 ) properties seen :{}
Probabilistic random walk after 1455732 steps, saw 204263 distinct states, run finished after 3001 ms. (steps per millisecond=485 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-08 21:52:04] [INFO ] Computed 60 place invariants in 16 ms
[2023-03-08 21:52:04] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 21:52:04] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 21:52:04] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 21:52:04] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 21:52:04] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 64 ms returned sat
[2023-03-08 21:52:05] [INFO ] After 366ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 21:52:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 21:52:05] [INFO ] After 26ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 21:52:05] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-08 21:52:05] [INFO ] After 637ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1459 steps, including 2 resets, run visited all 1 properties in 6 ms. (steps per millisecond=243 )
FORMULA DES-PT-60a-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 6 ms.
All properties solved without resorting to model-checking.
Total runtime 37833 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/506/inv_0_ --invariant=/tmp/506/inv_1_ --invariant=/tmp/506/inv_2_ --invariant=/tmp/506/inv_3_ --invariant=/tmp/506/inv_4_ --invariant=/tmp/506/inv_5_ --invariant=/tmp/506/inv_6_ --invariant=/tmp/506/inv_7_ --invariant=/tmp/506/inv_8_ --invariant=/tmp/506/inv_9_ --invariant=/tmp/506/inv_10_ --invariant=/tmp/506/inv_11_ --invariant=/tmp/506/inv_12_ --invariant=/tmp/506/inv_13_ --invariant=/tmp/506/inv_14_ --invariant=/tmp/506/inv_15_ --inv-par
FORMULA DES-PT-60a-ReachabilityCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-60a-ReachabilityCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-60a-ReachabilityCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-60a-ReachabilityCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-60a-ReachabilityCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-60a-ReachabilityCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-60a-ReachabilityCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-60a-ReachabilityCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-60a-ReachabilityCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-60a-ReachabilityCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-60a-ReachabilityCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-60a-ReachabilityCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-60a-ReachabilityCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-60a-ReachabilityCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-60a-ReachabilityCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-60a-ReachabilityCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678312392360

--------------------
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-60a-ReachabilityCardinality-00
rfs formula type EF
rfs formula formula --invariant=/tmp/506/inv_0_
rfs formula name DES-PT-60a-ReachabilityCardinality-01
rfs formula type EF
rfs formula formula --invariant=/tmp/506/inv_1_
rfs formula name DES-PT-60a-ReachabilityCardinality-02
rfs formula type EF
rfs formula formula --invariant=/tmp/506/inv_2_
rfs formula name DES-PT-60a-ReachabilityCardinality-03
rfs formula type AG
rfs formula formula --invariant=/tmp/506/inv_3_
rfs formula name DES-PT-60a-ReachabilityCardinality-04
rfs formula type EF
rfs formula formula --invariant=/tmp/506/inv_4_
rfs formula name DES-PT-60a-ReachabilityCardinality-05
rfs formula type AG
rfs formula formula --invariant=/tmp/506/inv_5_
rfs formula name DES-PT-60a-ReachabilityCardinality-06
rfs formula type AG
rfs formula formula --invariant=/tmp/506/inv_6_
rfs formula name DES-PT-60a-ReachabilityCardinality-07
rfs formula type EF
rfs formula formula --invariant=/tmp/506/inv_7_
rfs formula name DES-PT-60a-ReachabilityCardinality-08
rfs formula type AG
rfs formula formula --invariant=/tmp/506/inv_8_
rfs formula name DES-PT-60a-ReachabilityCardinality-09
rfs formula type EF
rfs formula formula --invariant=/tmp/506/inv_9_
rfs formula name DES-PT-60a-ReachabilityCardinality-10
rfs formula type EF
rfs formula formula --invariant=/tmp/506/inv_10_
rfs formula name DES-PT-60a-ReachabilityCardinality-11
rfs formula type AG
rfs formula formula --invariant=/tmp/506/inv_11_
rfs formula name DES-PT-60a-ReachabilityCardinality-12
rfs formula type AG
rfs formula formula --invariant=/tmp/506/inv_12_
rfs formula name DES-PT-60a-ReachabilityCardinality-13
rfs formula type AG
rfs formula formula --invariant=/tmp/506/inv_13_
rfs formula name DES-PT-60a-ReachabilityCardinality-14
rfs formula type AG
rfs formula formula --invariant=/tmp/506/inv_14_
rfs formula name DES-PT-60a-ReachabilityCardinality-15
rfs formula type EF
rfs formula formula --invariant=/tmp/506/inv_15_
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 354 places, 311 transitions and 1496 arcs
pnml2lts-sym: Petri net DES-PT-60a analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.000 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: 311->293 groups
pnml2lts-sym: Regrouping took 0.070 real 0.080 user 0.000 sys
pnml2lts-sym: state vector length is 354; there are 293 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:
pnml2lts-sym: Invariant violation (/tmp/506/inv_5_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/506/inv_7_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/506/inv_9_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/506/inv_8_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/506/inv_14_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/506/inv_11_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/506/inv_13_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/506/inv_10_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/506/inv_12_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/506/inv_4_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/506/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/506/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 11474310 group checks and 0 next state calls
pnml2lts-sym: reachability took 65.380 real 258.690 user 2.540 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.070 real 0.290 user 0.000 sys
pnml2lts-sym: state space has 81839417852245 states, 822211 nodes
pnml2lts-sym: group_next: 2432 nodes total
pnml2lts-sym: group_explored: 1334 nodes, 2206 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-60a"
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-60a, 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-167814481300494"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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