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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 8.2K Feb 26 09:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 09:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 26 09:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K Feb 26 09:14 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 3.7K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 09:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Feb 26 09:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 26 09:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 09:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:16 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 6.5K 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-AN04-CTLCardinality-00
FORMULA_NAME Sudoku-COL-AN04-CTLCardinality-01
FORMULA_NAME Sudoku-COL-AN04-CTLCardinality-02
FORMULA_NAME Sudoku-COL-AN04-CTLCardinality-03
FORMULA_NAME Sudoku-COL-AN04-CTLCardinality-04
FORMULA_NAME Sudoku-COL-AN04-CTLCardinality-05
FORMULA_NAME Sudoku-COL-AN04-CTLCardinality-06
FORMULA_NAME Sudoku-COL-AN04-CTLCardinality-07
FORMULA_NAME Sudoku-COL-AN04-CTLCardinality-08
FORMULA_NAME Sudoku-COL-AN04-CTLCardinality-09
FORMULA_NAME Sudoku-COL-AN04-CTLCardinality-10
FORMULA_NAME Sudoku-COL-AN04-CTLCardinality-11
FORMULA_NAME Sudoku-COL-AN04-CTLCardinality-12
FORMULA_NAME Sudoku-COL-AN04-CTLCardinality-13
FORMULA_NAME Sudoku-COL-AN04-CTLCardinality-14
FORMULA_NAME Sudoku-COL-AN04-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679169837976

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-AN04
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 20:03:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 20:03:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:03:59] [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-18 20:03:59] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 20:04:00] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 534 ms
[2023-03-18 20:04:00] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 112 PT places and 64.0 transition bindings in 11 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 33 ms.
[2023-03-18 20:04:00] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 3 ms.
[2023-03-18 20:04:00] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 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).
AF dead knowledge conclusive for 2 formulas.
FORMULA Sudoku-COL-AN04-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 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 147 ms. (steps per millisecond=68 ) properties (out of 82) seen :20
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 62) 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 62) 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 62) 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 62) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 62) 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 62) 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 62) 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 62) 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 62) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 62) 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 62) 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 62) 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 62) 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 62) 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 62) 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 62) 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 62) 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 62) 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 62) 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 62) 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 62) 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 62) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 62) 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 62) 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 62) 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 62) 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 62) 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 62) 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 62) 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 62) 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 62) 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 62) 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 62) 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 62) 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 62) 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 62) 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 62) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 4 ms. (steps per millisecond=251 ) properties (out of 62) 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 62) 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 62) 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 62) 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 62) 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 62) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 62) 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 62) 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 62) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 62) 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 62) 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 62) seen :0
Incomplete Best-First random walk after 1007 steps, including 55 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 62) seen :0
Running SMT prover for 62 properties.
// Phase 1: matrix 1 rows 4 cols
[2023-03-18 20:04:00] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-18 20:04:00] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 20:04:00] [INFO ] After 4ms SMT Verify possible using state equation in real domain returned unsat :56 sat :1 real:5
[2023-03-18 20:04:00] [INFO ] After 7ms SMT Verify possible using trap constraints in real domain returned unsat :56 sat :1 real:5
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-18 20:04:00] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :56 sat :1 real:5
[2023-03-18 20:04:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-18 20:04:00] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :61 sat :1
[2023-03-18 20:04:00] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :61 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-18 20:04:00] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :61 sat :1
Fused 62 Parikh solutions to 1 different solutions.
Finished Parikh walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Parikh walk visited 1 properties in 2 ms.
Successfully simplified 61 atomic propositions for a total of 14 simplifications.
FORMULA Sudoku-COL-AN04-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN04-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 20:04:01] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-18 20:04:01] [INFO ] Flatten gal took : 12 ms
[2023-03-18 20:04:01] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA Sudoku-COL-AN04-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN04-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN04-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 20:04:01] [INFO ] Flatten gal took : 2 ms
Domain [N(4), N(4)] of place Rows breaks symmetries in sort N
[2023-03-18 20:04:01] [INFO ] Unfolded HLPN to a Petri net with 112 places and 64 transitions 256 arcs in 7 ms.
[2023-03-18 20:04:01] [INFO ] Unfolded 10 HLPN properties in 1 ms.
Support contains 112 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 6 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 112 cols
[2023-03-18 20:04:01] [INFO ] Computed 48 place invariants in 3 ms
[2023-03-18 20:04:01] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-18 20:04:01] [INFO ] Invariant cache hit.
[2023-03-18 20:04:01] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2023-03-18 20:04:01] [INFO ] Invariant cache hit.
[2023-03-18 20:04:01] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 229 ms. Remains : 112/112 places, 64/64 transitions.
Support contains 112 out of 112 places after structural reductions.
[2023-03-18 20:04:01] [INFO ] Flatten gal took : 16 ms
[2023-03-18 20:04:01] [INFO ] Flatten gal took : 13 ms
[2023-03-18 20:04:01] [INFO ] Input system was already deterministic with 64 transitions.
Incomplete random walk after 10000 steps, including 696 resets, run finished after 717 ms. (steps per millisecond=13 ) properties (out of 58) seen :15
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 43) 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 43) 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 43) 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 43) 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 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 43) 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 43) 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 43) 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 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 43) 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 43) 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 43) 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 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 43) 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 43) 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 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) 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 43) 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 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 43) 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 43) 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 43) 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 43) 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 43) 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 43) 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 43) 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 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 43) 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 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 43) 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 43) 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 43) 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 43) 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 43) 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 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 43) 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 43) 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 43) 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 43) 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 43) 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 43) seen :0
Running SMT prover for 43 properties.
[2023-03-18 20:04:02] [INFO ] Invariant cache hit.
[2023-03-18 20:04:02] [INFO ] [Real]Absence check using 48 positive place invariants in 7 ms returned sat
[2023-03-18 20:04:02] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :41 sat :0 real:2
[2023-03-18 20:04:02] [INFO ] [Nat]Absence check using 48 positive place invariants in 16 ms returned sat
[2023-03-18 20:04:02] [INFO ] After 50ms SMT Verify possible using all constraints in natural domain returned unsat :43 sat :0
Fused 43 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 43 atomic propositions for a total of 10 simplifications.
[2023-03-18 20:04:02] [INFO ] Flatten gal took : 8 ms
[2023-03-18 20:04:02] [INFO ] Flatten gal took : 8 ms
[2023-03-18 20:04:02] [INFO ] Input system was already deterministic with 64 transitions.
FORMULA Sudoku-COL-AN04-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 112 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 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).
Starting structural reductions in LTL mode, iteration 0 : 112/112 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 48 transition count 64
Applied a total of 64 rules in 4 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 48/112 places, 64/64 transitions.
[2023-03-18 20:04:02] [INFO ] Flatten gal took : 5 ms
[2023-03-18 20:04:02] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:04:02] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Graph (complete) has 192 edges and 112 vertex of which 48 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 6 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 48/112 places, 64/64 transitions.
[2023-03-18 20:04:02] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:04:02] [INFO ] Flatten gal took : 5 ms
[2023-03-18 20:04:02] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 112/112 places, 64/64 transitions.
[2023-03-18 20:04:02] [INFO ] Flatten gal took : 5 ms
[2023-03-18 20:04:02] [INFO ] Flatten gal took : 5 ms
[2023-03-18 20:04:02] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 112/112 places, 64/64 transitions.
[2023-03-18 20:04:02] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:04:02] [INFO ] Flatten gal took : 5 ms
[2023-03-18 20:04:02] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 112/112 places, 64/64 transitions.
[2023-03-18 20:04:02] [INFO ] Flatten gal took : 5 ms
[2023-03-18 20:04:02] [INFO ] Flatten gal took : 6 ms
[2023-03-18 20:04:02] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 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 48 transition count 64
Applied a total of 64 rules in 1 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 48/112 places, 64/64 transitions.
[2023-03-18 20:04:02] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:04:02] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:04:02] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 112/112 places, 64/64 transitions.
[2023-03-18 20:04:02] [INFO ] Flatten gal took : 5 ms
[2023-03-18 20:04:02] [INFO ] Flatten gal took : 5 ms
[2023-03-18 20:04:02] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 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 48 transition count 64
Applied a total of 64 rules in 2 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 48/112 places, 64/64 transitions.
[2023-03-18 20:04:02] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:04:02] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:04:02] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Graph (complete) has 192 edges and 112 vertex of which 48 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.0 ms
Discarding 64 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 48/112 places, 64/64 transitions.
[2023-03-18 20:04:02] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:04:02] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:04:02] [INFO ] Input system was already deterministic with 64 transitions.
[2023-03-18 20:04:02] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:04:02] [INFO ] Flatten gal took : 5 ms
[2023-03-18 20:04:02] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-18 20:04:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 112 places, 64 transitions and 256 arcs took 1 ms.
Total runtime 3583 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/472/ctl_0_ --ctl=/tmp/472/ctl_1_ --ctl=/tmp/472/ctl_2_ --ctl=/tmp/472/ctl_3_ --ctl=/tmp/472/ctl_4_ --ctl=/tmp/472/ctl_5_ --ctl=/tmp/472/ctl_6_ --ctl=/tmp/472/ctl_7_ --ctl=/tmp/472/ctl_8_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393216 kB
MemFree: 154032 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16089900 kB
FORMULA Sudoku-COL-AN04-CTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Sudoku-COL-AN04-CTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Sudoku-COL-AN04-CTLCardinality-05
Could not compute solution for formula : Sudoku-COL-AN04-CTLCardinality-06
Could not compute solution for formula : Sudoku-COL-AN04-CTLCardinality-08
Could not compute solution for formula : Sudoku-COL-AN04-CTLCardinality-11
Could not compute solution for formula : Sudoku-COL-AN04-CTLCardinality-12
FORMULA Sudoku-COL-AN04-CTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Sudoku-COL-AN04-CTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679173415405

--------------------
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 Sudoku-COL-AN04-CTLCardinality-02
ctl formula formula --ctl=/tmp/472/ctl_0_
ctl formula name Sudoku-COL-AN04-CTLCardinality-03
ctl formula formula --ctl=/tmp/472/ctl_1_
ctl formula name Sudoku-COL-AN04-CTLCardinality-05
ctl formula formula --ctl=/tmp/472/ctl_2_
ctl formula name Sudoku-COL-AN04-CTLCardinality-06
ctl formula formula --ctl=/tmp/472/ctl_3_
ctl formula name Sudoku-COL-AN04-CTLCardinality-08
ctl formula formula --ctl=/tmp/472/ctl_4_
ctl formula name Sudoku-COL-AN04-CTLCardinality-11
ctl formula formula --ctl=/tmp/472/ctl_5_
ctl formula name Sudoku-COL-AN04-CTLCardinality-12
ctl formula formula --ctl=/tmp/472/ctl_6_
ctl formula name Sudoku-COL-AN04-CTLCardinality-13
ctl formula formula --ctl=/tmp/472/ctl_7_
ctl formula name Sudoku-COL-AN04-CTLCardinality-15
ctl formula formula --ctl=/tmp/472/ctl_8_
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 112 places, 64 transitions and 256 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 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.000 user 0.000 sys
pnml2lts-sym: state vector length is 112; 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: 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: Exploration took 7102711 group checks and 0 next state calls
pnml2lts-sym: reachability took 76.030 real 303.580 user 0.230 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.120 real 0.460 user 0.000 sys
pnml2lts-sym: state space has 127545137 states, 1753300 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: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/472/ctl_0_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/472/ctl_1_ holds 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: Formula /tmp/472/ctl_8_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/472/ctl_7_ 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
Killing (15) : 478
Killing (9) : 478

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-AN04"
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-AN04, 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-167912706200025"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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