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.r490-tall-167912708200073.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 marciexred
Input is Sudoku-COL-AN10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912708200073
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 8.8K Feb 26 09:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 09:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 09:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 09:23 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.6K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 16K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 26 10:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 09:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Feb 26 09:49 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-AN10-CTLCardinality-00
FORMULA_NAME Sudoku-COL-AN10-CTLCardinality-01
FORMULA_NAME Sudoku-COL-AN10-CTLCardinality-02
FORMULA_NAME Sudoku-COL-AN10-CTLCardinality-03
FORMULA_NAME Sudoku-COL-AN10-CTLCardinality-04
FORMULA_NAME Sudoku-COL-AN10-CTLCardinality-05
FORMULA_NAME Sudoku-COL-AN10-CTLCardinality-06
FORMULA_NAME Sudoku-COL-AN10-CTLCardinality-07
FORMULA_NAME Sudoku-COL-AN10-CTLCardinality-08
FORMULA_NAME Sudoku-COL-AN10-CTLCardinality-09
FORMULA_NAME Sudoku-COL-AN10-CTLCardinality-10
FORMULA_NAME Sudoku-COL-AN10-CTLCardinality-11
FORMULA_NAME Sudoku-COL-AN10-CTLCardinality-12
FORMULA_NAME Sudoku-COL-AN10-CTLCardinality-13
FORMULA_NAME Sudoku-COL-AN10-CTLCardinality-14
FORMULA_NAME Sudoku-COL-AN10-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679177630108

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=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 22:13:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 22:13:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 22:13:51] [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 22:13:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 22:13:52] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 583 ms
[2023-03-18 22:13:52] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 1300 PT places and 1000.0 transition bindings in 11 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
[2023-03-18 22:13:52] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2023-03-18 22:13:52] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-COL-AN10-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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.
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 10097 steps, including 98 resets, run finished after 56 ms. (steps per millisecond=180 ) properties (out of 74) seen :56
Incomplete Best-First random walk after 1019 steps, including 9 resets, run finished after 3 ms. (steps per millisecond=339 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1019 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=254 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1019 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=254 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1019 steps, including 9 resets, run finished after 3 ms. (steps per millisecond=339 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1019 steps, including 9 resets, run finished after 3 ms. (steps per millisecond=339 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1019 steps, including 9 resets, run finished after 3 ms. (steps per millisecond=339 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1019 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=254 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1019 steps, including 9 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1019 steps, including 9 resets, run finished after 3 ms. (steps per millisecond=339 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1019 steps, including 9 resets, run finished after 3 ms. (steps per millisecond=339 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1019 steps, including 9 resets, run finished after 3 ms. (steps per millisecond=339 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1019 steps, including 9 resets, run finished after 3 ms. (steps per millisecond=339 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1019 steps, including 9 resets, run finished after 3 ms. (steps per millisecond=339 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1019 steps, including 9 resets, run finished after 3 ms. (steps per millisecond=339 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1019 steps, including 9 resets, run finished after 3 ms. (steps per millisecond=339 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1019 steps, including 9 resets, run finished after 3 ms. (steps per millisecond=339 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1019 steps, including 9 resets, run finished after 3 ms. (steps per millisecond=339 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1019 steps, including 9 resets, run finished after 2 ms. (steps per millisecond=509 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
// Phase 1: matrix 1 rows 4 cols
[2023-03-18 22:13:52] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-18 22:13:52] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:16
[2023-03-18 22:13:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 22:13:52] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :15 sat :3
[2023-03-18 22:13:52] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :15 sat :3
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-18 22:13:52] [INFO ] After 102ms SMT Verify possible using all constraints in natural domain returned unsat :15 sat :3
Fused 18 Parikh solutions to 3 different solutions.
Finished Parikh walk after 50 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=50 )
Parikh walk visited 3 properties in 4 ms.
Successfully simplified 15 atomic propositions for a total of 14 simplifications.
[2023-03-18 22:13:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-18 22:13:52] [INFO ] Flatten gal took : 13 ms
[2023-03-18 22:13:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Sudoku-COL-AN10-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN10-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 22:13:52] [INFO ] Flatten gal took : 2 ms
Domain [N(10), N(10)] of place Rows breaks symmetries in sort N
[2023-03-18 22:13:52] [INFO ] Unfolded HLPN to a Petri net with 1300 places and 1000 transitions 4000 arcs in 23 ms.
[2023-03-18 22:13:52] [INFO ] Unfolded 13 HLPN properties in 3 ms.
Support contains 1300 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 18 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1300 cols
[2023-03-18 22:13:52] [INFO ] Computed 300 place invariants in 33 ms
[2023-03-18 22:13:53] [INFO ] Implicit Places using invariants in 303 ms returned []
[2023-03-18 22:13:53] [INFO ] Invariant cache hit.
[2023-03-18 22:13:53] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 900 ms to find 0 implicit places.
[2023-03-18 22:13:53] [INFO ] Invariant cache hit.
[2023-03-18 22:13:54] [INFO ] Dead Transitions using invariants and state equation in 581 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1501 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Support contains 1300 out of 1300 places after structural reductions.
[2023-03-18 22:13:54] [INFO ] Flatten gal took : 128 ms
[2023-03-18 22:13:54] [INFO ] Flatten gal took : 96 ms
[2023-03-18 22:13:55] [INFO ] Input system was already deterministic with 1000 transitions.
Incomplete random walk after 10000 steps, including 115 resets, run finished after 1769 ms. (steps per millisecond=5 ) properties (out of 60) seen :46
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 470 ms. (steps per millisecond=21 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-18 22:13:59] [INFO ] Invariant cache hit.
[2023-03-18 22:14:01] [INFO ] After 425ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:13
[2023-03-18 22:14:01] [INFO ] [Nat]Absence check using 300 positive place invariants in 62 ms returned sat
[2023-03-18 22:14:17] [INFO ] After 14625ms SMT Verify possible using state equation in natural domain returned unsat :12 sat :1
[2023-03-18 22:14:20] [INFO ] After 18160ms SMT Verify possible using trap constraints in natural domain returned unsat :12 sat :1
Attempting to minimize the solution found.
Minimization took 4143 ms.
[2023-03-18 22:14:24] [INFO ] After 23703ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :1
Fused 14 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 15 ms.
Support contains 100 out of 1300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Graph (complete) has 3000 edges and 1300 vertex of which 300 are kept as prefixes of interest. Removing 1000 places using SCC suffix rule.4 ms
Discarding 1000 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 57 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 300/1300 places, 1000/1000 transitions.
Incomplete random walk after 10000 steps, including 114 resets, run finished after 576 ms. (steps per millisecond=17 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 365774 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :{}
Probabilistic random walk after 365774 steps, saw 123874 distinct states, run finished after 3002 ms. (steps per millisecond=121 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1000 rows 300 cols
[2023-03-18 22:14:28] [INFO ] Computed 29 place invariants in 48 ms
[2023-03-18 22:14:28] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 17 ms returned sat
[2023-03-18 22:14:37] [INFO ] After 9335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 100 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 18 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 300/300 places, 1000/1000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 18 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-18 22:14:37] [INFO ] Invariant cache hit.
[2023-03-18 22:14:38] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-18 22:14:38] [INFO ] Invariant cache hit.
[2023-03-18 22:14:38] [INFO ] Implicit Places using invariants and state equation in 577 ms returned []
Implicit Place search using SMT with State Equation took 776 ms to find 0 implicit places.
[2023-03-18 22:14:38] [INFO ] Redundant transitions in 60 ms returned []
[2023-03-18 22:14:38] [INFO ] Invariant cache hit.
[2023-03-18 22:14:39] [INFO ] Dead Transitions using invariants and state equation in 317 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1183 ms. Remains : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 20 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-18 22:14:39] [INFO ] Invariant cache hit.
[2023-03-18 22:14:39] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 17 ms returned sat
[2023-03-18 22:14:48] [INFO ] After 9328ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Successfully simplified 12 atomic propositions for a total of 12 simplifications.
[2023-03-18 22:14:48] [INFO ] Flatten gal took : 64 ms
[2023-03-18 22:14:48] [INFO ] Flatten gal took : 66 ms
[2023-03-18 22:14:49] [INFO ] Input system was already deterministic with 1000 transitions.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
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 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 16 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 1300/1300 places, 1000/1000 transitions.
[2023-03-18 22:14:49] [INFO ] Flatten gal took : 48 ms
[2023-03-18 22:14:49] [INFO ] Flatten gal took : 48 ms
[2023-03-18 22:14:49] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 33 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 1300/1300 places, 1000/1000 transitions.
[2023-03-18 22:14:49] [INFO ] Flatten gal took : 43 ms
[2023-03-18 22:14:49] [INFO ] Flatten gal took : 47 ms
[2023-03-18 22:14:49] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 7 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 1300/1300 places, 1000/1000 transitions.
[2023-03-18 22:14:49] [INFO ] Flatten gal took : 40 ms
[2023-03-18 22:14:49] [INFO ] Flatten gal took : 40 ms
[2023-03-18 22:14:49] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Reduce places removed 1000 places and 0 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1000 place count 300 transition count 1000
Applied a total of 1000 rules in 7 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 300/1300 places, 1000/1000 transitions.
[2023-03-18 22:14:49] [INFO ] Flatten gal took : 28 ms
[2023-03-18 22:14:49] [INFO ] Flatten gal took : 30 ms
[2023-03-18 22:14:49] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 9 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 1300/1300 places, 1000/1000 transitions.
[2023-03-18 22:14:49] [INFO ] Flatten gal took : 34 ms
[2023-03-18 22:14:49] [INFO ] Flatten gal took : 37 ms
[2023-03-18 22:14:50] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Graph (complete) has 3000 edges and 1300 vertex of which 300 are kept as prefixes of interest. Removing 1000 places using SCC suffix rule.4 ms
Discarding 1000 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 17 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 300/1300 places, 1000/1000 transitions.
[2023-03-18 22:14:50] [INFO ] Flatten gal took : 28 ms
[2023-03-18 22:14:50] [INFO ] Flatten gal took : 29 ms
[2023-03-18 22:14:50] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 5 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 1300/1300 places, 1000/1000 transitions.
[2023-03-18 22:14:50] [INFO ] Flatten gal took : 34 ms
[2023-03-18 22:14:50] [INFO ] Flatten gal took : 39 ms
[2023-03-18 22:14:50] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 5 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 1300/1300 places, 1000/1000 transitions.
[2023-03-18 22:14:50] [INFO ] Flatten gal took : 32 ms
[2023-03-18 22:14:50] [INFO ] Flatten gal took : 37 ms
[2023-03-18 22:14:50] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Reduce places removed 1000 places and 0 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1000 place count 300 transition count 1000
Applied a total of 1000 rules in 13 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 300/1300 places, 1000/1000 transitions.
[2023-03-18 22:14:50] [INFO ] Flatten gal took : 26 ms
[2023-03-18 22:14:50] [INFO ] Flatten gal took : 29 ms
[2023-03-18 22:14:50] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 17 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 1300/1300 places, 1000/1000 transitions.
[2023-03-18 22:14:50] [INFO ] Flatten gal took : 33 ms
[2023-03-18 22:14:50] [INFO ] Flatten gal took : 36 ms
[2023-03-18 22:14:50] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Graph (complete) has 3000 edges and 1300 vertex of which 300 are kept as prefixes of interest. Removing 1000 places using SCC suffix rule.3 ms
Discarding 1000 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 300/1300 places, 1000/1000 transitions.
[2023-03-18 22:14:50] [INFO ] Flatten gal took : 25 ms
[2023-03-18 22:14:50] [INFO ] Flatten gal took : 28 ms
[2023-03-18 22:14:50] [INFO ] Input system was already deterministic with 1000 transitions.
Finished random walk after 86 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=7 )
FORMULA Sudoku-COL-AN10-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 4 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 1300/1300 places, 1000/1000 transitions.
[2023-03-18 22:14:50] [INFO ] Flatten gal took : 32 ms
[2023-03-18 22:14:51] [INFO ] Flatten gal took : 36 ms
[2023-03-18 22:14:51] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 5 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 1300/1300 places, 1000/1000 transitions.
[2023-03-18 22:14:51] [INFO ] Flatten gal took : 32 ms
[2023-03-18 22:14:51] [INFO ] Flatten gal took : 36 ms
[2023-03-18 22:14:51] [INFO ] Input system was already deterministic with 1000 transitions.
[2023-03-18 22:14:51] [INFO ] Flatten gal took : 43 ms
[2023-03-18 22:14:51] [INFO ] Flatten gal took : 45 ms
[2023-03-18 22:14:51] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 9 ms.
[2023-03-18 22:14:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1300 places, 1000 transitions and 4000 arcs took 6 ms.
Total runtime 60054 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 1300 NrTr: 1000 NrArc: 4000)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.096sec

net check time: 0m 0.000sec

init dd package: 0m 2.879sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9236256 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16093196 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.001sec

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-AN10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is Sudoku-COL-AN10, 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 r490-tall-167912708200073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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