Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813695100710.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is CANInsertWithFailure-PT-010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695100710
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 9.9K Feb 26 00:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 00:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 23:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 23:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 00:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 00:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 00:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 00:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 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 698K 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 CANInsertWithFailure-PT-010-ReachabilityCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678658648005

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=CANInsertWithFailure-PT-010
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 22:04:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 22:04:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 22:04:10] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2023-03-12 22:04:10] [INFO ] Transformed 324 places.
[2023-03-12 22:04:10] [INFO ] Transformed 660 transitions.
[2023-03-12 22:04:10] [INFO ] Parsed PT model containing 324 places and 660 transitions and 1800 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 43 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 16) seen :12
FORMULA CANInsertWithFailure-PT-010-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 660 rows 324 cols
[2023-03-12 22:04:10] [INFO ] Computed 13 place invariants in 22 ms
[2023-03-12 22:04:10] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 22:04:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-12 22:04:11] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-12 22:04:11] [INFO ] After 278ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-12 22:04:11] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-12 22:04:11] [INFO ] After 198ms SMT Verify possible using 190 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-12 22:04:11] [INFO ] After 422ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 245 ms.
[2023-03-12 22:04:12] [INFO ] After 1067ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA CANInsertWithFailure-PT-010-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 67 ms.
Support contains 62 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 660/660 transitions.
Graph (complete) has 951 edges and 324 vertex of which 323 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 323 transition count 630
Reduce places removed 30 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 42 rules applied. Total rules applied 73 place count 293 transition count 618
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 85 place count 281 transition count 618
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 85 place count 281 transition count 613
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 95 place count 276 transition count 613
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 139 place count 254 transition count 591
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 156 place count 254 transition count 574
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 160 place count 254 transition count 570
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 164 place count 250 transition count 570
Partial Free-agglomeration rule applied 133 times.
Drop transitions removed 133 transitions
Iterating global reduction 4 with 133 rules applied. Total rules applied 297 place count 250 transition count 570
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 4 with 62 rules applied. Total rules applied 359 place count 250 transition count 570
Applied a total of 359 rules in 179 ms. Remains 250 /324 variables (removed 74) and now considering 570/660 (removed 90) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 250/324 places, 570/660 transitions.
Incomplete random walk after 10000 steps, including 77 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 648140 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 648140 steps, saw 101546 distinct states, run finished after 3004 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 570 rows 250 cols
[2023-03-12 22:04:15] [INFO ] Computed 12 place invariants in 5 ms
[2023-03-12 22:04:15] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 22:04:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-12 22:04:15] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-12 22:04:16] [INFO ] After 287ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 22:04:16] [INFO ] State equation strengthened by 247 read => feed constraints.
[2023-03-12 22:04:16] [INFO ] After 191ms SMT Verify possible using 247 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 22:04:16] [INFO ] After 471ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 178 ms.
[2023-03-12 22:04:16] [INFO ] After 1065ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 33 ms.
Support contains 62 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 570/570 transitions.
Applied a total of 0 rules in 18 ms. Remains 250 /250 variables (removed 0) and now considering 570/570 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 250/250 places, 570/570 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 570/570 transitions.
Applied a total of 0 rules in 16 ms. Remains 250 /250 variables (removed 0) and now considering 570/570 (removed 0) transitions.
[2023-03-12 22:04:16] [INFO ] Invariant cache hit.
[2023-03-12 22:04:17] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-12 22:04:17] [INFO ] Invariant cache hit.
[2023-03-12 22:04:17] [INFO ] State equation strengthened by 247 read => feed constraints.
[2023-03-12 22:04:17] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
[2023-03-12 22:04:17] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-12 22:04:17] [INFO ] Invariant cache hit.
[2023-03-12 22:04:17] [INFO ] Dead Transitions using invariants and state equation in 275 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 961 ms. Remains : 250/250 places, 570/570 transitions.
Graph (trivial) has 169 edges and 250 vertex of which 12 / 250 are part of one of the 1 SCC in 2 ms
Free SCC test removed 11 places
Drop transitions removed 21 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 26 transitions.
Graph (complete) has 660 edges and 239 vertex of which 226 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 0 output transitions
Drop transitions removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 226 transition count 502
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 44 place count 226 transition count 500
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 224 transition count 500
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 220 transition count 492
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 220 transition count 492
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 219 transition count 491
Drop transitions removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 1 with 45 rules applied. Total rules applied 103 place count 219 transition count 446
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 19 rules applied. Total rules applied 122 place count 219 transition count 427
Reduce places removed 19 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 22 rules applied. Total rules applied 144 place count 200 transition count 424
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 147 place count 197 transition count 424
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 147 place count 197 transition count 416
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 163 place count 189 transition count 416
Free-agglomeration rule applied 59 times with reduction of 7 identical transitions.
Iterating global reduction 4 with 59 rules applied. Total rules applied 222 place count 189 transition count 350
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 4 with 106 rules applied. Total rules applied 328 place count 130 transition count 303
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 5 with 19 rules applied. Total rules applied 347 place count 130 transition count 284
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 350 place count 130 transition count 284
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 357 place count 127 transition count 280
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 360 place count 127 transition count 277
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 6 with 18 rules applied. Total rules applied 378 place count 127 transition count 277
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 379 place count 127 transition count 277
Applied a total of 379 rules in 95 ms. Remains 127 /250 variables (removed 123) and now considering 277/570 (removed 293) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 277 rows 127 cols
[2023-03-12 22:04:17] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 22:04:18] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 22:04:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 22:04:18] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 22:04:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 22:04:18] [INFO ] After 66ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 22:04:18] [INFO ] After 188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-12 22:04:18] [INFO ] After 506ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-12 22:04:18] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-12 22:04:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 250 places, 570 transitions and 1849 arcs took 7 ms.
[2023-03-12 22:04:18] [INFO ] Flatten gal took : 106 ms
Total runtime 8987 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/505/inv_0_ --invariant=/tmp/505/inv_1_ --invariant=/tmp/505/inv_2_ --inv-par
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393340 kB
MemFree: 15163684 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16099008 kB
Could not compute solution for formula : CANInsertWithFailure-PT-010-ReachabilityCardinality-07
Could not compute solution for formula : CANInsertWithFailure-PT-010-ReachabilityCardinality-12
Could not compute solution for formula : CANInsertWithFailure-PT-010-ReachabilityCardinality-14

BK_STOP 1678662230312

--------------------
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 CANInsertWithFailure-PT-010-ReachabilityCardinality-07
rfs formula type AG
rfs formula formula --invariant=/tmp/505/inv_0_
rfs formula name CANInsertWithFailure-PT-010-ReachabilityCardinality-12
rfs formula type AG
rfs formula formula --invariant=/tmp/505/inv_1_
rfs formula name CANInsertWithFailure-PT-010-ReachabilityCardinality-14
rfs formula type EF
rfs formula formula --invariant=/tmp/505/inv_2_
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 250 places, 570 transitions and 1849 arcs
pnml2lts-sym: Petri net gen analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 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: 570->570 groups
pnml2lts-sym: Regrouping took 0.210 real 0.200 user 0.000 sys
pnml2lts-sym: state vector length is 250; there are 570 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
Killing (15) : 511
Killing (9) : 511

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="CANInsertWithFailure-PT-010"
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 CANInsertWithFailure-PT-010, 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 r041-tajo-167813695100710"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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