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

About the Execution of LTSMin+red for AirplaneLD-COL-4000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
286.775 10561.00 22741.00 55.60 TTTFFFFTTFFTTTTF 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.r009-oct2-167813597600233.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 AirplaneLD-COL-4000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597600233
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.2K Feb 26 15:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 15:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 13:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 13:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 19:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Feb 26 19:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 17:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 17:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 620K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678620756201

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AirplaneLD-COL-4000
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 11:32:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 11:32:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 11:32:40] [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-12 11:32:40] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-12 11:32:41] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 967 ms
[2023-03-12 11:32:41] [INFO ] Detected 3 constant HL places corresponding to 12002 PT places.
[2023-03-12 11:32:41] [INFO ] Imported 20 HL places and 15 HL transitions for a total of 28019 PT places and 48012.0 transition bindings in 52 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 35 ms.
[2023-03-12 11:32:41] [INFO ] Built PT skeleton of HLPN with 20 places and 15 transitions 56 arcs in 5 ms.
[2023-03-12 11:32:41] [INFO ] Skeletonized 16 HLPN properties in 18 ms.
Computed a total of 20 stabilizing places and 15 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 15
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.
Remains 16 properties that can be checked using skeleton over-approximation.
Initial state reduction rules removed 1 formulas.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA AirplaneLD-COL-4000-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 17 stabilizing places and 14 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 transition count 14
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10000 steps, including 1269 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 70) seen :20
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 37 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 32 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 33 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 35 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 35 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 35 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 33 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 39 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 33 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 39 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 33 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 34 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 34 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 34 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 35 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 33 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 35 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 32 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 34 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 34 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 36 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 39 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 34 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 34 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 39 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 33 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 32 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 40 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 34 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 33 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 32 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 50) seen :0
Running SMT prover for 50 properties.
// Phase 1: matrix 14 rows 17 cols
[2023-03-12 11:32:42] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-12 11:32:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-12 11:32:42] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 29 ms returned sat
[2023-03-12 11:32:43] [INFO ] After 1168ms SMT Verify possible using all constraints in real domain returned unsat :31 sat :0 real:19
[2023-03-12 11:32:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-12 11:32:43] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 11:32:43] [INFO ] After 504ms SMT Verify possible using all constraints in natural domain returned unsat :50 sat :0
Fused 50 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 50 atomic propositions for a total of 15 simplifications.
FORMULA AirplaneLD-COL-4000-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-4000-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 11:32:44] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2023-03-12 11:32:44] [INFO ] Flatten gal took : 57 ms
[2023-03-12 11:32:44] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA AirplaneLD-COL-4000-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-4000-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-4000-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-4000-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-4000-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-4000-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-4000-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-4000-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 11:32:44] [INFO ] Flatten gal took : 3 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Altitude
Symmetric sort wr.t. initial detected :Altitude
Transition t3_2 : guard parameter $A(Altitude:8000) in guard (OR (GEQ $A 3999) (EQ $A 7999))introduces in Altitude(8000) partition with 2 elements
Transition t3_1 : guard parameter $A(Altitude:8000) in guard (AND (LT $A 3999) (NEQ $A 7999))introduces in Altitude(8000) partition with 2 elements
Sort wr.t. initial and guards Altitude has partition 2
Applying symmetric unfolding of partitioned symmetric sort :Altitude domain size was 8000 reducing to 2 values.
For transition t3_2:(OR (GEQ $A 3999) (EQ $A 7999)) -> (EQ $A 1)
For transition t3_1:(AND (LT $A 3999) (NEQ $A 7999)) -> (EQ $A 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Speed
Symmetric sort wr.t. initial detected :Speed
Transition t5_2 : guard parameter $S(Speed:4000) in guard (OR (LEQ $S 1999) (EQ $S 3999))introduces in Speed(4000) partition with 2 elements
Transition t5_1 : guard parameter $S(Speed:4000) in guard (AND (GT $S 1999) (NEQ $S 3999))introduces in Speed(4000) partition with 2 elements
Transition t4_2 : guard parameter $S(Speed:4000) in guard (OR (LEQ $S 1999) (EQ $S 3999))introduces in Speed(4000) partition with 2 elements
Transition t4_1 : guard parameter $S(Speed:4000) in guard (AND (GT $S 1999) (NEQ $S 3999))introduces in Speed(4000) partition with 2 elements
Sort wr.t. initial and guards Speed has partition 2
Applying symmetric unfolding of partitioned symmetric sort :Speed domain size was 4000 reducing to 2 values.
For transition t5_2:(OR (LEQ $S 1999) (EQ $S 3999)) -> (EQ $S 1)
For transition t5_1:(AND (GT $S 1999) (NEQ $S 3999)) -> (EQ $S 0)
For transition t4_2:(OR (LEQ $S 1999) (EQ $S 3999)) -> (EQ $S 1)
For transition t4_1:(AND (GT $S 1999) (NEQ $S 3999)) -> (EQ $S 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Signal
Arc [19:1*[1]] contains constants of sort Signal
Transition t5_2 : constants on arcs in [[19:1*[1]]] introduces in Signal(2) partition with 1 elements that refines current partition to 2 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :Weight
Symmetric sort wr.t. initial detected :Weight
Transition t2_2 : guard parameter $W(Weight:2) in guard (EQ $W 1)introduces in Weight(2) partition with 2 elements
[2023-03-12 11:32:44] [INFO ] Unfolded HLPN to a Petri net with 29 places and 20 transitions 56 arcs in 156 ms.
[2023-03-12 11:32:44] [INFO ] Unfolded 5 HLPN properties in 0 ms.
Reduce places removed 6 places and 0 transitions.
Support contains 20 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Applied a total of 0 rules in 6 ms. Remains 23 /23 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 23 cols
[2023-03-12 11:32:44] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-12 11:32:44] [INFO ] Implicit Places using invariants in 128 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 143 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/23 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 150 ms. Remains : 22/23 places, 20/20 transitions.
Support contains 20 out of 22 places after structural reductions.
[2023-03-12 11:32:44] [INFO ] Flatten gal took : 17 ms
[2023-03-12 11:32:44] [INFO ] Flatten gal took : 3 ms
[2023-03-12 11:32:44] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 10000 steps, including 1269 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 242 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 240 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 231 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 242 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 263 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 237 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 220 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 243 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 241 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 224 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 234 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 247 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 20 rows 22 cols
[2023-03-12 11:32:44] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 11:32:45] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-12 11:32:45] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:7
[2023-03-12 11:32:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 17 ms returned sat
[2023-03-12 11:32:45] [INFO ] After 350ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :0
Fused 12 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 12 atomic propositions for a total of 5 simplifications.
[2023-03-12 11:32:45] [INFO ] Flatten gal took : 9 ms
[2023-03-12 11:32:45] [INFO ] Flatten gal took : 2 ms
[2023-03-12 11:32:45] [INFO ] Input system was already deterministic with 20 transitions.
Computed a total of 22 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 20
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 19 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 18 transition count 19
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 18 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 18 transition count 18
Applied a total of 6 rules in 2 ms. Remains 18 /22 variables (removed 4) and now considering 18/20 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 18/22 places, 18/20 transitions.
[2023-03-12 11:32:45] [INFO ] Flatten gal took : 1 ms
[2023-03-12 11:32:45] [INFO ] Flatten gal took : 2 ms
[2023-03-12 11:32:45] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 19 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 18 transition count 19
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 18 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 18 transition count 18
Applied a total of 6 rules in 1 ms. Remains 18 /22 variables (removed 4) and now considering 18/20 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 18/22 places, 18/20 transitions.
[2023-03-12 11:32:45] [INFO ] Flatten gal took : 2 ms
[2023-03-12 11:32:45] [INFO ] Flatten gal took : 2 ms
[2023-03-12 11:32:45] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 19 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 18 transition count 19
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 18 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 18 transition count 18
Applied a total of 6 rules in 1 ms. Remains 18 /22 variables (removed 4) and now considering 18/20 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 18/22 places, 18/20 transitions.
[2023-03-12 11:32:45] [INFO ] Flatten gal took : 1 ms
[2023-03-12 11:32:45] [INFO ] Flatten gal took : 1 ms
[2023-03-12 11:32:45] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 19 transition count 19
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 19 transition count 18
Applied a total of 5 rules in 1 ms. Remains 19 /22 variables (removed 3) and now considering 18/20 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 19/22 places, 18/20 transitions.
[2023-03-12 11:32:45] [INFO ] Flatten gal took : 1 ms
[2023-03-12 11:32:45] [INFO ] Flatten gal took : 2 ms
[2023-03-12 11:32:45] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 19 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 18 transition count 19
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 18 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 18 transition count 18
Applied a total of 6 rules in 0 ms. Remains 18 /22 variables (removed 4) and now considering 18/20 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 18/22 places, 18/20 transitions.
[2023-03-12 11:32:45] [INFO ] Flatten gal took : 1 ms
[2023-03-12 11:32:45] [INFO ] Flatten gal took : 8 ms
[2023-03-12 11:32:45] [INFO ] Input system was already deterministic with 18 transitions.
[2023-03-12 11:32:45] [INFO ] Flatten gal took : 2 ms
[2023-03-12 11:32:45] [INFO ] Flatten gal took : 1 ms
[2023-03-12 11:32:45] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-12 11:32:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 22 places, 20 transitions and 54 arcs took 0 ms.
Total runtime 5605 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/480/ctl_0_ --ctl=/tmp/480/ctl_1_ --ctl=/tmp/480/ctl_2_ --ctl=/tmp/480/ctl_3_ --ctl=/tmp/480/ctl_4_ --mu-par --mu-opt
FORMULA AirplaneLD-COL-4000-CTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AirplaneLD-COL-4000-CTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AirplaneLD-COL-4000-CTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AirplaneLD-COL-4000-CTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AirplaneLD-COL-4000-CTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678620766762

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2023
ctl formula name AirplaneLD-COL-4000-CTLCardinality-03
ctl formula formula --ctl=/tmp/480/ctl_0_
ctl formula name AirplaneLD-COL-4000-CTLCardinality-08
ctl formula formula --ctl=/tmp/480/ctl_1_
ctl formula name AirplaneLD-COL-4000-CTLCardinality-12
ctl formula formula --ctl=/tmp/480/ctl_2_
ctl formula name AirplaneLD-COL-4000-CTLCardinality-14
ctl formula formula --ctl=/tmp/480/ctl_3_
ctl formula name AirplaneLD-COL-4000-CTLCardinality-15
ctl formula formula --ctl=/tmp/480/ctl_4_
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 22 places, 20 transitions and 54 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: 20->20 groups
pnml2lts-sym: Regrouping took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state vector length is 22; there are 20 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: Exploration took 153 group checks and 0 next state calls
pnml2lts-sym: reachability took 0.030 real 0.090 user 0.010 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state space has 485 states, 93 nodes
pnml2lts-sym: Formula /tmp/480/ctl_1_ holds for the initial state
pnml2lts-sym: Formula /tmp/480/ctl_2_ holds for the initial state
pnml2lts-sym: Formula /tmp/480/ctl_0_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/480/ctl_3_ holds for the initial state
pnml2lts-sym: Formula /tmp/480/ctl_4_ does not hold for the initial state
pnml2lts-sym: group_next: 128 nodes total
pnml2lts-sym: group_explored: 147 nodes, 87 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="AirplaneLD-COL-4000"
export BK_EXAMINATION="CTLCardinality"
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 AirplaneLD-COL-4000, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r009-oct2-167813597600233"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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