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.r297-tall-167873951000838.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 QuasiCertifProtocol-COL-22, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873951000838
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 01:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 01:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 01:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 01:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 01:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 01:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 104K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679661280194

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=QuasiCertifProtocol-COL-22
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 12:34:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 12:34:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 12:34:42] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-24 12:34:42] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-24 12:34:43] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 827 ms
[2023-03-24 12:34:43] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1966 PT places and 356.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
[2023-03-24 12:34:43] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2023-03-24 12:34:43] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
[2023-03-24 12:34:43] [INFO ] Flatten gal took : 20 ms
[2023-03-24 12:34:43] [INFO ] Flatten gal took : 6 ms
Domain [tsid(23), tsid(23)] of place n9 breaks symmetries in sort tsid
[2023-03-24 12:34:43] [INFO ] Unfolded HLPN to a Petri net with 1966 places and 356 transitions 4323 arcs in 35 ms.
[2023-03-24 12:34:43] [INFO ] Unfolded 16 HLPN properties in 2 ms.
Incomplete random walk after 10000 steps, including 371 resets, run finished after 795 ms. (steps per millisecond=12 ) properties (out of 16) seen :1
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=37 ) 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 30 ms. (steps per millisecond=33 ) 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 3 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=13 ) 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
Interrupted probabilistic random walk after 323188 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{0=1, 4=1, 8=1, 10=1, 11=1}
Probabilistic random walk after 323188 steps, saw 54811 distinct states, run finished after 3008 ms. (steps per millisecond=107 ) properties seen :5
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 10 properties.
// Phase 1: matrix 356 rows 1966 cols
[2023-03-24 12:34:47] [INFO ] Computed 1611 place invariants in 90 ms
[2023-03-24 12:34:49] [INFO ] [Real]Absence check using 4 positive place invariants in 15 ms returned sat
[2023-03-24 12:34:49] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 314 ms returned sat
[2023-03-24 12:34:49] [INFO ] After 1210ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:9
[2023-03-24 12:34:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2023-03-24 12:34:50] [INFO ] [Nat]Absence check using 4 positive and 1607 generalized place invariants in 314 ms returned sat
[2023-03-24 12:35:05] [INFO ] After 15780ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :0
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1363 out of 1966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Graph (complete) has 16044 edges and 1966 vertex of which 1963 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.11 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 1963 transition count 354
Applied a total of 3 rules in 121 ms. Remains 1963 /1966 variables (removed 3) and now considering 354/356 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 1963/1966 places, 354/356 transitions.
Incomplete random walk after 10000 steps, including 371 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 444 ms. (steps per millisecond=22 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 593635 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :{}
Probabilistic random walk after 593635 steps, saw 88183 distinct states, run finished after 3005 ms. (steps per millisecond=197 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 354 rows 1963 cols
[2023-03-24 12:35:09] [INFO ] Computed 1610 place invariants in 47 ms
[2023-03-24 12:35:09] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 12:35:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2023-03-24 12:35:10] [INFO ] [Nat]Absence check using 1 positive and 1609 generalized place invariants in 339 ms returned sat
[2023-03-24 12:35:19] [INFO ] After 9755ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 1363 out of 1963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1963/1963 places, 354/354 transitions.
Applied a total of 0 rules in 40 ms. Remains 1963 /1963 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 1963/1963 places, 354/354 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1963/1963 places, 354/354 transitions.
Applied a total of 0 rules in 46 ms. Remains 1963 /1963 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-24 12:35:19] [INFO ] Invariant cache hit.
[2023-03-24 12:35:20] [INFO ] Implicit Places using invariants in 993 ms returned [1936]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 997 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1962/1963 places, 354/354 transitions.
Applied a total of 0 rules in 44 ms. Remains 1962 /1962 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1087 ms. Remains : 1962/1963 places, 354/354 transitions.
Incomplete random walk after 10000 steps, including 370 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 456 ms. (steps per millisecond=21 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 624535 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 624535 steps, saw 92404 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 354 rows 1962 cols
[2023-03-24 12:35:23] [INFO ] Computed 1609 place invariants in 32 ms
[2023-03-24 12:35:24] [INFO ] After 264ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 12:35:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-24 12:35:24] [INFO ] [Nat]Absence check using 1 positive and 1608 generalized place invariants in 279 ms returned sat
[2023-03-24 12:35:34] [INFO ] After 9644ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1363 out of 1962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1962/1962 places, 354/354 transitions.
Applied a total of 0 rules in 25 ms. Remains 1962 /1962 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 1962/1962 places, 354/354 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1962/1962 places, 354/354 transitions.
Applied a total of 0 rules in 22 ms. Remains 1962 /1962 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-24 12:35:34] [INFO ] Invariant cache hit.
[2023-03-24 12:35:35] [INFO ] Implicit Places using invariants in 1157 ms returned []
[2023-03-24 12:35:35] [INFO ] Invariant cache hit.
[2023-03-24 12:35:37] [INFO ] Implicit Places using invariants and state equation in 2670 ms returned []
Implicit Place search using SMT with State Equation took 3841 ms to find 0 implicit places.
[2023-03-24 12:35:37] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-24 12:35:37] [INFO ] Invariant cache hit.
[2023-03-24 12:35:38] [INFO ] Dead Transitions using invariants and state equation in 783 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4687 ms. Remains : 1962/1962 places, 354/354 transitions.
Applied a total of 0 rules in 30 ms. Remains 1962 /1962 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-24 12:35:38] [INFO ] Invariant cache hit.
[2023-03-24 12:35:39] [INFO ] After 266ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 12:35:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-24 12:35:39] [INFO ] [Nat]Absence check using 1 positive and 1608 generalized place invariants in 323 ms returned sat
[2023-03-24 12:35:48] [INFO ] After 9708ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2023-03-24 12:35:48] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-24 12:35:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1962 places, 354 transitions and 4290 arcs took 11 ms.
[2023-03-24 12:35:49] [INFO ] Flatten gal took : 117 ms
Total runtime 66868 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/506/inv_0_ --inv-par
Could not compute solution for formula : QuasiCertifProtocol-COL-22-ReachabilityCardinality-07

BK_STOP 1679663587087

--------------------
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 QuasiCertifProtocol-COL-22-ReachabilityCardinality-07
rfs formula type AG
rfs formula formula --invariant=/tmp/506/inv_0_
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 1962 places, 354 transitions and 4290 arcs
pnml2lts-sym: Petri net Document_unf analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 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: 354->351 groups
pnml2lts-sym: Regrouping took 0.960 real 0.960 user 0.010 sys
pnml2lts-sym: state vector length is 1962; there are 351 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
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

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="QuasiCertifProtocol-COL-22"
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 QuasiCertifProtocol-COL-22, 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 r297-tall-167873951000838"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-22.tgz
mv QuasiCertifProtocol-COL-22 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 ;