About the Execution of LTSMin+red for FlexibleBarrier-PT-04b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
387.319 | 57645.00 | 206005.00 | 372.10 | TFFFFTFTTTFFTFTT | 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.r169-tall-167838855900455.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 FlexibleBarrier-PT-04b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855900455
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 12:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 12:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 25 12:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Feb 25 12:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 69K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-00
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-01
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-02
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-03
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-04
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-05
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-06
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-07
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-08
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-09
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-10
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-11
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-12
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-13
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-14
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1678550396528
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=FlexibleBarrier-PT-04b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 15:59:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 15:59:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 15:59:58] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2023-03-11 15:59:58] [INFO ] Transformed 268 places.
[2023-03-11 15:59:58] [INFO ] Transformed 305 transitions.
[2023-03-11 15:59:58] [INFO ] Found NUPN structural information;
[2023-03-11 15:59:58] [INFO ] Parsed PT model containing 268 places and 305 transitions and 743 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 238 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 16) seen :7
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :1
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 305 rows 268 cols
[2023-03-11 15:59:59] [INFO ] Computed 6 place invariants in 14 ms
[2023-03-11 15:59:59] [INFO ] After 423ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 16:00:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-11 16:00:00] [INFO ] After 268ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :6
[2023-03-11 16:00:00] [INFO ] Deduced a trap composed of 95 places in 81 ms of which 5 ms to minimize.
[2023-03-11 16:00:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-03-11 16:00:00] [INFO ] Deduced a trap composed of 79 places in 248 ms of which 1 ms to minimize.
[2023-03-11 16:00:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2023-03-11 16:00:01] [INFO ] Deduced a trap composed of 101 places in 129 ms of which 2 ms to minimize.
[2023-03-11 16:00:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2023-03-11 16:00:01] [INFO ] After 1074ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :6
Attempting to minimize the solution found.
Minimization took 168 ms.
[2023-03-11 16:00:01] [INFO ] After 1403ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :6
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 6 different solutions.
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 4 properties in 35 ms.
Support contains 43 out of 268 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 268/268 places, 305/305 transitions.
Graph (trivial) has 156 edges and 268 vertex of which 6 / 268 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 263 transition count 262
Reduce places removed 37 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 49 rules applied. Total rules applied 87 place count 226 transition count 250
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 99 place count 214 transition count 250
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 99 place count 214 transition count 227
Deduced a syphon composed of 23 places in 4 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 145 place count 191 transition count 227
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 196 place count 140 transition count 176
Iterating global reduction 3 with 51 rules applied. Total rules applied 247 place count 140 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 248 place count 140 transition count 175
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 248 place count 140 transition count 172
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 254 place count 137 transition count 172
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 256 place count 135 transition count 170
Iterating global reduction 4 with 2 rules applied. Total rules applied 258 place count 135 transition count 170
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 260 place count 135 transition count 168
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 298 place count 116 transition count 149
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 308 place count 111 transition count 162
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 314 place count 111 transition count 156
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 320 place count 105 transition count 156
Applied a total of 320 rules in 92 ms. Remains 105 /268 variables (removed 163) and now considering 156/305 (removed 149) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 105/268 places, 156/305 transitions.
Incomplete random walk after 10000 steps, including 314 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 65 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1399120 steps, run timeout after 3001 ms. (steps per millisecond=466 ) properties seen :{1=1}
Probabilistic random walk after 1399120 steps, saw 365334 distinct states, run finished after 3002 ms. (steps per millisecond=466 ) properties seen :1
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
[2023-03-11 16:00:04] [INFO ] Flow matrix only has 154 transitions (discarded 2 similar events)
// Phase 1: matrix 154 rows 105 cols
[2023-03-11 16:00:04] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-11 16:00:04] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 16:00:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 16:00:04] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 16:00:04] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-11 16:00:04] [INFO ] After 23ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 16:00:04] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2023-03-11 16:00:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-03-11 16:00:04] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-11 16:00:05] [INFO ] After 229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 25 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 156/156 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 105 transition count 153
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 102 transition count 153
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 102 transition count 149
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 98 transition count 149
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 93 transition count 144
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 93 transition count 144
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 42 place count 84 transition count 135
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 81 transition count 131
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 81 transition count 131
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 51 place count 81 transition count 128
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 3 with 2 rules applied. Total rules applied 53 place count 80 transition count 128
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 80 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 79 transition count 127
Applied a total of 56 rules in 27 ms. Remains 79 /105 variables (removed 26) and now considering 127/156 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 79/105 places, 127/156 transitions.
Incomplete random walk after 10000 steps, including 423 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 497325 steps, run visited all 1 properties in 595 ms. (steps per millisecond=835 )
Probabilistic random walk after 497325 steps, saw 133649 distinct states, run finished after 596 ms. (steps per millisecond=834 ) properties seen :1
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 7382 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/477/inv_0_ --invariant=/tmp/477/inv_1_ --invariant=/tmp/477/inv_2_ --invariant=/tmp/477/inv_3_ --invariant=/tmp/477/inv_4_ --invariant=/tmp/477/inv_5_ --invariant=/tmp/477/inv_6_ --invariant=/tmp/477/inv_7_ --invariant=/tmp/477/inv_8_ --invariant=/tmp/477/inv_9_ --invariant=/tmp/477/inv_10_ --invariant=/tmp/477/inv_11_ --invariant=/tmp/477/inv_12_ --invariant=/tmp/477/inv_13_ --invariant=/tmp/477/inv_14_ --invariant=/tmp/477/inv_15_ --inv-par
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
BK_STOP 1678550454173
--------------------
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 FlexibleBarrier-PT-04b-ReachabilityFireability-00
rfs formula type EF
rfs formula formula --invariant=/tmp/477/inv_0_
rfs formula name FlexibleBarrier-PT-04b-ReachabilityFireability-01
rfs formula type AG
rfs formula formula --invariant=/tmp/477/inv_1_
rfs formula name FlexibleBarrier-PT-04b-ReachabilityFireability-02
rfs formula type AG
rfs formula formula --invariant=/tmp/477/inv_2_
rfs formula name FlexibleBarrier-PT-04b-ReachabilityFireability-03
rfs formula type AG
rfs formula formula --invariant=/tmp/477/inv_3_
rfs formula name FlexibleBarrier-PT-04b-ReachabilityFireability-04
rfs formula type EF
rfs formula formula --invariant=/tmp/477/inv_4_
rfs formula name FlexibleBarrier-PT-04b-ReachabilityFireability-05
rfs formula type EF
rfs formula formula --invariant=/tmp/477/inv_5_
rfs formula name FlexibleBarrier-PT-04b-ReachabilityFireability-06
rfs formula type EF
rfs formula formula --invariant=/tmp/477/inv_6_
rfs formula name FlexibleBarrier-PT-04b-ReachabilityFireability-07
rfs formula type EF
rfs formula formula --invariant=/tmp/477/inv_7_
rfs formula name FlexibleBarrier-PT-04b-ReachabilityFireability-08
rfs formula type EF
rfs formula formula --invariant=/tmp/477/inv_8_
rfs formula name FlexibleBarrier-PT-04b-ReachabilityFireability-09
rfs formula type EF
rfs formula formula --invariant=/tmp/477/inv_9_
rfs formula name FlexibleBarrier-PT-04b-ReachabilityFireability-10
rfs formula type AG
rfs formula formula --invariant=/tmp/477/inv_10_
rfs formula name FlexibleBarrier-PT-04b-ReachabilityFireability-11
rfs formula type AG
rfs formula formula --invariant=/tmp/477/inv_11_
rfs formula name FlexibleBarrier-PT-04b-ReachabilityFireability-12
rfs formula type EF
rfs formula formula --invariant=/tmp/477/inv_12_
rfs formula name FlexibleBarrier-PT-04b-ReachabilityFireability-13
rfs formula type AG
rfs formula formula --invariant=/tmp/477/inv_13_
rfs formula name FlexibleBarrier-PT-04b-ReachabilityFireability-14
rfs formula type EF
rfs formula formula --invariant=/tmp/477/inv_14_
rfs formula name FlexibleBarrier-PT-04b-ReachabilityFireability-15
rfs formula type EF
rfs formula formula --invariant=/tmp/477/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 268 places, 305 transitions and 743 arcs
pnml2lts-sym: Petri net FlexibleBarrier-PT-04b 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: 305->305 groups
pnml2lts-sym: Regrouping took 0.050 real 0.050 user 0.000 sys
pnml2lts-sym: state vector length is 268; there are 305 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:
pnml2lts-sym: Invariant violation (/tmp/477/inv_2_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/477/inv_15_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/477/inv_14_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/477/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/477/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/477/inv_13_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/477/inv_12_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/477/inv_7_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/477/inv_5_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/477/inv_3_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/477/inv_8_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/477/inv_10_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/477/inv_9_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/477/inv_11_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 3857012 group checks and 0 next state calls
pnml2lts-sym: reachability took 34.280 real 136.930 user 0.000 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.040 real 0.180 user 0.000 sys
pnml2lts-sym: state space has 791372373 states, 235864 nodes
pnml2lts-sym: group_next: 1417 nodes total
pnml2lts-sym: group_explored: 738 nodes, 774 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="FlexibleBarrier-PT-04b"
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 FlexibleBarrier-PT-04b, 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 r169-tall-167838855900455"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-04b.tgz
mv FlexibleBarrier-PT-04b 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 '
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 ;