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-167873950300314.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-PT-03, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950300314
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 10K Feb 26 12:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 12:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 12:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 12:07 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 5.8K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 26 12:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 12:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Feb 26 12:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K Feb 26 12:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 87K 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-PT-03-CTLFireability-00
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-01
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-02
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-03
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-04
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-05
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-06
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-07
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-08
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-09
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-10
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-11
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-12
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-13
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-14
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679492783131

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-PT-03
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 13:46:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 13:46:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 13:46:24] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2023-03-22 13:46:24] [INFO ] Transformed 30 places.
[2023-03-22 13:46:24] [INFO ] Transformed 84 transitions.
[2023-03-22 13:46:24] [INFO ] Parsed PT model containing 30 places and 84 transitions and 564 arcs in 106 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Initial state reduction rules removed 6 formulas.
[2023-03-22 13:46:24] [INFO ] Reduced 5 identical enabling conditions.
[2023-03-22 13:46:24] [INFO ] Reduced 5 identical enabling conditions.
[2023-03-22 13:46:24] [INFO ] Reduced 5 identical enabling conditions.
[2023-03-22 13:46:24] [INFO ] Reduced 5 identical enabling conditions.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
FORMULA PhilosophersDyn-PT-03-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 81/81 transitions.
Applied a total of 0 rules in 10 ms. Remains 30 /30 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-22 13:46:25] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2023-03-22 13:46:25] [INFO ] Computed 11 place invariants in 14 ms
[2023-03-22 13:46:25] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 30 transitions.
Found 30 dead transitions using SMT.
Drop transitions removed 30 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 30 transitions.
// Phase 1: matrix 51 rows 30 cols
[2023-03-22 13:46:25] [INFO ] Computed 11 place invariants in 5 ms
[2023-03-22 13:46:25] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-22 13:46:25] [INFO ] Invariant cache hit.
[2023-03-22 13:46:25] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 13:46:25] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/30 places, 51/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 386 ms. Remains : 30/30 places, 51/81 transitions.
Support contains 30 out of 30 places after structural reductions.
[2023-03-22 13:46:25] [INFO ] Flatten gal took : 28 ms
[2023-03-22 13:46:25] [INFO ] Flatten gal took : 16 ms
[2023-03-22 13:46:25] [INFO ] Input system was already deterministic with 51 transitions.
Incomplete random walk after 10000 steps, including 1449 resets, run finished after 491 ms. (steps per millisecond=20 ) properties (out of 37) seen :26
Incomplete Best-First random walk after 10001 steps, including 238 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 625 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 625 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 625 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 625 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 235 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 229 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 625 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 235 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 625 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-22 13:46:27] [INFO ] Invariant cache hit.
[2023-03-22 13:46:35] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-22 13:46:35] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-22 13:46:35] [INFO ] After 3675ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-22 13:46:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 13:46:35] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-22 13:46:35] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :4
[2023-03-22 13:46:35] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 13:46:35] [INFO ] After 24ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :7 sat :4
[2023-03-22 13:46:35] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :4
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-22 13:46:35] [INFO ] After 242ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :4
Fused 11 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 12 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 6 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 13:46:35] [INFO ] Invariant cache hit.
[2023-03-22 13:46:35] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 30/30 places, 51/51 transitions.
Incomplete random walk after 10000 steps, including 1412 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 625 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 625 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 625 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 625 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Probably explored full state space saw : 325 states, properties seen :0
Probabilistic random walk after 1090 steps, saw 325 distinct states, run finished after 19 ms. (steps per millisecond=57 ) properties seen :0
Explored full state space saw : 325 states, properties seen :0
Exhaustive walk after 1090 steps, saw 325 distinct states, run finished after 14 ms. (steps per millisecond=77 ) properties seen :0
Successfully simplified 11 atomic propositions for a total of 10 simplifications.
FORMULA PhilosophersDyn-PT-03-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 13:46:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-22 13:46:35] [INFO ] Flatten gal took : 15 ms
FORMULA PhilosophersDyn-PT-03-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 13:46:36] [INFO ] Flatten gal took : 9 ms
[2023-03-22 13:46:36] [INFO ] Input system was already deterministic with 51 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 13:46:36] [INFO ] Invariant cache hit.
[2023-03-22 13:46:36] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 30/30 places, 51/51 transitions.
[2023-03-22 13:46:36] [INFO ] Flatten gal took : 6 ms
[2023-03-22 13:46:36] [INFO ] Flatten gal took : 4 ms
[2023-03-22 13:46:36] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 13:46:36] [INFO ] Invariant cache hit.
[2023-03-22 13:46:36] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53 ms. Remains : 30/30 places, 51/51 transitions.
[2023-03-22 13:46:36] [INFO ] Flatten gal took : 5 ms
[2023-03-22 13:46:36] [INFO ] Flatten gal took : 5 ms
[2023-03-22 13:46:36] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 13:46:36] [INFO ] Invariant cache hit.
[2023-03-22 13:46:36] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 30/30 places, 51/51 transitions.
[2023-03-22 13:46:36] [INFO ] Flatten gal took : 4 ms
[2023-03-22 13:46:36] [INFO ] Flatten gal took : 4 ms
[2023-03-22 13:46:36] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 13:46:36] [INFO ] Invariant cache hit.
[2023-03-22 13:46:36] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 30/30 places, 51/51 transitions.
[2023-03-22 13:46:36] [INFO ] Flatten gal took : 5 ms
[2023-03-22 13:46:36] [INFO ] Flatten gal took : 6 ms
[2023-03-22 13:46:36] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 13:46:36] [INFO ] Invariant cache hit.
[2023-03-22 13:46:36] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 30/30 places, 51/51 transitions.
[2023-03-22 13:46:36] [INFO ] Flatten gal took : 5 ms
[2023-03-22 13:46:36] [INFO ] Flatten gal took : 6 ms
[2023-03-22 13:46:36] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 13:46:36] [INFO ] Invariant cache hit.
[2023-03-22 13:46:36] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 30/30 places, 51/51 transitions.
[2023-03-22 13:46:36] [INFO ] Flatten gal took : 4 ms
[2023-03-22 13:46:36] [INFO ] Flatten gal took : 5 ms
[2023-03-22 13:46:36] [INFO ] Input system was already deterministic with 51 transitions.
[2023-03-22 13:46:36] [INFO ] Flatten gal took : 7 ms
[2023-03-22 13:46:36] [INFO ] Flatten gal took : 7 ms
[2023-03-22 13:46:36] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2023-03-22 13:46:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 51 transitions and 321 arcs took 0 ms.
Total runtime 11680 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 --ctl=/tmp/485/ctl_0_ --ctl=/tmp/485/ctl_1_ --ctl=/tmp/485/ctl_2_ --ctl=/tmp/485/ctl_3_ --ctl=/tmp/485/ctl_4_ --ctl=/tmp/485/ctl_5_ --mu-par --mu-opt
FORMULA PhilosophersDyn-PT-03-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA PhilosophersDyn-PT-03-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA PhilosophersDyn-PT-03-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA PhilosophersDyn-PT-03-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA PhilosophersDyn-PT-03-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA PhilosophersDyn-PT-03-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679492811928

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2023
ctl formula name PhilosophersDyn-PT-03-CTLFireability-00
ctl formula formula --ctl=/tmp/485/ctl_0_
ctl formula name PhilosophersDyn-PT-03-CTLFireability-01
ctl formula formula --ctl=/tmp/485/ctl_1_
ctl formula name PhilosophersDyn-PT-03-CTLFireability-02
ctl formula formula --ctl=/tmp/485/ctl_2_
ctl formula name PhilosophersDyn-PT-03-CTLFireability-04
ctl formula formula --ctl=/tmp/485/ctl_3_
ctl formula name PhilosophersDyn-PT-03-CTLFireability-06
ctl formula formula --ctl=/tmp/485/ctl_4_
ctl formula name PhilosophersDyn-PT-03-CTLFireability-08
ctl formula formula --ctl=/tmp/485/ctl_5_
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 30 places, 51 transitions and 321 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 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: 51->51 groups
pnml2lts-sym: Regrouping took 0.010 real 0.010 user 0.000 sys
pnml2lts-sym: state vector length is 30; there are 51 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: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: Exploration took 1464 group checks and 0 next state calls
pnml2lts-sym: reachability took 0.040 real 0.120 user 0.030 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state space has 325 states, 659 nodes
pnml2lts-sym: Formula /tmp/485/ctl_1_ holds for the initial state
pnml2lts-sym: Formula /tmp/485/ctl_5_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/485/ctl_0_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/485/ctl_2_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/485/ctl_3_ holds for the initial state
pnml2lts-sym: Formula /tmp/485/ctl_4_ does not hold for the initial state
pnml2lts-sym: group_next: 504 nodes total
pnml2lts-sym: group_explored: 1069 nodes, 1074 short vectors total
pnml2lts-sym: max token count: 1

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PhilosophersDyn-PT-03"
export BK_EXAMINATION="CTLFireability"
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-PT-03, examination is CTLFireability"
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-167873950300314"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-03.tgz
mv PhilosophersDyn-PT-03 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;