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.r330-tall-167889203800818.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 RingSingleMessageInMbox-PT-d0m080, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203800818
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.7K Feb 26 05:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 05:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 05:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 05:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 05:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 26 05:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 05:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 26 05:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 64K 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 RingSingleMessageInMbox-PT-d0m080-CTLFireability-00
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-01
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-02
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-03
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-04
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-05
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-06
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-07
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-08
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-09
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-10
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-11
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-12
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-13
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-14
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679183791113

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=RingSingleMessageInMbox-PT-d0m080
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:56:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 23:56:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:56:32] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2023-03-18 23:56:32] [INFO ] Transformed 385 places.
[2023-03-18 23:56:32] [INFO ] Transformed 59 transitions.
[2023-03-18 23:56:32] [INFO ] Parsed PT model containing 385 places and 59 transitions and 236 arcs in 99 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Deduced a syphon composed of 329 places in 0 ms
Reduce places removed 329 places and 0 transitions.
Support contains 50 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 59/59 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 59
Applied a total of 2 rules in 11 ms. Remains 54 /56 variables (removed 2) and now considering 59/59 (removed 0) transitions.
// Phase 1: matrix 59 rows 54 cols
[2023-03-18 23:56:32] [INFO ] Computed 3 place invariants in 10 ms
[2023-03-18 23:56:33] [INFO ] Implicit Places using invariants in 336 ms returned []
[2023-03-18 23:56:33] [INFO ] Invariant cache hit.
[2023-03-18 23:56:33] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-18 23:56:33] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
[2023-03-18 23:56:33] [INFO ] Invariant cache hit.
[2023-03-18 23:56:33] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 54/56 places, 59/59 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 511 ms. Remains : 54/56 places, 59/59 transitions.
Support contains 50 out of 54 places after structural reductions.
[2023-03-18 23:56:33] [INFO ] Flatten gal took : 21 ms
[2023-03-18 23:56:33] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:56:33] [INFO ] Input system was already deterministic with 59 transitions.
Incomplete random walk after 10000 steps, including 2134 resets, run finished after 492 ms. (steps per millisecond=20 ) properties (out of 63) seen :34
Incomplete Best-First random walk after 1001 steps, including 56 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 48 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 47 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 29) seen :1
Incomplete Best-First random walk after 1000 steps, including 109 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 96 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 77 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :2
Incomplete Best-First random walk after 1001 steps, including 74 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 158 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 92 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 94 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 94 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 33 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 98 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Running SMT prover for 26 properties.
[2023-03-18 23:56:34] [INFO ] Invariant cache hit.
[2023-03-18 23:56:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:56:34] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 5 ms returned sat
[2023-03-18 23:56:34] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:21
[2023-03-18 23:56:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:56:34] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 23:56:34] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :12 sat :14
[2023-03-18 23:56:34] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-18 23:56:34] [INFO ] After 86ms SMT Verify possible using 27 Read/Feed constraints in natural domain returned unsat :12 sat :14
[2023-03-18 23:56:34] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 4 ms to minimize.
[2023-03-18 23:56:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-18 23:56:34] [INFO ] After 270ms SMT Verify possible using trap constraints in natural domain returned unsat :12 sat :14
Attempting to minimize the solution found.
Minimization took 80 ms.
[2023-03-18 23:56:34] [INFO ] After 535ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :14
Fused 26 Parikh solutions to 14 different solutions.
Parikh walk visited 5 properties in 99 ms.
Support contains 13 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 50 transition count 53
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 50 transition count 53
Applied a total of 8 rules in 8 ms. Remains 50 /54 variables (removed 4) and now considering 53/59 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 50/54 places, 53/59 transitions.
Incomplete random walk after 10000 steps, including 2155 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 495 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 505 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 490 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 478 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 893 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 442 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 509 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 928 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 53 rows 50 cols
[2023-03-18 23:56:35] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-18 23:56:35] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-18 23:56:35] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-18 23:56:35] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 23:56:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:56:35] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 11 ms returned sat
[2023-03-18 23:56:35] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-18 23:56:35] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-18 23:56:35] [INFO ] After 34ms SMT Verify possible using 23 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-18 23:56:35] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-18 23:56:35] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 59 ms.
Support contains 10 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 53/53 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 50/50 places, 53/53 transitions.
Incomplete random walk after 10000 steps, including 2107 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 486 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 496 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 871 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 493 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 914 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 3498171 steps, run timeout after 3001 ms. (steps per millisecond=1165 ) properties seen :{0=1, 2=1, 3=1, 4=1, 5=1}
Probabilistic random walk after 3498171 steps, saw 1342628 distinct states, run finished after 3002 ms. (steps per millisecond=1165 ) properties seen :5
Running SMT prover for 1 properties.
[2023-03-18 23:56:39] [INFO ] Invariant cache hit.
[2023-03-18 23:56:39] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 23:56:39] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 23:56:39] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:56:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:56:39] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 23:56:39] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:56:39] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-18 23:56:39] [INFO ] After 5ms SMT Verify possible using 23 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 23:56:39] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-18 23:56:39] [INFO ] After 77ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 53/53 transitions.
Graph (complete) has 132 edges and 50 vertex of which 49 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 49 transition count 50
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 47 transition count 48
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 47 transition count 48
Applied a total of 8 rules in 14 ms. Remains 47 /50 variables (removed 3) and now considering 48/53 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 47/50 places, 48/53 transitions.
Incomplete random walk after 10000 steps, including 2164 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 456 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3617462 steps, run timeout after 3001 ms. (steps per millisecond=1205 ) properties seen :{}
Probabilistic random walk after 3617462 steps, saw 1377298 distinct states, run finished after 3001 ms. (steps per millisecond=1205 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 48 rows 47 cols
[2023-03-18 23:56:42] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-18 23:56:42] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-18 23:56:42] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 23:56:42] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:56:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-18 23:56:42] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 23:56:42] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:56:42] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-18 23:56:42] [INFO ] After 5ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 23:56:42] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-18 23:56:42] [INFO ] After 68ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 47 /47 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 47/47 places, 48/48 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 47 /47 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2023-03-18 23:56:42] [INFO ] Invariant cache hit.
[2023-03-18 23:56:42] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-18 23:56:42] [INFO ] Invariant cache hit.
[2023-03-18 23:56:42] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-18 23:56:42] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2023-03-18 23:56:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 23:56:42] [INFO ] Invariant cache hit.
[2023-03-18 23:56:42] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 47/47 places, 48/48 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 46 transition count 46
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 3 place count 46 transition count 39
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 17 place count 39 transition count 39
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 25 place count 35 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 34 transition count 35
Applied a total of 27 rules in 8 ms. Remains 34 /47 variables (removed 13) and now considering 35/48 (removed 13) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 35 rows 34 cols
[2023-03-18 23:56:42] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-18 23:56:42] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 23:56:42] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:56:42] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:56:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 23:56:43] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:56:43] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:56:43] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2023-03-18 23:56:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-18 23:56:43] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2023-03-18 23:56:43] [INFO ] After 89ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Successfully simplified 13 atomic propositions for a total of 16 simplifications.
FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 23:56:43] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-18 23:56:43] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:56:43] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 23:56:43] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:56:43] [INFO ] Input system was already deterministic with 59 transitions.
Support contains 36 out of 54 places (down from 40) after GAL structural reductions.
Computed a total of 6 stabilizing places and 12 stable transitions
Graph (complete) has 164 edges and 54 vertex of which 53 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 48 transition count 53
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 48 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 47 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 47 transition count 52
Applied a total of 14 rules in 4 ms. Remains 47 /54 variables (removed 7) and now considering 52/59 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 47/54 places, 52/59 transitions.
[2023-03-18 23:56:43] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:56:43] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:56:43] [INFO ] Input system was already deterministic with 52 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 47 transition count 50
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 47 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 46 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 46 transition count 49
Applied a total of 16 rules in 3 ms. Remains 46 /54 variables (removed 8) and now considering 49/59 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 46/54 places, 49/59 transitions.
[2023-03-18 23:56:43] [INFO ] Flatten gal took : 7 ms
[2023-03-18 23:56:43] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:56:43] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 47 transition count 50
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 47 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 46 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 46 transition count 49
Applied a total of 16 rules in 3 ms. Remains 46 /54 variables (removed 8) and now considering 49/59 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 46/54 places, 49/59 transitions.
[2023-03-18 23:56:43] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:56:43] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:56:43] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 48 transition count 51
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 48 transition count 51
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 47 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 47 transition count 50
Applied a total of 14 rules in 3 ms. Remains 47 /54 variables (removed 7) and now considering 50/59 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 47/54 places, 50/59 transitions.
[2023-03-18 23:56:43] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:56:43] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:56:43] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 47 transition count 50
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 47 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 46 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 46 transition count 49
Applied a total of 16 rules in 6 ms. Remains 46 /54 variables (removed 8) and now considering 49/59 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 46/54 places, 49/59 transitions.
[2023-03-18 23:56:43] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:56:43] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:56:43] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 48 transition count 51
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 48 transition count 51
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 47 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 47 transition count 50
Applied a total of 14 rules in 5 ms. Remains 47 /54 variables (removed 7) and now considering 50/59 (removed 9) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 47/54 places, 50/59 transitions.
[2023-03-18 23:56:43] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:56:43] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:56:43] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 47 transition count 50
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 47 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 46 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 46 transition count 49
Applied a total of 16 rules in 3 ms. Remains 46 /54 variables (removed 8) and now considering 49/59 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 46/54 places, 49/59 transitions.
[2023-03-18 23:56:43] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:56:43] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:56:43] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 49 transition count 54
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 49 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 48 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 48 transition count 53
Applied a total of 12 rules in 4 ms. Remains 48 /54 variables (removed 6) and now considering 53/59 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 48/54 places, 53/59 transitions.
[2023-03-18 23:56:43] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:56:43] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:56:43] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 49 transition count 54
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 49 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 48 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 48 transition count 53
Applied a total of 12 rules in 6 ms. Remains 48 /54 variables (removed 6) and now considering 53/59 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 48/54 places, 53/59 transitions.
[2023-03-18 23:56:43] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:56:43] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:56:43] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 51 transition count 56
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 51 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 50 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 50 transition count 55
Applied a total of 8 rules in 2 ms. Remains 50 /54 variables (removed 4) and now considering 55/59 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 50/54 places, 55/59 transitions.
[2023-03-18 23:56:43] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:56:43] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:56:43] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 47 transition count 50
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 47 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 46 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 46 transition count 49
Applied a total of 16 rules in 5 ms. Remains 46 /54 variables (removed 8) and now considering 49/59 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 46/54 places, 49/59 transitions.
[2023-03-18 23:56:43] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:56:43] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:56:43] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 47 transition count 50
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 47 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 46 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 46 transition count 49
Applied a total of 16 rules in 2 ms. Remains 46 /54 variables (removed 8) and now considering 49/59 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 46/54 places, 49/59 transitions.
[2023-03-18 23:56:43] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:56:43] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:56:43] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 49 transition count 54
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 49 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 48 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 48 transition count 53
Applied a total of 12 rules in 2 ms. Remains 48 /54 variables (removed 6) and now considering 53/59 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 48/54 places, 53/59 transitions.
[2023-03-18 23:56:43] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:56:43] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:56:43] [INFO ] Input system was already deterministic with 53 transitions.
[2023-03-18 23:56:43] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:56:43] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:56:43] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-18 23:56:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 54 places, 59 transitions and 231 arcs took 1 ms.
Total runtime 10804 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: 54 NrTr: 59 NrArc: 231)

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

net check time: 0m 0.000sec

init dd package: 0m 2.764sec


RS generation: 0m 2.959sec


-> reachability set: #nodes 35273 (3.5e+04) #states 350,014,562 (8)



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

checking: AF [[1<=p1 & 1<=p49]]
normalized: ~ [EG [~ [[1<=p1 & 1<=p49]]]]

abstracting: (1<=p49)
states: 24,988,964 (7)
abstracting: (1<=p1)
states: 80,055,442 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.975sec

checking: EX [EG [EF [[1<=p1 & 1<=p40]]]]
normalized: EX [EG [E [true U [1<=p1 & 1<=p40]]]]

abstracting: (1<=p40)
states: 11,481,860 (7)
abstracting: (1<=p1)
states: 80,055,442 (7)
...
EG iterations: 3
.-> the formula is TRUE

FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.813sec

checking: AX [A [~ [[1<=p15 & 1<=p18]] U ~ [EF [[1<=p5 & 1<=p28]]]]]
normalized: ~ [EX [~ [[~ [EG [E [true U [1<=p5 & 1<=p28]]]] & ~ [E [E [true U [1<=p5 & 1<=p28]] U [E [true U [1<=p5 & 1<=p28]] & [1<=p15 & 1<=p18]]]]]]]]

abstracting: (1<=p18)
states: 348,292,994 (8)
abstracting: (1<=p15)
states: 6,326,320 (6)
abstracting: (1<=p28)
states: 43,935,060 (7)
abstracting: (1<=p5)
states: 34,692,060 (7)
abstracting: (1<=p28)
states: 43,935,060 (7)
abstracting: (1<=p5)
states: 34,692,060 (7)
abstracting: (1<=p28)
states: 43,935,060 (7)
abstracting: (1<=p5)
states: 34,692,060 (7)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.196sec

checking: AG [AX [AF [~ [E [[1<=p1 & 1<=p20] U [1<=p17 & 1<=p36]]]]]]
normalized: ~ [E [true U EX [EG [E [[1<=p1 & 1<=p20] U [1<=p17 & 1<=p36]]]]]]

abstracting: (1<=p36)
states: 35,616,360 (7)
abstracting: (1<=p17)
states: 76,104,808 (7)
abstracting: (1<=p20)
states: 2
abstracting: (1<=p1)
states: 80,055,442 (7)
..
EG iterations: 2
.-> the formula is TRUE

FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.026sec

checking: EF [EX [[A [[1<=p1 & 1<=p23] U AX [[1<=p1 & 1<=p45]]] & [1<=p1 & 1<=p51]]]]
normalized: E [true U EX [[[1<=p1 & 1<=p51] & [~ [EG [EX [~ [[1<=p1 & 1<=p45]]]]] & ~ [E [EX [~ [[1<=p1 & 1<=p45]]] U [~ [[1<=p1 & 1<=p23]] & EX [~ [[1<=p1 & 1<=p45]]]]]]]]]]

abstracting: (1<=p45)
states: 37,539,141 (7)
abstracting: (1<=p1)
states: 80,055,442 (7)
.abstracting: (1<=p23)
states: 18,907,702 (7)
abstracting: (1<=p1)
states: 80,055,442 (7)
abstracting: (1<=p45)
states: 37,539,141 (7)
abstracting: (1<=p1)
states: 80,055,442 (7)
.abstracting: (1<=p45)
states: 37,539,141 (7)
abstracting: (1<=p1)
states: 80,055,442 (7)
....................................................................................................................................................................
EG iterations: 163
abstracting: (1<=p51)
states: 24,988,964 (7)
abstracting: (1<=p1)
states: 80,055,442 (7)
.-> the formula is FALSE

FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m19.880sec

checking: AG [[EF [[1<=p1 & 1<=p43]] | [[1<=p12 & 1<=p18] | [EX [EF [[p1<=0 | p27<=0]]] & [p1<=0 | p51<=0]]]]]
normalized: ~ [E [true U ~ [[[[[p1<=0 | p51<=0] & EX [E [true U [p1<=0 | p27<=0]]]] | [1<=p12 & 1<=p18]] | E [true U [1<=p1 & 1<=p43]]]]]]

abstracting: (1<=p43)
states: 1,305,542 (6)
abstracting: (1<=p1)
states: 80,055,442 (7)
abstracting: (1<=p18)
states: 348,292,994 (8)
abstracting: (1<=p12)
states: 3,327,480 (6)
abstracting: (p27<=0)
states: 214,213,325 (8)
abstracting: (p1<=0)
states: 269,959,120 (8)
.abstracting: (p51<=0)
states: 325,025,598 (8)
abstracting: (p1<=0)
states: 269,959,120 (8)
-> the formula is FALSE

FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.300sec

checking: EG [AG [[AF [EG [[1<=p1 & 1<=p47]]] | [[AF [[1<=p1 & 1<=p22]] & EF [[p1<=0 | p49<=0]]] & [1<=p5 & 1<=p28]]]]]
normalized: EG [~ [E [true U ~ [[[[1<=p5 & 1<=p28] & [E [true U [p1<=0 | p49<=0]] & ~ [EG [~ [[1<=p1 & 1<=p22]]]]]] | ~ [EG [~ [EG [[1<=p1 & 1<=p47]]]]]]]]]]

abstracting: (1<=p47)
states: 37,539,141 (7)
abstracting: (1<=p1)
states: 80,055,442 (7)
...............................................................................................................................................................
EG iterations: 159

EG iterations: 0
abstracting: (1<=p22)
states: 135,801,237 (8)
abstracting: (1<=p1)
states: 80,055,442 (7)
..
EG iterations: 2
abstracting: (p49<=0)
states: 325,025,598 (8)
abstracting: (p1<=0)
states: 269,959,120 (8)
abstracting: (1<=p28)
states: 43,935,060 (7)
abstracting: (1<=p5)
states: 34,692,060 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.308sec

checking: [AG [[~ [E [[1<=p24 & 1<=p13] U [1<=p1 & 1<=p51]]] & ~ [E [[1<=p4 & 1<=p18] U [1<=p1 & 1<=p40]]]]] | AF [AX [[1<=p1 & 1<=p43]]]]
normalized: [~ [EG [EX [~ [[1<=p1 & 1<=p43]]]]] | ~ [E [true U ~ [[~ [E [[1<=p4 & 1<=p18] U [1<=p1 & 1<=p40]]] & ~ [E [[1<=p24 & 1<=p13] U [1<=p1 & 1<=p51]]]]]]]]

abstracting: (1<=p51)
states: 24,988,964 (7)
abstracting: (1<=p1)
states: 80,055,442 (7)
abstracting: (1<=p13)
states: 10,070,920 (7)
abstracting: (1<=p24)
states: 47,713,788 (7)
abstracting: (1<=p40)
states: 11,481,860 (7)
abstracting: (1<=p1)
states: 80,055,442 (7)
abstracting: (1<=p18)
states: 348,292,994 (8)
abstracting: (1<=p4)
states: 5,253,500 (6)
abstracting: (1<=p43)
states: 1,305,542 (6)
abstracting: (1<=p1)
states: 80,055,442 (7)
..................................................................................................................................................................
EG iterations: 161
-> the formula is FALSE

FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.167sec

checking: AG [[EF [[p1<=0 | p18<=0]] | [[E [[1<=p10 & 1<=p34] U [1<=p1 & 1<=p50]] & 1<=p1] & [1<=p48 & [p2<=0 | p34<=0]]]]]
normalized: ~ [E [true U ~ [[[[1<=p48 & [p2<=0 | p34<=0]] & [1<=p1 & E [[1<=p10 & 1<=p34] U [1<=p1 & 1<=p50]]]] | E [true U [p1<=0 | p18<=0]]]]]]

abstracting: (p18<=0)
states: 1,721,568 (6)
abstracting: (p1<=0)
states: 269,959,120 (8)
abstracting: (1<=p50)
states: 24,988,964 (7)
abstracting: (1<=p1)
states: 80,055,442 (7)
abstracting: (1<=p34)
states: 35,616,360 (7)
abstracting: (1<=p10)
states: 16,144,440 (7)
abstracting: (1<=p1)
states: 80,055,442 (7)
abstracting: (p34<=0)
states: 314,398,202 (8)
abstracting: (p2<=0)
states: 255,362,132 (8)
abstracting: (1<=p48)
states: 327,897,570 (8)
-> the formula is TRUE

FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.276sec

checking: E [~ [AX [[1<=p1 & 1<=p20]]] U A [AX [A [[1<=p2 & 1<=p34] U [1<=p1 & 1<=p39]]] U ~ [[[AX [[1<=p1 & 1<=p49]] & [1<=p1 & 1<=p38]] | ~ [AG [[1<=p2 & 1<=p36]]]]]]]
normalized: E [EX [~ [[1<=p1 & 1<=p20]]] U [~ [EG [[E [true U ~ [[1<=p2 & 1<=p36]]] | [[1<=p1 & 1<=p38] & ~ [EX [~ [[1<=p1 & 1<=p49]]]]]]]] & ~ [E [[E [true U ~ [[1<=p2 & 1<=p36]]] | [[1<=p1 & 1<=p38] & ~ [EX [~ [[1<=p1 & 1<=p49]]]]]] U [EX [~ [[~ [EG [~ [[1<=p1 & 1<=p39]]]] & ~ [E [~ [[1<=p1 & 1<=p39]] U [~ [[1<=p2 & 1<=p34]] & ~ [[1<=p1 & 1<=p39]]]]]]]] & [E [true U ~ [[1<=p2 & 1<=p36]]] | [[1<=p1 & 1<=p38] & ~ [EX [~ [[1<=p1 & 1<=p49]]]]]]]]]]]

abstracting: (1<=p49)
states: 24,988,964 (7)
abstracting: (1<=p1)
states: 80,055,442 (7)
.abstracting: (1<=p38)
states: 64,863,266 (7)
abstracting: (1<=p1)
states: 80,055,442 (7)
abstracting: (1<=p36)
states: 35,616,360 (7)
abstracting: (1<=p2)
states: 94,652,430 (7)
abstracting: (1<=p39)
states: 11,481,860 (7)
abstracting: (1<=p1)
states: 80,055,442 (7)
abstracting: (1<=p34)
states: 35,616,360 (7)
abstracting: (1<=p2)
states: 94,652,430 (7)
abstracting: (1<=p39)
states: 11,481,860 (7)
abstracting: (1<=p1)
states: 80,055,442 (7)
abstracting: (1<=p39)
states: 11,481,860 (7)
abstracting: (1<=p1)
states: 80,055,442 (7)
.
EG iterations: 1
.abstracting: (1<=p49)
states: 24,988,964 (7)
abstracting: (1<=p1)
states: 80,055,442 (7)
.abstracting: (1<=p38)
states: 64,863,266 (7)
abstracting: (1<=p1)
states: 80,055,442 (7)
abstracting: (1<=p36)
states: 35,616,360 (7)
abstracting: (1<=p2)
states: 94,652,430 (7)
abstracting: (1<=p49)
states: 24,988,964 (7)
abstracting: (1<=p1)
states: 80,055,442 (7)
.abstracting: (1<=p38)
states: 64,863,266 (7)
abstracting: (1<=p1)
states: 80,055,442 (7)
abstracting: (1<=p36)
states: 35,616,360 (7)
abstracting: (1<=p2)
states: 94,652,430 (7)

EG iterations: 0
abstracting: (1<=p20)
states: 2
abstracting: (1<=p1)
states: 80,055,442 (7)
.-> the formula is FALSE

FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.172sec

checking: A [[~ [[1<=p3 & 1<=p18]] | [~ [AX [[1<=p1 & 1<=p51]]] | [EF [AX [[1<=p16 & 1<=p18]]] & [1<=p4 & 1<=p18]]]] U [AF [[1<=p1 & 1<=p26]] & [1<=p1 & 1<=p27]]]
normalized: [~ [EG [~ [[[1<=p1 & 1<=p27] & ~ [EG [~ [[1<=p1 & 1<=p26]]]]]]]] & ~ [E [~ [[[1<=p1 & 1<=p27] & ~ [EG [~ [[1<=p1 & 1<=p26]]]]]] U [~ [[[[[1<=p4 & 1<=p18] & E [true U ~ [EX [~ [[1<=p16 & 1<=p18]]]]]] | EX [~ [[1<=p1 & 1<=p51]]]] | ~ [[1<=p3 & 1<=p18]]]] & ~ [[[1<=p1 & 1<=p27] & ~ [EG [~ [[1<=p1 & 1<=p26]]]]]]]]]]

abstracting: (1<=p26)
states: 13
abstracting: (1<=p1)
states: 80,055,442 (7)
..
EG iterations: 2
abstracting: (1<=p27)
states: 135,801,237 (8)
abstracting: (1<=p1)
states: 80,055,442 (7)
abstracting: (1<=p18)
states: 348,292,994 (8)
abstracting: (1<=p3)
states: 1
abstracting: (1<=p51)
states: 24,988,964 (7)
abstracting: (1<=p1)
states: 80,055,442 (7)
.abstracting: (1<=p18)
states: 348,292,994 (8)
abstracting: (1<=p16)
states: 6,326,320 (6)
.abstracting: (1<=p18)
states: 348,292,994 (8)
abstracting: (1<=p4)
states: 5,253,500 (6)
abstracting: (1<=p26)
states: 13
abstracting: (1<=p1)
states: 80,055,442 (7)
..
EG iterations: 2
abstracting: (1<=p27)
states: 135,801,237 (8)
abstracting: (1<=p1)
states: 80,055,442 (7)
abstracting: (1<=p26)
states: 13
abstracting: (1<=p1)
states: 80,055,442 (7)
..
EG iterations: 2
abstracting: (1<=p27)
states: 135,801,237 (8)
abstracting: (1<=p1)
states: 80,055,442 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.140sec

checking: AF [[1<=p10 & [1<=p34 & [~ [E [[E [[1<=p1 & 1<=p29] U [1<=p1 & 1<=p26]] | [[1<=p1 & 1<=p22] | [1<=p0 & 1<=p18]]] U EG [[1<=p1 & 1<=p21]]]] | [p1<=0 | p20<=0]]]]]
normalized: ~ [EG [~ [[1<=p10 & [1<=p34 & [[p1<=0 | p20<=0] | ~ [E [[[[1<=p0 & 1<=p18] | [1<=p1 & 1<=p22]] | E [[1<=p1 & 1<=p29] U [1<=p1 & 1<=p26]]] U EG [[1<=p1 & 1<=p21]]]]]]]]]]

abstracting: (1<=p21)
states: 18,054,660 (7)
abstracting: (1<=p1)
states: 80,055,442 (7)
..............................................................................................................................................................
EG iterations: 158
abstracting: (1<=p26)
states: 13
abstracting: (1<=p1)
states: 80,055,442 (7)
abstracting: (1<=p29)
states: 1,305,554 (6)
abstracting: (1<=p1)
states: 80,055,442 (7)
abstracting: (1<=p22)
states: 135,801,237 (8)
abstracting: (1<=p1)
states: 80,055,442 (7)
abstracting: (1<=p18)
states: 348,292,994 (8)
abstracting: (1<=p0)
states: 1
abstracting: (p20<=0)
states: 350,014,560 (8)
abstracting: (p1<=0)
states: 269,959,120 (8)
abstracting: (1<=p34)
states: 35,616,360 (7)
abstracting: (1<=p10)
states: 16,144,440 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.324sec

checking: EG [[AF [[[1<=p1 & 1<=p44] | [[1<=p1 & 1<=p43] | [[1<=p1 & 1<=p47] & [1<=p16 & 1<=p18]]]]] & EX [[[1<=p1 & 1<=p25] | [[p1<=0 | p23<=0] & [[p15<=0 | p18<=0] | [p16<=0 | p18<=0]]]]]]]
normalized: EG [[EX [[[[[p16<=0 | p18<=0] | [p15<=0 | p18<=0]] & [p1<=0 | p23<=0]] | [1<=p1 & 1<=p25]]] & ~ [EG [~ [[[[[1<=p16 & 1<=p18] & [1<=p1 & 1<=p47]] | [1<=p1 & 1<=p43]] | [1<=p1 & 1<=p44]]]]]]]

abstracting: (1<=p44)
states: 332,671,445 (8)
abstracting: (1<=p1)
states: 80,055,442 (7)
abstracting: (1<=p43)
states: 1,305,542 (6)
abstracting: (1<=p1)
states: 80,055,442 (7)
abstracting: (1<=p47)
states: 37,539,141 (7)
abstracting: (1<=p1)
states: 80,055,442 (7)
abstracting: (1<=p18)
states: 348,292,994 (8)
abstracting: (1<=p16)
states: 6,326,320 (6)
..
EG iterations: 2
abstracting: (1<=p25)
states: 1,504,160 (6)
abstracting: (1<=p1)
states: 80,055,442 (7)
abstracting: (p23<=0)
states: 331,106,860 (8)
abstracting: (p1<=0)
states: 269,959,120 (8)
abstracting: (p18<=0)
states: 1,721,568 (6)
abstracting: (p15<=0)
states: 343,688,242 (8)
abstracting: (p18<=0)
states: 1,721,568 (6)
abstracting: (p16<=0)
states: 343,688,242 (8)
..................................................................................................................................................................
EG iterations: 161
-> the formula is FALSE

FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.901sec

totally nodes used: 5243215 (5.2e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 500841459 25058460 525899919
used/not used/entry size/cache size: 20693248 46415616 16 1024MB
basic ops cache: hits/miss/sum: 50169764 2810638 52980402
used/not used/entry size/cache size: 4262234 12514982 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: 1379585 154734 1534319
used/not used/entry size/cache size: 153523 8235085 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 63020972
1 3744589
2 274740
3 36985
4 14075
5 2468
6 3082
7 211
8 2868
9 247
>= 10 8627

Total processing time: 1m 1.672sec


BK_STOP 1679183866072

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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:98167 (1663), effective:4796 (81)

initing FirstDep: 0m 0.000sec


iterations count:1177 (19), effective:48 (0)

iterations count:1193 (20), effective:48 (0)

iterations count:1193 (20), effective:48 (0)

iterations count:1199 (20), effective:48 (0)

iterations count:1193 (20), effective:48 (0)

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

iterations count:189 (3), effective:4 (0)

iterations count:172 (2), effective:10 (0)

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

iterations count:775 (13), effective:36 (0)

iterations count:85 (1), effective:3 (0)

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

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

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

iterations count:1130 (19), effective:47 (0)

iterations count:353 (5), effective:16 (0)

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

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

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

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

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

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

iterations count:775 (13), effective:36 (0)

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

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="RingSingleMessageInMbox-PT-d0m080"
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 RingSingleMessageInMbox-PT-d0m080, 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 r330-tall-167889203800818"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RingSingleMessageInMbox-PT-d0m080.tgz
mv RingSingleMessageInMbox-PT-d0m080 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;