Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r330-tall-167889203700766.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 ResAllocation-PT-R050C002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203700766
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 704K
-rw-r--r-- 1 mcc users 6.6K Feb 25 15:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 15:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 15:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 15:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 15:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 167K Feb 25 15:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 15:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 15:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 212K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-00
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-01
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-02
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-03
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-04
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-05
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-06
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-07
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-08
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-09
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-10
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-11
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-12
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-13
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-14
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679182065879

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=ResAllocation-PT-R050C002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:27:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 23:27:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:27:47] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-03-18 23:27:47] [INFO ] Transformed 200 places.
[2023-03-18 23:27:47] [INFO ] Transformed 102 transitions.
[2023-03-18 23:27:47] [INFO ] Parsed PT model containing 200 places and 102 transitions and 500 arcs in 121 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 15 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 16) seen :7
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 9) seen :1
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 102 rows 200 cols
[2023-03-18 23:27:48] [INFO ] Computed 100 place invariants in 11 ms
[2023-03-18 23:27:48] [INFO ] After 474ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:7
[2023-03-18 23:27:48] [INFO ] [Nat]Absence check using 100 positive place invariants in 16 ms returned sat
[2023-03-18 23:27:49] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :5
[2023-03-18 23:27:49] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 5 ms to minimize.
[2023-03-18 23:27:49] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2023-03-18 23:27:49] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2023-03-18 23:27:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 125 ms
[2023-03-18 23:27:49] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-18 23:27:49] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2023-03-18 23:27:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 82 ms
[2023-03-18 23:27:49] [INFO ] After 469ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :5
Attempting to minimize the solution found.
Minimization took 93 ms.
[2023-03-18 23:27:49] [INFO ] After 698ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :5
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 149 ms.
Support contains 68 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 102/102 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 199 transition count 101
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 199 transition count 100
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 196 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 195 transition count 99
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 195 transition count 98
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 12 place count 192 transition count 98
Applied a total of 12 rules in 49 ms. Remains 192 /200 variables (removed 8) and now considering 98/102 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 192/200 places, 98/102 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 612925 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :{1=1}
Probabilistic random walk after 612925 steps, saw 162617 distinct states, run finished after 3002 ms. (steps per millisecond=204 ) properties seen :1
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 4 properties.
// Phase 1: matrix 98 rows 192 cols
[2023-03-18 23:27:53] [INFO ] Computed 96 place invariants in 6 ms
[2023-03-18 23:27:53] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 23:27:53] [INFO ] [Nat]Absence check using 96 positive place invariants in 35 ms returned sat
[2023-03-18 23:27:53] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 23:27:53] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2023-03-18 23:27:53] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2023-03-18 23:27:53] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2023-03-18 23:27:53] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2023-03-18 23:27:53] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2023-03-18 23:27:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 182 ms
[2023-03-18 23:27:53] [INFO ] After 374ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-18 23:27:53] [INFO ] After 528ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 97 ms.
Support contains 53 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 98/98 transitions.
Applied a total of 0 rules in 9 ms. Remains 192 /192 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 192/192 places, 98/98 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 583977 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :{}
Probabilistic random walk after 583977 steps, saw 156718 distinct states, run finished after 3001 ms. (steps per millisecond=194 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-18 23:27:57] [INFO ] Invariant cache hit.
[2023-03-18 23:27:57] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 23:27:57] [INFO ] [Nat]Absence check using 96 positive place invariants in 15 ms returned sat
[2023-03-18 23:27:57] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 23:27:57] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2023-03-18 23:27:57] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2023-03-18 23:27:57] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2023-03-18 23:27:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 121 ms
[2023-03-18 23:27:57] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2023-03-18 23:27:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-18 23:27:57] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2023-03-18 23:27:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-18 23:27:57] [INFO ] After 379ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-18 23:27:57] [INFO ] After 505ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 81 ms.
Support contains 53 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 98/98 transitions.
Applied a total of 0 rules in 6 ms. Remains 192 /192 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 192/192 places, 98/98 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 98/98 transitions.
Applied a total of 0 rules in 5 ms. Remains 192 /192 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-18 23:27:57] [INFO ] Invariant cache hit.
[2023-03-18 23:27:57] [INFO ] Implicit Places using invariants in 102 ms returned [101, 107, 109, 113, 115, 121, 123, 127, 129, 131, 135, 137, 139, 141, 143, 145, 147, 149, 153, 155, 157, 159, 161, 163, 167, 171, 173, 177, 179, 181, 183, 187, 189, 191]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 104 ms to find 34 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 158/192 places, 98/98 transitions.
Applied a total of 0 rules in 4 ms. Remains 158 /158 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 114 ms. Remains : 158/192 places, 98/98 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 638639 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :{}
Probabilistic random walk after 638639 steps, saw 170525 distinct states, run finished after 3007 ms. (steps per millisecond=212 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 98 rows 158 cols
[2023-03-18 23:28:01] [INFO ] Computed 62 place invariants in 3 ms
[2023-03-18 23:28:01] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 23:28:01] [INFO ] [Nat]Absence check using 62 positive place invariants in 7 ms returned sat
[2023-03-18 23:28:01] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 23:28:01] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2023-03-18 23:28:01] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2023-03-18 23:28:01] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2023-03-18 23:28:01] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2023-03-18 23:28:01] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2023-03-18 23:28:01] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2023-03-18 23:28:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 210 ms
[2023-03-18 23:28:01] [INFO ] After 377ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-18 23:28:01] [INFO ] After 528ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 87 ms.
Support contains 53 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 98/98 transitions.
Applied a total of 0 rules in 4 ms. Remains 158 /158 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 158/158 places, 98/98 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 158 /158 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-18 23:28:01] [INFO ] Invariant cache hit.
[2023-03-18 23:28:01] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-18 23:28:01] [INFO ] Invariant cache hit.
[2023-03-18 23:28:02] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2023-03-18 23:28:02] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 23:28:02] [INFO ] Invariant cache hit.
[2023-03-18 23:28:02] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 277 ms. Remains : 158/158 places, 98/98 transitions.
Applied a total of 0 rules in 4 ms. Remains 158 /158 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-18 23:28:02] [INFO ] Invariant cache hit.
[2023-03-18 23:28:02] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 23:28:02] [INFO ] [Nat]Absence check using 62 positive place invariants in 7 ms returned sat
[2023-03-18 23:28:02] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 23:28:02] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2023-03-18 23:28:02] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2023-03-18 23:28:02] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2023-03-18 23:28:02] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2023-03-18 23:28:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 150 ms
[2023-03-18 23:28:02] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2023-03-18 23:28:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-18 23:28:02] [INFO ] After 351ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-18 23:28:02] [INFO ] After 473ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-18 23:28:02] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-18 23:28:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 158 places, 98 transitions and 412 arcs took 2 ms.
[2023-03-18 23:28:02] [INFO ] Flatten gal took : 34 ms
Total runtime 15480 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: ResAllocation_PT_R050C002
(NrP: 158 NrTr: 98 NrArc: 412)

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

net check time: 0m 0.000sec

init dd package: 0m 2.728sec


RS generation: 0m 0.126sec


-> reachability set: #nodes 424 (4.2e+02) #states 7,036,874,417,766,400 (15)



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

checking: AG [p42<=p104]
normalized: ~ [E [true U ~ [p42<=p104]]]

abstracting: (p42<=p104)
states: 7,036,874,417,766,400 (15)
-> the formula is TRUE

FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [p88<=1] | [~ [p154<=1] | [[[~ [1<=p12] & p156<=p81] & [~ [1<=p47] & ~ [p50<=p66]]] & [[~ [p141<=p153] & ~ [p139<=p118]] & [~ [1<=p0] & [~ [p99<=0] | [p89<=1 & 1<=p38]]]]]]]]
normalized: E [true U [[[[[[[p89<=1 & 1<=p38] | ~ [p99<=0]] & ~ [1<=p0]] & [~ [p139<=p118] & ~ [p141<=p153]]] & [[~ [p50<=p66] & ~ [1<=p47]] & [p156<=p81 & ~ [1<=p12]]]] | ~ [p154<=1]] | ~ [p88<=1]]]

abstracting: (p88<=1)
states: 7,036,874,417,766,400 (15)
abstracting: (p154<=1)
states: 7,036,874,417,766,400 (15)
abstracting: (1<=p12)
states: 3,025,855,999,639,552 (15)
abstracting: (p156<=p81)
states: 5,312,840,185,413,632 (15)
abstracting: (1<=p47)
states: 3,448,068,464,705,536 (15)
abstracting: (p50<=p66)
states: 5,910,974,510,923,776 (15)
abstracting: (p141<=p153)
states: 4,503,599,627,370,496 (15)
abstracting: (p139<=p118)
states: 6,473,924,464,345,088 (15)
abstracting: (1<=p0)
states: 3,448,068,464,705,536 (15)
abstracting: (p99<=0)
states: 211,106,232,532,992 (14)
abstracting: (1<=p38)
states: 2,111,062,325,329,920 (15)
abstracting: (p89<=1)
states: 7,036,874,417,766,400 (15)
-> the formula is FALSE

FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [[[p34<=p112 | [1<=p127 | p144<=p62]] | [~ [1<=p72] | [[[~ [1<=p134] & ~ [p61<=p36]] & [[1<=p129 | 1<=p92] & [p5<=1 | [p120<=1 & p102<=0]]]] | [~ [1<=p95] & ~ [p26<=1]]]]]]
normalized: ~ [E [true U ~ [[[[[~ [p26<=1] & ~ [1<=p95]] | [[[p5<=1 | [p120<=1 & p102<=0]] & [1<=p129 | 1<=p92]] & [~ [p61<=p36] & ~ [1<=p134]]]] | ~ [1<=p72]] | [p34<=p112 | [1<=p127 | p144<=p62]]]]]]

abstracting: (p144<=p62)
states: 3,729,543,441,416,192 (15)
abstracting: (1<=p127)
states: 1,688,849,860,263,936 (15)
abstracting: (p34<=p112)
states: 7,036,874,417,766,400 (15)
abstracting: (1<=p72)
states: 914,793,674,309,632 (14)
abstracting: (1<=p134)
states: 2,111,062,325,329,920 (15)
abstracting: (p61<=p36)
states: 4,644,337,115,725,824 (15)
abstracting: (1<=p92)
states: 211,106,232,532,992 (14)
abstracting: (1<=p129)
states: 1,829,587,348,619,264 (15)
abstracting: (p102<=0)
states: 351,843,720,888,320 (14)
abstracting: (p120<=1)
states: 7,036,874,417,766,400 (15)
abstracting: (p5<=1)
states: 7,036,874,417,766,400 (15)
abstracting: (1<=p95)
states: 3,448,068,464,705,536 (15)
abstracting: (p26<=1)
states: 7,036,874,417,766,400 (15)
-> the formula is TRUE

FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [[[[[[[~ [p148<=0] | p123<=p44] | [~ [1<=p7] | ~ [p133<=1]]] & ~ [p126<=p132]] | [[1<=p63 & p108<=0] & [1<=p87 & [p14<=p88 | 1<=p97]]]] | [1<=p38 | [~ [p94<=0] & ~ [p28<=p114]]]] | [~ [p21<=p1] | [~ [p51<=1] | p90<=0]]]]
normalized: ~ [E [true U ~ [[[[p90<=0 | ~ [p51<=1]] | ~ [p21<=p1]] | [[1<=p38 | [~ [p28<=p114] & ~ [p94<=0]]] | [[[1<=p87 & [p14<=p88 | 1<=p97]] & [1<=p63 & p108<=0]] | [~ [p126<=p132] & [[~ [p133<=1] | ~ [1<=p7]] | [p123<=p44 | ~ [p148<=0]]]]]]]]]]

abstracting: (p148<=0)
states: 2,885,118,511,284,224 (15)
abstracting: (p123<=p44)
states: 3,307,330,976,350,208 (15)
abstracting: (1<=p7)
states: 3,448,068,464,705,536 (15)
abstracting: (p133<=1)
states: 7,036,874,417,766,400 (15)
abstracting: (p126<=p132)
states: 6,227,633,859,723,264 (15)
abstracting: (p108<=0)
states: 633,318,697,598,976 (14)
abstracting: (1<=p63)
states: 3,448,068,464,705,536 (15)
abstracting: (1<=p97)
states: 6,896,136,929,411,072 (15)
abstracting: (p14<=p88)
states: 4,257,309,022,748,672 (15)
abstracting: (1<=p87)
states: 3,448,068,464,705,536 (15)
abstracting: (p94<=0)
states: 6,896,136,929,411,072 (15)
abstracting: (p28<=p114)
states: 7,036,874,417,766,400 (15)
abstracting: (1<=p38)
states: 2,111,062,325,329,920 (15)
abstracting: (p21<=p1)
states: 5,277,655,813,324,800 (15)
abstracting: (p51<=1)
states: 7,036,874,417,766,400 (15)
abstracting: (p90<=0)
states: 6,755,399,441,055,744 (15)
-> the formula is FALSE

FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.132sec

totally nodes used: 231791 (2.3e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 297115 930217 1227332
used/not used/entry size/cache size: 1115344 65993520 16 1024MB
basic ops cache: hits/miss/sum: 53198 124526 177724
used/not used/entry size/cache size: 256830 16520386 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: 2062 6181 8243
used/not used/entry size/cache size: 6181 8382427 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 66881209
1 223622
2 3931
3 101
4 1
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.571sec


BK_STOP 1679182088343

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


iterations count:8223 (83), effective:2352 (24)

initing FirstDep: 0m 0.000sec


iterations count:3743 (38), effective:1165 (11)

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="ResAllocation-PT-R050C002"
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 ResAllocation-PT-R050C002, 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 r330-tall-167889203700766"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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