About the Execution of Marcie+red for Sudoku-COL-AN01
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5450.355 | 13466.00 | 13856.00 | 1280.80 | FFTFFFFFTTTFTTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r490-tall-167912708100002.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-AN01, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912708100002
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.7K Feb 26 09:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 09:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 09:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K 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 3.3K Feb 25 17:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 17:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 09:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Feb 26 09:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 09:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 09:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:15 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-AN01-CTLFireability-00
FORMULA_NAME Sudoku-COL-AN01-CTLFireability-01
FORMULA_NAME Sudoku-COL-AN01-CTLFireability-02
FORMULA_NAME Sudoku-COL-AN01-CTLFireability-03
FORMULA_NAME Sudoku-COL-AN01-CTLFireability-04
FORMULA_NAME Sudoku-COL-AN01-CTLFireability-05
FORMULA_NAME Sudoku-COL-AN01-CTLFireability-06
FORMULA_NAME Sudoku-COL-AN01-CTLFireability-07
FORMULA_NAME Sudoku-COL-AN01-CTLFireability-08
FORMULA_NAME Sudoku-COL-AN01-CTLFireability-09
FORMULA_NAME Sudoku-COL-AN01-CTLFireability-10
FORMULA_NAME Sudoku-COL-AN01-CTLFireability-11
FORMULA_NAME Sudoku-COL-AN01-CTLFireability-12
FORMULA_NAME Sudoku-COL-AN01-CTLFireability-13
FORMULA_NAME Sudoku-COL-AN01-CTLFireability-14
FORMULA_NAME Sudoku-COL-AN01-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679170031480
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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN01
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 20:07:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 20:07:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:07:14] [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:07:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 20:07:15] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 460 ms
[2023-03-18 20:07:15] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 4 PT places and 1.0 transition bindings in 10 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 23 ms.
[2023-03-18 20:07:15] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2023-03-18 20:07:15] [INFO ] Skeletonized 16 HLPN properties in 3 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 9 formulas.
FORMULA Sudoku-COL-AN01-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 1 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).
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2023-03-18 20:07:15] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-18 20:07:15] [INFO ] Flatten gal took : 12 ms
FORMULA Sudoku-COL-AN01-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 20:07:15] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:15] [INFO ] Unfolded HLPN to a Petri net with 4 places and 1 transitions 4 arcs in 4 ms.
[2023-03-18 20:07:15] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-COL-AN01-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 1
Applied a total of 1 rules in 4 ms. Remains 3 /4 variables (removed 1) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 3 cols
[2023-03-18 20:07:15] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-18 20:07:17] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 20:07:17] [INFO ] Implicit Places using invariants in 1741 ms returned []
[2023-03-18 20:07:17] [INFO ] Invariant cache hit.
[2023-03-18 20:07:17] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 1793 ms to find 0 implicit places.
[2023-03-18 20:07:17] [INFO ] Invariant cache hit.
[2023-03-18 20:07:17] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/4 places, 1/1 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1826 ms. Remains : 3/4 places, 1/1 transitions.
Support contains 3 out of 3 places after structural reductions.
[2023-03-18 20:07:17] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:07:17] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:07:17] [INFO ] Input system was already deterministic with 1 transitions.
Incomplete random walk after 10000 steps, including 5000 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 21) seen :17
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-18 20:07:18] [INFO ] Invariant cache hit.
[2023-03-18 20:07:18] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
[2023-03-18 20:07:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:07:18] [INFO ] Flatten gal took : 15 ms
[2023-03-18 20:07:18] [INFO ] Input system was already deterministic with 1 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 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).
Starting structural reductions in SI_CTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Applied a total of 0 rules in 2 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 3/3 places, 1/1 transitions.
[2023-03-18 20:07:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:18] [INFO ] Input system was already deterministic with 1 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 3/3 places, 1/1 transitions.
[2023-03-18 20:07:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:07:18] [INFO ] Input system was already deterministic with 1 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 3/3 places, 1/1 transitions.
[2023-03-18 20:07:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:07:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:07:18] [INFO ] Input system was already deterministic with 1 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 3/3 places, 1/1 transitions.
[2023-03-18 20:07:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:07:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:07:18] [INFO ] Input system was already deterministic with 1 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 3/3 places, 1/1 transitions.
[2023-03-18 20:07:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:07:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:07:18] [INFO ] Input system was already deterministic with 1 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 3/3 places, 1/1 transitions.
[2023-03-18 20:07:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:07:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:07:18] [INFO ] Input system was already deterministic with 1 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 3/3 places, 1/1 transitions.
[2023-03-18 20:07:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:07:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:18] [INFO ] Input system was already deterministic with 1 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 3/3 places, 1/1 transitions.
[2023-03-18 20:07:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:07:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:07:18] [INFO ] Input system was already deterministic with 1 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 3/3 places, 1/1 transitions.
[2023-03-18 20:07:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:07:18] [INFO ] Input system was already deterministic with 1 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 3/3 places, 1/1 transitions.
[2023-03-18 20:07:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:07:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:07:18] [INFO ] Input system was already deterministic with 1 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 3/3 places, 1/1 transitions.
[2023-03-18 20:07:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:07:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:07:18] [INFO ] Input system was already deterministic with 1 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 3/3 places, 1/1 transitions.
[2023-03-18 20:07:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:18] [INFO ] Input system was already deterministic with 1 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 0 ms. Remains : 3/3 places, 1/1 transitions.
[2023-03-18 20:07:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:07:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:07:18] [INFO ] Input system was already deterministic with 1 transitions.
[2023-03-18 20:07:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:07:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:07:18] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 19 ms.
[2023-03-18 20:07:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3 places, 1 transitions and 3 arcs took 0 ms.
Total runtime 4088 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=CTLFireability.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 3 NrTr: 1 NrArc: 3)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.800sec
RS generation: 0m 0.000sec
-> reachability set: #nodes 5 (5.0e+00) #states 2
starting MCC model checker
--------------------------
checking: EG [AG [AF [[[1<=p1 & 1<=p2] & 1<=p0]]]]
normalized: EG [~ [E [true U EG [~ [[1<=p0 & [1<=p1 & 1<=p2]]]]]]]
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE
FORMULA Sudoku-COL-AN01-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EG [AF [AG [[[EF [[1<=p0 & [1<=p1 & 1<=p2]]] & 1<=p0] & [1<=p1 & 1<=p2]]]]]
normalized: EG [~ [EG [E [true U ~ [[[E [true U [[1<=p1 & 1<=p2] & 1<=p0]] & 1<=p0] & [1<=p1 & 1<=p2]]]]]]]
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
EG iterations: 0
.
EG iterations: 1
-> the formula is FALSE
FORMULA Sudoku-COL-AN01-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AX [A [AG [[1<=p0 & [1<=p1 & 1<=p2]]] U [1<=p0 & [1<=p1 & 1<=p2]]]]
normalized: ~ [EX [~ [[~ [EG [~ [[[1<=p1 & 1<=p2] & 1<=p0]]]] & ~ [E [~ [[[1<=p1 & 1<=p2] & 1<=p0]] U [~ [[[1<=p1 & 1<=p2] & 1<=p0]] & E [true U ~ [[[1<=p1 & 1<=p2] & 1<=p0]]]]]]]]]]
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
.
EG iterations: 1
.-> the formula is FALSE
FORMULA Sudoku-COL-AN01-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [EX [EG [[EG [[p0<=0 | [p1<=0 | p2<=0]]] & AX [[p0<=0 | [p1<=0 | p2<=0]]]]]] & EX [[p0<=0 | [p1<=0 | p2<=0]]]]
normalized: [EX [EG [[EG [[[p1<=0 | p2<=0] | p0<=0]] & ~ [EX [~ [[[p1<=0 | p2<=0] | p0<=0]]]]]]] & EX [[[p1<=0 | p2<=0] | p0<=0]]]
abstracting: (p0<=0)
states: 1
abstracting: (p2<=0)
states: 1
abstracting: (p1<=0)
states: 1
.abstracting: (p0<=0)
states: 1
abstracting: (p2<=0)
states: 1
abstracting: (p1<=0)
states: 1
.abstracting: (p0<=0)
states: 1
abstracting: (p2<=0)
states: 1
abstracting: (p1<=0)
states: 1
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is TRUE
FORMULA Sudoku-COL-AN01-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [EF [EX [[[p0<=0 | [p1<=0 | p2<=0]] & AG [[p0<=0 | [p1<=0 | p2<=0]]]]]] & AX [EG [[p0<=0 | [p1<=0 | p2<=0]]]]]
normalized: [~ [EX [~ [EG [[[p1<=0 | p2<=0] | p0<=0]]]]] & E [true U EX [[~ [E [true U ~ [[[p1<=0 | p2<=0] | p0<=0]]]] & [[p1<=0 | p2<=0] | p0<=0]]]]]
abstracting: (p0<=0)
states: 1
abstracting: (p2<=0)
states: 1
abstracting: (p1<=0)
states: 1
abstracting: (p0<=0)
states: 1
abstracting: (p2<=0)
states: 1
abstracting: (p1<=0)
states: 1
.abstracting: (p0<=0)
states: 1
abstracting: (p2<=0)
states: 1
abstracting: (p1<=0)
states: 1
.
EG iterations: 1
.-> the formula is TRUE
FORMULA Sudoku-COL-AN01-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: E [[1<=p0 & [1<=p1 & 1<=p2]] U [[EG [[EX [[1<=p0 & [1<=p1 & 1<=p2]]] | [[1<=p0 & [1<=p1 & 1<=p2]] | [1<=p0 & [1<=p1 & 1<=p2]]]]] & 1<=p0] & [1<=p1 & 1<=p2]]]
normalized: E [[[1<=p1 & 1<=p2] & 1<=p0] U [[1<=p1 & 1<=p2] & [EG [[[[[1<=p1 & 1<=p2] & 1<=p0] | [[1<=p1 & 1<=p2] & 1<=p0]] | EX [[[1<=p1 & 1<=p2] & 1<=p0]]]] & 1<=p0]]]
abstracting: (1<=p0)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
.abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
..
EG iterations: 2
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
-> the formula is FALSE
FORMULA Sudoku-COL-AN01-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [AF [EG [[1<=p0 & [1<=p1 & 1<=p2]]]] | ~ [A [EF [[1<=p0 & [1<=p1 & 1<=p2]]] U [[[1<=p0 & [1<=p1 & 1<=p2]] | AF [[1<=p0 & [1<=p1 & 1<=p2]]]] & [AX [[1<=p0 & [1<=p1 & 1<=p2]]] & ~ [EF [[1<=p0 & [1<=p1 & 1<=p2]]]]]]]]]
normalized: [~ [EG [~ [EG [[[1<=p1 & 1<=p2] & 1<=p0]]]]] | ~ [[~ [EG [~ [[[~ [E [true U [[1<=p1 & 1<=p2] & 1<=p0]]] & ~ [EX [~ [[[1<=p1 & 1<=p2] & 1<=p0]]]]] & [~ [EG [~ [[[1<=p1 & 1<=p2] & 1<=p0]]]] | [[1<=p1 & 1<=p2] & 1<=p0]]]]]] & ~ [E [~ [[[~ [E [true U [[1<=p1 & 1<=p2] & 1<=p0]]] & ~ [EX [~ [[[1<=p1 & 1<=p2] & 1<=p0]]]]] & [~ [EG [~ [[[1<=p1 & 1<=p2] & 1<=p0]]]] | [[1<=p1 & 1<=p2] & 1<=p0]]]] U [~ [E [true U [[1<=p1 & 1<=p2] & 1<=p0]]] & ~ [[[~ [E [true U [[1<=p1 & 1<=p2] & 1<=p0]]] & ~ [EX [~ [[[1<=p1 & 1<=p2] & 1<=p0]]]]] & [~ [EG [~ [[[1<=p1 & 1<=p2] & 1<=p0]]]] | [[1<=p1 & 1<=p2] & 1<=p0]]]]]]]]]]
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
.
EG iterations: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
.abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
.
EG iterations: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
.abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
.
EG iterations: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
.abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
EG iterations: 0
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
..
EG iterations: 2
EG iterations: 0
-> the formula is TRUE
FORMULA Sudoku-COL-AN01-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: E [[AF [[~ [AF [[1<=p0 & [1<=p1 & 1<=p2]]]] | [1<=p0 & [1<=p1 & 1<=p2]]]] | [1<=p0 & [1<=p1 & 1<=p2]]] U E [[1<=p0 & [1<=p1 & 1<=p2]] U ~ [EG [[[1<=p0 & [1<=p1 & 1<=p2]] & [1<=p0 & [1<=p1 & 1<=p2]]]]]]]
normalized: E [[[[1<=p1 & 1<=p2] & 1<=p0] | ~ [EG [~ [[[[1<=p1 & 1<=p2] & 1<=p0] | EG [~ [[[1<=p1 & 1<=p2] & 1<=p0]]]]]]]] U E [[[1<=p1 & 1<=p2] & 1<=p0] U ~ [EG [[[[1<=p1 & 1<=p2] & 1<=p0] & [[1<=p1 & 1<=p2] & 1<=p0]]]]]]
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
..
EG iterations: 2
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
.
EG iterations: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
.
EG iterations: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
-> the formula is TRUE
FORMULA Sudoku-COL-AN01-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [EX [AF [EX [[[1<=p0 & [1<=p1 & 1<=p2]] & [1<=p0 & [1<=p1 & 1<=p2]]]]]] & AF [[~ [A [AF [[1<=p0 & [1<=p1 & 1<=p2]]] U [[AX [[1<=p0 & [1<=p1 & 1<=p2]]] & [1<=p0 & 1<=p1]] & [[1<=p2 & 1<=p0] & [1<=p1 & 1<=p2]]]]] | AX [[[p0<=0 | [p1<=0 | p2<=0]] | [p0<=0 | [p1<=0 | p2<=0]]]]]]]
normalized: [~ [EG [~ [[~ [EX [~ [[[[p1<=0 | p2<=0] | p0<=0] | [[p1<=0 | p2<=0] | p0<=0]]]]] | ~ [[~ [EG [~ [[[[1<=p1 & 1<=p2] & [1<=p2 & 1<=p0]] & [[1<=p0 & 1<=p1] & ~ [EX [~ [[[1<=p1 & 1<=p2] & 1<=p0]]]]]]]]] & ~ [E [~ [[[[1<=p1 & 1<=p2] & [1<=p2 & 1<=p0]] & [[1<=p0 & 1<=p1] & ~ [EX [~ [[[1<=p1 & 1<=p2] & 1<=p0]]]]]]] U [EG [~ [[[1<=p1 & 1<=p2] & 1<=p0]]] & ~ [[[[1<=p1 & 1<=p2] & [1<=p2 & 1<=p0]] & [[1<=p0 & 1<=p1] & ~ [EX [~ [[[1<=p1 & 1<=p2] & 1<=p0]]]]]]]]]]]]]]]] & EX [~ [EG [~ [EX [[[[1<=p1 & 1<=p2] & 1<=p0] & [[1<=p1 & 1<=p2] & 1<=p0]]]]]]]]
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
.
EG iterations: 0
.abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
.abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
.
EG iterations: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
.abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
.abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
EG iterations: 0
abstracting: (p0<=0)
states: 1
abstracting: (p2<=0)
states: 1
abstracting: (p1<=0)
states: 1
abstracting: (p0<=0)
states: 1
abstracting: (p2<=0)
states: 1
abstracting: (p1<=0)
states: 1
..
EG iterations: 1
-> the formula is FALSE
FORMULA Sudoku-COL-AN01-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [AF [[AX [[1<=p0 & [1<=p1 & 1<=p2]]] & ~ [A [[[AG [[1<=p0 & [1<=p1 & 1<=p2]]] & [1<=p0 & 1<=p1]] & [[1<=p2 & 1<=p0] & [1<=p1 & 1<=p2]]] U AX [[1<=p0 & [1<=p1 & 1<=p2]]]]]]] | AX [EG [[AX [AG [[1<=p0 & [1<=p1 & 1<=p2]]]] & [AX [[1<=p0 & [1<=p1 & 1<=p2]]] & EX [[1<=p0 & [1<=p1 & 1<=p2]]]]]]]]
normalized: [~ [EX [~ [EG [[[EX [[[1<=p1 & 1<=p2] & 1<=p0]] & ~ [EX [~ [[[1<=p1 & 1<=p2] & 1<=p0]]]]] & ~ [EX [E [true U ~ [[[1<=p1 & 1<=p2] & 1<=p0]]]]]]]]]] | ~ [EG [~ [[~ [[~ [EG [EX [~ [[[1<=p1 & 1<=p2] & 1<=p0]]]]] & ~ [E [EX [~ [[[1<=p1 & 1<=p2] & 1<=p0]]] U [~ [[[[1<=p1 & 1<=p2] & [1<=p2 & 1<=p0]] & [[1<=p0 & 1<=p1] & ~ [E [true U ~ [[[1<=p1 & 1<=p2] & 1<=p0]]]]]]] & EX [~ [[[1<=p1 & 1<=p2] & 1<=p0]]]]]]]] & ~ [EX [~ [[[1<=p1 & 1<=p2] & 1<=p0]]]]]]]]]
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
.abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
.abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
.abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
...
EG iterations: 2
EG iterations: 0
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
.abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
.abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
..
EG iterations: 1
.-> the formula is FALSE
FORMULA Sudoku-COL-AN01-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: A [[~ [[A [[1<=p0 & [1<=p1 & 1<=p2]] U E [[1<=p0 & [1<=p1 & 1<=p2]] U [1<=p0 & [1<=p1 & 1<=p2]]]] | [1<=p0 & [1<=p1 & 1<=p2]]]] | EF [[~ [[1<=p0 & [1<=p1 & 1<=p2]]] | AX [[1<=p0 & [1<=p1 & 1<=p2]]]]]] U ~ [AF [[~ [[1<=p0 & [1<=p1 & 1<=p2]]] | [[[A [[1<=p0 & [1<=p1 & 1<=p2]] U [1<=p0 & [1<=p1 & 1<=p2]]] | [1<=p0 & [1<=p1 & 1<=p2]]] & 1<=p0] & [1<=p1 & 1<=p2]]]]]]
normalized: [~ [EG [~ [EG [~ [[[[1<=p1 & 1<=p2] & [[[[1<=p1 & 1<=p2] & 1<=p0] | [~ [EG [~ [[[1<=p1 & 1<=p2] & 1<=p0]]]] & ~ [E [~ [[[1<=p1 & 1<=p2] & 1<=p0]] U [~ [[[1<=p1 & 1<=p2] & 1<=p0]] & ~ [[[1<=p1 & 1<=p2] & 1<=p0]]]]]]] & 1<=p0]] | ~ [[[1<=p1 & 1<=p2] & 1<=p0]]]]]]]] & ~ [E [~ [EG [~ [[[[1<=p1 & 1<=p2] & [[[[1<=p1 & 1<=p2] & 1<=p0] | [~ [EG [~ [[[1<=p1 & 1<=p2] & 1<=p0]]]] & ~ [E [~ [[[1<=p1 & 1<=p2] & 1<=p0]] U [~ [[[1<=p1 & 1<=p2] & 1<=p0]] & ~ [[[1<=p1 & 1<=p2] & 1<=p0]]]]]]] & 1<=p0]] | ~ [[[1<=p1 & 1<=p2] & 1<=p0]]]]]] U [~ [[E [true U [~ [EX [~ [[[1<=p1 & 1<=p2] & 1<=p0]]]] | ~ [[[1<=p1 & 1<=p2] & 1<=p0]]]] | ~ [[[[1<=p1 & 1<=p2] & 1<=p0] | [~ [EG [~ [E [[[1<=p1 & 1<=p2] & 1<=p0] U [[1<=p1 & 1<=p2] & 1<=p0]]]]] & ~ [E [~ [E [[[1<=p1 & 1<=p2] & 1<=p0] U [[1<=p1 & 1<=p2] & 1<=p0]]] U [~ [[[1<=p1 & 1<=p2] & 1<=p0]] & ~ [E [[[1<=p1 & 1<=p2] & 1<=p0] U [[1<=p1 & 1<=p2] & 1<=p0]]]]]]]]]]] & ~ [EG [~ [[[[1<=p1 & 1<=p2] & [[[[1<=p1 & 1<=p2] & 1<=p0] | [~ [EG [~ [[[1<=p1 & 1<=p2] & 1<=p0]]]] & ~ [E [~ [[[1<=p1 & 1<=p2] & 1<=p0]] U [~ [[[1<=p1 & 1<=p2] & 1<=p0]] & ~ [[[1<=p1 & 1<=p2] & 1<=p0]]]]]]] & 1<=p0]] | ~ [[[1<=p1 & 1<=p2] & 1<=p0]]]]]]]]]]
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
.
EG iterations: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
.
EG iterations: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
.
EG iterations: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
.abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
.
EG iterations: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
.
EG iterations: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
.
EG iterations: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
.
EG iterations: 1
EG iterations: 0
-> the formula is FALSE
FORMULA Sudoku-COL-AN01-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [[AG [[[[A [[1<=p0 & [1<=p1 & 1<=p2]] U [1<=p0 & [1<=p1 & 1<=p2]]] & 1<=p0] & [1<=p1 & 1<=p2]] | [AX [[1<=p0 & [1<=p1 & 1<=p2]]] | [AG [[p0<=0 | [p1<=0 | p2<=0]]] & [[p0<=0 | [p1<=0 | p2<=0]] & [p0<=0 | [p1<=0 | p2<=0]]]]]]] & [AX [[[AG [[p0<=0 | [p1<=0 | p2<=0]]] | [1<=p0 & [1<=p1 & 1<=p2]]] | [[1<=p0 & [1<=p1 & 1<=p2]] | [[1<=p0 & [1<=p1 & 1<=p2]] & [1<=p0 & [1<=p1 & 1<=p2]]]]]] | [1<=p0 & [1<=p1 & 1<=p2]]]]]
normalized: ~ [E [true U ~ [[~ [E [true U ~ [[[[~ [E [true U ~ [[[p1<=0 | p2<=0] | p0<=0]]]] & [[[p1<=0 | p2<=0] | p0<=0] & [[p1<=0 | p2<=0] | p0<=0]]] | ~ [EX [~ [[[1<=p1 & 1<=p2] & 1<=p0]]]]] | [[1<=p1 & 1<=p2] & [[~ [EG [~ [[[1<=p1 & 1<=p2] & 1<=p0]]]] & ~ [E [~ [[[1<=p1 & 1<=p2] & 1<=p0]] U [~ [[[1<=p1 & 1<=p2] & 1<=p0]] & ~ [[[1<=p1 & 1<=p2] & 1<=p0]]]]]] & 1<=p0]]]]]] & [[[1<=p1 & 1<=p2] & 1<=p0] | ~ [EX [~ [[[[[[1<=p1 & 1<=p2] & 1<=p0] & [[1<=p1 & 1<=p2] & 1<=p0]] | [[1<=p1 & 1<=p2] & 1<=p0]] | [[[1<=p1 & 1<=p2] & 1<=p0] | ~ [E [true U ~ [[[p1<=0 | p2<=0] | p0<=0]]]]]]]]]]]]]]
abstracting: (p0<=0)
states: 1
abstracting: (p2<=0)
states: 1
abstracting: (p1<=0)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
.abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
.
EG iterations: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
.abstracting: (p0<=0)
states: 1
abstracting: (p2<=0)
states: 1
abstracting: (p1<=0)
states: 1
abstracting: (p0<=0)
states: 1
abstracting: (p2<=0)
states: 1
abstracting: (p1<=0)
states: 1
abstracting: (p0<=0)
states: 1
abstracting: (p2<=0)
states: 1
abstracting: (p1<=0)
states: 1
-> the formula is TRUE
FORMULA Sudoku-COL-AN01-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [AF [[[[[[[E [[1<=p0 & [1<=p1 & 1<=p2]] U [1<=p0 & [1<=p1 & 1<=p2]]] & 1<=p0] & [1<=p1 & 1<=p2]] | p0<=0] | [p1<=0 | p2<=0]] & [AX [[[1<=p0 & [1<=p1 & 1<=p2]] & [1<=p0 & [1<=p1 & 1<=p2]]]] & [[[[AX [[p0<=0 | [p1<=0 | p2<=0]]] & 1<=p0] & [1<=p1 & 1<=p2]] | p0<=0] | [p1<=0 | p2<=0]]]] | EG [[[[p0<=0 | [p1<=0 | p2<=0]] | [p0<=0 | [p1<=0 | p2<=0]]] & AG [[p0<=0 | [p1<=0 | p2<=0]]]]]]] | EG [[AX [[[[1<=p0 & [1<=p1 & 1<=p2]] & [1<=p0 & [1<=p1 & 1<=p2]]] | [AX [[1<=p0 & [1<=p1 & 1<=p2]]] | AG [[1<=p0 & [1<=p1 & 1<=p2]]]]]] & [[AF [[1<=p0 & [1<=p1 & 1<=p2]]] | [E [[1<=p0 & [1<=p1 & 1<=p2]] U [1<=p0 & [1<=p1 & 1<=p2]]] | [[[EG [[1<=p0 & [1<=p1 & 1<=p2]]] | AG [[1<=p0 & [1<=p1 & 1<=p2]]]] & 1<=p0] & [1<=p1 & 1<=p2]]]] | [p0<=0 | [p1<=0 | p2<=0]]]]]]
normalized: [EG [[[[[p1<=0 | p2<=0] | p0<=0] | [[[[1<=p1 & 1<=p2] & [[~ [E [true U ~ [[[1<=p1 & 1<=p2] & 1<=p0]]]] | EG [[[1<=p1 & 1<=p2] & 1<=p0]]] & 1<=p0]] | E [[[1<=p1 & 1<=p2] & 1<=p0] U [[1<=p1 & 1<=p2] & 1<=p0]]] | ~ [EG [~ [[[1<=p1 & 1<=p2] & 1<=p0]]]]]] & ~ [EX [~ [[[~ [E [true U ~ [[[1<=p1 & 1<=p2] & 1<=p0]]]] | ~ [EX [~ [[[1<=p1 & 1<=p2] & 1<=p0]]]]] | [[[1<=p1 & 1<=p2] & 1<=p0] & [[1<=p1 & 1<=p2] & 1<=p0]]]]]]]] | ~ [EG [~ [[EG [[~ [E [true U ~ [[[p1<=0 | p2<=0] | p0<=0]]]] & [[[p1<=0 | p2<=0] | p0<=0] | [[p1<=0 | p2<=0] | p0<=0]]]] | [[[[p1<=0 | p2<=0] | [[[1<=p1 & 1<=p2] & [~ [EX [~ [[[p1<=0 | p2<=0] | p0<=0]]]] & 1<=p0]] | p0<=0]] & ~ [EX [~ [[[[1<=p1 & 1<=p2] & 1<=p0] & [[1<=p1 & 1<=p2] & 1<=p0]]]]]] & [[p1<=0 | p2<=0] | [[[1<=p1 & 1<=p2] & [E [[[1<=p1 & 1<=p2] & 1<=p0] U [[1<=p1 & 1<=p2] & 1<=p0]] & 1<=p0]] | p0<=0]]]]]]]]
abstracting: (p0<=0)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (p2<=0)
states: 1
abstracting: (p1<=0)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
.abstracting: (p0<=0)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (p0<=0)
states: 1
abstracting: (p2<=0)
states: 1
abstracting: (p1<=0)
states: 1
.abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (p2<=0)
states: 1
abstracting: (p1<=0)
states: 1
abstracting: (p0<=0)
states: 1
abstracting: (p2<=0)
states: 1
abstracting: (p1<=0)
states: 1
abstracting: (p0<=0)
states: 1
abstracting: (p2<=0)
states: 1
abstracting: (p1<=0)
states: 1
abstracting: (p0<=0)
states: 1
abstracting: (p2<=0)
states: 1
abstracting: (p1<=0)
states: 1
.
EG iterations: 1
..
EG iterations: 2
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
.abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
.abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
.
EG iterations: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
..
EG iterations: 2
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (p0<=0)
states: 1
abstracting: (p2<=0)
states: 1
abstracting: (p1<=0)
states: 1
EG iterations: 0
-> the formula is TRUE
FORMULA Sudoku-COL-AN01-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
totally nodes used: 20 (2.0e+01)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 93 11 104
used/not used/entry size/cache size: 21 67108843 16 1024MB
basic ops cache: hits/miss/sum: 284 29 313
used/not used/entry size/cache size: 50 16777166 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 393 7 400
used/not used/entry size/cache size: 7 8388601 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67108844
1 20
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 4.466sec
BK_STOP 1679170044946
--------------------
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 CTLFireability -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.000sec
iterations count:2 (2), effective:1 (1)
initing FirstDep: 0m 0.000sec
iterations count:2 (2), effective:1 (1)
iterations count:1 (1), effective:0 (0)
iterations count:2 (2), effective:1 (1)
iterations count:2 (2), effective:1 (1)
iterations count:1 (1), effective:0 (0)
iterations count:1 (1), effective:0 (0)
iterations count:1 (1), effective:0 (0)
iterations count:1 (1), effective:0 (0)
iterations count:1 (1), effective:0 (0)
iterations count:1 (1), effective:0 (0)
iterations count:2 (2), effective:1 (1)
iterations count:1 (1), effective:0 (0)
iterations count:1 (1), effective:0 (0)
iterations count:1 (1), effective:0 (0)
iterations count:2 (2), effective:1 (1)
iterations count:2 (2), effective:1 (1)
iterations count:1 (1), effective:0 (0)
iterations count:2 (2), effective:1 (1)
iterations count:1 (1), effective:0 (0)
iterations count:1 (1), effective:0 (0)
iterations count:1 (1), effective:0 (0)
iterations count:1 (1), effective:0 (0)
iterations count:1 (1), effective:0 (0)
iterations count:2 (2), effective:1 (1)
iterations count:1 (1), effective:0 (0)
iterations count:1 (1), effective:0 (0)
iterations count:1 (1), effective:0 (0)
iterations count:1 (1), effective:0 (0)
iterations count:1 (1), effective:0 (0)
iterations count:1 (1), effective:0 (0)
iterations count:1 (1), effective:0 (0)
iterations count:2 (2), effective:1 (1)
iterations count:1 (1), effective:0 (0)
iterations count:2 (2), effective:1 (1)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-COL-AN01"
export BK_EXAMINATION="CTLFireability"
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-AN01, examination is CTLFireability"
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-167912708100002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN01.tgz
mv Sudoku-COL-AN01 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;