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

About the Execution of LTSMin+red for SmartHome-PT-08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
333.163 49100.00 171954.00 406.60 TTFFFFFTFTFFFTTT normal

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.r457-smll-167912649000215.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 SmartHome-PT-08, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r457-smll-167912649000215
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.9K Feb 26 05:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 05:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 05:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 05:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 05:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 26 05:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 05:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 05:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 64K 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 SmartHome-PT-08-ReachabilityFireability-00
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-01
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-02
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-03
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-04
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-05
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-06
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-07
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-08
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-09
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-10
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-11
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-12
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-13
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-14
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679320766426

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=SmartHome-PT-08
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 13:59:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 13:59:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 13:59:29] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2023-03-20 13:59:29] [INFO ] Transformed 252 places.
[2023-03-20 13:59:29] [INFO ] Transformed 291 transitions.
[2023-03-20 13:59:29] [INFO ] Found NUPN structural information;
[2023-03-20 13:59:29] [INFO ] Parsed PT model containing 252 places and 291 transitions and 664 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 20 places in 7 ms
Reduce places removed 20 places and 21 transitions.
FORMULA SmartHome-PT-08-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 55 resets, run finished after 628 ms. (steps per millisecond=15 ) properties (out of 15) seen :10
FORMULA SmartHome-PT-08-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 270 rows 232 cols
[2023-03-20 13:59:30] [INFO ] Computed 11 place invariants in 21 ms
[2023-03-20 13:59:31] [INFO ] After 492ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 13:59:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2023-03-20 13:59:31] [INFO ] After 366ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-20 13:59:32] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 9 ms to minimize.
[2023-03-20 13:59:32] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2023-03-20 13:59:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 300 ms
[2023-03-20 13:59:32] [INFO ] After 906ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 138 ms.
[2023-03-20 13:59:32] [INFO ] After 1318ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
FORMULA SmartHome-PT-08-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SmartHome-PT-08-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 41 ms.
Support contains 59 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 270/270 transitions.
Graph (trivial) has 106 edges and 232 vertex of which 4 / 232 are part of one of the 1 SCC in 19 ms
Free SCC test removed 3 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 229 transition count 225
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 43 rules applied. Total rules applied 84 place count 189 transition count 222
Reduce places removed 1 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 2 with 14 rules applied. Total rules applied 98 place count 188 transition count 209
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 111 place count 175 transition count 209
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 111 place count 175 transition count 199
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 131 place count 165 transition count 199
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 167 place count 129 transition count 163
Iterating global reduction 4 with 36 rules applied. Total rules applied 203 place count 129 transition count 163
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 8 rules applied. Total rules applied 211 place count 129 transition count 155
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 213 place count 127 transition count 155
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 239 place count 114 transition count 142
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 242 place count 114 transition count 139
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 250 place count 114 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 251 place count 113 transition count 131
Free-agglomeration rule applied 5 times.
Iterating global reduction 8 with 5 rules applied. Total rules applied 256 place count 113 transition count 126
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 261 place count 108 transition count 126
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 263 place count 108 transition count 126
Applied a total of 263 rules in 169 ms. Remains 108 /232 variables (removed 124) and now considering 126/270 (removed 144) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 108/232 places, 126/270 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 728407 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :{}
Probabilistic random walk after 728407 steps, saw 138159 distinct states, run finished after 3005 ms. (steps per millisecond=242 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 126 rows 108 cols
[2023-03-20 13:59:35] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-20 13:59:36] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 13:59:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-20 13:59:36] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 13:59:36] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-20 13:59:36] [INFO ] After 58ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 13:59:36] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2023-03-20 13:59:36] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2023-03-20 13:59:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 158 ms
[2023-03-20 13:59:36] [INFO ] After 309ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 80 ms.
[2023-03-20 13:59:36] [INFO ] After 575ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA SmartHome-PT-08-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA SmartHome-PT-08-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 9 ms.
Support contains 17 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 126/126 transitions.
Graph (trivial) has 57 edges and 108 vertex of which 10 / 108 are part of one of the 2 SCC in 1 ms
Free SCC test removed 8 places
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 100 transition count 97
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 26 rules applied. Total rules applied 44 place count 83 transition count 88
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 55 place count 75 transition count 85
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 55 place count 75 transition count 84
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 74 transition count 84
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 66 place count 65 transition count 75
Iterating global reduction 3 with 9 rules applied. Total rules applied 75 place count 65 transition count 75
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 79 place count 65 transition count 71
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 105 place count 52 transition count 58
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 109 place count 52 transition count 54
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 110 place count 52 transition count 53
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 114 place count 52 transition count 49
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 118 place count 48 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 119 place count 47 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 120 place count 46 transition count 48
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 121 place count 46 transition count 47
Applied a total of 121 rules in 66 ms. Remains 46 /108 variables (removed 62) and now considering 47/126 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 46/108 places, 47/126 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished probabilistic random walk after 173646 steps, run visited all 1 properties in 205 ms. (steps per millisecond=847 )
Probabilistic random walk after 173646 steps, saw 25848 distinct states, run finished after 206 ms. (steps per millisecond=842 ) properties seen :1
FORMULA SmartHome-PT-08-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 7942 ms.
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/471/inv_0_ --invariant=/tmp/471/inv_1_ --invariant=/tmp/471/inv_2_ --invariant=/tmp/471/inv_3_ --invariant=/tmp/471/inv_4_ --invariant=/tmp/471/inv_5_ --invariant=/tmp/471/inv_6_ --invariant=/tmp/471/inv_7_ --invariant=/tmp/471/inv_8_ --invariant=/tmp/471/inv_9_ --invariant=/tmp/471/inv_10_ --invariant=/tmp/471/inv_11_ --invariant=/tmp/471/inv_12_ --invariant=/tmp/471/inv_13_ --invariant=/tmp/471/inv_14_ --invariant=/tmp/471/inv_15_ --inv-par
FORMULA SmartHome-PT-08-ReachabilityFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA SmartHome-PT-08-ReachabilityFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA SmartHome-PT-08-ReachabilityFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA SmartHome-PT-08-ReachabilityFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA SmartHome-PT-08-ReachabilityFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA SmartHome-PT-08-ReachabilityFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA SmartHome-PT-08-ReachabilityFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA SmartHome-PT-08-ReachabilityFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA SmartHome-PT-08-ReachabilityFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA SmartHome-PT-08-ReachabilityFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA SmartHome-PT-08-ReachabilityFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA SmartHome-PT-08-ReachabilityFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA SmartHome-PT-08-ReachabilityFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA SmartHome-PT-08-ReachabilityFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA SmartHome-PT-08-ReachabilityFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA SmartHome-PT-08-ReachabilityFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679320815526

--------------------
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 SmartHome-PT-08-ReachabilityFireability-00
rfs formula type EF
rfs formula formula --invariant=/tmp/471/inv_0_
rfs formula name SmartHome-PT-08-ReachabilityFireability-01
rfs formula type AG
rfs formula formula --invariant=/tmp/471/inv_1_
rfs formula name SmartHome-PT-08-ReachabilityFireability-02
rfs formula type EF
rfs formula formula --invariant=/tmp/471/inv_2_
rfs formula name SmartHome-PT-08-ReachabilityFireability-03
rfs formula type AG
rfs formula formula --invariant=/tmp/471/inv_3_
rfs formula name SmartHome-PT-08-ReachabilityFireability-04
rfs formula type EF
rfs formula formula --invariant=/tmp/471/inv_4_
rfs formula name SmartHome-PT-08-ReachabilityFireability-05
rfs formula type AG
rfs formula formula --invariant=/tmp/471/inv_5_
rfs formula name SmartHome-PT-08-ReachabilityFireability-06
rfs formula type AG
rfs formula formula --invariant=/tmp/471/inv_6_
rfs formula name SmartHome-PT-08-ReachabilityFireability-07
rfs formula type EF
rfs formula formula --invariant=/tmp/471/inv_7_
rfs formula name SmartHome-PT-08-ReachabilityFireability-08
rfs formula type AG
rfs formula formula --invariant=/tmp/471/inv_8_
rfs formula name SmartHome-PT-08-ReachabilityFireability-09
rfs formula type EF
rfs formula formula --invariant=/tmp/471/inv_9_
rfs formula name SmartHome-PT-08-ReachabilityFireability-10
rfs formula type AG
rfs formula formula --invariant=/tmp/471/inv_10_
rfs formula name SmartHome-PT-08-ReachabilityFireability-11
rfs formula type AG
rfs formula formula --invariant=/tmp/471/inv_11_
rfs formula name SmartHome-PT-08-ReachabilityFireability-12
rfs formula type AG
rfs formula formula --invariant=/tmp/471/inv_12_
rfs formula name SmartHome-PT-08-ReachabilityFireability-13
rfs formula type EF
rfs formula formula --invariant=/tmp/471/inv_13_
rfs formula name SmartHome-PT-08-ReachabilityFireability-14
rfs formula type EF
rfs formula formula --invariant=/tmp/471/inv_14_
rfs formula name SmartHome-PT-08-ReachabilityFireability-15
rfs formula type EF
rfs formula formula --invariant=/tmp/471/inv_15_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 252 places, 291 transitions and 664 arcs
pnml2lts-sym: Petri net SmartHome-PT-08 analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 291->291 groups
pnml2lts-sym: Regrouping took 0.090 real 0.090 user 0.000 sys
pnml2lts-sym: state vector length is 252; there are 291 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:
pnml2lts-sym: Invariant violation (/tmp/471/inv_15_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/471/inv_14_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/471/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/471/inv_3_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/471/inv_13_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/471/inv_12_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/471/inv_6_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/471/inv_5_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/471/inv_10_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/471/inv_9_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/471/inv_7_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/471/inv_8_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/471/inv_11_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 4283295 group checks and 0 next state calls
pnml2lts-sym: reachability took 36.440 real 144.890 user 0.630 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.090 real 0.370 user 0.000 sys
pnml2lts-sym: state space has 806568794170 states, 292827 nodes
pnml2lts-sym: group_next: 1199 nodes total
pnml2lts-sym: group_explored: 635 nodes, 749 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="SmartHome-PT-08"
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 SmartHome-PT-08, 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 r457-smll-167912649000215"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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