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-167863540100454.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 Parking-PT-864, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863540100454
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 5.8K Feb 26 16:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 26 16:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 15:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 15:30 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.3K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 17:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Feb 26 17:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 17:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 427K 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 Parking-PT-864-ReachabilityCardinality-00
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-01
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-02
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-03
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-04
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-05
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-06
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-07
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-08
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-09
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-10
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-11
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-12
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-13
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-14
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679022771810

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=Parking-PT-864
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-17 03:12:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 03:12:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 03:12:54] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2023-03-17 03:12:54] [INFO ] Transformed 1185 places.
[2023-03-17 03:12:54] [INFO ] Transformed 1697 transitions.
[2023-03-17 03:12:54] [INFO ] Found NUPN structural information;
[2023-03-17 03:12:54] [INFO ] Parsed PT model containing 1185 places and 1697 transitions and 5073 arcs in 317 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 33 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 688 transitions
Reduce redundant transitions removed 688 transitions.
FORMULA Parking-PT-864-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 38 resets, run finished after 695 ms. (steps per millisecond=14 ) properties (out of 11) seen :5
FORMULA Parking-PT-864-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1009 rows 1185 cols
[2023-03-17 03:12:56] [INFO ] Computed 280 place invariants in 41 ms
[2023-03-17 03:12:56] [INFO ] After 829ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 03:12:57] [INFO ] [Nat]Absence check using 272 positive place invariants in 127 ms returned sat
[2023-03-17 03:12:57] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-17 03:12:59] [INFO ] After 1442ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-17 03:12:59] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-17 03:13:00] [INFO ] After 1344ms SMT Verify possible using 248 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2023-03-17 03:13:02] [INFO ] Deduced a trap composed of 68 places in 88 ms of which 10 ms to minimize.
[2023-03-17 03:13:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2023-03-17 03:13:02] [INFO ] After 3315ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 1928 ms.
[2023-03-17 03:13:04] [INFO ] After 7726ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
FORMULA Parking-PT-864-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 174 ms.
Support contains 105 out of 1185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1185/1185 places, 1009/1009 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 1185 transition count 983
Reduce places removed 26 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 29 rules applied. Total rules applied 55 place count 1159 transition count 980
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 58 place count 1156 transition count 980
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 58 place count 1156 transition count 954
Deduced a syphon composed of 26 places in 3 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 110 place count 1130 transition count 954
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 118 place count 1122 transition count 946
Iterating global reduction 3 with 8 rules applied. Total rules applied 126 place count 1122 transition count 946
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 190 place count 1090 transition count 914
Free-agglomeration rule applied 170 times.
Iterating global reduction 3 with 170 rules applied. Total rules applied 360 place count 1090 transition count 744
Reduce places removed 170 places and 0 transitions.
Iterating post reduction 3 with 170 rules applied. Total rules applied 530 place count 920 transition count 744
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 534 place count 920 transition count 740
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 535 place count 920 transition count 740
Applied a total of 535 rules in 688 ms. Remains 920 /1185 variables (removed 265) and now considering 740/1009 (removed 269) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 689 ms. Remains : 920/1185 places, 740/1009 transitions.
Incomplete random walk after 10000 steps, including 30 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 5) seen :2
FORMULA Parking-PT-864-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 740 rows 920 cols
[2023-03-17 03:13:06] [INFO ] Computed 280 place invariants in 14 ms
[2023-03-17 03:13:06] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 03:13:06] [INFO ] [Nat]Absence check using 272 positive place invariants in 86 ms returned sat
[2023-03-17 03:13:06] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-17 03:13:07] [INFO ] After 877ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 03:13:07] [INFO ] State equation strengthened by 520 read => feed constraints.
[2023-03-17 03:13:08] [INFO ] After 1033ms SMT Verify possible using 520 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-17 03:13:09] [INFO ] After 1940ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1046 ms.
[2023-03-17 03:13:10] [INFO ] After 4269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA Parking-PT-864-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 22 ms.
Support contains 83 out of 920 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 920/920 places, 740/740 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 920 transition count 739
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 919 transition count 739
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 919 transition count 738
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 918 transition count 738
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 917 transition count 737
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 917 transition count 731
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 18 place count 911 transition count 731
Applied a total of 18 rules in 170 ms. Remains 911 /920 variables (removed 9) and now considering 731/740 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 911/920 places, 731/740 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 2) seen :1
FORMULA Parking-PT-864-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 731 rows 911 cols
[2023-03-17 03:13:11] [INFO ] Computed 280 place invariants in 13 ms
[2023-03-17 03:13:11] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 03:13:11] [INFO ] [Nat]Absence check using 272 positive place invariants in 86 ms returned sat
[2023-03-17 03:13:11] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-17 03:13:12] [INFO ] After 614ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 03:13:12] [INFO ] State equation strengthened by 530 read => feed constraints.
[2023-03-17 03:13:12] [INFO ] After 431ms SMT Verify possible using 530 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 03:13:13] [INFO ] After 835ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 707 ms.
[2023-03-17 03:13:13] [INFO ] After 2455ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 47 out of 911 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 911/911 places, 731/731 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 911 transition count 729
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 909 transition count 729
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 14 place count 909 transition count 719
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 24 place count 899 transition count 719
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 899 transition count 718
Applied a total of 25 rules in 112 ms. Remains 899 /911 variables (removed 12) and now considering 718/731 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 899/911 places, 718/731 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) 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 1) seen :0
Finished probabilistic random walk after 27927 steps, run visited all 1 properties in 408 ms. (steps per millisecond=68 )
Probabilistic random walk after 27927 steps, saw 26367 distinct states, run finished after 408 ms. (steps per millisecond=68 ) properties seen :1
FORMULA Parking-PT-864-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 20304 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/475/inv_0_ --invariant=/tmp/475/inv_1_ --invariant=/tmp/475/inv_2_ --invariant=/tmp/475/inv_3_ --invariant=/tmp/475/inv_4_ --invariant=/tmp/475/inv_5_ --invariant=/tmp/475/inv_6_ --invariant=/tmp/475/inv_7_ --invariant=/tmp/475/inv_8_ --invariant=/tmp/475/inv_9_ --invariant=/tmp/475/inv_10_ --invariant=/tmp/475/inv_11_ --invariant=/tmp/475/inv_12_ --invariant=/tmp/475/inv_13_ --invariant=/tmp/475/inv_14_ --invariant=/tmp/475/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393216 kB
MemFree: 14080000 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16099892 kB
Could not compute solution for formula : Parking-PT-864-ReachabilityCardinality-00
Could not compute solution for formula : Parking-PT-864-ReachabilityCardinality-01
Could not compute solution for formula : Parking-PT-864-ReachabilityCardinality-02
Could not compute solution for formula : Parking-PT-864-ReachabilityCardinality-03
Could not compute solution for formula : Parking-PT-864-ReachabilityCardinality-04
Could not compute solution for formula : Parking-PT-864-ReachabilityCardinality-05
Could not compute solution for formula : Parking-PT-864-ReachabilityCardinality-06
Could not compute solution for formula : Parking-PT-864-ReachabilityCardinality-07
Could not compute solution for formula : Parking-PT-864-ReachabilityCardinality-08
Could not compute solution for formula : Parking-PT-864-ReachabilityCardinality-09
Could not compute solution for formula : Parking-PT-864-ReachabilityCardinality-10
Could not compute solution for formula : Parking-PT-864-ReachabilityCardinality-11
Could not compute solution for formula : Parking-PT-864-ReachabilityCardinality-12
Could not compute solution for formula : Parking-PT-864-ReachabilityCardinality-13
Could not compute solution for formula : Parking-PT-864-ReachabilityCardinality-14
Could not compute solution for formula : Parking-PT-864-ReachabilityCardinality-15

BK_STOP 1679026367070

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023
rfs formula name Parking-PT-864-ReachabilityCardinality-00
rfs formula type AG
rfs formula formula --invariant=/tmp/475/inv_0_
rfs formula name Parking-PT-864-ReachabilityCardinality-01
rfs formula type AG
rfs formula formula --invariant=/tmp/475/inv_1_
rfs formula name Parking-PT-864-ReachabilityCardinality-02
rfs formula type AG
rfs formula formula --invariant=/tmp/475/inv_2_
rfs formula name Parking-PT-864-ReachabilityCardinality-03
rfs formula type AG
rfs formula formula --invariant=/tmp/475/inv_3_
rfs formula name Parking-PT-864-ReachabilityCardinality-04
rfs formula type EF
rfs formula formula --invariant=/tmp/475/inv_4_
rfs formula name Parking-PT-864-ReachabilityCardinality-05
rfs formula type AG
rfs formula formula --invariant=/tmp/475/inv_5_
rfs formula name Parking-PT-864-ReachabilityCardinality-06
rfs formula type AG
rfs formula formula --invariant=/tmp/475/inv_6_
rfs formula name Parking-PT-864-ReachabilityCardinality-07
rfs formula type AG
rfs formula formula --invariant=/tmp/475/inv_7_
rfs formula name Parking-PT-864-ReachabilityCardinality-08
rfs formula type EF
rfs formula formula --invariant=/tmp/475/inv_8_
rfs formula name Parking-PT-864-ReachabilityCardinality-09
rfs formula type AG
rfs formula formula --invariant=/tmp/475/inv_9_
rfs formula name Parking-PT-864-ReachabilityCardinality-10
rfs formula type AG
rfs formula formula --invariant=/tmp/475/inv_10_
rfs formula name Parking-PT-864-ReachabilityCardinality-11
rfs formula type AG
rfs formula formula --invariant=/tmp/475/inv_11_
rfs formula name Parking-PT-864-ReachabilityCardinality-12
rfs formula type EF
rfs formula formula --invariant=/tmp/475/inv_12_
rfs formula name Parking-PT-864-ReachabilityCardinality-13
rfs formula type AG
rfs formula formula --invariant=/tmp/475/inv_13_
rfs formula name Parking-PT-864-ReachabilityCardinality-14
rfs formula type EF
rfs formula formula --invariant=/tmp/475/inv_14_
rfs formula name Parking-PT-864-ReachabilityCardinality-15
rfs formula type AG
rfs formula formula --invariant=/tmp/475/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 1185 places, 1697 transitions and 5073 arcs
pnml2lts-sym: Petri net Parking-PT-864 analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.020 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: 1697->1009 groups
pnml2lts-sym: Regrouping took 1.720 real 1.710 user 0.000 sys
pnml2lts-sym: state vector length is 1185; there are 1009 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
Killing (15) : 481
Killing (9) : 481

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="Parking-PT-864"
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 Parking-PT-864, 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 r265-smll-167863540100454"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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