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.r233-tall-167856419000526.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 LeafsetExtension-PT-S64C2, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419000526
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 15K Feb 25 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 25 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 16:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 25 16:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 25 16:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14M 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 LeafsetExtension-PT-S64C2-ReachabilityCardinality-00
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-01
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-02
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-03
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-04
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-05
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-06
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-07
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-08
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-09
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-10
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-11
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-12
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-13
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-14
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679547087053

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=LeafsetExtension-PT-S64C2
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 04:51:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 04:51:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 04:51:29] [INFO ] Load time of PNML (sax parser for PT used): 490 ms
[2023-03-23 04:51:29] [INFO ] Transformed 21462 places.
[2023-03-23 04:51:29] [INFO ] Transformed 21129 transitions.
[2023-03-23 04:51:29] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 657 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 546 resets, run finished after 734 ms. (steps per millisecond=13 ) properties (out of 16) seen :1
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :1
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 21129 rows 21462 cols
[2023-03-23 04:51:33] [INFO ] Computed 333 place invariants in 2744 ms
[2023-03-23 04:51:39] [INFO ] [Real]Absence check using 67 positive place invariants in 87 ms returned sat
[2023-03-23 04:51:40] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 925 ms returned sat
[2023-03-23 04:51:58] [INFO ] After 17013ms SMT Verify possible using state equation in real domain returned unsat :1 sat :0 real:12
[2023-03-23 04:51:58] [INFO ] After 17055ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:12
[2023-03-23 04:51:58] [INFO ] After 25125ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:12
[2023-03-23 04:52:04] [INFO ] [Nat]Absence check using 67 positive place invariants in 63 ms returned sat
[2023-03-23 04:52:05] [INFO ] [Nat]Absence check using 67 positive and 266 generalized place invariants in 727 ms returned sat
[2023-03-23 04:52:23] [INFO ] After 16576ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :4
[2023-03-23 04:52:23] [INFO ] After 16579ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :4
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-23 04:52:23] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :4
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 31 out of 21462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Graph (complete) has 42457 edges and 21462 vertex of which 1392 are kept as prefixes of interest. Removing 20070 places using SCC suffix rule.41 ms
Discarding 20070 places :
Also discarding 11487 output transitions
Drop transitions removed 11487 transitions
Drop transitions removed 4246 transitions
Reduce isomorphic transitions removed 4246 transitions.
Drop transitions removed 539 transitions
Trivial Post-agglo rules discarded 539 transitions
Performed 539 trivial Post agglomeration. Transition count delta: 539
Iterating post reduction 0 with 4785 rules applied. Total rules applied 4786 place count 1392 transition count 4857
Reduce places removed 541 places and 0 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 558 rules applied. Total rules applied 5344 place count 851 transition count 4840
Reduce places removed 17 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 19 rules applied. Total rules applied 5363 place count 834 transition count 4838
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 5365 place count 832 transition count 4838
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 22 Pre rules applied. Total rules applied 5365 place count 832 transition count 4816
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 5409 place count 810 transition count 4816
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 5412 place count 810 transition count 4813
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 5415 place count 807 transition count 4813
Partial Free-agglomeration rule applied 494 times.
Drop transitions removed 494 transitions
Iterating global reduction 5 with 494 rules applied. Total rules applied 5909 place count 807 transition count 4813
Discarding 14 places :
Implicit places reduction removed 14 places
Iterating post reduction 5 with 14 rules applied. Total rules applied 5923 place count 793 transition count 4813
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 6 with 12 rules applied. Total rules applied 5935 place count 793 transition count 4801
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 5947 place count 781 transition count 4801
Applied a total of 5947 rules in 794 ms. Remains 781 /21462 variables (removed 20681) and now considering 4801/21129 (removed 16328) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 795 ms. Remains : 781/21462 places, 4801/21129 transitions.
Incomplete random walk after 10000 steps, including 1903 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 5) seen :3
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-23 04:52:24] [INFO ] Flow matrix only has 1261 transitions (discarded 3540 similar events)
// Phase 1: matrix 1261 rows 781 cols
[2023-03-23 04:52:24] [INFO ] Computed 2 place invariants in 17 ms
[2023-03-23 04:52:24] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 04:52:24] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-23 04:52:25] [INFO ] After 403ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 04:52:25] [INFO ] After 580ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 105 ms.
[2023-03-23 04:52:25] [INFO ] After 837ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 10 out of 781 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 781/781 places, 4801/4801 transitions.
Graph (complete) has 2360 edges and 781 vertex of which 405 are kept as prefixes of interest. Removing 376 places using SCC suffix rule.1 ms
Discarding 376 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Drop transitions removed 360 transitions
Reduce isomorphic transitions removed 360 transitions.
Iterating post reduction 0 with 360 rules applied. Total rules applied 361 place count 405 transition count 4429
Partial Free-agglomeration rule applied 32 times.
Drop transitions removed 32 transitions
Iterating global reduction 1 with 32 rules applied. Total rules applied 393 place count 405 transition count 4429
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 395 place count 403 transition count 4429
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 397 place count 403 transition count 4427
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 399 place count 401 transition count 4427
Applied a total of 399 rules in 173 ms. Remains 401 /781 variables (removed 380) and now considering 4427/4801 (removed 374) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 401/781 places, 4427/4801 transitions.
Incomplete random walk after 10000 steps, including 1951 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 38720 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{1=1}
Probabilistic random walk after 38720 steps, saw 14092 distinct states, run finished after 3002 ms. (steps per millisecond=12 ) properties seen :1
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
[2023-03-23 04:52:28] [INFO ] Flow matrix only has 528 transitions (discarded 3899 similar events)
// Phase 1: matrix 528 rows 401 cols
[2023-03-23 04:52:28] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-23 04:52:28] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 04:52:28] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 04:52:29] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 04:52:29] [INFO ] After 203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-23 04:52:29] [INFO ] After 331ms 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 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 4427/4427 transitions.
Graph (complete) has 980 edges and 401 vertex of which 297 are kept as prefixes of interest. Removing 104 places using SCC suffix rule.0 ms
Discarding 104 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 297 transition count 4324
Applied a total of 100 rules in 50 ms. Remains 297 /401 variables (removed 104) and now considering 4324/4427 (removed 103) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 297/401 places, 4324/4427 transitions.
Incomplete random walk after 10000 steps, including 1970 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished probabilistic random walk after 35940 steps, run visited all 1 properties in 2739 ms. (steps per millisecond=13 )
Probabilistic random walk after 35940 steps, saw 13361 distinct states, run finished after 2739 ms. (steps per millisecond=13 ) properties seen :1
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 63539 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/478/inv_0_ --invariant=/tmp/478/inv_1_ --invariant=/tmp/478/inv_2_ --invariant=/tmp/478/inv_3_ --invariant=/tmp/478/inv_4_ --invariant=/tmp/478/inv_5_ --invariant=/tmp/478/inv_6_ --invariant=/tmp/478/inv_7_ --invariant=/tmp/478/inv_8_ --invariant=/tmp/478/inv_9_ --invariant=/tmp/478/inv_10_ --invariant=/tmp/478/inv_11_ --invariant=/tmp/478/inv_12_ --invariant=/tmp/478/inv_13_ --invariant=/tmp/478/inv_14_ --invariant=/tmp/478/inv_15_ --inv-par
Could not compute solution for formula : LeafsetExtension-PT-S64C2-ReachabilityCardinality-00
Could not compute solution for formula : LeafsetExtension-PT-S64C2-ReachabilityCardinality-01
Could not compute solution for formula : LeafsetExtension-PT-S64C2-ReachabilityCardinality-02
Could not compute solution for formula : LeafsetExtension-PT-S64C2-ReachabilityCardinality-03
Could not compute solution for formula : LeafsetExtension-PT-S64C2-ReachabilityCardinality-04
Could not compute solution for formula : LeafsetExtension-PT-S64C2-ReachabilityCardinality-05
Could not compute solution for formula : LeafsetExtension-PT-S64C2-ReachabilityCardinality-06
Could not compute solution for formula : LeafsetExtension-PT-S64C2-ReachabilityCardinality-07
Could not compute solution for formula : LeafsetExtension-PT-S64C2-ReachabilityCardinality-08
Could not compute solution for formula : LeafsetExtension-PT-S64C2-ReachabilityCardinality-09
Could not compute solution for formula : LeafsetExtension-PT-S64C2-ReachabilityCardinality-10
Could not compute solution for formula : LeafsetExtension-PT-S64C2-ReachabilityCardinality-11
Could not compute solution for formula : LeafsetExtension-PT-S64C2-ReachabilityCardinality-12
Could not compute solution for formula : LeafsetExtension-PT-S64C2-ReachabilityCardinality-13
Could not compute solution for formula : LeafsetExtension-PT-S64C2-ReachabilityCardinality-14
Could not compute solution for formula : LeafsetExtension-PT-S64C2-ReachabilityCardinality-15

BK_STOP 1679550170319

--------------------
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 LeafsetExtension-PT-S64C2-ReachabilityCardinality-00
rfs formula type EF
rfs formula formula --invariant=/tmp/478/inv_0_
rfs formula name LeafsetExtension-PT-S64C2-ReachabilityCardinality-01
rfs formula type AG
rfs formula formula --invariant=/tmp/478/inv_1_
rfs formula name LeafsetExtension-PT-S64C2-ReachabilityCardinality-02
rfs formula type EF
rfs formula formula --invariant=/tmp/478/inv_2_
rfs formula name LeafsetExtension-PT-S64C2-ReachabilityCardinality-03
rfs formula type AG
rfs formula formula --invariant=/tmp/478/inv_3_
rfs formula name LeafsetExtension-PT-S64C2-ReachabilityCardinality-04
rfs formula type EF
rfs formula formula --invariant=/tmp/478/inv_4_
rfs formula name LeafsetExtension-PT-S64C2-ReachabilityCardinality-05
rfs formula type AG
rfs formula formula --invariant=/tmp/478/inv_5_
rfs formula name LeafsetExtension-PT-S64C2-ReachabilityCardinality-06
rfs formula type EF
rfs formula formula --invariant=/tmp/478/inv_6_
rfs formula name LeafsetExtension-PT-S64C2-ReachabilityCardinality-07
rfs formula type AG
rfs formula formula --invariant=/tmp/478/inv_7_
rfs formula name LeafsetExtension-PT-S64C2-ReachabilityCardinality-08
rfs formula type AG
rfs formula formula --invariant=/tmp/478/inv_8_
rfs formula name LeafsetExtension-PT-S64C2-ReachabilityCardinality-09
rfs formula type AG
rfs formula formula --invariant=/tmp/478/inv_9_
rfs formula name LeafsetExtension-PT-S64C2-ReachabilityCardinality-10
rfs formula type EF
rfs formula formula --invariant=/tmp/478/inv_10_
rfs formula name LeafsetExtension-PT-S64C2-ReachabilityCardinality-11
rfs formula type EF
rfs formula formula --invariant=/tmp/478/inv_11_
rfs formula name LeafsetExtension-PT-S64C2-ReachabilityCardinality-12
rfs formula type EF
rfs formula formula --invariant=/tmp/478/inv_12_
rfs formula name LeafsetExtension-PT-S64C2-ReachabilityCardinality-13
rfs formula type AG
rfs formula formula --invariant=/tmp/478/inv_13_
rfs formula name LeafsetExtension-PT-S64C2-ReachabilityCardinality-14
rfs formula type AG
rfs formula formula --invariant=/tmp/478/inv_14_
rfs formula name LeafsetExtension-PT-S64C2-ReachabilityCardinality-15
rfs formula type EF
rfs formula formula --invariant=/tmp/478/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 21462 places, 21129 transitions and 67740 arcs
pnml2lts-sym: Petri net gen analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.530 real 0.280 user 0.250 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: 21129->21129 groups
pnml2lts-sym: Regrouping took 552.170 real 550.600 user 1.470 sys
pnml2lts-sym: state vector length is 21462; there are 21129 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: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
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
MDD Unique table full, 268435456 of 268435456 buckets filled!

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="LeafsetExtension-PT-S64C2"
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 LeafsetExtension-PT-S64C2, 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 r233-tall-167856419000526"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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