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-167814481200455.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481200455
=====================================================================

--------------------
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-ReachabilityFireability-00
FORMULA_NAME DES-PT-30b-ReachabilityFireability-01
FORMULA_NAME DES-PT-30b-ReachabilityFireability-02
FORMULA_NAME DES-PT-30b-ReachabilityFireability-03
FORMULA_NAME DES-PT-30b-ReachabilityFireability-04
FORMULA_NAME DES-PT-30b-ReachabilityFireability-05
FORMULA_NAME DES-PT-30b-ReachabilityFireability-06
FORMULA_NAME DES-PT-30b-ReachabilityFireability-07
FORMULA_NAME DES-PT-30b-ReachabilityFireability-08
FORMULA_NAME DES-PT-30b-ReachabilityFireability-09
FORMULA_NAME DES-PT-30b-ReachabilityFireability-10
FORMULA_NAME DES-PT-30b-ReachabilityFireability-11
FORMULA_NAME DES-PT-30b-ReachabilityFireability-12
FORMULA_NAME DES-PT-30b-ReachabilityFireability-13
FORMULA_NAME DES-PT-30b-ReachabilityFireability-14
FORMULA_NAME DES-PT-30b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678303216871

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=ReachabilityFireability
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:20:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 19:20:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 19:20:18] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2023-03-08 19:20:18] [INFO ] Transformed 399 places.
[2023-03-08 19:20:18] [INFO ] Transformed 350 transitions.
[2023-03-08 19:20:18] [INFO ] Found NUPN structural information;
[2023-03-08 19:20:18] [INFO ] Parsed PT model containing 399 places and 350 transitions and 1143 arcs in 130 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 89 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 16) seen :7
FORMULA DES-PT-30b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 350 rows 399 cols
[2023-03-08 19:20:19] [INFO ] Computed 65 place invariants in 30 ms
[2023-03-08 19:20:19] [INFO ] After 301ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-08 19:20:20] [INFO ] [Nat]Absence check using 39 positive place invariants in 13 ms returned sat
[2023-03-08 19:20:20] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 22 ms returned sat
[2023-03-08 19:20:22] [INFO ] After 1470ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-08 19:20:22] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 9 ms to minimize.
[2023-03-08 19:20:23] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 0 ms to minimize.
[2023-03-08 19:20:23] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 1 ms to minimize.
[2023-03-08 19:20:23] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 1 ms to minimize.
[2023-03-08 19:20:23] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 1 ms to minimize.
[2023-03-08 19:20:24] [INFO ] Deduced a trap composed of 35 places in 192 ms of which 1 ms to minimize.
[2023-03-08 19:20:24] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 0 ms to minimize.
[2023-03-08 19:20:24] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1542 ms
[2023-03-08 19:20:25] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 0 ms to minimize.
[2023-03-08 19:20:25] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2023-03-08 19:20:25] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 0 ms to minimize.
[2023-03-08 19:20:25] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2023-03-08 19:20:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 495 ms
[2023-03-08 19:20:25] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 0 ms to minimize.
[2023-03-08 19:20:25] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2023-03-08 19:20:25] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2023-03-08 19:20:25] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 0 ms to minimize.
[2023-03-08 19:20:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 439 ms
[2023-03-08 19:20:26] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 0 ms to minimize.
[2023-03-08 19:20:26] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2023-03-08 19:20:26] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2023-03-08 19:20:26] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2023-03-08 19:20:26] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 0 ms to minimize.
[2023-03-08 19:20:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 491 ms
[2023-03-08 19:20:27] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 0 ms to minimize.
[2023-03-08 19:20:27] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 0 ms to minimize.
[2023-03-08 19:20:27] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2023-03-08 19:20:27] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2023-03-08 19:20:27] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 0 ms to minimize.
[2023-03-08 19:20:28] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2023-03-08 19:20:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1131 ms
[2023-03-08 19:20:28] [INFO ] After 7107ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 1254 ms.
[2023-03-08 19:20:29] [INFO ] After 9471ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
FORMULA DES-PT-30b-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 989 ms.
Support contains 82 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 390 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 390 transition count 339
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 383 transition count 337
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 381 transition count 337
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 20 place count 381 transition count 324
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 46 place count 368 transition count 324
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 61 place count 353 transition count 309
Iterating global reduction 3 with 15 rules applied. Total rules applied 76 place count 353 transition count 309
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 86 place count 343 transition count 299
Iterating global reduction 3 with 10 rules applied. Total rules applied 96 place count 343 transition count 299
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 104 place count 343 transition count 291
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 186 place count 302 transition count 250
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 188 place count 302 transition count 248
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 190 place count 300 transition count 248
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 192 place count 300 transition count 248
Applied a total of 192 rules in 126 ms. Remains 300 /399 variables (removed 99) and now considering 248/350 (removed 102) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 300/399 places, 248/350 transitions.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 587147 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :{}
Probabilistic random walk after 587147 steps, saw 104385 distinct states, run finished after 3002 ms. (steps per millisecond=195 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 248 rows 300 cols
[2023-03-08 19:20:34] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-08 19:20:34] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-08 19:20:34] [INFO ] [Nat]Absence check using 33 positive place invariants in 13 ms returned sat
[2023-03-08 19:20:34] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 113 ms returned sat
[2023-03-08 19:20:35] [INFO ] After 598ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-08 19:20:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 19:20:35] [INFO ] After 428ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-08 19:20:35] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2023-03-08 19:20:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-08 19:20:35] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2023-03-08 19:20:36] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2023-03-08 19:20:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 172 ms
[2023-03-08 19:20:36] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2023-03-08 19:20:36] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2023-03-08 19:20:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 116 ms
[2023-03-08 19:20:36] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 0 ms to minimize.
[2023-03-08 19:20:36] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2023-03-08 19:20:36] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 5 ms to minimize.
[2023-03-08 19:20:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 176 ms
[2023-03-08 19:20:36] [INFO ] After 1499ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 553 ms.
[2023-03-08 19:20:37] [INFO ] After 2945ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 281 ms.
Support contains 82 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 248/248 transitions.
Applied a total of 0 rules in 12 ms. Remains 300 /300 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 300/300 places, 248/248 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 248/248 transitions.
Applied a total of 0 rules in 11 ms. Remains 300 /300 variables (removed 0) and now considering 248/248 (removed 0) transitions.
[2023-03-08 19:20:37] [INFO ] Invariant cache hit.
[2023-03-08 19:20:37] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-08 19:20:37] [INFO ] Invariant cache hit.
[2023-03-08 19:20:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 19:20:37] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2023-03-08 19:20:37] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-08 19:20:37] [INFO ] Invariant cache hit.
[2023-03-08 19:20:38] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 584 ms. Remains : 300/300 places, 248/248 transitions.
Graph (complete) has 770 edges and 300 vertex of which 299 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 299 /300 variables (removed 1) and now considering 248/248 (removed 0) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 248 rows 299 cols
[2023-03-08 19:20:38] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-08 19:20:38] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-08 19:20:38] [INFO ] [Nat]Absence check using 32 positive place invariants in 5 ms returned sat
[2023-03-08 19:20:38] [INFO ] [Nat]Absence check using 32 positive and 27 generalized place invariants in 15 ms returned sat
[2023-03-08 19:20:39] [INFO ] After 688ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-08 19:20:39] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2023-03-08 19:20:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-03-08 19:20:39] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
[2023-03-08 19:20:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-08 19:20:39] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2023-03-08 19:20:39] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2023-03-08 19:20:39] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 0 ms to minimize.
[2023-03-08 19:20:40] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2023-03-08 19:20:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 272 ms
[2023-03-08 19:20:40] [INFO ] After 1726ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 521 ms.
[2023-03-08 19:20:40] [INFO ] After 2498ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2023-03-08 19:20:40] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-08 19:20:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 300 places, 248 transitions and 959 arcs took 2 ms.
[2023-03-08 19:20:40] [INFO ] Flatten gal took : 65 ms
Total runtime 22694 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 --inv-bin-par --invariant=/tmp/610/inv_0_ --invariant=/tmp/610/inv_1_ --invariant=/tmp/610/inv_2_ --invariant=/tmp/610/inv_3_ --invariant=/tmp/610/inv_4_ --invariant=/tmp/610/inv_5_ --invariant=/tmp/610/inv_6_ --invariant=/tmp/610/inv_7_ --inv-par
FORMULA DES-PT-30b-ReachabilityFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-30b-ReachabilityFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-30b-ReachabilityFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-30b-ReachabilityFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-30b-ReachabilityFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-30b-ReachabilityFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-30b-ReachabilityFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-30b-ReachabilityFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678303821910

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name DES-PT-30b-ReachabilityFireability-01
rfs formula type EF
rfs formula formula --invariant=/tmp/610/inv_0_
rfs formula name DES-PT-30b-ReachabilityFireability-05
rfs formula type EF
rfs formula formula --invariant=/tmp/610/inv_1_
rfs formula name DES-PT-30b-ReachabilityFireability-06
rfs formula type EF
rfs formula formula --invariant=/tmp/610/inv_2_
rfs formula name DES-PT-30b-ReachabilityFireability-08
rfs formula type AG
rfs formula formula --invariant=/tmp/610/inv_3_
rfs formula name DES-PT-30b-ReachabilityFireability-09
rfs formula type AG
rfs formula formula --invariant=/tmp/610/inv_4_
rfs formula name DES-PT-30b-ReachabilityFireability-10
rfs formula type EF
rfs formula formula --invariant=/tmp/610/inv_5_
rfs formula name DES-PT-30b-ReachabilityFireability-11
rfs formula type AG
rfs formula formula --invariant=/tmp/610/inv_6_
rfs formula name DES-PT-30b-ReachabilityFireability-13
rfs formula type EF
rfs formula formula --invariant=/tmp/610/inv_7_
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 300 places, 248 transitions and 959 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: 248->242 groups
pnml2lts-sym: Regrouping took 0.040 real 0.040 user 0.000 sys
pnml2lts-sym: state vector length is 300; there are 242 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/610/inv_4_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/610/inv_7_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/610/inv_6_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/610/inv_5_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/610/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/610/inv_3_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/610/inv_2_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/610/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 578.740 real 2305.440 user 7.290 sys
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="ReachabilityFireability"
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 ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r105-tall-167814481200455"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;