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.r170-tall-167838857300486.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 FlexibleBarrier-PT-08b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857300486
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 12:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 12:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 12:28 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 3.9K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 12:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 12:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 12:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 241K Mar 5 18:22 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 FlexibleBarrier-PT-08b-ReachabilityCardinality-00
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-01
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-02
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-03
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-04
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-05
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-06
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-07
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-08
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-09
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-10
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-11
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-12
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-13
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-14
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678555227013

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=FlexibleBarrier-PT-08b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 17:20:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 17:20:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 17:20:28] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2023-03-11 17:20:28] [INFO ] Transformed 920 places.
[2023-03-11 17:20:28] [INFO ] Transformed 1057 transitions.
[2023-03-11 17:20:28] [INFO ] Found NUPN structural information;
[2023-03-11 17:20:28] [INFO ] Parsed PT model containing 920 places and 1057 transitions and 2627 arcs in 145 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 157 resets, run finished after 493 ms. (steps per millisecond=20 ) properties (out of 14) seen :3
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :1
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 19 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 19 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :1
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 1057 rows 920 cols
[2023-03-11 17:20:29] [INFO ] Computed 10 place invariants in 22 ms
[2023-03-11 17:20:30] [INFO ] After 483ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-11 17:20:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 93 ms returned sat
[2023-03-11 17:20:31] [INFO ] After 674ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2023-03-11 17:20:31] [INFO ] Deduced a trap composed of 52 places in 310 ms of which 6 ms to minimize.
[2023-03-11 17:20:32] [INFO ] Deduced a trap composed of 287 places in 272 ms of which 1 ms to minimize.
[2023-03-11 17:20:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 714 ms
[2023-03-11 17:20:32] [INFO ] Deduced a trap composed of 318 places in 256 ms of which 1 ms to minimize.
[2023-03-11 17:20:32] [INFO ] Deduced a trap composed of 281 places in 234 ms of which 1 ms to minimize.
[2023-03-11 17:20:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 613 ms
[2023-03-11 17:20:33] [INFO ] Deduced a trap composed of 287 places in 161 ms of which 2 ms to minimize.
[2023-03-11 17:20:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2023-03-11 17:20:33] [INFO ] Deduced a trap composed of 324 places in 223 ms of which 1 ms to minimize.
[2023-03-11 17:20:33] [INFO ] Deduced a trap composed of 318 places in 194 ms of which 0 ms to minimize.
[2023-03-11 17:20:34] [INFO ] Deduced a trap composed of 326 places in 175 ms of which 1 ms to minimize.
[2023-03-11 17:20:34] [INFO ] Deduced a trap composed of 283 places in 161 ms of which 1 ms to minimize.
[2023-03-11 17:20:34] [INFO ] Deduced a trap composed of 288 places in 159 ms of which 0 ms to minimize.
[2023-03-11 17:20:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1153 ms
[2023-03-11 17:20:34] [INFO ] After 3816ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :7
Attempting to minimize the solution found.
Minimization took 374 ms.
[2023-03-11 17:20:34] [INFO ] After 4745ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :7
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 7 different solutions.
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 97 ms.
Support contains 122 out of 920 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 920/920 places, 1057/1057 transitions.
Graph (trivial) has 691 edges and 920 vertex of which 32 / 920 are part of one of the 5 SCC in 5 ms
Free SCC test removed 27 places
Drop transitions removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions removed 168 transitions
Trivial Post-agglo rules discarded 168 transitions
Performed 168 trivial Post agglomeration. Transition count delta: 168
Iterating post reduction 0 with 168 rules applied. Total rules applied 169 place count 893 transition count 856
Reduce places removed 168 places and 0 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Iterating post reduction 1 with 199 rules applied. Total rules applied 368 place count 725 transition count 825
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 399 place count 694 transition count 825
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 399 place count 694 transition count 791
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 467 place count 660 transition count 791
Discarding 246 places :
Symmetric choice reduction at 3 with 246 rule applications. Total rules 713 place count 414 transition count 545
Iterating global reduction 3 with 246 rules applied. Total rules applied 959 place count 414 transition count 545
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 959 place count 414 transition count 544
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 961 place count 413 transition count 544
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 988 place count 386 transition count 517
Iterating global reduction 3 with 27 rules applied. Total rules applied 1015 place count 386 transition count 517
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 1031 place count 386 transition count 501
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 1115 place count 344 transition count 459
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1118 place count 344 transition count 456
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 1126 place count 340 transition count 494
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 1130 place count 340 transition count 490
Free-agglomeration rule applied 107 times.
Iterating global reduction 5 with 107 rules applied. Total rules applied 1237 place count 340 transition count 383
Reduce places removed 107 places and 0 transitions.
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 117 rules applied. Total rules applied 1354 place count 233 transition count 373
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 1366 place count 233 transition count 361
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1367 place count 233 transition count 360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1368 place count 232 transition count 360
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1369 place count 232 transition count 360
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 1371 place count 232 transition count 360
Applied a total of 1371 rules in 222 ms. Remains 232 /920 variables (removed 688) and now considering 360/1057 (removed 697) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 222 ms. Remains : 232/920 places, 360/1057 transitions.
Incomplete random walk after 10000 steps, including 225 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 6) seen :2
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :1
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 17:20:35] [INFO ] Flow matrix only has 354 transitions (discarded 6 similar events)
// Phase 1: matrix 354 rows 232 cols
[2023-03-11 17:20:35] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-11 17:20:35] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 17:20:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-11 17:20:35] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 17:20:35] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-11 17:20:36] [INFO ] After 71ms SMT Verify possible using 80 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 17:20:36] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 1 ms to minimize.
[2023-03-11 17:20:36] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2023-03-11 17:20:36] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 9 ms to minimize.
[2023-03-11 17:20:36] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 1 ms to minimize.
[2023-03-11 17:20:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 319 ms
[2023-03-11 17:20:36] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 0 ms to minimize.
[2023-03-11 17:20:36] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2023-03-11 17:20:36] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 1 ms to minimize.
[2023-03-11 17:20:36] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 0 ms to minimize.
[2023-03-11 17:20:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 319 ms
[2023-03-11 17:20:36] [INFO ] After 787ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-03-11 17:20:36] [INFO ] After 1067ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1 ms.
Support contains 72 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 360/360 transitions.
Graph (trivial) has 82 edges and 232 vertex of which 2 / 232 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 231 transition count 341
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 214 transition count 340
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 213 transition count 340
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 52 place count 198 transition count 323
Iterating global reduction 3 with 15 rules applied. Total rules applied 67 place count 198 transition count 323
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 97 place count 183 transition count 308
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 108 place count 183 transition count 297
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 111 place count 180 transition count 293
Iterating global reduction 4 with 3 rules applied. Total rules applied 114 place count 180 transition count 293
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 116 place count 179 transition count 294
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 117 place count 178 transition count 292
Iterating global reduction 4 with 1 rules applied. Total rules applied 118 place count 178 transition count 292
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 119 place count 178 transition count 291
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 133 place count 178 transition count 277
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 134 place count 177 transition count 276
Iterating global reduction 5 with 1 rules applied. Total rules applied 135 place count 177 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 136 place count 177 transition count 275
Free-agglomeration rule applied 21 times.
Iterating global reduction 6 with 21 rules applied. Total rules applied 157 place count 177 transition count 254
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 22 rules applied. Total rules applied 179 place count 156 transition count 253
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 183 place count 156 transition count 249
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 185 place count 156 transition count 249
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 186 place count 156 transition count 249
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 187 place count 155 transition count 248
Applied a total of 187 rules in 71 ms. Remains 155 /232 variables (removed 77) and now considering 248/360 (removed 112) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 155/232 places, 248/360 transitions.
Incomplete random walk after 10000 steps, including 232 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 891906 steps, run timeout after 3001 ms. (steps per millisecond=297 ) properties seen :{}
Probabilistic random walk after 891906 steps, saw 191160 distinct states, run finished after 3003 ms. (steps per millisecond=297 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 17:20:40] [INFO ] Flow matrix only has 242 transitions (discarded 6 similar events)
// Phase 1: matrix 242 rows 155 cols
[2023-03-11 17:20:40] [INFO ] Computed 10 place invariants in 5 ms
[2023-03-11 17:20:40] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 17:20:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-11 17:20:40] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 17:20:40] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-11 17:20:40] [INFO ] After 57ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 17:20:40] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2023-03-11 17:20:40] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2023-03-11 17:20:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 126 ms
[2023-03-11 17:20:40] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 0 ms to minimize.
[2023-03-11 17:20:40] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2023-03-11 17:20:40] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2023-03-11 17:20:40] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 0 ms to minimize.
[2023-03-11 17:20:40] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
[2023-03-11 17:20:40] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 0 ms to minimize.
[2023-03-11 17:20:40] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2023-03-11 17:20:40] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2023-03-11 17:20:41] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 416 ms
[2023-03-11 17:20:41] [INFO ] After 656ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-11 17:20:41] [INFO ] After 876ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 5 ms.
Support contains 72 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 248/248 transitions.
Applied a total of 0 rules in 7 ms. Remains 155 /155 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 155/155 places, 248/248 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 248/248 transitions.
Applied a total of 0 rules in 6 ms. Remains 155 /155 variables (removed 0) and now considering 248/248 (removed 0) transitions.
[2023-03-11 17:20:41] [INFO ] Flow matrix only has 242 transitions (discarded 6 similar events)
[2023-03-11 17:20:41] [INFO ] Invariant cache hit.
[2023-03-11 17:20:41] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-11 17:20:41] [INFO ] Flow matrix only has 242 transitions (discarded 6 similar events)
[2023-03-11 17:20:41] [INFO ] Invariant cache hit.
[2023-03-11 17:20:41] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-11 17:20:41] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2023-03-11 17:20:41] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-11 17:20:41] [INFO ] Flow matrix only has 242 transitions (discarded 6 similar events)
[2023-03-11 17:20:41] [INFO ] Invariant cache hit.
[2023-03-11 17:20:41] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 299 ms. Remains : 155/155 places, 248/248 transitions.
Graph (trivial) has 58 edges and 155 vertex of which 14 / 155 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Drop transitions removed 18 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 148 transition count 221
Reduce places removed 7 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 141 transition count 216
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 27 place count 136 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 28 place count 135 transition count 214
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 28 place count 135 transition count 212
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 32 place count 133 transition count 212
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 34 place count 131 transition count 208
Iterating global reduction 4 with 2 rules applied. Total rules applied 36 place count 131 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 37 place count 131 transition count 207
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 49 place count 125 transition count 201
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 53 place count 123 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 54 place count 123 transition count 201
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 6 with 18 rules applied. Total rules applied 72 place count 123 transition count 183
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 76 place count 123 transition count 179
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 80 place count 119 transition count 179
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 81 place count 119 transition count 178
Applied a total of 81 rules in 28 ms. Remains 119 /155 variables (removed 36) and now considering 178/248 (removed 70) transitions.
Running SMT prover for 3 properties.
[2023-03-11 17:20:41] [INFO ] Flow matrix only has 174 transitions (discarded 4 similar events)
// Phase 1: matrix 174 rows 119 cols
[2023-03-11 17:20:41] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-11 17:20:41] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 17:20:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-11 17:20:41] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 17:20:41] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-11 17:20:41] [INFO ] After 234ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-11 17:20:41] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-11 17:20:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 155 places, 248 transitions and 898 arcs took 2 ms.
[2023-03-11 17:20:41] [INFO ] Flatten gal took : 41 ms
Total runtime 13369 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: FlexibleBarrier_PT_08b
(NrP: 155 NrTr: 248 NrArc: 898)

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

net check time: 0m 0.000sec

init dd package: 0m 2.738sec


RS generation: 1m48.560sec


-> reachability set: #nodes 224753 (2.2e+05) #states 55,280,880,702 (10)



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

checking: EF [[[p86<=0 & 0<=p86] & [[p130<=1 & 1<=p130] & [[[p31<=0 & 0<=p31] & [p19<=1 & 1<=p19]] | [[[p4<=0 & 0<=p4] & [p145<=1 & 1<=p145]] | [[p2<=0 & 0<=p2] & [p139<=1 & 1<=p139]]]]]]]
normalized: E [true U [[p86<=0 & 0<=p86] & [[p130<=1 & 1<=p130] & [[[[p139<=1 & 1<=p139] & [p2<=0 & 0<=p2]] | [[p145<=1 & 1<=p145] & [p4<=0 & 0<=p4]]] | [[p19<=1 & 1<=p19] & [p31<=0 & 0<=p31]]]]]]

abstracting: (0<=p31)
states: 55,280,880,702 (10)
abstracting: (p31<=0)
states: 53,811,765,534 (10)
abstracting: (1<=p19)
states: 3,286,438,380 (9)
abstracting: (p19<=1)
states: 55,280,880,702 (10)
abstracting: (0<=p4)
states: 55,280,880,702 (10)
abstracting: (p4<=0)
states: 51,357,098,322 (10)
abstracting: (1<=p145)
states: 933,694,506 (8)
abstracting: (p145<=1)
states: 55,280,880,702 (10)
abstracting: (0<=p2)
states: 55,280,880,702 (10)
abstracting: (p2<=0)
states: 55,276,096,419 (10)
abstracting: (1<=p139)
states: 1,536,093,216 (9)
abstracting: (p139<=1)
states: 55,280,880,702 (10)
abstracting: (1<=p130)
states: 1,890,200,880 (9)
abstracting: (p130<=1)
states: 55,280,880,702 (10)
abstracting: (0<=p86)
states: 55,280,880,702 (10)
abstracting: (p86<=0)
states: 50,736,736,029 (10)

before gc: list nodes free: 493402

after gc: idd nodes used:960964, unused:63039036; list nodes free:280969599
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 5m28.588sec

checking: EF [[[[[0<=p134 & p134<=0] & [p94<=0 & 0<=p94]] & [[p132<=1 & 1<=p132] & [p106<=0 & 0<=p106]]] & [[[[p61<=0 & 0<=p61] | [p102<=1 & 1<=p102]] & [[p17<=1 & 1<=p17] | [[p136<=0 & 0<=p136] | [p69<=0 & 0<=p69]]]] & [[[p15<=1 & 1<=p15] | [[p68<=1 & 1<=p68] & [p52<=1 & 1<=p52]]] & [[[[p7<=1 & 1<=p7] & [[p87<=1 & 1<=p87] & [p81<=0 & 0<=p81]]] & [[p51<=1 & 1<=p51] & [[p141<=1 & 1<=p141] & [[[p97<=0 & 0<=p97] | [[p114<=0 & 0<=p114] | [p56<=1 & 1<=p56]]] | [[p73<=0 & 0<=p73] | [[p40<=0 & 0<=p40] | [[p101<=0 & 0<=p101] & [p21<=1 & 1<=p21]]]]]]]] | [[p110<=0 & 0<=p110] & [p82<=0 & 0<=p82]]]]]]]
normalized: E [true U [[[[[[p82<=0 & 0<=p82] & [p110<=0 & 0<=p110]] | [[[[[[[[p21<=1 & 1<=p21] & [p101<=0 & 0<=p101]] | [p40<=0 & 0<=p40]] | [p73<=0 & 0<=p73]] | [[[p56<=1 & 1<=p56] | [p114<=0 & 0<=p114]] | [p97<=0 & 0<=p97]]] & [p141<=1 & 1<=p141]] & [p51<=1 & 1<=p51]] & [[[p81<=0 & 0<=p81] & [p87<=1 & 1<=p87]] & [p7<=1 & 1<=p7]]]] & [[[p52<=1 & 1<=p52] & [p68<=1 & 1<=p68]] | [p15<=1 & 1<=p15]]] & [[[[p69<=0 & 0<=p69] | [p136<=0 & 0<=p136]] | [p17<=1 & 1<=p17]] & [[p102<=1 & 1<=p102] | [p61<=0 & 0<=p61]]]] & [[[p106<=0 & 0<=p106] & [p132<=1 & 1<=p132]] & [[p94<=0 & 0<=p94] & [0<=p134 & p134<=0]]]]]

abstracting: (p134<=0)
states: 53,563,450,563 (10)
abstracting: (0<=p134)
states: 55,280,880,702 (10)
abstracting: (0<=p94)
states: 55,280,880,702 (10)
abstracting: (p94<=0)
states: 52,160,120,364 (10)
abstracting: (1<=p132)
states: 1,536,093,216 (9)
abstracting: (p132<=1)
states: 55,280,880,702 (10)
abstracting: (0<=p106)
states: 55,280,880,702 (10)
abstracting: (p106<=0)
states: 52,837,145,613 (10)
abstracting: (0<=p61)
states: 55,280,880,702 (10)
abstracting: (p61<=0)
states: 49,700,474,283 (10)
abstracting: (1<=p102)
states: 2,391,996,918 (9)
abstracting: (p102<=1)
states: 55,280,880,702 (10)
abstracting: (1<=p17)
states: 3,296,368,068 (9)
abstracting: (p17<=1)
states: 55,280,880,702 (10)
abstracting: (0<=p136)
states: 55,280,880,702 (10)
abstracting: (p136<=0)
states: 53,747,284,158 (10)
abstracting: (0<=p69)
states: 55,280,880,702 (10)
abstracting: (p69<=0)
states: 52,549,265,022 (10)
abstracting: (1<=p15)
states: 3,272,243,964 (9)
abstracting: (p15<=1)
states: 55,280,880,702 (10)
abstracting: (1<=p68)
states: 2,741,748,936 (9)
abstracting: (p68<=1)
states: 55,280,880,702 (10)
abstracting: (1<=p52)
states: 1,474,431,540 (9)
abstracting: (p52<=1)
states: 55,280,880,702 (10)
abstracting: (1<=p7)
states: 5,007,655,908 (9)
abstracting: (p7<=1)
states: 55,280,880,702 (10)
abstracting: (1<=p87)
states: 3,086,300,493 (9)
abstracting: (p87<=1)
states: 55,280,880,702 (10)
abstracting: (0<=p81)
states: 55,280,880,702 (10)
abstracting: (p81<=0)
states: 52,640,304,276 (10)
abstracting: (1<=p51)
states: 2,289,651,192 (9)
abstracting: (p51<=1)
states: 55,280,880,702 (10)
abstracting: (1<=p141)
states: 2,089,286,784 (9)
abstracting: (p141<=1)
states: 55,280,880,702 (10)
abstracting: (0<=p97)
states: 55,280,880,702 (10)
abstracting: (p97<=0)
states: 52,529,917,314 (10)
abstracting: (0<=p114)
states: 55,280,880,702 (10)
abstracting: (p114<=0)
states: 50,184,605,116 (10)
abstracting: (1<=p56)
states: 3,776,857,032 (9)
abstracting: (p56<=1)
states: 55,280,880,702 (10)
abstracting: (0<=p73)
states: 55,280,880,702 (10)
abstracting: (p73<=0)
states: 49,788,790,191 (10)
abstracting: (0<=p40)
states: 55,280,880,702 (10)
abstracting: (p40<=0)
states: 52,991,229,510 (10)
abstracting: (0<=p101)
states: 55,280,880,702 (10)
abstracting: (p101<=0)
states: 52,364,339,562 (10)
abstracting: (1<=p21)
states: 3,916,024,140 (9)
abstracting: (p21<=1)
states: 55,280,880,702 (10)
abstracting: (0<=p110)
states: 55,280,880,702 (10)
abstracting: (p110<=0)
states: 50,660,202,624 (10)
abstracting: (0<=p82)
states: 55,280,880,702 (10)
abstracting: (p82<=0)
states: 52,186,890,708 (10)

before gc: list nodes free: 4042261

after gc: idd nodes used:2065650, unused:61934350; list nodes free:275929543

before gc: list nodes free: 3576510

after gc: idd nodes used:2381083, unused:61618917; list nodes free:274566744
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m25.283sec

checking: AG [[[[[[[[[[[[[[[[p33<=0 & 0<=p33] & [p152<=1 & 1<=p152]] & [[p59<=1 & 1<=p59] & [[p128<=0 & 0<=p128] | [p48<=1 & 1<=p48]]]] | [p147<=1 & 1<=p147]] | [p131<=0 & 0<=p131]] | [[p54<=0 & 0<=p54] | [p144<=1 & 1<=p144]]] & [p104<=1 & 1<=p104]] | [p148<=1 & 1<=p148]] | [[p57<=1 & 1<=p57] | [p71<=0 & 0<=p71]]] & [[[p5<=0 & 0<=p5] | [p74<=1 & 1<=p74]] | [[p150<=0 & 0<=p150] | [p84<=1 & 1<=p84]]]] & [[p116<=0 & 0<=p116] | [[p85<=1 & 1<=p85] | [p79<=1 & 1<=p79]]]] | [p73<=1 & 1<=p73]] | [[p122<=0 & 0<=p122] | [p125<=1 & 1<=p125]]] | [[p90<=0 & 0<=p90] | [[p23<=1 & 1<=p23] | [p146<=0 & 0<=p146]]]] & [[[p58<=1 & 1<=p58] | [[p137<=0 & 0<=p137] | [p20<=0 & 0<=p20]]] | [[[p98<=0 & 0<=p98] & [p99<=1 & 1<=p99]] | [[[p127<=0 & 0<=p127] & [[p49<=1 & 1<=p49] & [[p115<=1 & 1<=p115] | [[p70<=0 & 0<=p70] & [p130<=1 & 1<=p130]]]]] | [[[p3<=0 & 0<=p3] | [p142<=1 & 1<=p142]] & [[p88<=1 & 1<=p88] | [p119<=1 & 1<=p119]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[p119<=1 & 1<=p119] | [p88<=1 & 1<=p88]] & [[p142<=1 & 1<=p142] | [p3<=0 & 0<=p3]]] | [[[[[p130<=1 & 1<=p130] & [p70<=0 & 0<=p70]] | [p115<=1 & 1<=p115]] & [p49<=1 & 1<=p49]] & [p127<=0 & 0<=p127]]] | [[p99<=1 & 1<=p99] & [p98<=0 & 0<=p98]]] | [[[p20<=0 & 0<=p20] | [p137<=0 & 0<=p137]] | [p58<=1 & 1<=p58]]] & [[[[p146<=0 & 0<=p146] | [p23<=1 & 1<=p23]] | [p90<=0 & 0<=p90]] | [[[p125<=1 & 1<=p125] | [p122<=0 & 0<=p122]] | [[p73<=1 & 1<=p73] | [[[[p79<=1 & 1<=p79] | [p85<=1 & 1<=p85]] | [p116<=0 & 0<=p116]] & [[[[p84<=1 & 1<=p84] | [p150<=0 & 0<=p150]] | [[p74<=1 & 1<=p74] | [p5<=0 & 0<=p5]]] & [[[p71<=0 & 0<=p71] | [p57<=1 & 1<=p57]] | [[p148<=1 & 1<=p148] | [[p104<=1 & 1<=p104] & [[[p144<=1 & 1<=p144] | [p54<=0 & 0<=p54]] | [[p131<=0 & 0<=p131] | [[p147<=1 & 1<=p147] | [[[[p48<=1 & 1<=p48] | [p128<=0 & 0<=p128]] & [p59<=1 & 1<=p59]] & [[p152<=1 & 1<=p152] & [p33<=0 & 0<=p33]]]]]]]]]]]]]]]]]]

abstracting: (0<=p33)
states: 55,280,880,702 (10)
abstracting: (p33<=0)
states: 53,625,905,082 (10)
abstracting: (1<=p152)
states: 17,526,455,881 (10)
abstracting: (p152<=1)
states: 55,280,880,702 (10)
abstracting: (1<=p59)
states: 4,897,891,443 (9)
abstracting: (p59<=1)
states: 55,280,880,702 (10)
abstracting: (0<=p128)
states: 55,280,880,702 (10)
abstracting: (p128<=0)
states: 53,469,175,746 (10)
abstracting: (1<=p48)
states: 2,564,900,304 (9)
abstracting: (p48<=1)
states: 55,280,880,702 (10)
abstracting: (1<=p147)
states: 1,803,141,312 (9)
abstracting: (p147<=1)
states: 55,280,880,702 (10)
abstracting: (0<=p131)
states: 55,280,880,702 (10)
abstracting: (p131<=0)
states: 53,390,679,822 (10)
abstracting: (0<=p54)
states: 55,280,880,702 (10)
abstracting: (p54<=0)
states: 52,991,229,510 (10)
abstracting: (1<=p144)
states: 1,624,399,704 (9)
abstracting: (p144<=1)
states: 55,280,880,702 (10)
abstracting: (1<=p104)
states: 2,443,735,089 (9)
abstracting: (p104<=1)
states: 55,280,880,702 (10)
abstracting: (1<=p148)
states: 1,882,030,860 (9)
abstracting: (p148<=1)
states: 55,280,880,702 (10)
abstracting: (1<=p57)
states: 3,801,896,676 (9)
abstracting: (p57<=1)
states: 55,280,880,702 (10)
abstracting: (0<=p71)
states: 55,280,880,702 (10)
abstracting: (p71<=0)
states: 52,380,094,578 (10)
abstracting: (0<=p5)
states: 55,280,880,702 (10)
abstracting: (p5<=0)
states: 51,393,191,220 (10)
abstracting: (1<=p74)
states: 2,780,896,872 (9)
abstracting: (p74<=1)
states: 55,280,880,702 (10)
abstracting: (0<=p150)
states: 55,280,880,702 (10)
abstracting: (p150<=0)
states: 50,223,598,071 (10)
abstracting: (1<=p84)
states: 3,113,258,694 (9)
abstracting: (p84<=1)
states: 55,280,880,702 (10)
abstracting: (0<=p116)
states: 55,280,880,702 (10)
abstracting: (p116<=0)
states: 50,184,605,116 (10)
abstracting: (1<=p85)
states: 4,544,144,673 (9)
abstracting: (p85<=1)
states: 55,280,880,702 (10)
abstracting: (1<=p79)
states: 6,345,101,385 (9)
abstracting: (p79<=1)
states: 55,280,880,702 (10)
abstracting: (1<=p73)
states: 5,492,090,511 (9)
abstracting: (p73<=1)
states: 55,280,880,702 (10)
abstracting: (0<=p122)
states: 55,280,880,702 (10)
abstracting: (p122<=0)
states: 50,184,605,116 (10)
abstracting: (1<=p125)
states: 1,527,931,188 (9)
abstracting: (p125<=1)
states: 55,280,880,702 (10)
abstracting: (0<=p90)
states: 55,280,880,702 (10)
abstracting: (p90<=0)
states: 52,160,120,364 (10)
abstracting: (1<=p23)
states: 4,434,894,060 (9)
abstracting: (p23<=1)
states: 55,280,880,702 (10)
abstracting: (0<=p146)
states: 55,280,880,702 (10)
abstracting: (p146<=0)
states: 50,223,598,071 (10)
abstracting: (1<=p58)
states: 3,704,223,402 (9)
abstracting: (p58<=1)
states: 55,280,880,702 (10)
abstracting: (0<=p137)
states: 55,280,880,702 (10)
abstracting: (p137<=0)
states: 54,272,688,822 (10)
abstracting: (0<=p20)
states: 55,280,880,702 (10)
abstracting: (p20<=0)
states: 51,994,442,322 (10)
abstracting: (0<=p98)
states: 55,280,880,702 (10)
abstracting: (p98<=0)
states: 52,529,917,314 (10)
abstracting: (1<=p99)
states: 2,098,132,296 (9)
abstracting: (p99<=1)
states: 55,280,880,702 (10)
abstracting: (0<=p127)
states: 55,280,880,702 (10)
abstracting: (p127<=0)
states: 54,198,078,822 (10)
abstracting: (1<=p49)
states: 2,564,900,304 (9)
abstracting: (p49<=1)
states: 55,280,880,702 (10)
abstracting: (1<=p115)
states: 5,096,275,586 (9)
abstracting: (p115<=1)
states: 55,280,880,702 (10)
abstracting: (0<=p70)
states: 55,280,880,702 (10)
abstracting: (p70<=0)
states: 52,380,094,578 (10)
abstracting: (1<=p130)
states: 1,890,200,880 (9)
abstracting: (p130<=1)
states: 55,280,880,702 (10)
abstracting: (0<=p3)
states: 55,280,880,702 (10)
abstracting: (p3<=0)
states: 51,357,098,322 (10)
abstracting: (1<=p142)
states: 1,358,463,669 (9)
abstracting: (p142<=1)
states: 55,280,880,702 (10)
abstracting: (1<=p88)
states: 4,544,144,673 (9)
abstracting: (p88<=1)
states: 55,280,880,702 (10)
abstracting: (1<=p119)
states: 4,419,588,958 (9)
abstracting: (p119<=1)
states: 55,280,880,702 (10)

before gc: list nodes free: 3476105

after gc: idd nodes used:4371065, unused:59628935; list nodes free:265625681

before gc: list nodes free: 1615061

after gc: idd nodes used:4653454, unused:59346546; list nodes free:264393938

before gc: list nodes free: 5061635

after gc: idd nodes used:4696813, unused:59303187; list nodes free:264213315
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 11m 3.173sec

totally nodes used: 419274937 (4.2e+08)
number of garbage collections: 6
fire ops cache: hits/miss/sum: 657649764 2045875015 2703524779
used/not used/entry size/cache size: 65906987 1201877 16 1024MB
basic ops cache: hits/miss/sum: 173259524 518239723 691499247
used/not used/entry size/cache size: 16746403 30813 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: 1753872 4704811 6458683
used/not used/entry size/cache size: 0 8388608 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 30843592
1 22835127
2 9706741
3 2908854
4 669184
5 123311
6 19248
7 2480
8 289
9 36
>= 10 2

Total processing time: 22m55.423sec


BK_STOP 1678556618325

--------------------
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.000sec

11157 15335 274360
iterations count:330694 (1333), effective:17199 (69)

initing FirstDep: 0m 0.003sec


iterations count:27263 (109), effective:1253 (5)

iterations count:20127 (81), effective:844 (3)

iterations count:42409 (171), effective:1819 (7)

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="FlexibleBarrier-PT-08b"
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 FlexibleBarrier-PT-08b, 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 r170-tall-167838857300486"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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