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

About the Execution of LTSMin+red for FlexibleBarrier-PT-06b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5058.703 3578985.00 14285620.00 435.10 TFFFFTFTTTFFTTTF 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-167838855900470.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-06b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855900470
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 12:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 12:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 12:38 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:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 12:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 25 12:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 25 12:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 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 141K 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-06b-ReachabilityCardinality-00
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-01
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-02
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-03
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-04
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-05
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-06
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-07
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-08
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-09
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-10
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-11
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-12
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-13
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-14
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678551037518

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-06b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 16:10:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 16:10:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 16:10:39] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2023-03-11 16:10:39] [INFO ] Transformed 542 places.
[2023-03-11 16:10:39] [INFO ] Transformed 621 transitions.
[2023-03-11 16:10:39] [INFO ] Found NUPN structural information;
[2023-03-11 16:10:39] [INFO ] Parsed PT model containing 542 places and 621 transitions and 1533 arcs in 136 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 193 resets, run finished after 614 ms. (steps per millisecond=16 ) properties (out of 13) seen :3
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :1
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :1
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :1
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 621 rows 542 cols
[2023-03-11 16:10:40] [INFO ] Computed 8 place invariants in 19 ms
[2023-03-11 16:10:41] [INFO ] After 457ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 16:10:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-11 16:10:41] [INFO ] After 427ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-11 16:10:42] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 6 ms to minimize.
[2023-03-11 16:10:42] [INFO ] Deduced a trap composed of 167 places in 110 ms of which 1 ms to minimize.
[2023-03-11 16:10:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 333 ms
[2023-03-11 16:10:42] [INFO ] Deduced a trap composed of 132 places in 162 ms of which 1 ms to minimize.
[2023-03-11 16:10:42] [INFO ] Deduced a trap composed of 165 places in 121 ms of which 1 ms to minimize.
[2023-03-11 16:10:42] [INFO ] Deduced a trap composed of 213 places in 125 ms of which 2 ms to minimize.
[2023-03-11 16:10:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 493 ms
[2023-03-11 16:10:43] [INFO ] After 1587ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 221 ms.
[2023-03-11 16:10:43] [INFO ] After 2097ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 4 properties in 71 ms.
Support contains 36 out of 542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 621/621 transitions.
Graph (trivial) has 461 edges and 542 vertex of which 6 / 542 are part of one of the 1 SCC in 9 ms
Free SCC test removed 5 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 135 transitions
Trivial Post-agglo rules discarded 135 transitions
Performed 135 trivial Post agglomeration. Transition count delta: 135
Iterating post reduction 0 with 135 rules applied. Total rules applied 136 place count 537 transition count 480
Reduce places removed 135 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 147 rules applied. Total rules applied 283 place count 402 transition count 468
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 294 place count 391 transition count 468
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 294 place count 391 transition count 445
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 340 place count 368 transition count 445
Discarding 142 places :
Symmetric choice reduction at 3 with 142 rule applications. Total rules 482 place count 226 transition count 303
Iterating global reduction 3 with 142 rules applied. Total rules applied 624 place count 226 transition count 303
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 624 place count 226 transition count 300
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 630 place count 223 transition count 300
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 642 place count 211 transition count 288
Iterating global reduction 3 with 12 rules applied. Total rules applied 654 place count 211 transition count 288
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 664 place count 211 transition count 278
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 762 place count 162 transition count 229
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 763 place count 162 transition count 228
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 769 place count 159 transition count 237
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 774 place count 159 transition count 232
Free-agglomeration rule applied 69 times.
Iterating global reduction 5 with 69 rules applied. Total rules applied 843 place count 159 transition count 163
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 70 rules applied. Total rules applied 913 place count 90 transition count 162
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 926 place count 90 transition count 149
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 928 place count 90 transition count 149
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 929 place count 89 transition count 148
Applied a total of 929 rules in 133 ms. Remains 89 /542 variables (removed 453) and now considering 148/621 (removed 473) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 89/542 places, 148/621 transitions.
Incomplete random walk after 10000 steps, including 148 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) seen :1
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 16:10:43] [INFO ] Flow matrix only has 142 transitions (discarded 6 similar events)
// Phase 1: matrix 142 rows 89 cols
[2023-03-11 16:10:43] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 16:10:43] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 16:10:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-11 16:10:43] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 16:10:43] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 16:10:43] [INFO ] After 22ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 16:10:43] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 0 ms to minimize.
[2023-03-11 16:10:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-03-11 16:10:43] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2023-03-11 16:10:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-11 16:10:43] [INFO ] After 150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-11 16:10:43] [INFO ] After 253ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 25 steps, including 2 resets, run visited all 2 properties in 1 ms. (steps per millisecond=25 )
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 1 ms.
All properties solved without resorting to model-checking.
Total runtime 4582 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/483/inv_0_ --invariant=/tmp/483/inv_1_ --invariant=/tmp/483/inv_2_ --invariant=/tmp/483/inv_3_ --invariant=/tmp/483/inv_4_ --invariant=/tmp/483/inv_5_ --invariant=/tmp/483/inv_6_ --invariant=/tmp/483/inv_7_ --invariant=/tmp/483/inv_8_ --invariant=/tmp/483/inv_9_ --invariant=/tmp/483/inv_10_ --invariant=/tmp/483/inv_11_ --invariant=/tmp/483/inv_12_ --invariant=/tmp/483/inv_13_ --invariant=/tmp/483/inv_14_ --invariant=/tmp/483/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393216 kB
MemFree: 11090520 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16100184 kB
Could not compute solution for formula : FlexibleBarrier-PT-06b-ReachabilityCardinality-00
Could not compute solution for formula : FlexibleBarrier-PT-06b-ReachabilityCardinality-01
Could not compute solution for formula : FlexibleBarrier-PT-06b-ReachabilityCardinality-02
Could not compute solution for formula : FlexibleBarrier-PT-06b-ReachabilityCardinality-03
Could not compute solution for formula : FlexibleBarrier-PT-06b-ReachabilityCardinality-04
Could not compute solution for formula : FlexibleBarrier-PT-06b-ReachabilityCardinality-05
Could not compute solution for formula : FlexibleBarrier-PT-06b-ReachabilityCardinality-06
Could not compute solution for formula : FlexibleBarrier-PT-06b-ReachabilityCardinality-07
Could not compute solution for formula : FlexibleBarrier-PT-06b-ReachabilityCardinality-08
Could not compute solution for formula : FlexibleBarrier-PT-06b-ReachabilityCardinality-09
Could not compute solution for formula : FlexibleBarrier-PT-06b-ReachabilityCardinality-10
Could not compute solution for formula : FlexibleBarrier-PT-06b-ReachabilityCardinality-11
Could not compute solution for formula : FlexibleBarrier-PT-06b-ReachabilityCardinality-12
Could not compute solution for formula : FlexibleBarrier-PT-06b-ReachabilityCardinality-13
Could not compute solution for formula : FlexibleBarrier-PT-06b-ReachabilityCardinality-14
Could not compute solution for formula : FlexibleBarrier-PT-06b-ReachabilityCardinality-15

BK_STOP 1678554616503

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023
rfs formula name FlexibleBarrier-PT-06b-ReachabilityCardinality-00
rfs formula type AG
rfs formula formula --invariant=/tmp/483/inv_0_
rfs formula name FlexibleBarrier-PT-06b-ReachabilityCardinality-01
rfs formula type AG
rfs formula formula --invariant=/tmp/483/inv_1_
rfs formula name FlexibleBarrier-PT-06b-ReachabilityCardinality-02
rfs formula type AG
rfs formula formula --invariant=/tmp/483/inv_2_
rfs formula name FlexibleBarrier-PT-06b-ReachabilityCardinality-03
rfs formula type AG
rfs formula formula --invariant=/tmp/483/inv_3_
rfs formula name FlexibleBarrier-PT-06b-ReachabilityCardinality-04
rfs formula type AG
rfs formula formula --invariant=/tmp/483/inv_4_
rfs formula name FlexibleBarrier-PT-06b-ReachabilityCardinality-05
rfs formula type EF
rfs formula formula --invariant=/tmp/483/inv_5_
rfs formula name FlexibleBarrier-PT-06b-ReachabilityCardinality-06
rfs formula type AG
rfs formula formula --invariant=/tmp/483/inv_6_
rfs formula name FlexibleBarrier-PT-06b-ReachabilityCardinality-07
rfs formula type EF
rfs formula formula --invariant=/tmp/483/inv_7_
rfs formula name FlexibleBarrier-PT-06b-ReachabilityCardinality-08
rfs formula type AG
rfs formula formula --invariant=/tmp/483/inv_8_
rfs formula name FlexibleBarrier-PT-06b-ReachabilityCardinality-09
rfs formula type EF
rfs formula formula --invariant=/tmp/483/inv_9_
rfs formula name FlexibleBarrier-PT-06b-ReachabilityCardinality-10
rfs formula type AG
rfs formula formula --invariant=/tmp/483/inv_10_
rfs formula name FlexibleBarrier-PT-06b-ReachabilityCardinality-11
rfs formula type AG
rfs formula formula --invariant=/tmp/483/inv_11_
rfs formula name FlexibleBarrier-PT-06b-ReachabilityCardinality-12
rfs formula type EF
rfs formula formula --invariant=/tmp/483/inv_12_
rfs formula name FlexibleBarrier-PT-06b-ReachabilityCardinality-13
rfs formula type EF
rfs formula formula --invariant=/tmp/483/inv_13_
rfs formula name FlexibleBarrier-PT-06b-ReachabilityCardinality-14
rfs formula type AG
rfs formula formula --invariant=/tmp/483/inv_14_
rfs formula name FlexibleBarrier-PT-06b-ReachabilityCardinality-15
rfs formula type AG
rfs formula formula --invariant=/tmp/483/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 542 places, 621 transitions and 1533 arcs
pnml2lts-sym: Petri net FlexibleBarrier-PT-06b analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 621->621 groups
pnml2lts-sym: Regrouping took 0.190 real 0.180 user 0.000 sys
pnml2lts-sym: state vector length is 542; there are 621 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: 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
Killing (15) : 489
Killing (9) : 489

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-06b"
export BK_EXAMINATION="ReachabilityCardinality"
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-06b, examination is ReachabilityCardinality"
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-167838855900470"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-06b.tgz
mv FlexibleBarrier-PT-06b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;