fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r425-tajo-167905977900239
Last Updated
May 14, 2023

About the Execution of LTSMin+red for ShieldRVt-PT-004B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
393.688 10369.00 21086.00 43.00 TTFFTTFFTTTTFTFT normal

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-167905977900239.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-004B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905977900239
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 5.6K Feb 25 22:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 25 22:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 22:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 22:54 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.7K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 22:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 22:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 22:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 22:55 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 48K 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-004B-ReachabilityFireability-00
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-01
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-02
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-03
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-04
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-05
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-06
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-07
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-08
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-09
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-10
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-11
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-12
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-13
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-14
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679306038114

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-004B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 09:53:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 09:53:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 09:53:59] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2023-03-20 09:53:59] [INFO ] Transformed 203 places.
[2023-03-20 09:53:59] [INFO ] Transformed 203 transitions.
[2023-03-20 09:53:59] [INFO ] Found NUPN structural information;
[2023-03-20 09:53:59] [INFO ] Parsed PT model containing 203 places and 203 transitions and 478 arcs in 119 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 403 ms. (steps per millisecond=24 ) properties (out of 16) seen :11
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 203 rows 203 cols
[2023-03-20 09:54:00] [INFO ] Computed 17 place invariants in 21 ms
[2023-03-20 09:54:00] [INFO ] After 284ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 09:54:01] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-20 09:54:01] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-20 09:54:01] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 6 ms to minimize.
[2023-03-20 09:54:01] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2023-03-20 09:54:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 242 ms
[2023-03-20 09:54:01] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 10 ms to minimize.
[2023-03-20 09:54:01] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 12 ms to minimize.
[2023-03-20 09:54:02] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2023-03-20 09:54:02] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 0 ms to minimize.
[2023-03-20 09:54:02] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2023-03-20 09:54:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 519 ms
[2023-03-20 09:54:02] [INFO ] After 1121ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 107 ms.
[2023-03-20 09:54:02] [INFO ] After 1431ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 53 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 203/203 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 203 transition count 174
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 60 place count 174 transition count 172
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 6 rules applied. Total rules applied 66 place count 173 transition count 167
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 71 place count 168 transition count 167
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 71 place count 168 transition count 149
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 107 place count 150 transition count 149
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 125 place count 132 transition count 131
Iterating global reduction 4 with 18 rules applied. Total rules applied 143 place count 132 transition count 131
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 143 place count 132 transition count 129
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 147 place count 130 transition count 129
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 193 place count 107 transition count 106
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 196 place count 107 transition count 103
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 199 place count 104 transition count 103
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 202 place count 104 transition count 103
Applied a total of 202 rules in 69 ms. Remains 104 /203 variables (removed 99) and now considering 103/203 (removed 100) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 104/203 places, 103/203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :1
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 103 rows 104 cols
[2023-03-20 09:54:02] [INFO ] Computed 17 place invariants in 6 ms
[2023-03-20 09:54:02] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 09:54:02] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-20 09:54:02] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 09:54:02] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 09:54:02] [INFO ] After 39ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 09:54:03] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2023-03-20 09:54:03] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2023-03-20 09:54:03] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 0 ms to minimize.
[2023-03-20 09:54:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 227 ms
[2023-03-20 09:54:03] [INFO ] After 310ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-20 09:54:03] [INFO ] After 472ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 45 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 103/103 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 104 transition count 100
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 101 transition count 100
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 101 transition count 99
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 100 transition count 99
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 99 transition count 98
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 99 transition count 98
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 94 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 93 transition count 93
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 93 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 92 transition count 92
Applied a total of 24 rules in 29 ms. Remains 92 /104 variables (removed 12) and now considering 92/103 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 92/104 places, 92/103 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
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 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 456473 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :{}
Probabilistic random walk after 456473 steps, saw 197335 distinct states, run finished after 3002 ms. (steps per millisecond=152 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 92 rows 92 cols
[2023-03-20 09:54:06] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-20 09:54:06] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 09:54:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-03-20 09:54:06] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 09:54:06] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-20 09:54:06] [INFO ] After 63ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 09:54:07] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2023-03-20 09:54:07] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2023-03-20 09:54:07] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2023-03-20 09:54:07] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2023-03-20 09:54:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 269 ms
[2023-03-20 09:54:07] [INFO ] After 414ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-03-20 09:54:07] [INFO ] After 668ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 45 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 92/92 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 92/92 places, 92/92 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 92/92 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2023-03-20 09:54:07] [INFO ] Invariant cache hit.
[2023-03-20 09:54:07] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-20 09:54:07] [INFO ] Invariant cache hit.
[2023-03-20 09:54:07] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-20 09:54:07] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2023-03-20 09:54:07] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 09:54:07] [INFO ] Invariant cache hit.
[2023-03-20 09:54:07] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 92/92 places, 92/92 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 92 transition count 91
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 92 transition count 91
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 92 transition count 90
Applied a total of 5 rules in 11 ms. Remains 92 /92 variables (removed 0) and now considering 90/92 (removed 2) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 90 rows 92 cols
[2023-03-20 09:54:07] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-20 09:54:07] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 09:54:07] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-03-20 09:54:07] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 09:54:07] [INFO ] After 103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-20 09:54:07] [INFO ] After 188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-20 09:54:07] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-20 09:54:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 92 places, 92 transitions and 266 arcs took 1 ms.
[2023-03-20 09:54:08] [INFO ] Flatten gal took : 32 ms
Total runtime 8299 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/552/inv_0_ --invariant=/tmp/552/inv_1_ --inv-par
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679306048483

--------------------
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-004B-ReachabilityFireability-09
rfs formula type AG
rfs formula formula --invariant=/tmp/552/inv_0_
rfs formula name ShieldRVt-PT-004B-ReachabilityFireability-15
rfs formula type AG
rfs formula formula --invariant=/tmp/552/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 92 places, 92 transitions and 266 arcs
pnml2lts-sym: Petri net ShieldRVt_PT_004B 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: 92->83 groups
pnml2lts-sym: Regrouping took 0.010 real 0.010 user 0.000 sys
pnml2lts-sym: state vector length is 92; there are 83 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: Exploration took 12788 group checks and 0 next state calls
pnml2lts-sym: reachability took 0.090 real 0.370 user 0.000 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state space has 72218307991 states, 1511 nodes
pnml2lts-sym: group_next: 669 nodes total
pnml2lts-sym: group_explored: 614 nodes, 587 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="ShieldRVt-PT-004B"
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-004B, 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-167905977900239"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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