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

About the Execution of LTSMin+red for PermAdmissibility-COL-02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
261.615 10191.00 20672.00 575.50 FFTTFTTFFTTFFTFT 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.r265-smll-167863540100465.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 PermAdmissibility-COL-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863540100465
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 8.8K Feb 26 01:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 26 01:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 01:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 26 01:18 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 3.8K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 01:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 01:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 01:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 26 01:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 54K 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 PermAdmissibility-COL-02-CTLCardinality-00
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-01
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-02
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-03
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-04
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-05
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-06
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-07
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-08
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-09
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-10
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-11
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-12
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-13
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-14
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679029833875

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=PermAdmissibility-COL-02
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-17 05:10:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 05:10:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 05:10:36] [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-17 05:10:36] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-17 05:10:37] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 889 ms
[2023-03-17 05:10:37] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 42 ms.
[2023-03-17 05:10:37] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 6 ms.
[2023-03-17 05:10:37] [INFO ] Skeletonized 16 HLPN properties in 5 ms.
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
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 206 resets, run finished after 763 ms. (steps per millisecond=13 ) properties (out of 109) seen :34
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 75) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 75) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 75) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 75) seen :0
Incomplete Best-First random walk after 1000 steps, including 13 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 75) seen :1
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 13 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 15 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 14 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 15 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 15 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 14 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 15 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 13 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 13 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 14 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 14 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 13 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 15 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 13 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 13 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 13 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 74) seen :0
Running SMT prover for 74 properties.
// Phase 1: matrix 16 rows 40 cols
[2023-03-17 05:10:39] [INFO ] Computed 24 place invariants in 10 ms
[2023-03-17 05:10:40] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-17 05:10:40] [INFO ] After 429ms SMT Verify possible using all constraints in real domain returned unsat :12 sat :0 real:62
[2023-03-17 05:10:40] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 17 ms returned sat
[2023-03-17 05:10:40] [INFO ] After 288ms SMT Verify possible using all constraints in natural domain returned unsat :74 sat :0
Fused 74 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 74 atomic propositions for a total of 16 simplifications.
FORMULA PermAdmissibility-COL-02-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-17 05:10:40] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2023-03-17 05:10:40] [INFO ] Flatten gal took : 54 ms
FORMULA PermAdmissibility-COL-02-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-17 05:10:40] [INFO ] Flatten gal took : 7 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :input
Symmetric sort wr.t. initial detected :input
Symmetric sort wr.t. initial and guards detected :input
Applying symmetric unfolding of full symmetric sort :input domain size was 8
[2023-03-17 05:10:40] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 11 ms.
[2023-03-17 05:10:40] [INFO ] Unfolded 8 HLPN properties in 1 ms.
Support contains 36 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 37 transition count 16
Applied a total of 3 rules in 9 ms. Remains 37 /40 variables (removed 3) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 37 cols
[2023-03-17 05:10:40] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-17 05:10:40] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-17 05:10:40] [INFO ] Invariant cache hit.
[2023-03-17 05:10:40] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-17 05:10:40] [INFO ] Invariant cache hit.
[2023-03-17 05:10:40] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 37/40 places, 16/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 163 ms. Remains : 37/40 places, 16/16 transitions.
Support contains 36 out of 37 places after structural reductions.
[2023-03-17 05:10:40] [INFO ] Flatten gal took : 6 ms
[2023-03-17 05:10:40] [INFO ] Flatten gal took : 6 ms
[2023-03-17 05:10:40] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 10000 steps, including 207 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 57) seen :18
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 15 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 14 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 15 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 14 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 15 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 14 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 15 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 13 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 13 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 13 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 15 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 13 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 15 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 13 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 13 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 39) seen :0
Running SMT prover for 39 properties.
[2023-03-17 05:10:41] [INFO ] Invariant cache hit.
[2023-03-17 05:10:42] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 12 ms returned sat
[2023-03-17 05:10:42] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:34
[2023-03-17 05:10:42] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 8 ms returned sat
[2023-03-17 05:10:42] [INFO ] After 119ms SMT Verify possible using all constraints in natural domain returned unsat :39 sat :0
Fused 39 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 39 atomic propositions for a total of 8 simplifications.
[2023-03-17 05:10:42] [INFO ] Flatten gal took : 6 ms
[2023-03-17 05:10:42] [INFO ] Flatten gal took : 4 ms
[2023-03-17 05:10:42] [INFO ] Input system was already deterministic with 16 transitions.
Support contains 11 out of 37 places (down from 13) after GAL structural reductions.
FORMULA PermAdmissibility-COL-02-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 37 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 37 transition count 16
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 SI_CTL mode, iteration 0 : 37/37 places, 16/16 transitions.
Graph (complete) has 94 edges and 37 vertex of which 26 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Applied a total of 1 rules in 8 ms. Remains 26 /37 variables (removed 11) and now considering 14/16 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 26/37 places, 14/16 transitions.
[2023-03-17 05:10:42] [INFO ] Flatten gal took : 2 ms
[2023-03-17 05:10:42] [INFO ] Flatten gal took : 3 ms
[2023-03-17 05:10:42] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 16/16 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 30 transition count 16
Applied a total of 7 rules in 2 ms. Remains 30 /37 variables (removed 7) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 30/37 places, 16/16 transitions.
[2023-03-17 05:10:42] [INFO ] Flatten gal took : 3 ms
[2023-03-17 05:10:42] [INFO ] Flatten gal took : 3 ms
[2023-03-17 05:10:42] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 16/16 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 30 transition count 16
Applied a total of 7 rules in 2 ms. Remains 30 /37 variables (removed 7) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 30/37 places, 16/16 transitions.
[2023-03-17 05:10:42] [INFO ] Flatten gal took : 3 ms
[2023-03-17 05:10:42] [INFO ] Flatten gal took : 3 ms
[2023-03-17 05:10:42] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 16/16 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 31 transition count 16
Applied a total of 6 rules in 2 ms. Remains 31 /37 variables (removed 6) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 31/37 places, 16/16 transitions.
[2023-03-17 05:10:42] [INFO ] Flatten gal took : 3 ms
[2023-03-17 05:10:42] [INFO ] Flatten gal took : 2 ms
[2023-03-17 05:10:42] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 16/16 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 31 transition count 16
Applied a total of 6 rules in 1 ms. Remains 31 /37 variables (removed 6) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 31/37 places, 16/16 transitions.
[2023-03-17 05:10:42] [INFO ] Flatten gal took : 3 ms
[2023-03-17 05:10:42] [INFO ] Flatten gal took : 3 ms
[2023-03-17 05:10:42] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 37/37 places, 16/16 transitions.
Graph (complete) has 94 edges and 37 vertex of which 31 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 31 /37 variables (removed 6) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 31/37 places, 16/16 transitions.
[2023-03-17 05:10:42] [INFO ] Flatten gal took : 2 ms
[2023-03-17 05:10:42] [INFO ] Flatten gal took : 3 ms
[2023-03-17 05:10:42] [INFO ] Input system was already deterministic with 16 transitions.
Finished random walk after 43 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=43 )
FORMULA PermAdmissibility-COL-02-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 16/16 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 31 transition count 16
Applied a total of 6 rules in 2 ms. Remains 31 /37 variables (removed 6) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 31/37 places, 16/16 transitions.
[2023-03-17 05:10:42] [INFO ] Flatten gal took : 3 ms
[2023-03-17 05:10:42] [INFO ] Flatten gal took : 3 ms
[2023-03-17 05:10:42] [INFO ] Input system was already deterministic with 16 transitions.
[2023-03-17 05:10:42] [INFO ] Flatten gal took : 3 ms
[2023-03-17 05:10:42] [INFO ] Flatten gal took : 3 ms
[2023-03-17 05:10:42] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2023-03-17 05:10:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 37 places, 16 transitions and 78 arcs took 0 ms.
Total runtime 6030 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/478/ctl_0_ --ctl=/tmp/478/ctl_1_ --ctl=/tmp/478/ctl_2_ --ctl=/tmp/478/ctl_3_ --ctl=/tmp/478/ctl_4_ --ctl=/tmp/478/ctl_5_ --mu-par --mu-opt
FORMULA PermAdmissibility-COL-02-CTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679029844066

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2023
ctl formula name PermAdmissibility-COL-02-CTLCardinality-01
ctl formula formula --ctl=/tmp/478/ctl_0_
ctl formula name PermAdmissibility-COL-02-CTLCardinality-04
ctl formula formula --ctl=/tmp/478/ctl_1_
ctl formula name PermAdmissibility-COL-02-CTLCardinality-08
ctl formula formula --ctl=/tmp/478/ctl_2_
ctl formula name PermAdmissibility-COL-02-CTLCardinality-09
ctl formula formula --ctl=/tmp/478/ctl_3_
ctl formula name PermAdmissibility-COL-02-CTLCardinality-10
ctl formula formula --ctl=/tmp/478/ctl_4_
ctl formula name PermAdmissibility-COL-02-CTLCardinality-14
ctl formula formula --ctl=/tmp/478/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 37 places, 16 transitions and 78 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: 16->16 groups
pnml2lts-sym: Regrouping took 0.010 real 0.010 user 0.000 sys
pnml2lts-sym: state vector length is 37; there are 16 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 290 group checks and 0 next state calls
pnml2lts-sym: reachability took 0.040 real 0.130 user 0.040 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state space has 153 states, 573 nodes
pnml2lts-sym: Formula /tmp/478/ctl_2_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/478/ctl_1_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/478/ctl_5_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/478/ctl_4_ holds for the initial state
pnml2lts-sym: Formula /tmp/478/ctl_3_ holds for the initial state
pnml2lts-sym: Formula /tmp/478/ctl_0_ does not hold for the initial state
pnml2lts-sym: group_next: 537 nodes total
pnml2lts-sym: group_explored: 606 nodes, 368 short vectors total
pnml2lts-sym: max token count: 4

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="PermAdmissibility-COL-02"
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 PermAdmissibility-COL-02, 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 r265-smll-167863540100465"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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