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

About the Execution of LTSMin+red for Referendum-PT-0020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3402.936 193106.00 759027.00 271.40 FFFFFTFTTFFFFFTT 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.r329-tall-167889202100482.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 Referendum-PT-0020, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-167889202100482
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 30K Feb 26 17:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 191K Feb 26 17:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 17:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 44K Feb 26 17:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 267K Feb 26 17:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 41K Feb 26 17:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 340K Feb 26 17:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 23K 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 Referendum-PT-0020-CTLFireability-00
FORMULA_NAME Referendum-PT-0020-CTLFireability-01
FORMULA_NAME Referendum-PT-0020-CTLFireability-02
FORMULA_NAME Referendum-PT-0020-CTLFireability-03
FORMULA_NAME Referendum-PT-0020-CTLFireability-04
FORMULA_NAME Referendum-PT-0020-CTLFireability-05
FORMULA_NAME Referendum-PT-0020-CTLFireability-06
FORMULA_NAME Referendum-PT-0020-CTLFireability-07
FORMULA_NAME Referendum-PT-0020-CTLFireability-08
FORMULA_NAME Referendum-PT-0020-CTLFireability-09
FORMULA_NAME Referendum-PT-0020-CTLFireability-10
FORMULA_NAME Referendum-PT-0020-CTLFireability-11
FORMULA_NAME Referendum-PT-0020-CTLFireability-12
FORMULA_NAME Referendum-PT-0020-CTLFireability-13
FORMULA_NAME Referendum-PT-0020-CTLFireability-14
FORMULA_NAME Referendum-PT-0020-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679135985024

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=Referendum-PT-0020
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 10:39:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 10:39:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 10:39:46] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2023-03-18 10:39:46] [INFO ] Transformed 61 places.
[2023-03-18 10:39:46] [INFO ] Transformed 41 transitions.
[2023-03-18 10:39:46] [INFO ] Found NUPN structural information;
[2023-03-18 10:39:46] [INFO ] Parsed PT model containing 61 places and 41 transitions and 101 arcs in 84 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 21 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 21 transition count 21
Applied a total of 60 rules in 9 ms. Remains 21 /61 variables (removed 40) and now considering 21/41 (removed 20) transitions.
// Phase 1: matrix 21 rows 21 cols
[2023-03-18 10:39:46] [INFO ] Computed 0 place invariants in 4 ms
[2023-03-18 10:39:46] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-18 10:39:46] [INFO ] Invariant cache hit.
[2023-03-18 10:39:46] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2023-03-18 10:39:46] [INFO ] Invariant cache hit.
[2023-03-18 10:39:47] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/61 places, 21/41 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 444 ms. Remains : 21/61 places, 21/41 transitions.
Support contains 21 out of 21 places after structural reductions.
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 18 ms
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 6 ms
[2023-03-18 10:39:47] [INFO ] Input system was already deterministic with 21 transitions.
Finished random walk after 21 steps, including 0 resets, run visited all 36 properties in 19 ms. (steps per millisecond=1 )
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 4 ms
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 6 ms
[2023-03-18 10:39:47] [INFO ] Input system was already deterministic with 21 transitions.
Computed a total of 21 stabilizing places and 21 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 21
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
FORMULA Referendum-PT-0020-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in SI_CTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 21/21 places, 21/21 transitions.
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 2 ms
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 2 ms
[2023-03-18 10:39:47] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Graph (complete) has 20 edges and 21 vertex of which 1 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Applied a total of 1 rules in 1 ms. Remains 1 /21 variables (removed 20) and now considering 1/21 (removed 20) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 1/21 places, 1/21 transitions.
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 0 ms
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 1 ms
[2023-03-18 10:39:47] [INFO ] Input system was already deterministic with 1 transitions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 21/21 places, 21/21 transitions.
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 2 ms
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 2 ms
[2023-03-18 10:39:47] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 21/21 places, 21/21 transitions.
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 1 ms
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 1 ms
[2023-03-18 10:39:47] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 21/21 places, 21/21 transitions.
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 1 ms
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 2 ms
[2023-03-18 10:39:47] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 21/21 places, 21/21 transitions.
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 1 ms
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 1 ms
[2023-03-18 10:39:47] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 21/21 places, 21/21 transitions.
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 1 ms
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 1 ms
[2023-03-18 10:39:47] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 21/21 places, 21/21 transitions.
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 2 ms
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 2 ms
[2023-03-18 10:39:47] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 9 transition count 9
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 9 transition count 9
Applied a total of 24 rules in 2 ms. Remains 9 /21 variables (removed 12) and now considering 9/21 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 9/21 places, 9/21 transitions.
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 1 ms
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 1 ms
[2023-03-18 10:39:47] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 5 transition count 5
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 5 transition count 5
Applied a total of 32 rules in 1 ms. Remains 5 /21 variables (removed 16) and now considering 5/21 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 5/21 places, 5/21 transitions.
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 1 ms
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 0 ms
[2023-03-18 10:39:47] [INFO ] Input system was already deterministic with 5 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Graph (complete) has 20 edges and 21 vertex of which 3 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 18 output transitions
Drop transitions removed 18 transitions
Applied a total of 1 rules in 1 ms. Remains 3 /21 variables (removed 18) and now considering 3/21 (removed 18) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 3/21 places, 3/21 transitions.
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 0 ms
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 1 ms
[2023-03-18 10:39:47] [INFO ] Input system was already deterministic with 3 transitions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 12 transition count 12
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 12 transition count 12
Applied a total of 18 rules in 1 ms. Remains 12 /21 variables (removed 9) and now considering 12/21 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 12/21 places, 12/21 transitions.
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 1 ms
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 1 ms
[2023-03-18 10:39:47] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 12 transition count 12
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 12 transition count 12
Applied a total of 18 rules in 1 ms. Remains 12 /21 variables (removed 9) and now considering 12/21 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 12/21 places, 12/21 transitions.
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 1 ms
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 1 ms
[2023-03-18 10:39:47] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Graph (complete) has 20 edges and 21 vertex of which 5 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /21 variables (removed 16) and now considering 5/21 (removed 16) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 5/21 places, 5/21 transitions.
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 0 ms
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 0 ms
[2023-03-18 10:39:47] [INFO ] Input system was already deterministic with 5 transitions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 4 transition count 4
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 4 transition count 4
Applied a total of 34 rules in 0 ms. Remains 4 /21 variables (removed 17) and now considering 4/21 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 4/21 places, 4/21 transitions.
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 0 ms
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 1 ms
[2023-03-18 10:39:47] [INFO ] Input system was already deterministic with 4 transitions.
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 3 ms
[2023-03-18 10:39:47] [INFO ] Flatten gal took : 4 ms
[2023-03-18 10:39:47] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-18 10:39:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 21 places, 21 transitions and 41 arcs took 0 ms.
Total runtime 1168 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/457/ctl_0_ --ctl=/tmp/457/ctl_1_ --ctl=/tmp/457/ctl_2_ --ctl=/tmp/457/ctl_3_ --ctl=/tmp/457/ctl_4_ --ctl=/tmp/457/ctl_5_ --ctl=/tmp/457/ctl_6_ --ctl=/tmp/457/ctl_7_ --ctl=/tmp/457/ctl_8_ --ctl=/tmp/457/ctl_9_ --ctl=/tmp/457/ctl_10_ --ctl=/tmp/457/ctl_11_ --ctl=/tmp/457/ctl_12_ --ctl=/tmp/457/ctl_13_ --ctl=/tmp/457/ctl_14_ --mu-par --mu-opt
FORMULA Referendum-PT-0020-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Referendum-PT-0020-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Referendum-PT-0020-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Referendum-PT-0020-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Referendum-PT-0020-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Referendum-PT-0020-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Referendum-PT-0020-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Referendum-PT-0020-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Referendum-PT-0020-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Referendum-PT-0020-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Referendum-PT-0020-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Referendum-PT-0020-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Referendum-PT-0020-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Referendum-PT-0020-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Referendum-PT-0020-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679136178130

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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 Referendum-PT-0020-CTLFireability-00
ctl formula formula --ctl=/tmp/457/ctl_0_
ctl formula name Referendum-PT-0020-CTLFireability-01
ctl formula formula --ctl=/tmp/457/ctl_1_
ctl formula name Referendum-PT-0020-CTLFireability-02
ctl formula formula --ctl=/tmp/457/ctl_2_
ctl formula name Referendum-PT-0020-CTLFireability-03
ctl formula formula --ctl=/tmp/457/ctl_3_
ctl formula name Referendum-PT-0020-CTLFireability-04
ctl formula formula --ctl=/tmp/457/ctl_4_
ctl formula name Referendum-PT-0020-CTLFireability-05
ctl formula formula --ctl=/tmp/457/ctl_5_
ctl formula name Referendum-PT-0020-CTLFireability-06
ctl formula formula --ctl=/tmp/457/ctl_6_
ctl formula name Referendum-PT-0020-CTLFireability-07
ctl formula formula --ctl=/tmp/457/ctl_7_
ctl formula name Referendum-PT-0020-CTLFireability-08
ctl formula formula --ctl=/tmp/457/ctl_8_
ctl formula name Referendum-PT-0020-CTLFireability-09
ctl formula formula --ctl=/tmp/457/ctl_9_
ctl formula name Referendum-PT-0020-CTLFireability-10
ctl formula formula --ctl=/tmp/457/ctl_10_
ctl formula name Referendum-PT-0020-CTLFireability-11
ctl formula formula --ctl=/tmp/457/ctl_11_
ctl formula name Referendum-PT-0020-CTLFireability-13
ctl formula formula --ctl=/tmp/457/ctl_12_
ctl formula name Referendum-PT-0020-CTLFireability-14
ctl formula formula --ctl=/tmp/457/ctl_13_
ctl formula name Referendum-PT-0020-CTLFireability-15
ctl formula formula --ctl=/tmp/457/ctl_14_
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 21 places, 21 transitions and 41 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: 21->1 groups
pnml2lts-sym: Regrouping took 0.000 real 0.000 user 0.010 sys
pnml2lts-sym: state vector length is 21; there are 1 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: 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: 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: 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: Exploration took 22 group checks and 0 next state calls
pnml2lts-sym: reachability took 183.520 real 639.560 user 92.110 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.070 real 0.130 user 0.140 sys
pnml2lts-sym: state space has 1048577 states, 62 nodes
pnml2lts-sym: Formula /tmp/457/ctl_1_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/457/ctl_3_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/457/ctl_2_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/457/ctl_5_ holds for the initial state
pnml2lts-sym: Formula /tmp/457/ctl_0_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/457/ctl_8_ holds for the initial state
pnml2lts-sym: Formula /tmp/457/ctl_7_ holds for the initial state
pnml2lts-sym: Formula /tmp/457/ctl_6_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/457/ctl_14_ holds for the initial state
pnml2lts-sym: Formula /tmp/457/ctl_10_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/457/ctl_11_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/457/ctl_4_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/457/ctl_9_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/457/ctl_13_ holds for the initial state
pnml2lts-sym: Formula /tmp/457/ctl_12_ does not hold for the initial state
pnml2lts-sym: group_next: 923 nodes total
pnml2lts-sym: group_explored: 62 nodes, 1048577 short vectors total
pnml2lts-sym: max token count: 1
double free or corruption (out)
free(): invalid pointer

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="Referendum-PT-0020"
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 Referendum-PT-0020, 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 r329-tall-167889202100482"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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