Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r425-tajo-167905978000271.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldRVt-PT-010B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905978000271
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.2K Feb 25 22:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 22:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 22:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 22:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 25 22:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 22:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 22:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 119K Mar 5 18:23 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 ShieldRVt-PT-010B-ReachabilityFireability-00
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-01
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-02
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-03
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-04
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-05
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-06
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-07
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-08
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-09
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-10
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-11
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-12
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-13
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-14
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679306249903

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=ShieldRVt-PT-010B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 09:57:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 09:57:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 09:57:31] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2023-03-20 09:57:31] [INFO ] Transformed 503 places.
[2023-03-20 09:57:31] [INFO ] Transformed 503 transitions.
[2023-03-20 09:57:31] [INFO ] Found NUPN structural information;
[2023-03-20 09:57:31] [INFO ] Parsed PT model containing 503 places and 503 transitions and 1186 arcs in 133 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 16) seen :12
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :1
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 503 rows 503 cols
[2023-03-20 09:57:32] [INFO ] Computed 41 place invariants in 16 ms
[2023-03-20 09:57:32] [INFO ] After 303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 09:57:32] [INFO ] [Nat]Absence check using 41 positive place invariants in 17 ms returned sat
[2023-03-20 09:57:33] [INFO ] After 425ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 09:57:33] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 6 ms to minimize.
[2023-03-20 09:57:33] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 1 ms to minimize.
[2023-03-20 09:57:33] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 2 ms to minimize.
[2023-03-20 09:57:33] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2023-03-20 09:57:33] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2023-03-20 09:57:34] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2023-03-20 09:57:34] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2023-03-20 09:57:34] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2023-03-20 09:57:34] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 808 ms
[2023-03-20 09:57:34] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2023-03-20 09:57:34] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 1 ms to minimize.
[2023-03-20 09:57:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 280 ms
[2023-03-20 09:57:34] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 1 ms to minimize.
[2023-03-20 09:57:34] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 1 ms to minimize.
[2023-03-20 09:57:35] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 1 ms to minimize.
[2023-03-20 09:57:35] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 1 ms to minimize.
[2023-03-20 09:57:35] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
[2023-03-20 09:57:35] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2023-03-20 09:57:35] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 1 ms to minimize.
[2023-03-20 09:57:35] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 1 ms to minimize.
[2023-03-20 09:57:36] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 0 ms to minimize.
[2023-03-20 09:57:36] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 0 ms to minimize.
[2023-03-20 09:57:36] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 1 ms to minimize.
[2023-03-20 09:57:36] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 0 ms to minimize.
[2023-03-20 09:57:36] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1699 ms
[2023-03-20 09:57:36] [INFO ] After 3563ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 280 ms.
[2023-03-20 09:57:36] [INFO ] After 4038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 60 ms.
Support contains 78 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 503/503 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 503 transition count 408
Reduce places removed 95 places and 0 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Iterating post reduction 1 with 130 rules applied. Total rules applied 225 place count 408 transition count 373
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 260 place count 373 transition count 373
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 260 place count 373 transition count 342
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 322 place count 342 transition count 342
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 364 place count 300 transition count 300
Iterating global reduction 3 with 42 rules applied. Total rules applied 406 place count 300 transition count 300
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 406 place count 300 transition count 288
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 430 place count 288 transition count 288
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 566 place count 220 transition count 220
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 596 place count 205 transition count 225
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 599 place count 205 transition count 222
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 602 place count 202 transition count 222
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 603 place count 202 transition count 221
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 604 place count 202 transition count 221
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 605 place count 201 transition count 220
Applied a total of 605 rules in 126 ms. Remains 201 /503 variables (removed 302) and now considering 220/503 (removed 283) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 201/503 places, 220/503 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 3) seen :1
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 220 rows 201 cols
[2023-03-20 09:57:37] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-20 09:57:37] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 09:57:37] [INFO ] [Nat]Absence check using 41 positive place invariants in 7 ms returned sat
[2023-03-20 09:57:37] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 09:57:37] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-20 09:57:37] [INFO ] After 126ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 09:57:37] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2023-03-20 09:57:37] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 0 ms to minimize.
[2023-03-20 09:57:37] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2023-03-20 09:57:37] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2023-03-20 09:57:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 261 ms
[2023-03-20 09:57:37] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2023-03-20 09:57:38] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2023-03-20 09:57:38] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 0 ms to minimize.
[2023-03-20 09:57:38] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2023-03-20 09:57:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 287 ms
[2023-03-20 09:57:38] [INFO ] After 786ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-03-20 09:57:38] [INFO ] After 1111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 67 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 220/220 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 201 transition count 216
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 197 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 196 transition count 215
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 10 place count 196 transition count 213
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 14 place count 194 transition count 213
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 15 place count 193 transition count 212
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 193 transition count 212
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 32 place count 185 transition count 204
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 184 transition count 203
Applied a total of 33 rules in 54 ms. Remains 184 /201 variables (removed 17) and now considering 203/220 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 184/201 places, 203/220 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 447880 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :{}
Probabilistic random walk after 447880 steps, saw 225735 distinct states, run finished after 3002 ms. (steps per millisecond=149 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 203 rows 184 cols
[2023-03-20 09:57:41] [INFO ] Computed 41 place invariants in 4 ms
[2023-03-20 09:57:41] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 09:57:41] [INFO ] [Nat]Absence check using 41 positive place invariants in 8 ms returned sat
[2023-03-20 09:57:43] [INFO ] After 1740ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 09:57:43] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-20 09:57:43] [INFO ] After 116ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 09:57:43] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2023-03-20 09:57:44] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2023-03-20 09:57:44] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 13 ms to minimize.
[2023-03-20 09:57:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 259 ms
[2023-03-20 09:57:44] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2023-03-20 09:57:44] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2023-03-20 09:57:44] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2023-03-20 09:57:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 297 ms
[2023-03-20 09:57:44] [INFO ] After 858ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-03-20 09:57:44] [INFO ] After 2808ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 67 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 203/203 transitions.
Applied a total of 0 rules in 8 ms. Remains 184 /184 variables (removed 0) and now considering 203/203 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 184/184 places, 203/203 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 203/203 transitions.
Applied a total of 0 rules in 9 ms. Remains 184 /184 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2023-03-20 09:57:44] [INFO ] Invariant cache hit.
[2023-03-20 09:57:44] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-20 09:57:44] [INFO ] Invariant cache hit.
[2023-03-20 09:57:46] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-20 09:57:50] [INFO ] Implicit Places using invariants and state equation in 5951 ms returned []
Implicit Place search using SMT with State Equation took 6102 ms to find 0 implicit places.
[2023-03-20 09:57:50] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-20 09:57:50] [INFO ] Invariant cache hit.
[2023-03-20 09:57:50] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6296 ms. Remains : 184/184 places, 203/203 transitions.
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 184 transition count 198
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 184 transition count 198
Applied a total of 8 rules in 14 ms. Remains 184 /184 variables (removed 0) and now considering 198/203 (removed 5) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 198 rows 184 cols
[2023-03-20 09:57:50] [INFO ] Computed 41 place invariants in 3 ms
[2023-03-20 09:57:51] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 09:57:51] [INFO ] [Nat]Absence check using 41 positive place invariants in 7 ms returned sat
[2023-03-20 09:57:51] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 09:57:51] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 2 ms to minimize.
[2023-03-20 09:57:51] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2023-03-20 09:57:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 132 ms
[2023-03-20 09:57:51] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2023-03-20 09:57:51] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2023-03-20 09:57:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 130 ms
[2023-03-20 09:57:51] [INFO ] After 467ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-20 09:57:51] [INFO ] After 608ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-20 09:57:51] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-20 09:57:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 184 places, 203 transitions and 707 arcs took 2 ms.
[2023-03-20 09:57:51] [INFO ] Flatten gal took : 77 ms
Total runtime 20363 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/632/inv_0_ --invariant=/tmp/632/inv_1_ --inv-par
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679306277439

--------------------
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 ShieldRVt-PT-010B-ReachabilityFireability-00
rfs formula type AG
rfs formula formula --invariant=/tmp/632/inv_0_
rfs formula name ShieldRVt-PT-010B-ReachabilityFireability-09
rfs formula type AG
rfs formula formula --invariant=/tmp/632/inv_1_
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 184 places, 203 transitions and 707 arcs
pnml2lts-sym: Petri net ShieldRVt_PT_010B analyzed
pnml2lts-sym: There are no 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: 203->162 groups
pnml2lts-sym: Regrouping took 0.020 real 0.010 user 0.000 sys
pnml2lts-sym: state vector length is 184; there are 162 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:
pnml2lts-sym: Invariant violation (/tmp/632/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/632/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 0.180 real 0.630 user 0.070 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="ShieldRVt-PT-010B"
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 ShieldRVt-PT-010B, 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 r425-tajo-167905978000271"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-010B.tgz
mv ShieldRVt-PT-010B 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 ;