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.r489-tall-167912706400137.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 Sudoku-COL-BN04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912706400137
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 8.0K Feb 26 09:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 09:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 09:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 09:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 09:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 26 09:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 09:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Feb 26 09:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 36K 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 Sudoku-COL-BN04-CTLCardinality-00
FORMULA_NAME Sudoku-COL-BN04-CTLCardinality-01
FORMULA_NAME Sudoku-COL-BN04-CTLCardinality-02
FORMULA_NAME Sudoku-COL-BN04-CTLCardinality-03
FORMULA_NAME Sudoku-COL-BN04-CTLCardinality-04
FORMULA_NAME Sudoku-COL-BN04-CTLCardinality-05
FORMULA_NAME Sudoku-COL-BN04-CTLCardinality-06
FORMULA_NAME Sudoku-COL-BN04-CTLCardinality-07
FORMULA_NAME Sudoku-COL-BN04-CTLCardinality-08
FORMULA_NAME Sudoku-COL-BN04-CTLCardinality-09
FORMULA_NAME Sudoku-COL-BN04-CTLCardinality-10
FORMULA_NAME Sudoku-COL-BN04-CTLCardinality-11
FORMULA_NAME Sudoku-COL-BN04-CTLCardinality-12
FORMULA_NAME Sudoku-COL-BN04-CTLCardinality-13
FORMULA_NAME Sudoku-COL-BN04-CTLCardinality-14
FORMULA_NAME Sudoku-COL-BN04-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679196222817

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=Sudoku-COL-BN04
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 03:23:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 03:23:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 03:23:44] [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-19 03:23:44] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-19 03:23:44] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 429 ms
[2023-03-19 03:23:44] [INFO ] Imported 5 HL places and 1 HL transitions for a total of 128 PT places and 256.0 transition bindings in 207 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
[2023-03-19 03:23:45] [INFO ] Built PT skeleton of HLPN with 5 places and 1 transitions 5 arcs in 3 ms.
[2023-03-19 03:23:45] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 5 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 1
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 5 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 1
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 10007 steps, including 555 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 83) seen :15
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 6 ms. (steps per millisecond=167 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 5 ms. (steps per millisecond=201 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 6 ms. (steps per millisecond=167 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 6 ms. (steps per millisecond=167 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 5 ms. (steps per millisecond=201 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 5 ms. (steps per millisecond=201 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 6 ms. (steps per millisecond=167 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 6 ms. (steps per millisecond=167 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 6 ms. (steps per millisecond=167 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 6 ms. (steps per millisecond=167 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 6 ms. (steps per millisecond=167 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 6 ms. (steps per millisecond=167 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 6 ms. (steps per millisecond=167 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 6 ms. (steps per millisecond=167 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 6 ms. (steps per millisecond=167 ) properties (out of 68) seen :0
Running SMT prover for 68 properties.
// Phase 1: matrix 1 rows 5 cols
[2023-03-19 03:23:45] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-19 03:23:45] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-19 03:23:45] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :53 sat :1 real:14
[2023-03-19 03:23:45] [INFO ] After 6ms SMT Verify possible using trap constraints in real domain returned unsat :53 sat :1 real:14
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-19 03:23:45] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :53 sat :1 real:14
[2023-03-19 03:23:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-19 03:23:45] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :67 sat :1
[2023-03-19 03:23:45] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :67 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-19 03:23:45] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :67 sat :1
Fused 68 Parikh solutions to 1 different solutions.
Finished Parikh walk after 8 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Parikh walk visited 1 properties in 1 ms.
Successfully simplified 67 atomic propositions for a total of 16 simplifications.
FORMULA Sudoku-COL-BN04-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 03:23:45] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2023-03-19 03:23:45] [INFO ] Flatten gal took : 14 ms
[2023-03-19 03:23:45] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Sudoku-COL-BN04-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN04-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN04-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN04-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN04-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN04-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN04-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 03:23:46] [INFO ] Flatten gal took : 1 ms
Domain [N(4), N(4)] of place Rows breaks symmetries in sort N
[2023-03-19 03:23:46] [INFO ] Unfolded HLPN to a Petri net with 128 places and 64 transitions 320 arcs in 13 ms.
[2023-03-19 03:23:46] [INFO ] Unfolded 8 HLPN properties in 1 ms.
Support contains 128 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 30 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 128 cols
[2023-03-19 03:23:46] [INFO ] Computed 64 place invariants in 4 ms
[2023-03-19 03:23:46] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-19 03:23:46] [INFO ] Invariant cache hit.
[2023-03-19 03:23:46] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2023-03-19 03:23:46] [INFO ] Invariant cache hit.
[2023-03-19 03:23:46] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 277 ms. Remains : 128/128 places, 64/64 transitions.
Support contains 128 out of 128 places after structural reductions.
[2023-03-19 03:23:46] [INFO ] Flatten gal took : 15 ms
[2023-03-19 03:23:46] [INFO ] Flatten gal took : 13 ms
[2023-03-19 03:23:46] [INFO ] Input system was already deterministic with 64 transitions.
FORMULA Sudoku-COL-BN04-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 716 resets, run finished after 489 ms. (steps per millisecond=20 ) properties (out of 26) seen :9
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-19 03:23:46] [INFO ] Invariant cache hit.
[2023-03-19 03:23:47] [INFO ] [Real]Absence check using 64 positive place invariants in 13 ms returned sat
[2023-03-19 03:23:47] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :8 sat :0 real:9
[2023-03-19 03:23:47] [INFO ] [Nat]Absence check using 64 positive place invariants in 12 ms returned sat
[2023-03-19 03:23:47] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :17 sat :0
Fused 17 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 17 atomic propositions for a total of 7 simplifications.
[2023-03-19 03:23:47] [INFO ] Flatten gal took : 10 ms
[2023-03-19 03:23:47] [INFO ] Flatten gal took : 11 ms
[2023-03-19 03:23:47] [INFO ] Input system was already deterministic with 64 transitions.
Computed a total of 128 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 128 transition count 64
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 2 formulas.
FORMULA Sudoku-COL-BN04-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Graph (complete) has 256 edges and 128 vertex of which 64 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.1 ms
Discarding 64 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 64 /128 variables (removed 64) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 64/128 places, 64/64 transitions.
[2023-03-19 03:23:47] [INFO ] Flatten gal took : 6 ms
[2023-03-19 03:23:47] [INFO ] Flatten gal took : 5 ms
[2023-03-19 03:23:47] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 128/128 places, 64/64 transitions.
[2023-03-19 03:23:47] [INFO ] Flatten gal took : 6 ms
[2023-03-19 03:23:47] [INFO ] Flatten gal took : 7 ms
[2023-03-19 03:23:47] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 64 transition count 64
Applied a total of 64 rules in 4 ms. Remains 64 /128 variables (removed 64) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 64/128 places, 64/64 transitions.
[2023-03-19 03:23:47] [INFO ] Flatten gal took : 5 ms
[2023-03-19 03:23:47] [INFO ] Flatten gal took : 5 ms
[2023-03-19 03:23:47] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 64 transition count 64
Applied a total of 64 rules in 3 ms. Remains 64 /128 variables (removed 64) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 64/128 places, 64/64 transitions.
[2023-03-19 03:23:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-19 03:23:47] [INFO ] Flatten gal took : 6 ms
FORMULA Sudoku-COL-BN04-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 03:23:47] [INFO ] Flatten gal took : 5 ms
[2023-03-19 03:23:47] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 64 transition count 64
Applied a total of 64 rules in 3 ms. Remains 64 /128 variables (removed 64) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 64/128 places, 64/64 transitions.
[2023-03-19 03:23:47] [INFO ] Flatten gal took : 5 ms
[2023-03-19 03:23:47] [INFO ] Flatten gal took : 4 ms
[2023-03-19 03:23:47] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 128/128 places, 64/64 transitions.
[2023-03-19 03:23:47] [INFO ] Flatten gal took : 6 ms
[2023-03-19 03:23:47] [INFO ] Flatten gal took : 6 ms
[2023-03-19 03:23:47] [INFO ] Input system was already deterministic with 64 transitions.
[2023-03-19 03:23:47] [INFO ] Flatten gal took : 6 ms
[2023-03-19 03:23:47] [INFO ] Flatten gal took : 5 ms
[2023-03-19 03:23:47] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-19 03:23:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 128 places, 64 transitions and 320 arcs took 1 ms.
Total runtime 3202 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/476/ctl_0_ --ctl=/tmp/476/ctl_1_ --ctl=/tmp/476/ctl_2_ --ctl=/tmp/476/ctl_3_ --ctl=/tmp/476/ctl_4_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393216 kB
MemFree: 10129644 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16141140 kB
FORMULA Sudoku-COL-BN04-CTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Sudoku-COL-BN04-CTLCardinality-05
FORMULA Sudoku-COL-BN04-CTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Sudoku-COL-BN04-CTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Sudoku-COL-BN04-CTLCardinality-14

BK_STOP 1679199799583

--------------------
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 Sudoku-COL-BN04-CTLCardinality-01
ctl formula formula --ctl=/tmp/476/ctl_0_
ctl formula name Sudoku-COL-BN04-CTLCardinality-05
ctl formula formula --ctl=/tmp/476/ctl_1_
ctl formula name Sudoku-COL-BN04-CTLCardinality-07
ctl formula formula --ctl=/tmp/476/ctl_2_
ctl formula name Sudoku-COL-BN04-CTLCardinality-11
ctl formula formula --ctl=/tmp/476/ctl_3_
ctl formula name Sudoku-COL-BN04-CTLCardinality-14
ctl formula formula --ctl=/tmp/476/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 128 places, 64 transitions and 320 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: 64->64 groups
pnml2lts-sym: Regrouping took 0.010 real 0.010 user 0.000 sys
pnml2lts-sym: state vector length is 128; there are 64 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: 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 8767238 group checks and 0 next state calls
pnml2lts-sym: reachability took 96.580 real 385.120 user 0.780 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.230 real 0.940 user 0.000 sys
pnml2lts-sym: state space has 61556225 states, 2182156 nodes
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: Formula /tmp/476/ctl_3_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/476/ctl_2_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/476/ctl_0_ does not hold for the initial state
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: 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: 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: 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: 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: 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: 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
Killing (15) : 482
Killing (9) : 482

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="Sudoku-COL-BN04"
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 Sudoku-COL-BN04, 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 r489-tall-167912706400137"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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