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.r009-oct2-167813598100607.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 AutonomousCar-PT-05b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598100607
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 12:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 12:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 25 12:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 12:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 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 159K 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 AutonomousCar-PT-05b-ReachabilityFireability-00
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-01
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-02
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-03
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-04
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-05
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-06
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-07
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-08
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-09
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-10
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-11
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-12
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-13
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-14
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678637728365

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=AutonomousCar-PT-05b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:15:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:15:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:15:30] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2023-03-12 16:15:30] [INFO ] Transformed 255 places.
[2023-03-12 16:15:30] [INFO ] Transformed 490 transitions.
[2023-03-12 16:15:30] [INFO ] Found NUPN structural information;
[2023-03-12 16:15:30] [INFO ] Parsed PT model containing 255 places and 490 transitions and 2527 arcs in 137 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 11 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 16) seen :8
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :1
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 7) seen :1
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :1
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 5 properties.
// Phase 1: matrix 490 rows 255 cols
[2023-03-12 16:15:31] [INFO ] Computed 10 place invariants in 12 ms
[2023-03-12 16:15:32] [INFO ] After 335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 16:15:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-12 16:15:32] [INFO ] After 225ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2023-03-12 16:15:32] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 8 ms to minimize.
[2023-03-12 16:15:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2023-03-12 16:15:32] [INFO ] After 518ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 162 ms.
[2023-03-12 16:15:33] [INFO ] After 801ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 19 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 490/490 transitions.
Graph (trivial) has 202 edges and 255 vertex of which 4 / 255 are part of one of the 2 SCC in 6 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 759 edges and 253 vertex of which 246 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 97 rules applied. Total rules applied 99 place count 246 transition count 384
Reduce places removed 95 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 121 rules applied. Total rules applied 220 place count 151 transition count 358
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 15 rules applied. Total rules applied 235 place count 137 transition count 357
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 236 place count 136 transition count 357
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 236 place count 136 transition count 341
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 268 place count 120 transition count 341
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 292 place count 96 transition count 317
Iterating global reduction 4 with 24 rules applied. Total rules applied 316 place count 96 transition count 317
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 103 rules applied. Total rules applied 419 place count 96 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 420 place count 95 transition count 214
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 425 place count 90 transition count 193
Iterating global reduction 6 with 5 rules applied. Total rules applied 430 place count 90 transition count 193
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 4 rules applied. Total rules applied 434 place count 90 transition count 189
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 436 place count 89 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 437 place count 88 transition count 188
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 9 with 46 rules applied. Total rules applied 483 place count 65 transition count 165
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 485 place count 63 transition count 153
Iterating global reduction 9 with 2 rules applied. Total rules applied 487 place count 63 transition count 153
Free-agglomeration rule applied 8 times.
Iterating global reduction 9 with 8 rules applied. Total rules applied 495 place count 63 transition count 145
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 503 place count 55 transition count 145
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 505 place count 55 transition count 143
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 508 place count 55 transition count 143
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 509 place count 54 transition count 137
Iterating global reduction 10 with 1 rules applied. Total rules applied 510 place count 54 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 511 place count 53 transition count 136
Applied a total of 511 rules in 127 ms. Remains 53 /255 variables (removed 202) and now considering 136/490 (removed 354) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 53/255 places, 136/490 transitions.
Incomplete random walk after 10000 steps, including 356 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :1
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 136 rows 53 cols
[2023-03-12 16:15:33] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-12 16:15:33] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-12 16:15:33] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:15:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-12 16:15:33] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:15:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:15:33] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 16:15:33] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-12 16:15:33] [INFO ] After 119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 136/136 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 53 transition count 133
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 50 transition count 133
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 50 transition count 132
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 49 transition count 132
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 48 transition count 127
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 48 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 48 transition count 126
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 17 place count 45 transition count 123
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 42 transition count 120
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 27 place count 42 transition count 116
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 31 place count 38 transition count 116
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 37 transition count 115
Applied a total of 32 rules in 36 ms. Remains 37 /53 variables (removed 16) and now considering 115/136 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 37/53 places, 115/136 transitions.
Finished random walk after 3788 steps, including 54 resets, run visited all 1 properties in 12 ms. (steps per millisecond=315 )
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 3037 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/471/inv_0_ --invariant=/tmp/471/inv_1_ --invariant=/tmp/471/inv_2_ --invariant=/tmp/471/inv_3_ --invariant=/tmp/471/inv_4_ --invariant=/tmp/471/inv_5_ --invariant=/tmp/471/inv_6_ --invariant=/tmp/471/inv_7_ --invariant=/tmp/471/inv_8_ --invariant=/tmp/471/inv_9_ --invariant=/tmp/471/inv_10_ --invariant=/tmp/471/inv_11_ --invariant=/tmp/471/inv_12_ --invariant=/tmp/471/inv_13_ --invariant=/tmp/471/inv_14_ --invariant=/tmp/471/inv_15_ --inv-par
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678637761495

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name AutonomousCar-PT-05b-ReachabilityFireability-00
rfs formula type EF
rfs formula formula --invariant=/tmp/471/inv_0_
rfs formula name AutonomousCar-PT-05b-ReachabilityFireability-01
rfs formula type EF
rfs formula formula --invariant=/tmp/471/inv_1_
rfs formula name AutonomousCar-PT-05b-ReachabilityFireability-02
rfs formula type EF
rfs formula formula --invariant=/tmp/471/inv_2_
rfs formula name AutonomousCar-PT-05b-ReachabilityFireability-03
rfs formula type AG
rfs formula formula --invariant=/tmp/471/inv_3_
rfs formula name AutonomousCar-PT-05b-ReachabilityFireability-04
rfs formula type AG
rfs formula formula --invariant=/tmp/471/inv_4_
rfs formula name AutonomousCar-PT-05b-ReachabilityFireability-05
rfs formula type EF
rfs formula formula --invariant=/tmp/471/inv_5_
rfs formula name AutonomousCar-PT-05b-ReachabilityFireability-06
rfs formula type AG
rfs formula formula --invariant=/tmp/471/inv_6_
rfs formula name AutonomousCar-PT-05b-ReachabilityFireability-07
rfs formula type AG
rfs formula formula --invariant=/tmp/471/inv_7_
rfs formula name AutonomousCar-PT-05b-ReachabilityFireability-08
rfs formula type EF
rfs formula formula --invariant=/tmp/471/inv_8_
rfs formula name AutonomousCar-PT-05b-ReachabilityFireability-09
rfs formula type EF
rfs formula formula --invariant=/tmp/471/inv_9_
rfs formula name AutonomousCar-PT-05b-ReachabilityFireability-10
rfs formula type EF
rfs formula formula --invariant=/tmp/471/inv_10_
rfs formula name AutonomousCar-PT-05b-ReachabilityFireability-11
rfs formula type AG
rfs formula formula --invariant=/tmp/471/inv_11_
rfs formula name AutonomousCar-PT-05b-ReachabilityFireability-12
rfs formula type EF
rfs formula formula --invariant=/tmp/471/inv_12_
rfs formula name AutonomousCar-PT-05b-ReachabilityFireability-13
rfs formula type AG
rfs formula formula --invariant=/tmp/471/inv_13_
rfs formula name AutonomousCar-PT-05b-ReachabilityFireability-14
rfs formula type EF
rfs formula formula --invariant=/tmp/471/inv_14_
rfs formula name AutonomousCar-PT-05b-ReachabilityFireability-15
rfs formula type EF
rfs formula formula --invariant=/tmp/471/inv_15_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 255 places, 490 transitions and 2527 arcs
pnml2lts-sym: Petri net AutonomousCar-PT-05b analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.010 user 0.010 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: 490->490 groups
pnml2lts-sym: Regrouping took 0.130 real 0.120 user 0.000 sys
pnml2lts-sym: state vector length is 255; there are 490 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/471/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/471/inv_15_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/471/inv_3_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/471/inv_4_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/471/inv_5_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/471/inv_6_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/471/inv_7_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/471/inv_12_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/471/inv_11_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/471/inv_10_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/471/inv_8_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/471/inv_2_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/471/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 1828624 group checks and 0 next state calls
pnml2lts-sym: reachability took 26.950 real 107.540 user 0.060 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.030 real 0.110 user 0.000 sys
pnml2lts-sym: state space has 158000170058 states, 74679 nodes
pnml2lts-sym: group_next: 4265 nodes total
pnml2lts-sym: group_explored: 2518 nodes, 5796 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="AutonomousCar-PT-05b"
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 AutonomousCar-PT-05b, 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 r009-oct2-167813598100607"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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