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

About the Execution of LTSMin+red for Peterson-PT-3

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
537.367 42233.00 120259.00 786.40 TTTFFTTFTFTFFFFF 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.r265-smll-167863540300615.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 Peterson-PT-3, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863540300615
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 29K Feb 25 22:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 157K Feb 25 22:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 40K Feb 25 22:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 194K Feb 25 22:05 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 15K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 93K Feb 25 22:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 439K Feb 25 22:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 58K Feb 25 22:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 283K Feb 25 22:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 143K 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 Peterson-PT-3-ReachabilityFireability-00
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-01
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-02
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-03
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-04
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-05
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-06
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-07
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-08
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-09
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-10
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-11
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-12
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-13
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-14
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679132839183

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=Peterson-PT-3
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 09:47:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 09:47:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 09:47:22] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2023-03-18 09:47:22] [INFO ] Transformed 244 places.
[2023-03-18 09:47:22] [INFO ] Transformed 332 transitions.
[2023-03-18 09:47:22] [INFO ] Found NUPN structural information;
[2023-03-18 09:47:22] [INFO ] Completing missing partition info from NUPN : creating a component with [TestAlone_1_2_3, TestAlone_2_2_3]
[2023-03-18 09:47:22] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 266 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 60 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Peterson-PT-3-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 871 ms. (steps per millisecond=11 ) properties (out of 14) seen :5
FORMULA Peterson-PT-3-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 9) seen :1
FORMULA Peterson-PT-3-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-18 09:47:25] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2023-03-18 09:47:25] [INFO ] Computed 15 place invariants in 20 ms
[2023-03-18 09:47:26] [INFO ] After 699ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-18 09:47:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 56 ms returned sat
[2023-03-18 09:47:26] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-18 09:47:28] [INFO ] After 1229ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :5
[2023-03-18 09:47:28] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 09:47:28] [INFO ] After 677ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :3 sat :5
[2023-03-18 09:47:29] [INFO ] Deduced a trap composed of 34 places in 151 ms of which 5 ms to minimize.
[2023-03-18 09:47:29] [INFO ] Deduced a trap composed of 56 places in 148 ms of which 1 ms to minimize.
[2023-03-18 09:47:30] [INFO ] Deduced a trap composed of 27 places in 211 ms of which 2 ms to minimize.
[2023-03-18 09:47:30] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 3 ms to minimize.
[2023-03-18 09:47:30] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 1 ms to minimize.
[2023-03-18 09:47:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 981 ms
[2023-03-18 09:47:30] [INFO ] Deduced a trap composed of 27 places in 266 ms of which 1 ms to minimize.
[2023-03-18 09:47:31] [INFO ] Deduced a trap composed of 12 places in 286 ms of which 1 ms to minimize.
[2023-03-18 09:47:31] [INFO ] Deduced a trap composed of 67 places in 246 ms of which 1 ms to minimize.
[2023-03-18 09:47:31] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 0 ms to minimize.
[2023-03-18 09:47:31] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2023-03-18 09:47:31] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 1 ms to minimize.
[2023-03-18 09:47:31] [INFO ] Deduced a trap composed of 49 places in 164 ms of which 1 ms to minimize.
[2023-03-18 09:47:32] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 1 ms to minimize.
[2023-03-18 09:47:32] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 1 ms to minimize.
[2023-03-18 09:47:32] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 0 ms to minimize.
[2023-03-18 09:47:32] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 1 ms to minimize.
[2023-03-18 09:47:32] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2051 ms
[2023-03-18 09:47:32] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 0 ms to minimize.
[2023-03-18 09:47:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 121 ms
[2023-03-18 09:47:32] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 0 ms to minimize.
[2023-03-18 09:47:33] [INFO ] Deduced a trap composed of 45 places in 711 ms of which 0 ms to minimize.
[2023-03-18 09:47:33] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 1 ms to minimize.
[2023-03-18 09:47:33] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 1 ms to minimize.
[2023-03-18 09:47:34] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 2 ms to minimize.
[2023-03-18 09:47:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1307 ms
[2023-03-18 09:47:34] [INFO ] Deduced a trap composed of 16 places in 227 ms of which 1 ms to minimize.
[2023-03-18 09:47:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2023-03-18 09:47:34] [INFO ] After 6135ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :4
Attempting to minimize the solution found.
Minimization took 702 ms.
[2023-03-18 09:47:35] [INFO ] After 8638ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :4
FORMULA Peterson-PT-3-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-3-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-3-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-3-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 232 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 244 transition count 328
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 240 transition count 328
Applied a total of 8 rules in 60 ms. Remains 240 /244 variables (removed 4) and now considering 328/332 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 240/244 places, 328/332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 4) seen :1
FORMULA Peterson-PT-3-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-18 09:47:35] [INFO ] Flow matrix only has 304 transitions (discarded 24 similar events)
// Phase 1: matrix 304 rows 240 cols
[2023-03-18 09:47:35] [INFO ] Computed 15 place invariants in 5 ms
[2023-03-18 09:47:36] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 09:47:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-18 09:47:36] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-18 09:47:36] [INFO ] After 277ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 09:47:36] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 09:47:36] [INFO ] After 89ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-18 09:47:36] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 1 ms to minimize.
[2023-03-18 09:47:37] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 1 ms to minimize.
[2023-03-18 09:47:37] [INFO ] Deduced a trap composed of 18 places in 270 ms of which 1 ms to minimize.
[2023-03-18 09:47:37] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 1 ms to minimize.
[2023-03-18 09:47:38] [INFO ] Deduced a trap composed of 27 places in 241 ms of which 1 ms to minimize.
[2023-03-18 09:47:38] [INFO ] Deduced a trap composed of 47 places in 172 ms of which 0 ms to minimize.
[2023-03-18 09:47:38] [INFO ] Deduced a trap composed of 16 places in 180 ms of which 1 ms to minimize.
[2023-03-18 09:47:38] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 0 ms to minimize.
[2023-03-18 09:47:38] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1863 ms
[2023-03-18 09:47:38] [INFO ] After 2051ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-18 09:47:38] [INFO ] After 2535ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 15 ms.
Support contains 14 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 328/328 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 240 transition count 246
Reduce places removed 82 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 88 rules applied. Total rules applied 170 place count 158 transition count 240
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 176 place count 152 transition count 240
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 176 place count 152 transition count 202
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 252 place count 114 transition count 202
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 272 place count 104 transition count 192
Applied a total of 272 rules in 51 ms. Remains 104 /240 variables (removed 136) and now considering 192/328 (removed 136) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 104/240 places, 192/328 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 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 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Finished probabilistic random walk after 250245 steps, run visited all 3 properties in 760 ms. (steps per millisecond=329 )
Probabilistic random walk after 250245 steps, saw 50270 distinct states, run finished after 760 ms. (steps per millisecond=329 ) properties seen :3
FORMULA Peterson-PT-3-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 17538 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/560/inv_0_ --invariant=/tmp/560/inv_1_ --invariant=/tmp/560/inv_2_ --invariant=/tmp/560/inv_3_ --invariant=/tmp/560/inv_4_ --invariant=/tmp/560/inv_5_ --invariant=/tmp/560/inv_6_ --invariant=/tmp/560/inv_7_ --invariant=/tmp/560/inv_8_ --invariant=/tmp/560/inv_9_ --invariant=/tmp/560/inv_10_ --invariant=/tmp/560/inv_11_ --invariant=/tmp/560/inv_12_ --invariant=/tmp/560/inv_13_ --invariant=/tmp/560/inv_14_ --invariant=/tmp/560/inv_15_ --inv-par
FORMULA Peterson-PT-3-ReachabilityFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-ReachabilityFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-ReachabilityFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-ReachabilityFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-ReachabilityFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-ReachabilityFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-ReachabilityFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-ReachabilityFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-ReachabilityFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-ReachabilityFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-ReachabilityFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-ReachabilityFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-ReachabilityFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-ReachabilityFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-ReachabilityFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-ReachabilityFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679132881416

--------------------
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 Peterson-PT-3-ReachabilityFireability-00
rfs formula type EF
rfs formula formula --invariant=/tmp/560/inv_0_
rfs formula name Peterson-PT-3-ReachabilityFireability-01
rfs formula type EF
rfs formula formula --invariant=/tmp/560/inv_1_
rfs formula name Peterson-PT-3-ReachabilityFireability-02
rfs formula type EF
rfs formula formula --invariant=/tmp/560/inv_2_
rfs formula name Peterson-PT-3-ReachabilityFireability-03
rfs formula type AG
rfs formula formula --invariant=/tmp/560/inv_3_
rfs formula name Peterson-PT-3-ReachabilityFireability-04
rfs formula type AG
rfs formula formula --invariant=/tmp/560/inv_4_
rfs formula name Peterson-PT-3-ReachabilityFireability-05
rfs formula type EF
rfs formula formula --invariant=/tmp/560/inv_5_
rfs formula name Peterson-PT-3-ReachabilityFireability-06
rfs formula type EF
rfs formula formula --invariant=/tmp/560/inv_6_
rfs formula name Peterson-PT-3-ReachabilityFireability-07
rfs formula type EF
rfs formula formula --invariant=/tmp/560/inv_7_
rfs formula name Peterson-PT-3-ReachabilityFireability-08
rfs formula type AG
rfs formula formula --invariant=/tmp/560/inv_8_
rfs formula name Peterson-PT-3-ReachabilityFireability-09
rfs formula type AG
rfs formula formula --invariant=/tmp/560/inv_9_
rfs formula name Peterson-PT-3-ReachabilityFireability-10
rfs formula type AG
rfs formula formula --invariant=/tmp/560/inv_10_
rfs formula name Peterson-PT-3-ReachabilityFireability-11
rfs formula type EF
rfs formula formula --invariant=/tmp/560/inv_11_
rfs formula name Peterson-PT-3-ReachabilityFireability-12
rfs formula type AG
rfs formula formula --invariant=/tmp/560/inv_12_
rfs formula name Peterson-PT-3-ReachabilityFireability-13
rfs formula type AG
rfs formula formula --invariant=/tmp/560/inv_13_
rfs formula name Peterson-PT-3-ReachabilityFireability-14
rfs formula type AG
rfs formula formula --invariant=/tmp/560/inv_14_
rfs formula name Peterson-PT-3-ReachabilityFireability-15
rfs formula type EF
rfs formula formula --invariant=/tmp/560/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 244 places, 332 transitions and 1016 arcs
pnml2lts-sym: Petri net Peterson-PT-3 analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.010 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: 332->332 groups
pnml2lts-sym: Regrouping took 0.130 real 0.120 user 0.000 sys
pnml2lts-sym: state vector length is 244; there are 332 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/560/inv_6_) found at depth 0!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/560/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/560/inv_14_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/560/inv_13_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/560/inv_12_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/560/inv_9_) found at depth -1!
pnml2lts-sym:
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:
pnml2lts-sym: Invariant violation (/tmp/560/inv_3_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/560/inv_4_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/560/inv_5_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/560/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/560/inv_2_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 214871 group checks and 0 next state calls
pnml2lts-sym: reachability took 9.310 real 35.030 user 2.030 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.010 real 0.030 user 0.000 sys
pnml2lts-sym: state space has 3407946 states, 43031 nodes
pnml2lts-sym: group_next: 1724 nodes total
pnml2lts-sym: group_explored: 1016 nodes, 1004 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="Peterson-PT-3"
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 Peterson-PT-3, 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 r265-smll-167863540300615"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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