fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r297-tall-167873950200294
Last Updated
May 14, 2023

About the Execution of LTSMin+red for PhilosophersDyn-COL-20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4878.428 252055.00 313080.00 904.60 TFTF??T??TFTTTFT normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.8K Feb 26 13:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 13:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 13:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 13:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 14:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Feb 26 14:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 14:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 14:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:34 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 32K 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 PhilosophersDyn-COL-20-ReachabilityCardinality-00
FORMULA_NAME PhilosophersDyn-COL-20-ReachabilityCardinality-01
FORMULA_NAME PhilosophersDyn-COL-20-ReachabilityCardinality-02
FORMULA_NAME PhilosophersDyn-COL-20-ReachabilityCardinality-03
FORMULA_NAME PhilosophersDyn-COL-20-ReachabilityCardinality-04
FORMULA_NAME PhilosophersDyn-COL-20-ReachabilityCardinality-05
FORMULA_NAME PhilosophersDyn-COL-20-ReachabilityCardinality-06
FORMULA_NAME PhilosophersDyn-COL-20-ReachabilityCardinality-07
FORMULA_NAME PhilosophersDyn-COL-20-ReachabilityCardinality-08
FORMULA_NAME PhilosophersDyn-COL-20-ReachabilityCardinality-09
FORMULA_NAME PhilosophersDyn-COL-20-ReachabilityCardinality-10
FORMULA_NAME PhilosophersDyn-COL-20-ReachabilityCardinality-11
FORMULA_NAME PhilosophersDyn-COL-20-ReachabilityCardinality-12
FORMULA_NAME PhilosophersDyn-COL-20-ReachabilityCardinality-13
FORMULA_NAME PhilosophersDyn-COL-20-ReachabilityCardinality-14
FORMULA_NAME PhilosophersDyn-COL-20-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679485627345

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=PhilosophersDyn-COL-20
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 11:47:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 11:47:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 11:47:09] [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-22 11:47:09] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 11:47:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 504 ms
[2023-03-22 11:47:09] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 540 PT places and 17240.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
[2023-03-22 11:47:10] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions 33 arcs in 6 ms.
[2023-03-22 11:47:10] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
[2023-03-22 11:47:10] [INFO ] Flatten gal took : 16 ms
[2023-03-22 11:47:10] [INFO ] Flatten gal took : 3 ms
Domain [Philosopher(20), Philosopher(20)] of place Neighbourhood breaks symmetries in sort Philosopher
[2023-03-22 11:47:10] [INFO ] Unfolded HLPN to a Petri net with 540 places and 17220 transitions 140780 arcs in 281 ms.
[2023-03-22 11:47:10] [INFO ] Unfolded 16 HLPN properties in 2 ms.
Ensure Unique test removed 190 transitions
Reduce redundant transitions removed 190 transitions.
Incomplete random walk after 10000 steps, including 1138 resets, run finished after 1167 ms. (steps per millisecond=8 ) properties (out of 16) seen :2
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 966 ms. (steps per millisecond=10 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 387 ms. (steps per millisecond=25 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-22 11:47:14] [INFO ] Flow matrix only has 15510 transitions (discarded 1520 similar events)
// Phase 1: matrix 15510 rows 540 cols
[2023-03-22 11:47:15] [INFO ] Computed 79 place invariants in 850 ms
[2023-03-22 11:47:18] [INFO ] [Real]Absence check using 60 positive place invariants in 17 ms returned sat
[2023-03-22 11:47:19] [INFO ] [Real]Absence check using 60 positive and 19 generalized place invariants in 29 ms returned sat
[2023-03-22 11:47:25] [INFO ] After 6503ms SMT Verify possible using state equation in real domain returned unsat :6 sat :1 real:7
[2023-03-22 11:47:25] [INFO ] State equation strengthened by 8060 read => feed constraints.
[2023-03-22 11:47:31] [INFO ] After 5374ms SMT Verify possible using 8060 Read/Feed constraints in real domain returned unsat :6 sat :0 real:8
[2023-03-22 11:47:31] [INFO ] After 12905ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0 real:8
[2023-03-22 11:47:31] [INFO ] [Nat]Absence check using 60 positive place invariants in 19 ms returned sat
[2023-03-22 11:47:31] [INFO ] [Nat]Absence check using 60 positive and 19 generalized place invariants in 23 ms returned sat
[2023-03-22 11:47:43] [INFO ] After 12175ms SMT Verify possible using state equation in natural domain returned unsat :10 sat :4
[2023-03-22 11:47:51] [INFO ] After 7729ms SMT Verify possible using 8060 Read/Feed constraints in natural domain returned unsat :10 sat :4
[2023-03-22 11:47:56] [INFO ] After 12469ms SMT Verify possible using trap constraints in natural domain returned unsat :10 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-22 11:47:56] [INFO ] After 25052ms SMT Verify possible using all constraints in natural domain returned unsat :10 sat :3
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 540 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 17030/17030 transitions.
Applied a total of 0 rules in 2551 ms. Remains 540 /540 variables (removed 0) and now considering 17030/17030 (removed 0) transitions.
[2023-03-22 11:47:59] [INFO ] Flow matrix only has 15510 transitions (discarded 1520 similar events)
[2023-03-22 11:47:59] [INFO ] Invariant cache hit.
[2023-03-22 11:48:06] [INFO ] Dead Transitions using invariants and state equation in 6990 ms found 1560 transitions.
Found 1560 dead transitions using SMT.
Drop transitions removed 1560 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1560 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 540/540 places, 15470/17030 transitions.
Applied a total of 0 rules in 1824 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11377 ms. Remains : 540/540 places, 15470/17030 transitions.
Incomplete random walk after 10000 steps, including 1143 resets, run finished after 641 ms. (steps per millisecond=15 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 41041 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 41041 steps, saw 11400 distinct states, run finished after 3002 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 15470 rows 540 cols
[2023-03-22 11:48:13] [INFO ] Computed 79 place invariants in 1753 ms
[2023-03-22 11:48:14] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-22 11:48:14] [INFO ] [Real]Absence check using 15 positive and 64 generalized place invariants in 51 ms returned sat
[2023-03-22 11:48:18] [INFO ] After 5013ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 11:48:19] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-22 11:48:19] [INFO ] [Nat]Absence check using 15 positive and 64 generalized place invariants in 47 ms returned sat
[2023-03-22 11:48:27] [INFO ] After 8380ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 11:48:28] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-22 11:48:44] [INFO ] After 15946ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 11:48:44] [INFO ] After 15948ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-22 11:48:44] [INFO ] After 25057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 175 ms.
Support contains 540 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 1836 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1837 ms. Remains : 540/540 places, 15470/15470 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 1833 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-22 11:48:47] [INFO ] Invariant cache hit.
[2023-03-22 11:48:48] [INFO ] Implicit Places using invariants in 134 ms returned []
Implicit Place search using SMT only with invariants took 136 ms to find 0 implicit places.
[2023-03-22 11:48:48] [INFO ] Invariant cache hit.
[2023-03-22 11:48:54] [INFO ] Dead Transitions using invariants and state equation in 6564 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8536 ms. Remains : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 663 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-22 11:48:55] [INFO ] Invariant cache hit.
[2023-03-22 11:48:55] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-22 11:48:55] [INFO ] [Real]Absence check using 15 positive and 64 generalized place invariants in 50 ms returned sat
[2023-03-22 11:49:00] [INFO ] After 4936ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 11:49:00] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-22 11:49:00] [INFO ] [Nat]Absence check using 15 positive and 64 generalized place invariants in 47 ms returned sat
[2023-03-22 11:49:08] [INFO ] After 8128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 11:49:11] [INFO ] After 10283ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1516 ms.
[2023-03-22 11:49:12] [INFO ] After 12040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-22 11:49:12] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 16 ms.
[2023-03-22 11:49:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 540 places, 15470 transitions and 120800 arcs took 80 ms.
[2023-03-22 11:49:13] [INFO ] Flatten gal took : 1015 ms
Total runtime 124482 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/496/inv_0_ --invariant=/tmp/496/inv_1_ --invariant=/tmp/496/inv_2_ --invariant=/tmp/496/inv_3_ --inv-par
Could not compute solution for formula : PhilosophersDyn-COL-20-ReachabilityCardinality-04
Could not compute solution for formula : PhilosophersDyn-COL-20-ReachabilityCardinality-05
Could not compute solution for formula : PhilosophersDyn-COL-20-ReachabilityCardinality-07
Could not compute solution for formula : PhilosophersDyn-COL-20-ReachabilityCardinality-08

BK_STOP 1679485879400

--------------------
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 PhilosophersDyn-COL-20-ReachabilityCardinality-04
rfs formula type EF
rfs formula formula --invariant=/tmp/496/inv_0_
rfs formula name PhilosophersDyn-COL-20-ReachabilityCardinality-05
rfs formula type EF
rfs formula formula --invariant=/tmp/496/inv_1_
rfs formula name PhilosophersDyn-COL-20-ReachabilityCardinality-07
rfs formula type AG
rfs formula formula --invariant=/tmp/496/inv_2_
rfs formula name PhilosophersDyn-COL-20-ReachabilityCardinality-08
rfs formula type AG
rfs formula formula --invariant=/tmp/496/inv_3_
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 540 places, 15470 transitions and 120800 arcs
pnml2lts-sym: Petri net PhilosophersDyn_COL_20_unf analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.270 real 0.230 user 0.040 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: 15470->15470 groups
pnml2lts-sym: Regrouping took 112.030 real 111.990 user 0.040 sys
pnml2lts-sym: state vector length is 540; there are 15470 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: got initial state

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="PhilosophersDyn-COL-20"
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 PhilosophersDyn-COL-20, 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-167873950200294"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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