Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r490-tall-167912708600402.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 Szymanski-PT-a02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912708600402
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.4K Feb 26 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Feb 26 16:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 26 16:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 16:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Feb 26 16:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 26 16:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 26 16:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 101K 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 Szymanski-PT-a02-CTLFireability-00
FORMULA_NAME Szymanski-PT-a02-CTLFireability-01
FORMULA_NAME Szymanski-PT-a02-CTLFireability-02
FORMULA_NAME Szymanski-PT-a02-CTLFireability-03
FORMULA_NAME Szymanski-PT-a02-CTLFireability-04
FORMULA_NAME Szymanski-PT-a02-CTLFireability-05
FORMULA_NAME Szymanski-PT-a02-CTLFireability-06
FORMULA_NAME Szymanski-PT-a02-CTLFireability-07
FORMULA_NAME Szymanski-PT-a02-CTLFireability-08
FORMULA_NAME Szymanski-PT-a02-CTLFireability-09
FORMULA_NAME Szymanski-PT-a02-CTLFireability-10
FORMULA_NAME Szymanski-PT-a02-CTLFireability-11
FORMULA_NAME Szymanski-PT-a02-CTLFireability-12
FORMULA_NAME Szymanski-PT-a02-CTLFireability-13
FORMULA_NAME Szymanski-PT-a02-CTLFireability-14
FORMULA_NAME Szymanski-PT-a02-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679253627547

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=Szymanski-PT-a02
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 19:20:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 19:20:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 19:20:29] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2023-03-19 19:20:29] [INFO ] Transformed 61 places.
[2023-03-19 19:20:29] [INFO ] Transformed 224 transitions.
[2023-03-19 19:20:29] [INFO ] Parsed PT model containing 61 places and 224 transitions and 900 arcs in 109 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 7 ms.
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 8 transitions.
FORMULA Szymanski-PT-a02-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a02-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 216
Applied a total of 2 rules in 11 ms. Remains 47 /49 variables (removed 2) and now considering 216/216 (removed 0) transitions.
[2023-03-19 19:20:29] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
// Phase 1: matrix 79 rows 47 cols
[2023-03-19 19:20:29] [INFO ] Computed 1 place invariants in 6 ms
[2023-03-19 19:20:29] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-19 19:20:29] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2023-03-19 19:20:29] [INFO ] Invariant cache hit.
[2023-03-19 19:20:30] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 19:20:30] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2023-03-19 19:20:30] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2023-03-19 19:20:30] [INFO ] Invariant cache hit.
[2023-03-19 19:20:30] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 47/49 places, 216/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 383 ms. Remains : 47/49 places, 216/216 transitions.
Support contains 35 out of 47 places after structural reductions.
[2023-03-19 19:20:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-19 19:20:30] [INFO ] Flatten gal took : 34 ms
FORMULA Szymanski-PT-a02-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 19:20:30] [INFO ] Flatten gal took : 15 ms
[2023-03-19 19:20:30] [INFO ] Input system was already deterministic with 216 transitions.
Support contains 34 out of 47 places (down from 35) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 29 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 41) seen :23
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) 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 :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) 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 :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) 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 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) 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 17) 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 17) seen :0
Running SMT prover for 17 properties.
[2023-03-19 19:20:31] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2023-03-19 19:20:31] [INFO ] Invariant cache hit.
[2023-03-19 19:20:31] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:20:31] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-19 19:20:31] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:20:31] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-19 19:20:31] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 19:20:31] [INFO ] After 63ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-19 19:20:31] [INFO ] After 176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-19 19:20:31] [INFO ] After 423ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Parikh walk visited 0 properties in 41 ms.
Support contains 16 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 216/216 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 214
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 46 transition count 210
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 46 transition count 210
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 20 place count 46 transition count 194
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 45 transition count 190
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 45 transition count 190
Applied a total of 22 rules in 23 ms. Remains 45 /47 variables (removed 2) and now considering 190/216 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 45/47 places, 190/216 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 17) 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 17) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 11) 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 11) 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 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 11) 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 11) 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 11) 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 11) 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 11) seen :0
Running SMT prover for 11 properties.
[2023-03-19 19:20:31] [INFO ] Flow matrix only has 71 transitions (discarded 119 similar events)
// Phase 1: matrix 71 rows 45 cols
[2023-03-19 19:20:31] [INFO ] Computed 1 place invariants in 4 ms
[2023-03-19 19:20:31] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:20:31] [INFO ] After 29ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:10
[2023-03-19 19:20:31] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 19:20:31] [INFO ] After 6ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 19:20:31] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 19:20:31] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:20:32] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-19 19:20:32] [INFO ] After 34ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-19 19:20:32] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-19 19:20:32] [INFO ] After 242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 27 ms.
Support contains 13 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 190/190 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 44 transition count 186
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 44 transition count 186
Applied a total of 2 rules in 8 ms. Remains 44 /45 variables (removed 1) and now considering 186/190 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 44/45 places, 186/190 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :0
Finished probabilistic random walk after 169467 steps, run visited all 10 properties in 636 ms. (steps per millisecond=266 )
Probabilistic random walk after 169467 steps, saw 37861 distinct states, run finished after 636 ms. (steps per millisecond=266 ) properties seen :10
[2023-03-19 19:20:33] [INFO ] Flatten gal took : 10 ms
[2023-03-19 19:20:33] [INFO ] Flatten gal took : 10 ms
[2023-03-19 19:20:33] [INFO ] Input system was already deterministic with 216 transitions.
Computed a total of 9 stabilizing places and 36 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 200
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 200
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 24 place count 43 transition count 184
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 41 transition count 176
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 41 transition count 176
Applied a total of 28 rules in 14 ms. Remains 41 /47 variables (removed 6) and now considering 176/216 (removed 40) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 41/47 places, 176/216 transitions.
[2023-03-19 19:20:33] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:20:33] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:20:33] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 196
Applied a total of 10 rules in 2 ms. Remains 42 /47 variables (removed 5) and now considering 196/216 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 42/47 places, 196/216 transitions.
[2023-03-19 19:20:33] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:20:33] [INFO ] Flatten gal took : 9 ms
[2023-03-19 19:20:33] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 200
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 200
Applied a total of 8 rules in 2 ms. Remains 43 /47 variables (removed 4) and now considering 200/216 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 43/47 places, 200/216 transitions.
[2023-03-19 19:20:33] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:20:33] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:20:33] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 44 transition count 204
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 44 transition count 204
Applied a total of 6 rules in 2 ms. Remains 44 /47 variables (removed 3) and now considering 204/216 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 44/47 places, 204/216 transitions.
[2023-03-19 19:20:33] [INFO ] Flatten gal took : 9 ms
[2023-03-19 19:20:33] [INFO ] Flatten gal took : 9 ms
[2023-03-19 19:20:33] [INFO ] Input system was already deterministic with 204 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 200
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 200
Applied a total of 8 rules in 2 ms. Remains 43 /47 variables (removed 4) and now considering 200/216 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 43/47 places, 200/216 transitions.
[2023-03-19 19:20:33] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:20:33] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:20:33] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 196
Applied a total of 10 rules in 3 ms. Remains 42 /47 variables (removed 5) and now considering 196/216 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 42/47 places, 196/216 transitions.
[2023-03-19 19:20:33] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:20:33] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:20:33] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 200
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 200
Applied a total of 8 rules in 2 ms. Remains 43 /47 variables (removed 4) and now considering 200/216 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 43/47 places, 200/216 transitions.
[2023-03-19 19:20:33] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:20:33] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:20:33] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 196
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 26 place count 42 transition count 180
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 40 transition count 172
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 40 transition count 172
Applied a total of 30 rules in 11 ms. Remains 40 /47 variables (removed 7) and now considering 172/216 (removed 44) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 40/47 places, 172/216 transitions.
[2023-03-19 19:20:33] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:20:33] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:20:33] [INFO ] Input system was already deterministic with 172 transitions.
Finished random walk after 158 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=79 )
FORMULA Szymanski-PT-a02-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 46 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 46 transition count 212
Applied a total of 2 rules in 2 ms. Remains 46 /47 variables (removed 1) and now considering 212/216 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 46/47 places, 212/216 transitions.
[2023-03-19 19:20:33] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:20:33] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:20:33] [INFO ] Input system was already deterministic with 212 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 196
Applied a total of 10 rules in 2 ms. Remains 42 /47 variables (removed 5) and now considering 196/216 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 42/47 places, 196/216 transitions.
[2023-03-19 19:20:33] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:20:33] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:20:33] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 196
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 22 place count 42 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 41 transition count 180
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 41 transition count 180
Applied a total of 24 rules in 12 ms. Remains 41 /47 variables (removed 6) and now considering 180/216 (removed 36) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 41/47 places, 180/216 transitions.
[2023-03-19 19:20:33] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:20:33] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:20:33] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 196
Applied a total of 10 rules in 2 ms. Remains 42 /47 variables (removed 5) and now considering 196/216 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 42/47 places, 196/216 transitions.
[2023-03-19 19:20:33] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:20:33] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:20:33] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 196
Applied a total of 10 rules in 1 ms. Remains 42 /47 variables (removed 5) and now considering 196/216 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 42/47 places, 196/216 transitions.
[2023-03-19 19:20:33] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:20:33] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:20:33] [INFO ] Input system was already deterministic with 196 transitions.
[2023-03-19 19:20:33] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:20:33] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:20:33] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-19 19:20:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 47 places, 216 transitions and 860 arcs took 2 ms.
Total runtime 4489 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: 47 NrTr: 216 NrArc: 860)

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

net check time: 0m 0.000sec

init dd package: 0m 2.733sec


RS generation: 0m 0.172sec


-> reachability set: #nodes 542 (5.4e+02) #states 62,187 (4)



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

checking: AG [AX [EF [[p3<=0 | p9<=0]]]]
normalized: ~ [E [true U EX [~ [E [true U [p3<=0 | p9<=0]]]]]]

abstracting: (p9<=0)
states: 60,950 (4)
abstracting: (p3<=0)
states: 61,588 (4)
.-> the formula is TRUE

FORMULA Szymanski-PT-a02-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: EX [AX [[1<=p2 & 1<=p39]]]
normalized: EX [~ [EX [~ [[1<=p2 & 1<=p39]]]]]

abstracting: (1<=p39)
states: 6,209 (3)
abstracting: (1<=p2)
states: 27,396 (4)
..-> the formula is FALSE

FORMULA Szymanski-PT-a02-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.026sec

checking: AX [EG [[p1<=0 | p28<=0]]]
normalized: ~ [EX [~ [EG [[p1<=0 | p28<=0]]]]]

abstracting: (p28<=0)
states: 55,663 (4)
abstracting: (p1<=0)
states: 35,000 (4)
..
EG iterations: 2
.-> the formula is TRUE

FORMULA Szymanski-PT-a02-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

checking: AG [AX [EF [[1<=p0 & 1<=p18]]]]
normalized: ~ [E [true U EX [~ [E [true U [1<=p0 & 1<=p18]]]]]]

abstracting: (1<=p18)
states: 6,524 (3)
abstracting: (1<=p0)
states: 620
.-> the formula is FALSE

FORMULA Szymanski-PT-a02-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.153sec

checking: AX [AG [EF [[1<=p2 & [1<=p8 & 1<=p17]]]]]
normalized: ~ [EX [E [true U ~ [E [true U [1<=p2 & [1<=p8 & 1<=p17]]]]]]]

abstracting: (1<=p17)
states: 6,524 (3)
abstracting: (1<=p8)
states: 638
abstracting: (1<=p2)
states: 27,396 (4)
.-> the formula is FALSE

FORMULA Szymanski-PT-a02-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.039sec

checking: [EG [[1<=p3 & 1<=p46]] | AG [EF [[1<=p3 & 1<=p31]]]]
normalized: [~ [E [true U ~ [E [true U [1<=p3 & 1<=p31]]]]] | EG [[1<=p3 & 1<=p46]]]

abstracting: (1<=p46)
states: 6,209 (3)
abstracting: (1<=p3)
states: 599
...
EG iterations: 3
abstracting: (1<=p31)
states: 6,209 (3)
abstracting: (1<=p3)
states: 599
-> the formula is FALSE

FORMULA Szymanski-PT-a02-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.190sec

checking: [AF [[1<=p0 & 1<=p30]] | AG [[EX [[p1<=0 | p16<=0]] | AG [[p2<=0 | p35<=0]]]]]
normalized: [~ [E [true U ~ [[~ [E [true U ~ [[p2<=0 | p35<=0]]]] | EX [[p1<=0 | p16<=0]]]]]] | ~ [EG [~ [[1<=p0 & 1<=p30]]]]]

abstracting: (1<=p30)
states: 6,209 (3)
abstracting: (1<=p0)
states: 620
.
EG iterations: 1
abstracting: (p16<=0)
states: 55,663 (4)
abstracting: (p1<=0)
states: 35,000 (4)
.abstracting: (p35<=0)
states: 55,978 (4)
abstracting: (p2<=0)
states: 34,791 (4)
-> the formula is FALSE

FORMULA Szymanski-PT-a02-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.339sec

checking: [AG [EF [[1<=p3 & 1<=p17]]] | EG [[AF [[p0<=0 | p11<=0]] & [1<=p0 & 1<=p44]]]]
normalized: [EG [[[1<=p0 & 1<=p44] & ~ [EG [~ [[p0<=0 | p11<=0]]]]]] | ~ [E [true U ~ [E [true U [1<=p3 & 1<=p17]]]]]]

abstracting: (1<=p17)
states: 6,524 (3)
abstracting: (1<=p3)
states: 599
abstracting: (p11<=0)
states: 60,947 (4)
abstracting: (p0<=0)
states: 61,567 (4)
...
EG iterations: 3
abstracting: (1<=p44)
states: 6,209 (3)
abstracting: (1<=p0)
states: 620
...
EG iterations: 3
-> the formula is FALSE

FORMULA Szymanski-PT-a02-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.069sec

checking: [EG [[1<=p2 & 1<=p42]] | EX [EG [E [~ [EF [[1<=p3 & 1<=p35]]] U A [[1<=p1 & 1<=p44] U [1<=p3 & 1<=p24]]]]]]
normalized: [EX [EG [E [~ [E [true U [1<=p3 & 1<=p35]]] U [~ [EG [~ [[1<=p3 & 1<=p24]]]] & ~ [E [~ [[1<=p3 & 1<=p24]] U [~ [[1<=p1 & 1<=p44]] & ~ [[1<=p3 & 1<=p24]]]]]]]]] | EG [[1<=p2 & 1<=p42]]]

abstracting: (1<=p42)
states: 6,209 (3)
abstracting: (1<=p2)
states: 27,396 (4)
.
EG iterations: 1
abstracting: (1<=p24)
states: 6,524 (3)
abstracting: (1<=p3)
states: 599
abstracting: (1<=p44)
states: 6,209 (3)
abstracting: (1<=p1)
states: 27,187 (4)
abstracting: (1<=p24)
states: 6,524 (3)
abstracting: (1<=p3)
states: 599
abstracting: (1<=p24)
states: 6,524 (3)
abstracting: (1<=p3)
states: 599
.
EG iterations: 1
abstracting: (1<=p35)
states: 6,209 (3)
abstracting: (1<=p3)
states: 599
.
EG iterations: 1
.-> the formula is FALSE

FORMULA Szymanski-PT-a02-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.197sec

checking: [EG [[1<=p0 & 1<=p31]] | [AX [[[AG [[1<=p0 & 1<=p9]] | [1<=p4 & 1<=p11]] | [[1<=p3 & 1<=p46] | EG [[1<=p0 & 1<=p29]]]]] | [AF [[EF [[p3<=0 | p32<=0]] | [p1<=0 | p43<=0]]] & AG [EF [AX [[p0<=0 | p8<=0]]]]]]]
normalized: [[[~ [E [true U ~ [E [true U ~ [EX [~ [[p0<=0 | p8<=0]]]]]]]] & ~ [EG [~ [[[p1<=0 | p43<=0] | E [true U [p3<=0 | p32<=0]]]]]]] | ~ [EX [~ [[[EG [[1<=p0 & 1<=p29]] | [1<=p3 & 1<=p46]] | [[1<=p4 & 1<=p11] | ~ [E [true U ~ [[1<=p0 & 1<=p9]]]]]]]]]] | EG [[1<=p0 & 1<=p31]]]

abstracting: (1<=p31)
states: 6,209 (3)
abstracting: (1<=p0)
states: 620
...
EG iterations: 3
abstracting: (1<=p9)
states: 1,237 (3)
abstracting: (1<=p0)
states: 620
abstracting: (1<=p11)
states: 1,240 (3)
abstracting: (1<=p4)
states: 2
abstracting: (1<=p46)
states: 6,209 (3)
abstracting: (1<=p3)
states: 599
abstracting: (1<=p29)
states: 5,952 (3)
abstracting: (1<=p0)
states: 620
...
EG iterations: 3
.abstracting: (p32<=0)
states: 55,978 (4)
abstracting: (p3<=0)
states: 61,588 (4)
abstracting: (p43<=0)
states: 55,978 (4)
abstracting: (p1<=0)
states: 35,000 (4)
.
EG iterations: 1
abstracting: (p8<=0)
states: 61,549 (4)
abstracting: (p0<=0)
states: 61,567 (4)
.-> the formula is TRUE

FORMULA Szymanski-PT-a02-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: E [~ [[AG [[E [[1<=p3 & 1<=p31] U [1<=p3 & 1<=p40]] | AF [[1<=p0 & 1<=p44]]]] | [1<=p3 & 1<=p28]]] U EX [[~ [[AX [[1<=p0 & 1<=p10]] & [1<=p3 & 1<=p35]]] & AG [[[1<=p2 & 1<=p37] | ~ [[1<=p1 & 1<=p35]]]]]]]
normalized: E [~ [[[1<=p3 & 1<=p28] | ~ [E [true U ~ [[~ [EG [~ [[1<=p0 & 1<=p44]]]] | E [[1<=p3 & 1<=p31] U [1<=p3 & 1<=p40]]]]]]]] U EX [[~ [E [true U ~ [[~ [[1<=p1 & 1<=p35]] | [1<=p2 & 1<=p37]]]]] & ~ [[[1<=p3 & 1<=p35] & ~ [EX [~ [[1<=p0 & 1<=p10]]]]]]]]]

abstracting: (1<=p10)
states: 1,279 (3)
abstracting: (1<=p0)
states: 620
.abstracting: (1<=p35)
states: 6,209 (3)
abstracting: (1<=p3)
states: 599
abstracting: (1<=p37)
states: 6,209 (3)
abstracting: (1<=p2)
states: 27,396 (4)
abstracting: (1<=p35)
states: 6,209 (3)
abstracting: (1<=p1)
states: 27,187 (4)
.abstracting: (1<=p40)
states: 6,209 (3)
abstracting: (1<=p3)
states: 599
abstracting: (1<=p31)
states: 6,209 (3)
abstracting: (1<=p3)
states: 599
abstracting: (1<=p44)
states: 6,209 (3)
abstracting: (1<=p0)
states: 620
.
EG iterations: 1
abstracting: (1<=p28)
states: 6,524 (3)
abstracting: (1<=p3)
states: 599
-> the formula is TRUE

FORMULA Szymanski-PT-a02-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.309sec

checking: [AF [[p1<=0 | p39<=0]] & [EF [[1<=p3 & 1<=p42]] | [AX [EX [[1<=p3 & 1<=p15]]] | [[EX [[1<=p2 & 1<=p35]] & EF [AX [[1<=p1 & 1<=p13]]]] & [A [[1<=p1 & 1<=p29] U [[1<=p0 & [1<=p17 & 1<=p0]] & [1<=p45 & [~ [[1<=p3 & 1<=p44]] & AX [[1<=p2 & 1<=p34]]]]]] & [E [[1<=p0 & 1<=p14] U [1<=p0 & 1<=p19]] | AG [[1<=p2 & 1<=p41]]]]]]]]
normalized: [[[[[[~ [E [true U ~ [[1<=p2 & 1<=p41]]]] | E [[1<=p0 & 1<=p14] U [1<=p0 & 1<=p19]]] & [~ [EG [~ [[[[~ [EX [~ [[1<=p2 & 1<=p34]]]] & ~ [[1<=p3 & 1<=p44]]] & 1<=p45] & [[1<=p17 & 1<=p0] & 1<=p0]]]]] & ~ [E [~ [[[[~ [EX [~ [[1<=p2 & 1<=p34]]]] & ~ [[1<=p3 & 1<=p44]]] & 1<=p45] & [[1<=p17 & 1<=p0] & 1<=p0]]] U [~ [[1<=p1 & 1<=p29]] & ~ [[[[~ [EX [~ [[1<=p2 & 1<=p34]]]] & ~ [[1<=p3 & 1<=p44]]] & 1<=p45] & [[1<=p17 & 1<=p0] & 1<=p0]]]]]]]] & [E [true U ~ [EX [~ [[1<=p1 & 1<=p13]]]]] & EX [[1<=p2 & 1<=p35]]]] | ~ [EX [~ [EX [[1<=p3 & 1<=p15]]]]]] | E [true U [1<=p3 & 1<=p42]]] & ~ [EG [~ [[p1<=0 | p39<=0]]]]]

abstracting: (p39<=0)
states: 55,978 (4)
abstracting: (p1<=0)
states: 35,000 (4)
....
EG iterations: 4
abstracting: (1<=p42)
states: 6,209 (3)
abstracting: (1<=p3)
states: 599
abstracting: (1<=p15)
states: 6,524 (3)
abstracting: (1<=p3)
states: 599
..abstracting: (1<=p35)
states: 6,209 (3)
abstracting: (1<=p2)
states: 27,396 (4)
.abstracting: (1<=p13)
states: 6,524 (3)
abstracting: (1<=p1)
states: 27,187 (4)
.abstracting: (1<=p0)
states: 620
abstracting: (1<=p0)
states: 620
abstracting: (1<=p17)
states: 6,524 (3)
abstracting: (1<=p45)
states: 6,209 (3)
abstracting: (1<=p44)
states: 6,209 (3)
abstracting: (1<=p3)
states: 599
abstracting: (1<=p34)
states: 6,209 (3)
abstracting: (1<=p2)
states: 27,396 (4)
.abstracting: (1<=p29)
states: 5,952 (3)
abstracting: (1<=p1)
states: 27,187 (4)
abstracting: (1<=p0)
states: 620
abstracting: (1<=p0)
states: 620
abstracting: (1<=p17)
states: 6,524 (3)
abstracting: (1<=p45)
states: 6,209 (3)
abstracting: (1<=p44)
states: 6,209 (3)
abstracting: (1<=p3)
states: 599
abstracting: (1<=p34)
states: 6,209 (3)
abstracting: (1<=p2)
states: 27,396 (4)
.abstracting: (1<=p0)
states: 620
abstracting: (1<=p0)
states: 620
abstracting: (1<=p17)
states: 6,524 (3)
abstracting: (1<=p45)
states: 6,209 (3)
abstracting: (1<=p44)
states: 6,209 (3)
abstracting: (1<=p3)
states: 599
abstracting: (1<=p34)
states: 6,209 (3)
abstracting: (1<=p2)
states: 27,396 (4)
.
EG iterations: 0
abstracting: (1<=p19)
states: 6,524 (3)
abstracting: (1<=p0)
states: 620
abstracting: (1<=p14)
states: 6,524 (3)
abstracting: (1<=p0)
states: 620
abstracting: (1<=p41)
states: 6,209 (3)
abstracting: (1<=p2)
states: 27,396 (4)
-> the formula is TRUE

FORMULA Szymanski-PT-a02-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.330sec

totally nodes used: 376515 (3.8e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 4872276 5647309 10519585
used/not used/entry size/cache size: 5631860 61477004 16 1024MB
basic ops cache: hits/miss/sum: 568724 322463 891187
used/not used/entry size/cache size: 612856 16164360 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: 4466 5771 10237
used/not used/entry size/cache size: 5771 8382837 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 66742395
1 358294
2 7644
3 391
4 17
5 6
6 11
7 15
8 4
9 3
>= 10 84

Total processing time: 0m 6.230sec


BK_STOP 1679253644230

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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:42695 (197), effective:883 (4)

initing FirstDep: 0m 0.000sec


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

iterations count:23189 (107), effective:294 (1)

iterations count:509 (2), effective:9 (0)

iterations count:3300 (15), effective:41 (0)

iterations count:477 (2), effective:6 (0)

iterations count:41303 (191), effective:449 (2)

iterations count:1059 (4), effective:16 (0)

iterations count:17356 (80), effective:162 (0)

iterations count:24578 (113), effective:247 (1)

iterations count:5456 (25), effective:86 (0)

iterations count:1059 (4), effective:16 (0)

iterations count:3393 (15), effective:22 (0)

iterations count:41521 (192), effective:453 (2)

iterations count:469 (2), effective:3 (0)

iterations count:220 (1), effective:2 (0)

iterations count:371 (1), effective:2 (0)

iterations count:218 (1), effective:2 (0)

iterations count:25905 (119), effective:253 (1)

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

iterations count:394 (1), effective:4 (0)

iterations count:22369 (103), effective:201 (0)

iterations count:43636 (202), effective:476 (2)

iterations count:30662 (141), effective:287 (1)

iterations count:516 (2), effective:2 (0)

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

iterations count:2320 (10), effective:22 (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="Szymanski-PT-a02"
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 Szymanski-PT-a02, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r490-tall-167912708600402"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-a02.tgz
mv Szymanski-PT-a02 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 ;