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.r522-tall-167987247200297.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 Murphy-COL-D2N100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247200297
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 6.7K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 23 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 23 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 20K Mar 31 16:48 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 Murphy-COL-D2N100-CTLCardinality-00
FORMULA_NAME Murphy-COL-D2N100-CTLCardinality-01
FORMULA_NAME Murphy-COL-D2N100-CTLCardinality-02
FORMULA_NAME Murphy-COL-D2N100-CTLCardinality-03
FORMULA_NAME Murphy-COL-D2N100-CTLCardinality-04
FORMULA_NAME Murphy-COL-D2N100-CTLCardinality-05
FORMULA_NAME Murphy-COL-D2N100-CTLCardinality-06
FORMULA_NAME Murphy-COL-D2N100-CTLCardinality-07
FORMULA_NAME Murphy-COL-D2N100-CTLCardinality-08
FORMULA_NAME Murphy-COL-D2N100-CTLCardinality-09
FORMULA_NAME Murphy-COL-D2N100-CTLCardinality-10
FORMULA_NAME Murphy-COL-D2N100-CTLCardinality-11
FORMULA_NAME Murphy-COL-D2N100-CTLCardinality-12
FORMULA_NAME Murphy-COL-D2N100-CTLCardinality-13
FORMULA_NAME Murphy-COL-D2N100-CTLCardinality-14
FORMULA_NAME Murphy-COL-D2N100-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680888033715

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=Murphy-COL-D2N100
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 17:20:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 17:20:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 17:20:35] [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-04-07 17:20:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-07 17:20:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 399 ms
[2023-04-07 17:20:35] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 18 PT places and 21.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
[2023-04-07 17:20:35] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 27 arcs in 3 ms.
[2023-04-07 17:20:35] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Murphy-COL-D2N100-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D2N100-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D2N100-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D2N100-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10016 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=182 ) properties (out of 44) seen :20
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 7 rows 6 cols
[2023-04-07 17:20:35] [INFO ] Computed 2 invariants in 2 ms
[2023-04-07 17:20:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 17:20:36] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:14
[2023-04-07 17:20:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 17:20:36] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :13
[2023-04-07 17:20:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-04-07 17:20:36] [INFO ] After 19ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :4 sat :13
[2023-04-07 17:20:36] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :13
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-04-07 17:20:36] [INFO ] After 172ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :13
Fused 17 Parikh solutions to 13 different solutions.
Parikh walk visited 9 properties in 185 ms.
Support contains 4 out of 6 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6/6 places, 7/7 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 6 transition count 6
Applied a total of 1 rules in 8 ms. Remains 6 /6 variables (removed 0) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 6 cols
[2023-04-07 17:20:36] [INFO ] Computed 2 invariants in 1 ms
[2023-04-07 17:20:36] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 6/6 places, 6/7 transitions.
Incomplete random walk after 10073 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1259 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-07 17:20:36] [INFO ] Invariant cache hit.
[2023-04-07 17:20:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 17:20:36] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-04-07 17:20:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-04-07 17:20:36] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 17:20:36] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 17:20:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 17:20:36] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 17:20:36] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 17:20:36] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-04-07 17:20:36] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 715 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=238 )
Parikh walk visited 2 properties in 3 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2023-04-07 17:20:36] [INFO ] Flatten gal took : 20 ms
[2023-04-07 17:20:36] [INFO ] Flatten gal took : 3 ms
Arc [2:1*[(MOD (ADD $x 1) 3)]] contains successor/predecessor on variables of sort CD
[2023-04-07 17:20:36] [INFO ] Unfolded HLPN to a Petri net with 18 places and 21 transitions 81 arcs in 5 ms.
[2023-04-07 17:20:36] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 18 cols
[2023-04-07 17:20:36] [INFO ] Computed 4 invariants in 2 ms
[2023-04-07 17:20:36] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-04-07 17:20:36] [INFO ] Invariant cache hit.
[2023-04-07 17:20:36] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 17:20:36] [INFO ] Invariant cache hit.
[2023-04-07 17:20:36] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 17:20:36] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-04-07 17:20:36] [INFO ] Invariant cache hit.
[2023-04-07 17:20:36] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109 ms. Remains : 18/18 places, 21/21 transitions.
Support contains 18 out of 18 places after structural reductions.
[2023-04-07 17:20:36] [INFO ] Flatten gal took : 4 ms
[2023-04-07 17:20:36] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:20:36] [INFO ] Input system was already deterministic with 21 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 44) seen :15
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) 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 29) 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 29) 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 29) 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 29) 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 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) 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 29) 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 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) 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 29) 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 29) 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 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) 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 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) 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 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) 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 29) 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 29) 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 29) seen :0
Running SMT prover for 29 properties.
[2023-04-07 17:20:37] [INFO ] Invariant cache hit.
[2023-04-07 17:20:37] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 17:20:37] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 17:20:37] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:26
[2023-04-07 17:20:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 17:20:37] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-07 17:20:37] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :25
[2023-04-07 17:20:37] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 17:20:37] [INFO ] After 56ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :4 sat :25
[2023-04-07 17:20:37] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2023-04-07 17:20:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2023-04-07 17:20:37] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 2 ms to minimize.
[2023-04-07 17:20:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-04-07 17:20:37] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2023-04-07 17:20:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2023-04-07 17:20:37] [INFO ] After 200ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :25
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-04-07 17:20:37] [INFO ] After 375ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :25
Fused 29 Parikh solutions to 25 different solutions.
Parikh walk visited 3 properties in 964 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 17:20:38] [INFO ] Invariant cache hit.
[2023-04-07 17:20:38] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 18/18 places, 21/21 transitions.
Incomplete random walk after 10029 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=668 ) properties (out of 22) 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 22) 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 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) 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 22) 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 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) 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 22) 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 22) seen :0
Interrupted probabilistic random walk after 202564 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 202564 steps, saw 131408 distinct states, run finished after 3002 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 22 properties.
[2023-04-07 17:20:41] [INFO ] Invariant cache hit.
[2023-04-07 17:20:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 17:20:41] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 17:20:41] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2023-04-07 17:20:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 17:20:41] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 17:20:42] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2023-04-07 17:20:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 17:20:42] [INFO ] After 47ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :22
[2023-04-07 17:20:42] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-04-07 17:20:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2023-04-07 17:20:42] [INFO ] After 137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :22
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-04-07 17:20:42] [INFO ] After 282ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :22
Parikh walk visited 3 properties in 574 ms.
Support contains 15 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 18/18 places, 21/21 transitions.
Incomplete random walk after 10086 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=560 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) 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 19) 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 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) 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 19) 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 19) 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 19) 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 19) 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 19) seen :0
Interrupted probabilistic random walk after 245153 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 245153 steps, saw 159795 distinct states, run finished after 3002 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 19 properties.
[2023-04-07 17:20:45] [INFO ] Invariant cache hit.
[2023-04-07 17:20:45] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 17:20:45] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-07 17:20:45] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-04-07 17:20:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 17:20:45] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 17:20:45] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-04-07 17:20:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 17:20:46] [INFO ] After 34ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-04-07 17:20:46] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-04-07 17:20:46] [INFO ] After 206ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Parikh walk visited 0 properties in 444 ms.
Support contains 15 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 18/18 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 17:20:46] [INFO ] Invariant cache hit.
[2023-04-07 17:20:46] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-07 17:20:46] [INFO ] Invariant cache hit.
[2023-04-07 17:20:46] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 17:20:46] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-04-07 17:20:46] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 17:20:46] [INFO ] Invariant cache hit.
[2023-04-07 17:20:46] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running SMT prover for 19 properties.
[2023-04-07 17:20:46] [INFO ] Invariant cache hit.
[2023-04-07 17:20:46] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 17:20:46] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-07 17:20:46] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-04-07 17:20:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 17:20:46] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 17:20:46] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-04-07 17:20:46] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 17:20:46] [INFO ] After 36ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-04-07 17:20:46] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2023-04-07 17:20:46] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2023-04-07 17:20:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 45 ms
[2023-04-07 17:20:46] [INFO ] After 137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-04-07 17:20:46] [INFO ] After 257ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
FORMULA Murphy-COL-D2N100-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 17:20:46] [INFO ] Flatten gal took : 4 ms
[2023-04-07 17:20:46] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:20:46] [INFO ] Input system was already deterministic with 21 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 17:20:46] [INFO ] Invariant cache hit.
[2023-04-07 17:20:47] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 17:20:47] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:20:47] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:20:47] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 17:20:47] [INFO ] Invariant cache hit.
[2023-04-07 17:20:47] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 17:20:47] [INFO ] Flatten gal took : 5 ms
[2023-04-07 17:20:47] [INFO ] Flatten gal took : 4 ms
[2023-04-07 17:20:47] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 17:20:47] [INFO ] Invariant cache hit.
[2023-04-07 17:20:47] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 17:20:47] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:20:47] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:20:47] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 17:20:47] [INFO ] Invariant cache hit.
[2023-04-07 17:20:47] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 17:20:47] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:20:47] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:20:47] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 17:20:47] [INFO ] Invariant cache hit.
[2023-04-07 17:20:47] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 17:20:47] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:20:47] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:20:47] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 17:20:47] [INFO ] Invariant cache hit.
[2023-04-07 17:20:47] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 17:20:47] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:20:47] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:20:47] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 17:20:47] [INFO ] Invariant cache hit.
[2023-04-07 17:20:47] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 17:20:47] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:20:47] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:20:47] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 17:20:47] [INFO ] Invariant cache hit.
[2023-04-07 17:20:47] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 17:20:47] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:20:47] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:20:47] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 17:20:47] [INFO ] Invariant cache hit.
[2023-04-07 17:20:47] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 17:20:47] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:20:47] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:20:47] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 17:20:47] [INFO ] Invariant cache hit.
[2023-04-07 17:20:47] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 17:20:47] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:20:47] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:20:47] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 17:20:47] [INFO ] Invariant cache hit.
[2023-04-07 17:20:47] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 17:20:47] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:20:47] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:20:47] [INFO ] Input system was already deterministic with 21 transitions.
[2023-04-07 17:20:47] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:20:47] [INFO ] Flatten gal took : 17 ms
[2023-04-07 17:20:47] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2023-04-07 17:20:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 18 places, 21 transitions and 81 arcs took 1 ms.
Total runtime 12291 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: 18 NrTr: 21 NrArc: 81)

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

net check time: 0m 0.000sec

init dd package: 0m 2.701sec


RS generation: 0m19.730sec


-> reachability set: #nodes 53223 (5.3e+04) #states 1,207,044,185,616 (12)



starting MCC model checker
--------------------------

checking: EG [sum(p11, p10, p9)<=42]
normalized: EG [sum(p11, p10, p9)<=42]

abstracting: (sum(p11, p10, p9)<=42)
states: 1,207,044,185,616 (12)

EG iterations: 0
-> the formula is TRUE

FORMULA Murphy-COL-D2N100-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.051sec

checking: EG [AG [sum(p17, p16, p15)<=27]]
normalized: EG [~ [E [true U ~ [sum(p17, p16, p15)<=27]]]]

abstracting: (sum(p17, p16, p15)<=27)
states: 1,207,044,185,616 (12)

EG iterations: 0
-> the formula is TRUE

FORMULA Murphy-COL-D2N100-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.049sec

checking: EX [EF [sum(p11, p10, p9)<=94]]
normalized: EX [E [true U sum(p11, p10, p9)<=94]]

abstracting: (sum(p11, p10, p9)<=94)
states: 1,207,044,185,616 (12)
.-> the formula is TRUE

FORMULA Murphy-COL-D2N100-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.111sec

checking: AF [AG [~ [sum(p2, p1, p0)<=sum(p17, p16, p15)]]]
normalized: ~ [EG [E [true U sum(p2, p1, p0)<=sum(p17, p16, p15)]]]

abstracting: (sum(p2, p1, p0)<=sum(p17, p16, p15))
states: 120,025,806 (8)

EG iterations: 0
-> the formula is FALSE

FORMULA Murphy-COL-D2N100-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 5m33.740sec

checking: AG [AX [[[AX [sum(p14, p13, p12)<=sum(p8, p7, p6)] | AF [43<=sum(p8, p7, p6)]] | [sum(p2, p1, p0)<=22 | [sum(p5, p4, p3)<=sum(p2, p1, p0) & [sum(p17, p16, p15)<=sum(p8, p7, p6) & sum(p11, p10, p9)<=50]]]]]]
normalized: ~ [E [true U EX [~ [[[sum(p2, p1, p0)<=22 | [sum(p5, p4, p3)<=sum(p2, p1, p0) & [sum(p17, p16, p15)<=sum(p8, p7, p6) & sum(p11, p10, p9)<=50]]] | [~ [EG [~ [43<=sum(p8, p7, p6)]]] | ~ [EX [~ [sum(p14, p13, p12)<=sum(p8, p7, p6)]]]]]]]]]

abstracting: (sum(p14, p13, p12)<=sum(p8, p7, p6))
states: 1,207,018,743,448 (12)
.abstracting: (43<=sum(p8, p7, p6))
states: 1,178,483,381,064 (12)
.
EG iterations: 1
abstracting: (sum(p11, p10, p9)<=50)
states: 1,207,044,185,616 (12)
abstracting: (sum(p17, p16, p15)<=sum(p8, p7, p6))
states: 1,206,970,339,952 (12)
abstracting: (sum(p5, p4, p3)<=sum(p2, p1, p0))
MC time: 7m44.086sec

checking: EX [[A [AF [sum(p14, p13, p12)<=sum(p8, p7, p6)] U ~ [[sum(p17, p16, p15)<=38 | [A [sum(p17, p16, p15)<=58 U sum(p17, p16, p15)<=36] | EG [sum(p14, p13, p12)<=8]]]]] & A [sum(p8, p7, p6)<=sum(p14, p13, p12) U EX [AG [sum(p11, p10, p9)<=40]]]]]
normalized: EX [[[~ [EG [~ [EX [~ [E [true U ~ [sum(p11, p10, p9)<=40]]]]]]] & ~ [E [~ [EX [~ [E [true U ~ [sum(p11, p10, p9)<=40]]]]] U [~ [EX [~ [E [true U ~ [sum(p11, p10, p9)<=40]]]]] & ~ [sum(p8, p7, p6)<=sum(p14, p13, p12)]]]]] & [~ [EG [[sum(p17, p16, p15)<=38 | [EG [sum(p14, p13, p12)<=8] | [~ [EG [~ [sum(p17, p16, p15)<=36]]] & ~ [E [~ [sum(p17, p16, p15)<=36] U [~ [sum(p17, p16, p15)<=58] & ~ [sum(p17, p16, p15)<=36]]]]]]]]] & ~ [E [[sum(p17, p16, p15)<=38 | [EG [sum(p14, p13, p12)<=8] | [~ [EG [~ [sum(p17, p16, p15)<=36]]] & ~ [E [~ [sum(p17, p16, p15)<=36] U [~ [sum(p17, p16, p15)<=58] & ~ [sum(p17, p16, p15)<=36]]]]]]] U [EG [~ [sum(p14, p13, p12)<=sum(p8, p7, p6)]] & [sum(p17, p16, p15)<=38 | [EG [sum(p14, p13, p12)<=8] | [~ [EG [~ [sum(p17, p16, p15)<=36]]] & ~ [E [~ [sum(p17, p16, p15)<=36] U [~ [sum(p17, p16, p15)<=58] & ~ [sum(p17, p16, p15)<=36]]]]]]]]]]]]]

abstracting: (sum(p17, p16, p15)<=36)
states: 1,207,044,185,616 (12)
abstracting: (sum(p17, p16, p15)<=58)
states: 1,207,044,185,616 (12)
abstracting: (sum(p17, p16, p15)<=36)
states: 1,207,044,185,616 (12)
abstracting: (sum(p17, p16, p15)<=36)
states: 1,207,044,185,616 (12)
.
EG iterations: 1
abstracting: (sum(p14, p13, p12)<=8)
states: 1,207,044,185,616 (12)

EG iterations: 0
abstracting: (sum(p17, p16, p15)<=38)
states: 1,207,044,185,616 (12)
abstracting: (sum(p14, p13, p12)<=sum(p8, p7, p6))
states: 1,207,018,743,448 (12)
.
EG iterations: 1
abstracting: (sum(p17, p16, p15)<=36)
states: 1,207,044,185,616 (12)
abstracting: (sum(p17, p16, p15)<=58)
states: 1,207,044,185,616 (12)
abstracting: (sum(p17, p16, p15)<=36)
states: 1,207,044,185,616 (12)
abstracting: (sum(p17, p16, p15)<=36)
states: 1,207,044,185,616 (12)
.
EG iterations: 1
abstracting: (sum(p14, p13, p12)<=8)
states: 1,207,044,185,616 (12)

EG iterations: 0
abstracting: (sum(p17, p16, p15)<=38)
states: 1,207,044,185,616 (12)
abstracting: (sum(p17, p16, p15)<=36)
states: 1,207,044,185,616 (12)
abstracting: (sum(p17, p16, p15)<=58)
states: 1,207,044,185,616 (12)
abstracting: (sum(p17, p16, p15)<=36)
states: 1,207,044,185,616 (12)
abstracting: (sum(p17, p16, p15)<=36)
states: 1,207,044,185,616 (12)
.
EG iterations: 1
abstracting: (sum(p14, p13, p12)<=8)
states: 1,207,044,185,616 (12)

EG iterations: 0
abstracting: (sum(p17, p16, p15)<=38)
states: 1,207,044,185,616 (12)

EG iterations: 0
abstracting: (sum(p8, p7, p6)<=sum(p14, p13, p12))
states: 51,230,112 (7)
abstracting: (sum(p11, p10, p9)<=40)
states: 1,207,044,185,616 (12)
.abstracting: (sum(p11, p10, p9)<=40)
states: 1,207,044,185,616 (12)
.abstracting: (sum(p11, p10, p9)<=40)
states: 1,207,044,185,616 (12)
..
EG iterations: 1
.-> the formula is FALSE

FORMULA Murphy-COL-D2N100-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m26.230sec

checking: EF [[EX [EF [~ [88<=sum(p11, p10, p9)]]] & [[AF [sum(p14, p13, p12)<=30] | A [70<=sum(p8, p7, p6) U 81<=sum(p5, p4, p3)]] | [A [EX [sum(p2, p1, p0)<=28] U [sum(p5, p4, p3)<=29 & sum(p11, p10, p9)<=sum(p2, p1, p0)]] | [85<=sum(p2, p1, p0) | ~ [73<=sum(p5, p4, p3)]]]]]]
normalized: E [true U [[[[85<=sum(p2, p1, p0) | ~ [73<=sum(p5, p4, p3)]] | [~ [EG [~ [[sum(p5, p4, p3)<=29 & sum(p11, p10, p9)<=sum(p2, p1, p0)]]]] & ~ [E [~ [[sum(p5, p4, p3)<=29 & sum(p11, p10, p9)<=sum(p2, p1, p0)]] U [~ [EX [sum(p2, p1, p0)<=28]] & ~ [[sum(p5, p4, p3)<=29 & sum(p11, p10, p9)<=sum(p2, p1, p0)]]]]]]] | [[~ [EG [~ [81<=sum(p5, p4, p3)]]] & ~ [E [~ [81<=sum(p5, p4, p3)] U [~ [70<=sum(p8, p7, p6)] & ~ [81<=sum(p5, p4, p3)]]]]] | ~ [EG [~ [sum(p14, p13, p12)<=30]]]]] & EX [E [true U ~ [88<=sum(p11, p10, p9)]]]]]

abstracting: (88<=sum(p11, p10, p9))
states: 0

BK_STOP 1680889151880

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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.000sec


iterations count:14959 (712), effective:3586 (170)

initing FirstDep: 0m 0.000sec


iterations count:21 (1), effective:0 (0)

iterations count:5873 (279), effective:1386 (66)

idd.h:1025: Timeout: after 463 sec


iterations count:4602 (219), effective:918 (43)

iterations count:21 (1), effective:0 (0)
/home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin//../BenchKit_head.sh: line 16: 598 Killed ${MARCIE} --net-file=model.pnml --mcc-file=${BK_EXAMINATION}.xml ${MARCIE_CONFIG}

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="Murphy-COL-D2N100"
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 Murphy-COL-D2N100, 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 r522-tall-167987247200297"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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