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-167838857300519.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-12b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857300519
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 988K
-rw-r--r-- 1 mcc users 7.6K Feb 25 12:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 12:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 12:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 12:36 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.6K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 17K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 12:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 25 12:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 12:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 12:37 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 536K 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-12b-ReachabilityFireability-00
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-01
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-02
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-03
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-04
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-05
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-06
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-07
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-08
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-09
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-10
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-11
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-12
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-13
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-14
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678560939673

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-12b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 18:55:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 18:55:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 18:55:41] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2023-03-11 18:55:41] [INFO ] Transformed 1988 places.
[2023-03-11 18:55:41] [INFO ] Transformed 2289 transitions.
[2023-03-11 18:55:41] [INFO ] Found NUPN structural information;
[2023-03-11 18:55:41] [INFO ] Parsed PT model containing 1988 places and 2289 transitions and 5727 arcs in 213 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 115 resets, run finished after 494 ms. (steps per millisecond=20 ) properties (out of 16) seen :1
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 238801 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 238801 steps, saw 108661 distinct states, run finished after 3002 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 2289 rows 1988 cols
[2023-03-11 18:55:45] [INFO ] Computed 14 place invariants in 57 ms
[2023-03-11 18:55:46] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2023-03-11 18:55:46] [INFO ] After 1050ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-11 18:55:47] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2023-03-11 18:55:50] [INFO ] After 2321ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :14
[2023-03-11 18:55:51] [INFO ] Deduced a trap composed of 72 places in 661 ms of which 9 ms to minimize.
[2023-03-11 18:55:52] [INFO ] Deduced a trap composed of 688 places in 515 ms of which 1 ms to minimize.
[2023-03-11 18:55:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1420 ms
[2023-03-11 18:55:53] [INFO ] Deduced a trap composed of 704 places in 682 ms of which 2 ms to minimize.
[2023-03-11 18:55:54] [INFO ] Deduced a trap composed of 690 places in 652 ms of which 3 ms to minimize.
[2023-03-11 18:55:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1579 ms
[2023-03-11 18:55:55] [INFO ] Deduced a trap composed of 682 places in 600 ms of which 2 ms to minimize.
[2023-03-11 18:55:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 740 ms
[2023-03-11 18:55:55] [INFO ] After 8035ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :14
Attempting to minimize the solution found.
Minimization took 1331 ms.
[2023-03-11 18:55:57] [INFO ] After 10613ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :14
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 15 Parikh solutions to 14 different solutions.
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 7 properties in 169 ms.
Support contains 69 out of 1988 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1988/1988 places, 2289/2289 transitions.
Graph (trivial) has 1533 edges and 1988 vertex of which 42 / 1988 are part of one of the 7 SCC in 19 ms
Free SCC test removed 35 places
Drop transitions removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Drop transitions removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 352 rules applied. Total rules applied 353 place count 1953 transition count 1895
Reduce places removed 352 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 361 rules applied. Total rules applied 714 place count 1601 transition count 1886
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 723 place count 1592 transition count 1886
Performed 243 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 243 Pre rules applied. Total rules applied 723 place count 1592 transition count 1643
Deduced a syphon composed of 243 places in 2 ms
Reduce places removed 243 places and 0 transitions.
Iterating global reduction 3 with 486 rules applied. Total rules applied 1209 place count 1349 transition count 1643
Discarding 715 places :
Symmetric choice reduction at 3 with 715 rule applications. Total rules 1924 place count 634 transition count 928
Iterating global reduction 3 with 715 rules applied. Total rules applied 2639 place count 634 transition count 928
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 2639 place count 634 transition count 924
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 2647 place count 630 transition count 924
Discarding 103 places :
Symmetric choice reduction at 3 with 103 rule applications. Total rules 2750 place count 527 transition count 821
Iterating global reduction 3 with 103 rules applied. Total rules applied 2853 place count 527 transition count 821
Ensure Unique test removed 93 transitions
Reduce isomorphic transitions removed 93 transitions.
Iterating post reduction 3 with 93 rules applied. Total rules applied 2946 place count 527 transition count 728
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 3100 place count 450 transition count 651
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 3112 place count 444 transition count 675
Free-agglomeration rule applied 111 times.
Iterating global reduction 4 with 111 rules applied. Total rules applied 3223 place count 444 transition count 564
Reduce places removed 111 places and 0 transitions.
Iterating post reduction 4 with 111 rules applied. Total rules applied 3334 place count 333 transition count 564
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 3337 place count 330 transition count 561
Iterating global reduction 5 with 3 rules applied. Total rules applied 3340 place count 330 transition count 561
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 3343 place count 330 transition count 558
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 3355 place count 330 transition count 546
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 3360 place count 330 transition count 546
Applied a total of 3360 rules in 436 ms. Remains 330 /1988 variables (removed 1658) and now considering 546/2289 (removed 1743) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 436 ms. Remains : 330/1988 places, 546/2289 transitions.
Incomplete random walk after 10000 steps, including 125 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 7) seen :1
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :1
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 5 properties.
[2023-03-11 18:55:58] [INFO ] Flow matrix only has 531 transitions (discarded 15 similar events)
// Phase 1: matrix 531 rows 330 cols
[2023-03-11 18:55:58] [INFO ] Computed 14 place invariants in 10 ms
[2023-03-11 18:55:58] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 18:55:58] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-11 18:55:58] [INFO ] After 230ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 18:55:58] [INFO ] State equation strengthened by 108 read => feed constraints.
[2023-03-11 18:55:58] [INFO ] After 157ms SMT Verify possible using 108 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-11 18:55:59] [INFO ] After 367ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 164 ms.
[2023-03-11 18:55:59] [INFO ] After 874ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 8 ms.
Support contains 53 out of 330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 330/330 places, 546/546 transitions.
Graph (trivial) has 35 edges and 330 vertex of which 2 / 330 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 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 329 transition count 540
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 325 transition count 540
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 12 place count 322 transition count 537
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 322 transition count 537
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 31 place count 314 transition count 529
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 314 transition count 528
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 34 place count 312 transition count 526
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 312 transition count 526
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 38 place count 312 transition count 524
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 40 place count 311 transition count 527
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 42 place count 311 transition count 525
Free-agglomeration rule applied 15 times.
Iterating global reduction 4 with 15 rules applied. Total rules applied 57 place count 311 transition count 510
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 74 place count 296 transition count 508
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 80 place count 290 transition count 502
Iterating global reduction 5 with 6 rules applied. Total rules applied 86 place count 290 transition count 502
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 92 place count 290 transition count 496
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 94 place count 290 transition count 494
Applied a total of 94 rules in 104 ms. Remains 290 /330 variables (removed 40) and now considering 494/546 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 290/330 places, 494/546 transitions.
Incomplete random walk after 10000 steps, including 102 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 553973 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :{2=1, 3=1}
Probabilistic random walk after 553973 steps, saw 312653 distinct states, run finished after 3001 ms. (steps per millisecond=184 ) properties seen :2
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
[2023-03-11 18:56:02] [INFO ] Flow matrix only has 478 transitions (discarded 16 similar events)
// Phase 1: matrix 478 rows 290 cols
[2023-03-11 18:56:02] [INFO ] Computed 14 place invariants in 5 ms
[2023-03-11 18:56:02] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 18:56:02] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-11 18:56:03] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 18:56:03] [INFO ] State equation strengthened by 115 read => feed constraints.
[2023-03-11 18:56:03] [INFO ] After 126ms SMT Verify possible using 115 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 18:56:03] [INFO ] Deduced a trap composed of 133 places in 76 ms of which 1 ms to minimize.
[2023-03-11 18:56:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2023-03-11 18:56:03] [INFO ] After 361ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 117 ms.
[2023-03-11 18:56:03] [INFO ] After 742ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1 ms.
Support contains 50 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 494/494 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 288 transition count 492
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 287 transition count 491
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 287 transition count 491
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 287 transition count 490
Applied a total of 7 rules in 21 ms. Remains 287 /290 variables (removed 3) and now considering 490/494 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 287/290 places, 490/494 transitions.
Incomplete random walk after 10000 steps, including 102 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 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 16 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 610187 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :{}
Probabilistic random walk after 610187 steps, saw 263676 distinct states, run finished after 3001 ms. (steps per millisecond=203 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 18:56:06] [INFO ] Flow matrix only has 474 transitions (discarded 16 similar events)
// Phase 1: matrix 474 rows 287 cols
[2023-03-11 18:56:06] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-11 18:56:07] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 18:56:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-11 18:56:07] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 18:56:07] [INFO ] State equation strengthened by 114 read => feed constraints.
[2023-03-11 18:56:07] [INFO ] After 103ms SMT Verify possible using 114 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 18:56:07] [INFO ] Deduced a trap composed of 132 places in 90 ms of which 1 ms to minimize.
[2023-03-11 18:56:07] [INFO ] Deduced a trap composed of 132 places in 69 ms of which 1 ms to minimize.
[2023-03-11 18:56:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 207 ms
[2023-03-11 18:56:07] [INFO ] After 438ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-11 18:56:07] [INFO ] After 784ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1 ms.
Support contains 50 out of 287 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 287/287 places, 490/490 transitions.
Applied a total of 0 rules in 10 ms. Remains 287 /287 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 287/287 places, 490/490 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 287/287 places, 490/490 transitions.
Applied a total of 0 rules in 7 ms. Remains 287 /287 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-11 18:56:07] [INFO ] Flow matrix only has 474 transitions (discarded 16 similar events)
[2023-03-11 18:56:07] [INFO ] Invariant cache hit.
[2023-03-11 18:56:07] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-11 18:56:07] [INFO ] Flow matrix only has 474 transitions (discarded 16 similar events)
[2023-03-11 18:56:07] [INFO ] Invariant cache hit.
[2023-03-11 18:56:08] [INFO ] State equation strengthened by 114 read => feed constraints.
[2023-03-11 18:56:08] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
[2023-03-11 18:56:08] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-11 18:56:08] [INFO ] Flow matrix only has 474 transitions (discarded 16 similar events)
[2023-03-11 18:56:08] [INFO ] Invariant cache hit.
[2023-03-11 18:56:08] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 678 ms. Remains : 287/287 places, 490/490 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 287 transition count 450
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 88 place count 263 transition count 426
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 130 place count 221 transition count 377
Iterating global reduction 2 with 42 rules applied. Total rules applied 172 place count 221 transition count 377
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 203 place count 221 transition count 346
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 204 place count 221 transition count 345
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 207 place count 221 transition count 345
Applied a total of 207 rules in 32 ms. Remains 221 /287 variables (removed 66) and now considering 345/490 (removed 145) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 345 rows 221 cols
[2023-03-11 18:56:08] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-11 18:56:08] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 18:56:08] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-11 18:56:08] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 18:56:08] [INFO ] After 235ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-11 18:56:09] [INFO ] After 372ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-11 18:56:09] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-11 18:56:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 287 places, 490 transitions and 1846 arcs took 4 ms.
[2023-03-11 18:56:09] [INFO ] Flatten gal took : 86 ms
Total runtime 27870 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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: FlexibleBarrier_PT_12b
(NrP: 287 NrTr: 490 NrArc: 1846)

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

net check time: 0m 0.000sec

init dd package: 0m 2.718sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7117164 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16100848 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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 ReachabilityFireability -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

7744 19897 23761 43983 60076 48144 56676 121682 121451 244701 671407 597455

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-12b"
export BK_EXAMINATION="ReachabilityFireability"
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-12b, examination is ReachabilityFireability"
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-167838857300519"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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