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.r266-smll-167863541200622.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 Peterson-PT-4, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863541200622
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 68K Feb 25 22:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 323K Feb 25 22:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 71K Feb 25 22:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 340K Feb 25 22:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 31K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 39K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 138K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 255K Feb 25 22:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Feb 25 22:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 225K Feb 25 22:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M Feb 25 22:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 298K 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 Peterson-PT-4-ReachabilityCardinality-00
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-01
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-02
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-03
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-04
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-05
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-06
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-07
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-08
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-09
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-10
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-11
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-12
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-13
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-14
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679197857654

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-4
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 03:51:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 03:51:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 03:51:01] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2023-03-19 03:51:01] [INFO ] Transformed 480 places.
[2023-03-19 03:51:01] [INFO ] Transformed 690 transitions.
[2023-03-19 03:51:01] [INFO ] Found NUPN structural information;
[2023-03-19 03:51:01] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_0_3_4, IsEndLoop_1_3_4, TestAlone_3_1_4, TestAlone_2_2_4, TestIdentity_2_3_4, TestIdentity_4_0_4, AskForSection_0_3, AskForSection_0_2]
[2023-03-19 03:51:01] [INFO ] Parsed PT model containing 480 places and 690 transitions and 2120 arcs in 332 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 164 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-4-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 975 ms. (steps per millisecond=10 ) properties (out of 15) seen :1
FORMULA Peterson-PT-4-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 652 ms. (steps per millisecond=15 ) properties (out of 14) seen :1
FORMULA Peterson-PT-4-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-19 03:51:05] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-19 03:51:05] [INFO ] Computed 19 place invariants in 22 ms
[2023-03-19 03:51:07] [INFO ] After 751ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:9
[2023-03-19 03:51:08] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-19 03:51:08] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-19 03:51:08] [INFO ] After 445ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :5
[2023-03-19 03:51:08] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-19 03:51:09] [INFO ] After 262ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :8 sat :5
[2023-03-19 03:51:09] [INFO ] Deduced a trap composed of 32 places in 293 ms of which 21 ms to minimize.
[2023-03-19 03:51:09] [INFO ] Deduced a trap composed of 35 places in 382 ms of which 1 ms to minimize.
[2023-03-19 03:51:10] [INFO ] Deduced a trap composed of 36 places in 250 ms of which 1 ms to minimize.
[2023-03-19 03:51:10] [INFO ] Deduced a trap composed of 10 places in 408 ms of which 2 ms to minimize.
[2023-03-19 03:51:11] [INFO ] Deduced a trap composed of 10 places in 388 ms of which 1 ms to minimize.
[2023-03-19 03:51:11] [INFO ] Deduced a trap composed of 32 places in 264 ms of which 1 ms to minimize.
[2023-03-19 03:51:11] [INFO ] Deduced a trap composed of 17 places in 357 ms of which 1 ms to minimize.
[2023-03-19 03:51:12] [INFO ] Deduced a trap composed of 17 places in 331 ms of which 2 ms to minimize.
[2023-03-19 03:51:12] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3051 ms
[2023-03-19 03:51:12] [INFO ] Deduced a trap composed of 58 places in 673 ms of which 1 ms to minimize.
[2023-03-19 03:51:13] [INFO ] Deduced a trap composed of 119 places in 162 ms of which 2 ms to minimize.
[2023-03-19 03:51:13] [INFO ] Deduced a trap composed of 73 places in 171 ms of which 1 ms to minimize.
[2023-03-19 03:51:13] [INFO ] Deduced a trap composed of 47 places in 173 ms of which 1 ms to minimize.
[2023-03-19 03:51:13] [INFO ] Deduced a trap composed of 47 places in 175 ms of which 1 ms to minimize.
[2023-03-19 03:51:14] [INFO ] Deduced a trap composed of 70 places in 147 ms of which 1 ms to minimize.
[2023-03-19 03:51:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1824 ms
[2023-03-19 03:51:14] [INFO ] Deduced a trap composed of 69 places in 189 ms of which 1 ms to minimize.
[2023-03-19 03:51:14] [INFO ] Deduced a trap composed of 32 places in 232 ms of which 1 ms to minimize.
[2023-03-19 03:51:14] [INFO ] Deduced a trap composed of 54 places in 169 ms of which 1 ms to minimize.
[2023-03-19 03:51:15] [INFO ] Deduced a trap composed of 76 places in 271 ms of which 1 ms to minimize.
[2023-03-19 03:51:15] [INFO ] Deduced a trap composed of 81 places in 208 ms of which 1 ms to minimize.
[2023-03-19 03:51:15] [INFO ] Deduced a trap composed of 54 places in 138 ms of which 1 ms to minimize.
[2023-03-19 03:51:15] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1538 ms
[2023-03-19 03:51:15] [INFO ] Deduced a trap composed of 80 places in 217 ms of which 1 ms to minimize.
[2023-03-19 03:51:16] [INFO ] Deduced a trap composed of 79 places in 262 ms of which 1 ms to minimize.
[2023-03-19 03:51:16] [INFO ] Deduced a trap composed of 89 places in 222 ms of which 1 ms to minimize.
[2023-03-19 03:51:16] [INFO ] Deduced a trap composed of 58 places in 202 ms of which 2 ms to minimize.
[2023-03-19 03:51:16] [INFO ] Deduced a trap composed of 57 places in 152 ms of which 1 ms to minimize.
[2023-03-19 03:51:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1288 ms
[2023-03-19 03:51:17] [INFO ] Deduced a trap composed of 37 places in 380 ms of which 2 ms to minimize.
[2023-03-19 03:51:17] [INFO ] Deduced a trap composed of 37 places in 338 ms of which 1 ms to minimize.
[2023-03-19 03:51:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 855 ms
[2023-03-19 03:51:17] [INFO ] After 9133ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :5
Attempting to minimize the solution found.
Minimization took 430 ms.
[2023-03-19 03:51:18] [INFO ] After 10522ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :5
FORMULA Peterson-PT-4-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 54 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 135 transitions
Trivial Post-agglo rules discarded 135 transitions
Performed 135 trivial Post agglomeration. Transition count delta: 135
Iterating post reduction 0 with 135 rules applied. Total rules applied 135 place count 480 transition count 555
Reduce places removed 135 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 157 rules applied. Total rules applied 292 place count 345 transition count 533
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 314 place count 323 transition count 533
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 314 place count 323 transition count 455
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 470 place count 245 transition count 455
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 502 place count 229 transition count 439
Applied a total of 502 rules in 103 ms. Remains 229 /480 variables (removed 251) and now considering 439/690 (removed 251) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 229/480 places, 439/690 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 5) seen :1
FORMULA Peterson-PT-4-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-19 03:51:19] [INFO ] Flow matrix only has 379 transitions (discarded 60 similar events)
// Phase 1: matrix 379 rows 229 cols
[2023-03-19 03:51:19] [INFO ] Computed 19 place invariants in 5 ms
[2023-03-19 03:51:19] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 03:51:19] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-19 03:51:19] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-19 03:51:19] [INFO ] After 269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 03:51:19] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-19 03:51:19] [INFO ] After 188ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 03:51:20] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 1 ms to minimize.
[2023-03-19 03:51:20] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 1 ms to minimize.
[2023-03-19 03:51:20] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 0 ms to minimize.
[2023-03-19 03:51:20] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 0 ms to minimize.
[2023-03-19 03:51:20] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 1 ms to minimize.
[2023-03-19 03:51:21] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 2 ms to minimize.
[2023-03-19 03:51:21] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 0 ms to minimize.
[2023-03-19 03:51:21] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 1 ms to minimize.
[2023-03-19 03:51:21] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 1 ms to minimize.
[2023-03-19 03:51:21] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 0 ms to minimize.
[2023-03-19 03:51:21] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 0 ms to minimize.
[2023-03-19 03:51:22] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 2 ms to minimize.
[2023-03-19 03:51:22] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 1 ms to minimize.
[2023-03-19 03:51:22] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2275 ms
[2023-03-19 03:51:22] [INFO ] Deduced a trap composed of 8 places in 213 ms of which 1 ms to minimize.
[2023-03-19 03:51:22] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 1 ms to minimize.
[2023-03-19 03:51:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 487 ms
[2023-03-19 03:51:22] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 1 ms to minimize.
[2023-03-19 03:51:23] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 1 ms to minimize.
[2023-03-19 03:51:23] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
[2023-03-19 03:51:23] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 1 ms to minimize.
[2023-03-19 03:51:23] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 1 ms to minimize.
[2023-03-19 03:51:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 694 ms
[2023-03-19 03:51:23] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 0 ms to minimize.
[2023-03-19 03:51:23] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 0 ms to minimize.
[2023-03-19 03:51:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 385 ms
[2023-03-19 03:51:24] [INFO ] After 4218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 170 ms.
[2023-03-19 03:51:24] [INFO ] After 4858ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 59 ms.
Support contains 52 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 439/439 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 1 rules applied. Total rules applied 1 place count 229 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 228 transition count 438
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 228 transition count 436
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 226 transition count 436
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 8 place count 225 transition count 435
Applied a total of 8 rules in 50 ms. Remains 225 /229 variables (removed 4) and now considering 435/439 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 225/229 places, 435/439 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 476208 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :{}
Probabilistic random walk after 476208 steps, saw 80242 distinct states, run finished after 3004 ms. (steps per millisecond=158 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-19 03:51:27] [INFO ] Flow matrix only has 375 transitions (discarded 60 similar events)
// Phase 1: matrix 375 rows 225 cols
[2023-03-19 03:51:27] [INFO ] Computed 19 place invariants in 6 ms
[2023-03-19 03:51:28] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 03:51:28] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-19 03:51:28] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-19 03:51:28] [INFO ] After 298ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 03:51:28] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-19 03:51:28] [INFO ] After 179ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 03:51:28] [INFO ] Deduced a trap composed of 20 places in 199 ms of which 2 ms to minimize.
[2023-03-19 03:51:29] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 1 ms to minimize.
[2023-03-19 03:51:29] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 1 ms to minimize.
[2023-03-19 03:51:29] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 1 ms to minimize.
[2023-03-19 03:51:29] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 1 ms to minimize.
[2023-03-19 03:51:30] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 4 ms to minimize.
[2023-03-19 03:51:30] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 1 ms to minimize.
[2023-03-19 03:51:30] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 1 ms to minimize.
[2023-03-19 03:51:30] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 1 ms to minimize.
[2023-03-19 03:51:30] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 1 ms to minimize.
[2023-03-19 03:51:30] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 0 ms to minimize.
[2023-03-19 03:51:30] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 0 ms to minimize.
[2023-03-19 03:51:31] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 2 ms to minimize.
[2023-03-19 03:51:31] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 1 ms to minimize.
[2023-03-19 03:51:31] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 2 ms to minimize.
[2023-03-19 03:51:31] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2023-03-19 03:51:31] [INFO ] Deduced a trap composed of 44 places in 170 ms of which 0 ms to minimize.
[2023-03-19 03:51:31] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 4 ms to minimize.
[2023-03-19 03:51:32] [INFO ] Deduced a trap composed of 31 places in 185 ms of which 2 ms to minimize.
[2023-03-19 03:51:32] [INFO ] Deduced a trap composed of 19 places in 183 ms of which 1 ms to minimize.
[2023-03-19 03:51:32] [INFO ] Deduced a trap composed of 47 places in 148 ms of which 0 ms to minimize.
[2023-03-19 03:51:32] [INFO ] Deduced a trap composed of 47 places in 152 ms of which 2 ms to minimize.
[2023-03-19 03:51:32] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 1 ms to minimize.
[2023-03-19 03:51:32] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 1 ms to minimize.
[2023-03-19 03:51:33] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 0 ms to minimize.
[2023-03-19 03:51:33] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 4275 ms
[2023-03-19 03:51:33] [INFO ] Deduced a trap composed of 26 places in 181 ms of which 1 ms to minimize.
[2023-03-19 03:51:33] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 1 ms to minimize.
[2023-03-19 03:51:33] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2023-03-19 03:51:33] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 0 ms to minimize.
[2023-03-19 03:51:33] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2023-03-19 03:51:33] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2023-03-19 03:51:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 762 ms
[2023-03-19 03:51:34] [INFO ] Deduced a trap composed of 13 places in 209 ms of which 1 ms to minimize.
[2023-03-19 03:51:34] [INFO ] Deduced a trap composed of 13 places in 199 ms of which 1 ms to minimize.
[2023-03-19 03:51:34] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 2 ms to minimize.
[2023-03-19 03:51:34] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 0 ms to minimize.
[2023-03-19 03:51:34] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 1 ms to minimize.
[2023-03-19 03:51:34] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2023-03-19 03:51:34] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 0 ms to minimize.
[2023-03-19 03:51:35] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 1 ms to minimize.
[2023-03-19 03:51:35] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 0 ms to minimize.
[2023-03-19 03:51:35] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1333 ms
[2023-03-19 03:51:35] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 1 ms to minimize.
[2023-03-19 03:51:35] [INFO ] Deduced a trap composed of 35 places in 183 ms of which 1 ms to minimize.
[2023-03-19 03:51:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 417 ms
[2023-03-19 03:51:35] [INFO ] After 7150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 193 ms.
[2023-03-19 03:51:35] [INFO ] After 7890ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 33 ms.
Support contains 52 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 435/435 transitions.
Applied a total of 0 rules in 30 ms. Remains 225 /225 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 225/225 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 435/435 transitions.
Applied a total of 0 rules in 26 ms. Remains 225 /225 variables (removed 0) and now considering 435/435 (removed 0) transitions.
[2023-03-19 03:51:36] [INFO ] Flow matrix only has 375 transitions (discarded 60 similar events)
[2023-03-19 03:51:36] [INFO ] Invariant cache hit.
[2023-03-19 03:51:36] [INFO ] Implicit Places using invariants in 357 ms returned [215, 216, 217, 218, 219]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 361 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 220/225 places, 435/435 transitions.
Applied a total of 0 rules in 25 ms. Remains 220 /220 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 414 ms. Remains : 220/225 places, 435/435 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 549426 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :{}
Probabilistic random walk after 549426 steps, saw 92762 distinct states, run finished after 3001 ms. (steps per millisecond=183 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-19 03:51:40] [INFO ] Flow matrix only has 375 transitions (discarded 60 similar events)
// Phase 1: matrix 375 rows 220 cols
[2023-03-19 03:51:40] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-19 03:51:40] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 03:51:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-19 03:51:40] [INFO ] After 284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 03:51:40] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-19 03:51:40] [INFO ] After 167ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 03:51:40] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 1 ms to minimize.
[2023-03-19 03:51:41] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 1 ms to minimize.
[2023-03-19 03:51:41] [INFO ] Deduced a trap composed of 18 places in 208 ms of which 1 ms to minimize.
[2023-03-19 03:51:41] [INFO ] Deduced a trap composed of 8 places in 200 ms of which 2 ms to minimize.
[2023-03-19 03:51:41] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 1 ms to minimize.
[2023-03-19 03:51:41] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 1 ms to minimize.
[2023-03-19 03:51:42] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 0 ms to minimize.
[2023-03-19 03:51:42] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 1 ms to minimize.
[2023-03-19 03:51:42] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 0 ms to minimize.
[2023-03-19 03:51:42] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 0 ms to minimize.
[2023-03-19 03:51:42] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1743 ms
[2023-03-19 03:51:42] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 0 ms to minimize.
[2023-03-19 03:51:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2023-03-19 03:51:42] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 0 ms to minimize.
[2023-03-19 03:51:42] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 0 ms to minimize.
[2023-03-19 03:51:43] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 1 ms to minimize.
[2023-03-19 03:51:43] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 1 ms to minimize.
[2023-03-19 03:51:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 468 ms
[2023-03-19 03:51:43] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 0 ms to minimize.
[2023-03-19 03:51:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2023-03-19 03:51:43] [INFO ] After 2833ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 122 ms.
[2023-03-19 03:51:43] [INFO ] After 3381ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 27 ms.
Support contains 52 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 435/435 transitions.
Applied a total of 0 rules in 13 ms. Remains 220 /220 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 220/220 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 435/435 transitions.
Applied a total of 0 rules in 12 ms. Remains 220 /220 variables (removed 0) and now considering 435/435 (removed 0) transitions.
[2023-03-19 03:51:43] [INFO ] Flow matrix only has 375 transitions (discarded 60 similar events)
[2023-03-19 03:51:43] [INFO ] Invariant cache hit.
[2023-03-19 03:51:43] [INFO ] Implicit Places using invariants in 280 ms returned []
[2023-03-19 03:51:43] [INFO ] Flow matrix only has 375 transitions (discarded 60 similar events)
[2023-03-19 03:51:43] [INFO ] Invariant cache hit.
[2023-03-19 03:51:44] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-19 03:51:44] [INFO ] Implicit Places using invariants and state equation in 749 ms returned []
Implicit Place search using SMT with State Equation took 1031 ms to find 0 implicit places.
[2023-03-19 03:51:44] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-19 03:51:44] [INFO ] Flow matrix only has 375 transitions (discarded 60 similar events)
[2023-03-19 03:51:44] [INFO ] Invariant cache hit.
[2023-03-19 03:51:45] [INFO ] Dead Transitions using invariants and state equation in 453 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1545 ms. Remains : 220/220 places, 435/435 transitions.
Graph (trivial) has 230 edges and 220 vertex of which 31 / 220 are part of one of the 13 SCC in 7 ms
Free SCC test removed 18 places
Drop transitions removed 36 transitions
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 97 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 202 transition count 337
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 201 transition count 337
Performed 41 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 85 place count 160 transition count 282
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 94 place count 160 transition count 273
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 33 rules applied. Total rules applied 127 place count 142 transition count 327
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 50 edges and 142 vertex of which 6 / 142 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 138 place count 137 transition count 317
Drop transitions removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 145 place count 137 transition count 310
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 149 place count 135 transition count 308
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 3 with 30 rules applied. Total rules applied 179 place count 135 transition count 278
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 180 place count 135 transition count 277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 181 place count 134 transition count 277
Free-agglomeration rule applied 9 times.
Iterating global reduction 5 with 9 rules applied. Total rules applied 190 place count 134 transition count 268
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 199 place count 125 transition count 268
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 211 place count 125 transition count 268
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 218 place count 125 transition count 261
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 219 place count 125 transition count 261
Applied a total of 219 rules in 123 ms. Remains 125 /220 variables (removed 95) and now considering 261/435 (removed 174) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 261 rows 125 cols
[2023-03-19 03:51:45] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-19 03:51:45] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 03:51:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-19 03:51:45] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 03:51:45] [INFO ] After 280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-19 03:51:45] [INFO ] After 453ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-19 03:51:45] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2023-03-19 03:51:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 220 places, 435 transitions and 1600 arcs took 6 ms.
[2023-03-19 03:51:46] [INFO ] Flatten gal took : 124 ms
Total runtime 45074 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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Peterson_PT_4
(NrP: 220 NrTr: 435 NrArc: 1600)

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

net check time: 0m 0.000sec

init dd package: 0m 3.429sec


RS generation: 15m 3.645sec


-> reachability set: #nodes 845682 (8.5e+05) #states 29,171,620 (7)



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

checking: AG [[p54<=0 & 0<=p54]]
normalized: ~ [E [true U ~ [[p54<=0 & 0<=p54]]]]

abstracting: (0<=p54)
states: 29,171,620 (7)
abstracting: (p54<=0)
states: 28,613,099 (7)
-> the formula is FALSE

FORMULA Peterson-PT-4-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.318sec

checking: AG [[[[[1<=p109 & p109<=1] & [0<=p11 & p11<=0]] | [[[1<=p150 & p150<=1] & [0<=p98 & p98<=0]] & [[0<=p168 & p168<=0] & [p117<=1 & 1<=p117]]]] | [[1<=p212 & p212<=1] | [0<=p139 & p139<=0]]]]
normalized: ~ [E [true U ~ [[[[0<=p139 & p139<=0] | [1<=p212 & p212<=1]] | [[[[p117<=1 & 1<=p117] & [0<=p168 & p168<=0]] & [[0<=p98 & p98<=0] & [1<=p150 & p150<=1]]] | [[0<=p11 & p11<=0] & [1<=p109 & p109<=1]]]]]]]

abstracting: (p109<=1)
states: 29,171,620 (7)
abstracting: (1<=p109)
states: 1,102,659 (6)
abstracting: (p11<=0)
states: 28,589,151 (7)
abstracting: (0<=p11)
states: 29,171,620 (7)
abstracting: (p150<=1)
states: 29,171,620 (7)
abstracting: (1<=p150)
states: 739,775 (5)
abstracting: (p98<=0)
states: 27,259,750 (7)
abstracting: (0<=p98)
states: 29,171,620 (7)
abstracting: (p168<=0)
states: 27,259,750 (7)
abstracting: (0<=p168)
states: 29,171,620 (7)
abstracting: (1<=p117)
states: 11,387 (4)
abstracting: (p117<=1)
states: 29,171,620 (7)
abstracting: (p212<=1)
states: 29,171,620 (7)
abstracting: (1<=p212)
states: 996,578 (5)
abstracting: (p139<=0)
states: 28,523,482 (7)
abstracting: (0<=p139)
states: 29,171,620 (7)
-> the formula is FALSE

FORMULA Peterson-PT-4-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m20.854sec

checking: AG [[[[p190<=0 & 0<=p190] | [p203<=1 & 1<=p203]] & [[p115<=0 & 0<=p115] | [[p188<=0 & 0<=p188] | [[1<=p37 & p37<=1] & [[[0<=p189 & p189<=0] | [1<=p178 & p178<=1]] & [[0<=p113 & p113<=0] | [[[[1<=p185 & p185<=1] & [0<=p191 & p191<=0]] & [1<=p209 & p209<=1]] | [[1<=p183 & p183<=1] & [0<=p36 & p36<=0]]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[[[0<=p36 & p36<=0] & [1<=p183 & p183<=1]] | [[1<=p209 & p209<=1] & [[0<=p191 & p191<=0] & [1<=p185 & p185<=1]]]] | [0<=p113 & p113<=0]] & [[1<=p178 & p178<=1] | [0<=p189 & p189<=0]]] & [1<=p37 & p37<=1]] | [p188<=0 & 0<=p188]] | [p115<=0 & 0<=p115]] & [[p203<=1 & 1<=p203] | [p190<=0 & 0<=p190]]]]]]

abstracting: (0<=p190)
states: 29,171,620 (7)
abstracting: (p190<=0)
states: 29,107,016 (7)
abstracting: (1<=p203)
states: 3,287,144 (6)
abstracting: (p203<=1)
states: 29,171,620 (7)
abstracting: (0<=p115)
states: 29,171,620 (7)
abstracting: (p115<=0)
states: 28,708,276 (7)
abstracting: (0<=p188)
states: 29,171,620 (7)
abstracting: (p188<=0)
states: 27,932,307 (7)
abstracting: (p37<=1)
states: 29,171,620 (7)
abstracting: (1<=p37)
states: 319,276 (5)
abstracting: (p189<=0)
states: 28,145,990 (7)
abstracting: (0<=p189)
states: 29,171,620 (7)
abstracting: (p178<=1)
states: 29,171,620 (7)
abstracting: (1<=p178)
states: 3,051,911 (6)
abstracting: (p113<=0)
states: 28,708,276 (7)
abstracting: (0<=p113)
states: 29,171,620 (7)
abstracting: (p185<=1)
states: 29,171,620 (7)
abstracting: (1<=p185)
states: 85,779 (4)
abstracting: (p191<=0)
states: 28,708,276 (7)
abstracting: (0<=p191)
states: 29,171,620 (7)
abstracting: (p209<=1)
states: 29,171,620 (7)
abstracting: (1<=p209)
states: 222,201 (5)
abstracting: (p183<=1)
states: 29,171,620 (7)
abstracting: (1<=p183)
states: 638,510 (5)
abstracting: (p36<=0)
states: 28,548,044 (7)
abstracting: (0<=p36)
states: 29,171,620 (7)
-> the formula is FALSE

FORMULA Peterson-PT-4-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m20.462sec

checking: AG [[[[[[[[[[[[p146<=1 & 1<=p146] | [p99<=0 & 0<=p99]] & [[p132<=0 & 0<=p132] | [p106<=1 & 1<=p106]]] | [p121<=0 & 0<=p121]] & [[0<=p108 & p108<=0] | [p65<=1 & 1<=p65]]] & [[p112<=0 & 0<=p112] | [p14<=1 & 1<=p14]]] & [[p170<=0 & 0<=p170] & [p12<=1 & 1<=p12]]] | [0<=p63 & p63<=0]] & [[1<=p91 & p91<=1] | [0<=p208 & p208<=0]]] | [p187<=0 & 0<=p187]] | [[[p11<=0 & 0<=p11] & [p183<=1 & 1<=p183]] | [[[[p111<=0 & 0<=p111] | [p0<=1 & 1<=p0]] | [[p136<=0 & 0<=p136] | [[p147<=1 & 1<=p147] | [[[p107<=1 & 1<=p107] | [p9<=1 & 1<=p9]] & [[p119<=0 & 0<=p119] | [p56<=0 & 0<=p56]]]]]] & [[[p182<=0 & 0<=p182] & [p20<=1 & 1<=p20]] | [[[p140<=0 & 0<=p140] & [p9<=1 & 1<=p9]] | [[[p136<=0 & 0<=p136] & [p141<=0 & 0<=p141]] & [[p155<=1 & 1<=p155] & [[p192<=0 & 0<=p192] & [p114<=1 & 1<=p114]]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[[[p114<=1 & 1<=p114] & [p192<=0 & 0<=p192]] & [p155<=1 & 1<=p155]] & [[p141<=0 & 0<=p141] & [p136<=0 & 0<=p136]]] | [[p9<=1 & 1<=p9] & [p140<=0 & 0<=p140]]] | [[p20<=1 & 1<=p20] & [p182<=0 & 0<=p182]]] & [[[[[[p56<=0 & 0<=p56] | [p119<=0 & 0<=p119]] & [[p9<=1 & 1<=p9] | [p107<=1 & 1<=p107]]] | [p147<=1 & 1<=p147]] | [p136<=0 & 0<=p136]] | [[p0<=1 & 1<=p0] | [p111<=0 & 0<=p111]]]] | [[p183<=1 & 1<=p183] & [p11<=0 & 0<=p11]]] | [[p187<=0 & 0<=p187] | [[[0<=p208 & p208<=0] | [1<=p91 & p91<=1]] & [[0<=p63 & p63<=0] | [[[p12<=1 & 1<=p12] & [p170<=0 & 0<=p170]] & [[[p14<=1 & 1<=p14] | [p112<=0 & 0<=p112]] & [[[p65<=1 & 1<=p65] | [0<=p108 & p108<=0]] & [[p121<=0 & 0<=p121] | [[[p106<=1 & 1<=p106] | [p132<=0 & 0<=p132]] & [[p99<=0 & 0<=p99] | [p146<=1 & 1<=p146]]]]]]]]]]]]]]

abstracting: (1<=p146)
states: 63,416 (4)
abstracting: (p146<=1)
states: 29,171,620 (7)
abstracting: (0<=p99)
states: 29,171,620 (7)
abstracting: (p99<=0)
states: 27,939,790 (7)
abstracting: (0<=p132)
states: 29,171,620 (7)
abstracting: (p132<=0)
states: 27,932,307 (7)
abstracting: (1<=p106)
states: 1,191,617 (6)
abstracting: (p106<=1)
states: 29,171,620 (7)
abstracting: (0<=p121)
states: 29,171,620 (7)
abstracting: (p121<=0)
states: 28,351,219 (7)
abstracting: (p108<=0)
states: 28,056,806 (7)
abstracting: (0<=p108)
states: 29,171,620 (7)
abstracting: (1<=p65)
states: 191,597 (5)
abstracting: (p65<=1)
states: 29,171,620 (7)
abstracting: (0<=p112)
states: 29,171,620 (7)
abstracting: (p112<=0)
states: 29,048,897 (7)
abstracting: (1<=p14)
states: 64,604 (4)
abstracting: (p14<=1)
states: 29,171,620 (7)
abstracting: (0<=p170)
states: 29,171,620 (7)
abstracting: (p170<=0)
states: 28,369,973 (7)
abstracting: (1<=p12)
states: 443,033 (5)
abstracting: (p12<=1)
states: 29,171,620 (7)
abstracting: (p63<=0)
states: 28,708,276 (7)
abstracting: (0<=p63)
states: 29,171,620 (7)
abstracting: (p91<=1)
states: 29,171,620 (7)
abstracting: (1<=p91)
states: 801,647 (5)
abstracting: (p208<=0)
states: 28,708,276 (7)
abstracting: (0<=p208)
states: 29,171,620 (7)
abstracting: (0<=p187)
states: 29,171,620 (7)
abstracting: (p187<=0)
states: 28,841,762 (7)
abstracting: (0<=p11)
states: 29,171,620 (7)
abstracting: (p11<=0)
states: 28,589,151 (7)
abstracting: (1<=p183)
states: 638,510 (5)
abstracting: (p183<=1)
states: 29,171,620 (7)
abstracting: (0<=p111)
states: 29,171,620 (7)
abstracting: (p111<=0)
states: 28,394,153 (7)
abstracting: (1<=p0)
states: 3,051,911 (6)
abstracting: (p0<=1)
states: 29,171,620 (7)
abstracting: (0<=p136)
states: 29,171,620 (7)
abstracting: (p136<=0)
states: 28,421,127 (7)
abstracting: (1<=p147)
states: 64,604 (4)
abstracting: (p147<=1)
states: 29,171,620 (7)
abstracting: (1<=p107)
states: 1,239,313 (6)
abstracting: (p107<=1)
states: 29,171,620 (7)
abstracting: (1<=p9)
states: 336,769 (5)
abstracting: (p9<=1)
states: 29,171,620 (7)
abstracting: (0<=p119)
states: 29,171,620 (7)
abstracting: (p119<=0)
states: 26,695,542 (7)
abstracting: (0<=p56)
states: 29,171,620 (7)
abstracting: (p56<=0)
states: 28,852,344 (7)
abstracting: (0<=p182)
states: 29,171,620 (7)
abstracting: (p182<=0)
states: 29,123,791 (7)
abstracting: (1<=p20)
states: 739,775 (5)
abstracting: (p20<=1)
states: 29,171,620 (7)
abstracting: (0<=p140)
states: 29,171,620 (7)
abstracting: (p140<=0)
states: 29,132,651 (7)
abstracting: (1<=p9)
states: 336,769 (5)
abstracting: (p9<=1)
states: 29,171,620 (7)
abstracting: (0<=p136)
states: 29,171,620 (7)
abstracting: (p136<=0)
states: 28,421,127 (7)
abstracting: (0<=p141)
states: 29,171,620 (7)
abstracting: (p141<=0)
states: 29,160,233 (7)
abstracting: (1<=p155)
states: 191,597 (5)
abstracting: (p155<=1)
states: 29,171,620 (7)
abstracting: (0<=p192)
states: 29,171,620 (7)
abstracting: (p192<=0)
states: 28,834,851 (7)
abstracting: (1<=p114)
states: 558,521 (5)
abstracting: (p114<=1)
states: 29,171,620 (7)
-> the formula is FALSE

FORMULA Peterson-PT-4-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m28.443sec

totally nodes used: 30624200 (3.1e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 477996290 1862890402 2340886692
used/not used/entry size/cache size: 67108863 1 16 1024MB
basic ops cache: hits/miss/sum: 15883353 72001256 87884609
used/not used/entry size/cache size: 16735629 41587 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: 1888852 6895186 8784038
used/not used/entry size/cache size: 4697250 3691358 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 44665829
1 16125339
2 4807562
3 1213386
4 247846
5 42081
6 6029
7 730
8 52
9 10
>= 10 0

Total processing time: 16m34.237sec


BK_STOP 1679198901656

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.001sec

182088 256489 344873 420705 477790 549938 579916 602060 545676 575051 715192 697992 683671 686773 628589 679000 780137 780270 791448 734726 802400 939911 929744 903134 902533 850212
iterations count:2639833 (6068), effective:61026 (140)

initing FirstDep: 0m 0.001sec


iterations count:43579 (100), effective:640 (1)

iterations count:36837 (84), effective:590 (1)

iterations count:60280 (138), effective:928 (2)

iterations count:60298 (138), effective:992 (2)

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="Peterson-PT-4"
export BK_EXAMINATION="ReachabilityCardinality"
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 Peterson-PT-4, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r266-smll-167863541200622"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-4.tgz
mv Peterson-PT-4 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;