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.r106-tall-167814482800462.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 DES-PT-40a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482800462
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.4K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 15:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 15:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 26 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 15:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 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 83K 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 DES-PT-40a-ReachabilityCardinality-00
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-01
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-02
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-03
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-04
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-05
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-06
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-07
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-08
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-09
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-10
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-11
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-12
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-13
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-14
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678399241099

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=DES-PT-40a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 22:00:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 22:00:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 22:00:42] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2023-03-09 22:00:42] [INFO ] Transformed 274 places.
[2023-03-09 22:00:42] [INFO ] Transformed 231 transitions.
[2023-03-09 22:00:42] [INFO ] Found NUPN structural information;
[2023-03-09 22:00:42] [INFO ] Parsed PT model containing 274 places and 231 transitions and 1116 arcs in 117 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-40a-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 222 resets, run finished after 487 ms. (steps per millisecond=20 ) properties (out of 14) seen :2
FORMULA DES-PT-40a-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 217 rows 274 cols
[2023-03-09 22:00:44] [INFO ] Computed 59 place invariants in 19 ms
[2023-03-09 22:00:44] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-09 22:00:44] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-09 22:00:44] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 129 ms returned sat
[2023-03-09 22:00:48] [INFO ] After 3451ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :10
[2023-03-09 22:00:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:00:51] [INFO ] After 3615ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :2 sat :10
[2023-03-09 22:00:52] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 5 ms to minimize.
[2023-03-09 22:00:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2023-03-09 22:00:53] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 0 ms to minimize.
[2023-03-09 22:00:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2023-03-09 22:00:53] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 4 ms to minimize.
[2023-03-09 22:00:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-09 22:00:54] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2023-03-09 22:00:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-09 22:00:54] [INFO ] After 6603ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :10
Attempting to minimize the solution found.
Minimization took 3821 ms.
[2023-03-09 22:00:58] [INFO ] After 14413ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :10
FORMULA DES-PT-40a-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-40a-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 565 ms.
Support contains 112 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 217/217 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 274 transition count 216
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 274 transition count 216
Applied a total of 3 rules in 43 ms. Remains 274 /274 variables (removed 0) and now considering 216/217 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 274/274 places, 216/217 transitions.
Incomplete random walk after 10000 steps, including 166 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 372193 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :{}
Probabilistic random walk after 372193 steps, saw 57419 distinct states, run finished after 3002 ms. (steps per millisecond=123 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 216 rows 274 cols
[2023-03-09 22:01:03] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-09 22:01:03] [INFO ] After 223ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-09 22:01:03] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 22:01:03] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 84 ms returned sat
[2023-03-09 22:01:06] [INFO ] After 2199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-09 22:01:06] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 22:01:07] [INFO ] After 1560ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-09 22:01:08] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2023-03-09 22:01:08] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2023-03-09 22:01:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 354 ms
[2023-03-09 22:01:09] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 0 ms to minimize.
[2023-03-09 22:01:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-09 22:01:09] [INFO ] Deduced a trap composed of 11 places in 268 ms of which 1 ms to minimize.
[2023-03-09 22:01:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
[2023-03-09 22:01:10] [INFO ] Deduced a trap composed of 12 places in 251 ms of which 0 ms to minimize.
[2023-03-09 22:01:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2023-03-09 22:01:10] [INFO ] After 4409ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 1578 ms.
[2023-03-09 22:01:12] [INFO ] After 8744ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
FORMULA DES-PT-40a-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 4 properties in 287 ms.
Support contains 71 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 216/216 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 274 transition count 216
Applied a total of 1 rules in 21 ms. Remains 274 /274 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 274/274 places, 216/216 transitions.
Incomplete random walk after 10000 steps, including 168 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 673061 steps, run timeout after 3001 ms. (steps per millisecond=224 ) properties seen :{}
Probabilistic random walk after 673061 steps, saw 94197 distinct states, run finished after 3001 ms. (steps per millisecond=224 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 216 rows 274 cols
[2023-03-09 22:01:15] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-09 22:01:16] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2023-03-09 22:01:16] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 24 ms returned sat
[2023-03-09 22:01:16] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 22:01:16] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 22:01:16] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 71 ms returned sat
[2023-03-09 22:01:17] [INFO ] After 871ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 22:01:17] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 22:01:18] [INFO ] After 1182ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 22:01:19] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2023-03-09 22:01:19] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 0 ms to minimize.
[2023-03-09 22:01:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 255 ms
[2023-03-09 22:01:19] [INFO ] After 2415ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 933 ms.
[2023-03-09 22:01:20] [INFO ] After 4597ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 229 ms.
Support contains 71 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 216/216 transitions.
Applied a total of 0 rules in 8 ms. Remains 274 /274 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 274/274 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 216/216 transitions.
Applied a total of 0 rules in 8 ms. Remains 274 /274 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-09 22:01:21] [INFO ] Invariant cache hit.
[2023-03-09 22:01:21] [INFO ] Implicit Places using invariants in 260 ms returned [171]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 276 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 273/274 places, 216/216 transitions.
Applied a total of 0 rules in 9 ms. Remains 273 /273 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 293 ms. Remains : 273/274 places, 216/216 transitions.
Incomplete random walk after 10000 steps, including 163 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 743683 steps, run timeout after 3001 ms. (steps per millisecond=247 ) properties seen :{}
Probabilistic random walk after 743683 steps, saw 102074 distinct states, run finished after 3001 ms. (steps per millisecond=247 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 216 rows 273 cols
[2023-03-09 22:01:24] [INFO ] Computed 59 place invariants in 10 ms
[2023-03-09 22:01:24] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-09 22:01:24] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-09 22:01:24] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 22:01:24] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 22:01:24] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 61 ms returned sat
[2023-03-09 22:01:26] [INFO ] After 1105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 22:01:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 22:01:27] [INFO ] After 1317ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 22:01:27] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2023-03-09 22:01:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-09 22:01:28] [INFO ] After 2811ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1442 ms.
[2023-03-09 22:01:30] [INFO ] After 5623ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 157 ms.
Support contains 71 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 216/216 transitions.
Applied a total of 0 rules in 8 ms. Remains 273 /273 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 273/273 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 216/216 transitions.
Applied a total of 0 rules in 8 ms. Remains 273 /273 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-09 22:01:30] [INFO ] Invariant cache hit.
[2023-03-09 22:01:30] [INFO ] Implicit Places using invariants in 273 ms returned []
[2023-03-09 22:01:30] [INFO ] Invariant cache hit.
[2023-03-09 22:01:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 22:01:31] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 801 ms to find 0 implicit places.
[2023-03-09 22:01:31] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-09 22:01:31] [INFO ] Invariant cache hit.
[2023-03-09 22:01:31] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 993 ms. Remains : 273/273 places, 216/216 transitions.
Applied a total of 0 rules in 9 ms. Remains 273 /273 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Running SMT prover for 6 properties.
[2023-03-09 22:01:31] [INFO ] Invariant cache hit.
[2023-03-09 22:01:31] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-09 22:01:31] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 22 ms returned sat
[2023-03-09 22:01:31] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 22:01:31] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 22:01:31] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-09 22:01:33] [INFO ] After 1216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 22:01:33] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2023-03-09 22:01:33] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2023-03-09 22:01:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 165 ms
[2023-03-09 22:01:34] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2023-03-09 22:01:34] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2023-03-09 22:01:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 89 ms
[2023-03-09 22:01:34] [INFO ] After 2278ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 626 ms.
[2023-03-09 22:01:34] [INFO ] After 3156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-09 22:01:34] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 9 ms.
[2023-03-09 22:01:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 273 places, 216 transitions and 1066 arcs took 3 ms.
[2023-03-09 22:01:35] [INFO ] Flatten gal took : 64 ms
Total runtime 52694 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: DES_PT_40a
(NrP: 273 NrTr: 216 NrArc: 1066)

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

net check time: 0m 0.000sec

init dd package: 0m 2.682sec


RS generation: 2m34.329sec


-> reachability set: #nodes 1827375 (1.8e+06) #states 25,022,694,174,894 (13)



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

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

abstracting: (0<=p52)
states: 25,022,694,174,894 (13)
abstracting: (p52<=0)
states: 24,354,060,411,182 (13)

before gc: list nodes free: 2087524

after gc: idd nodes used:3772990, unused:60227010; list nodes free:270237329

before gc: list nodes free: 3249898

after gc: idd nodes used:5057499, unused:58942501; list nodes free:264447325
-> the formula is FALSE

FORMULA DES-PT-40a-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 7m38.717sec

checking: AG [[[p26<=0 & 0<=p26] | [p58<=1 & 1<=p58]]]
normalized: ~ [E [true U ~ [[[p58<=1 & 1<=p58] | [p26<=0 & 0<=p26]]]]]

abstracting: (0<=p26)
states: 25,022,694,174,894 (13)
abstracting: (p26<=0)
states: 24,354,060,411,182 (13)
abstracting: (1<=p58)
states: 668,633,763,712 (11)
abstracting: (p58<=1)
states: 25,022,694,174,894 (13)

before gc: list nodes free: 941967

after gc: idd nodes used:4228711, unused:59771289; list nodes free:268197679
-> the formula is FALSE

FORMULA DES-PT-40a-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 5m58.055sec

checking: EF [[[1<=p148 & p148<=1] & [[p120<=0 & 0<=p120] | [p10<=1 & 1<=p10]]]]
normalized: E [true U [[[p10<=1 & 1<=p10] | [p120<=0 & 0<=p120]] & [1<=p148 & p148<=1]]]

abstracting: (p148<=1)
states: 25,022,694,174,894 (13)
abstracting: (1<=p148)
states: 668,633,763,712 (11)
abstracting: (0<=p120)
states: 25,022,694,174,894 (13)
abstracting: (p120<=0)
states: 25,022,694,174,890 (13)
abstracting: (1<=p10)
states: 668,633,763,712 (11)
abstracting: (p10<=1)
states: 25,022,694,174,894 (13)

before gc: list nodes free: 994821

after gc: idd nodes used:3466426, unused:60533574; list nodes free:271644738

before gc: list nodes free: 1403681

after gc: idd nodes used:4998743, unused:59001257; list nodes free:264731572
-> the formula is TRUE

FORMULA DES-PT-40a-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 8m38.606sec

checking: AG [[[p126<=0 & 0<=p126] | [[p244<=1 & 1<=p244] | [[p141<=0 & 0<=p141] & [p1<=1 & 1<=p1]]]]]
normalized: ~ [E [true U ~ [[[[[p1<=1 & 1<=p1] & [p141<=0 & 0<=p141]] | [p244<=1 & 1<=p244]] | [p126<=0 & 0<=p126]]]]]

abstracting: (0<=p126)
states: 25,022,694,174,894 (13)
abstracting: (p126<=0)
states: 24,354,060,411,182 (13)
abstracting: (1<=p244)
states: 8,361,517,821,480 (12)
abstracting: (p244<=1)
states: 25,022,694,174,894 (13)
abstracting: (0<=p141)
states: 25,022,694,174,894 (13)
abstracting: (p141<=0)
states: 24,354,060,411,182 (13)
abstracting: (1<=p1)
states: 106,707,189,564 (11)
abstracting: (p1<=1)
states: 25,022,694,174,894 (13)

before gc: list nodes free: 1880304

after gc: idd nodes used:4714290, unused:59285710; list nodes free:266018406

before gc: list nodes free: 4238395

after gc: idd nodes used:5288342, unused:58711658; list nodes free:263436056
-> the formula is FALSE

FORMULA DES-PT-40a-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 9m50.660sec

checking: AG [[[p84<=0 & 0<=p84] | [[[p121<=1 & 1<=p121] | [[[p117<=0 & 0<=p117] & [[[p93<=1 & 1<=p93] | [p182<=1 & 1<=p182]] | [[p255<=0 & 0<=p255] | [[p154<=1 & 1<=p154] | [[p192<=0 & 0<=p192] & [p251<=1 & 1<=p251]]]]]] | [[p78<=0 & 0<=p78] & [[p22<=0 & 0<=p22] | [p220<=1 & 1<=p220]]]]] & [[p166<=1 & 1<=p166] | [[p40<=1 & 1<=p40] & [[p26<=0 & 0<=p26] & [p81<=1 & 1<=p81]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[p26<=0 & 0<=p26] & [p81<=1 & 1<=p81]] & [p40<=1 & 1<=p40]] | [p166<=1 & 1<=p166]] & [[[[[p220<=1 & 1<=p220] | [p22<=0 & 0<=p22]] & [p78<=0 & 0<=p78]] | [[[[[[p251<=1 & 1<=p251] & [p192<=0 & 0<=p192]] | [p154<=1 & 1<=p154]] | [p255<=0 & 0<=p255]] | [[p182<=1 & 1<=p182] | [p93<=1 & 1<=p93]]] & [p117<=0 & 0<=p117]]] | [p121<=1 & 1<=p121]]] | [p84<=0 & 0<=p84]]]]]

abstracting: (0<=p84)
states: 25,022,694,174,894 (13)
abstracting: (p84<=0)
states: 24,379,037,343,740 (13)
abstracting: (1<=p121)
states: 280,722,497,755 (11)
abstracting: (p121<=1)
states: 25,022,694,174,894 (13)
abstracting: (0<=p117)
states: 25,022,694,174,894 (13)
abstracting: (p117<=0)
states: 24,410,365,627,722 (13)
abstracting: (1<=p93)
states: 643,656,831,154 (11)
abstracting: (p93<=1)
states: 25,022,694,174,894 (13)
abstracting: (1<=p182)
states: 5,605,405,422,983 (12)
abstracting: (p182<=1)
states: 25,022,694,174,894 (13)
abstracting: (0<=p255)
states: 25,022,694,174,894 (13)
abstracting: (p255<=0)
states: 24,460,445,712,702 (13)
abstracting: (1<=p154)
states: 668,633,763,712 (11)
abstracting: (p154<=1)
states: 25,022,694,174,894 (13)
abstracting: (0<=p192)
states: 25,022,694,174,894 (13)
abstracting: (p192<=0)
states: 16,593,256,224,248 (13)
abstracting: (1<=p251)
states: 2,058,354,408,454 (12)
abstracting: (p251<=1)
states: 25,022,694,174,894 (13)
abstracting: (0<=p78)
states: 25,022,694,174,894 (13)
abstracting: (p78<=0)
states: 24,897,514,993,417 (13)
abstracting: (0<=p22)
states: 25,022,694,174,894 (13)
abstracting: (p22<=0)
states: 24,354,060,411,182 (13)
abstracting: (1<=p220)
states: 15,778,930,935,092 (13)
abstracting: (p220<=1)
states: 25,022,694,174,894 (13)
abstracting: (1<=p166)
states: 8,683,509,376,987 (12)
abstracting: (p166<=1)
states: 25,022,694,174,894 (13)
abstracting: (1<=p40)
states: 1,408 (3)
abstracting: (p40<=1)
states: 25,022,694,174,894 (13)
abstracting: (1<=p81)
states: 643,656,831,154 (11)
abstracting: (p81<=1)
states: 25,022,694,174,894 (13)
abstracting: (0<=p26)
states: 25,022,694,174,894 (13)
abstracting: (p26<=0)
states: 24,354,060,411,182 (13)

before gc: list nodes free: 4702252

after gc: idd nodes used:8414564, unused:55585436; list nodes free:249119962

before gc: list nodes free: 9654382

after gc: idd nodes used:8767646, unused:55232354; list nodes free:247536295
MC time: 12m38.001sec

checking: AG [[[[[[[[[[[1<=p256 & p256<=1] | [p45<=0 & 0<=p45]] & [p246<=1 & 1<=p246]] & [p0<=1 & 1<=p0]] | [[p172<=0 & 0<=p172] & [p250<=1 & 1<=p250]]] & [[[[p79<=1 & 1<=p79] & [[[p30<=0 & 0<=p30] | [p59<=1 & 1<=p59]] & [[p104<=0 & 0<=p104] | [p208<=1 & 1<=p208]]]] | [[p88<=0 & 0<=p88] & [p238<=1 & 1<=p238]]] & [[[p155<=0 & 0<=p155] | [p99<=0 & 0<=p99]] | [[p201<=1 & 1<=p201] | [[p267<=1 & 1<=p267] & [[p13<=0 & 0<=p13] & [p193<=1 & 1<=p193]]]]]]] & [[p254<=1 & 1<=p254] & [[p226<=0 & 0<=p226] | [p112<=1 & 1<=p112]]]] | [[[p181<=1 & 1<=p181] & [[p159<=0 & 0<=p159] & [p113<=1 & 1<=p113]]] | [[[p159<=0 & 0<=p159] & [p229<=0 & 0<=p229]] & [[[p55<=0 & 0<=p55] | [p263<=1 & 1<=p263]] & [[[p89<=0 & 0<=p89] | [[p266<=0 & 0<=p266] & [[[p3<=0 & 0<=p3] | [p81<=1 & 1<=p81]] & [[p80<=1 & 1<=p80] | [[p68<=1 & 1<=p68] | [[[p245<=0 & 0<=p245] | [p98<=1 & 1<=p98]] & [[p1<=0 & 0<=p1] | [p31<=1 & 1<=p31]]]]]]]] & [[[p92<=1 & 1<=p92] & [[p12<=0 & 0<=p12] | [[p63<=1 & 1<=p63] & [[p76<=0 & 0<=p76] | [p30<=1 & 1<=p30]]]]] | [[p102<=1 & 1<=p102] & [[p190<=0 & 0<=p190] & [p212<=1 & 1<=p212]]]]]]]]] | [[p85<=0 & 0<=p85] | [p12<=1 & 1<=p12]]] & [[[p104<=0 & 0<=p104] | [p102<=1 & 1<=p102]] | [[p89<=0 & 0<=p89] | [[p20<=1 & 1<=p20] & [p17<=1 & 1<=p17]]]]]]
normalized: ~ [E [true U ~ [[[[[[p17<=1 & 1<=p17] & [p20<=1 & 1<=p20]] | [p89<=0 & 0<=p89]] | [[p102<=1 & 1<=p102] | [p104<=0 & 0<=p104]]] & [[[p12<=1 & 1<=p12] | [p85<=0 & 0<=p85]] | [[[[[[[[[p212<=1 & 1<=p212] & [p190<=0 & 0<=p190]] & [p102<=1 & 1<=p102]] | [[[[[p30<=1 & 1<=p30] | [p76<=0 & 0<=p76]] & [p63<=1 & 1<=p63]] | [p12<=0 & 0<=p12]] & [p92<=1 & 1<=p92]]] & [[[[[[[[p31<=1 & 1<=p31] | [p1<=0 & 0<=p1]] & [[p98<=1 & 1<=p98] | [p245<=0 & 0<=p245]]] | [p68<=1 & 1<=p68]] | [p80<=1 & 1<=p80]] & [[p81<=1 & 1<=p81] | [p3<=0 & 0<=p3]]] & [p266<=0 & 0<=p266]] | [p89<=0 & 0<=p89]]] & [[p263<=1 & 1<=p263] | [p55<=0 & 0<=p55]]] & [[p229<=0 & 0<=p229] & [p159<=0 & 0<=p159]]] | [[[p113<=1 & 1<=p113] & [p159<=0 & 0<=p159]] & [p181<=1 & 1<=p181]]] | [[[[p112<=1 & 1<=p112] | [p226<=0 & 0<=p226]] & [p254<=1 & 1<=p254]] & [[[[[[[p193<=1 & 1<=p193] & [p13<=0 & 0<=p13]] & [p267<=1 & 1<=p267]] | [p201<=1 & 1<=p201]] | [[p99<=0 & 0<=p99] | [p155<=0 & 0<=p155]]] & [[[p238<=1 & 1<=p238] & [p88<=0 & 0<=p88]] | [[[[p208<=1 & 1<=p208] | [p104<=0 & 0<=p104]] & [[p59<=1 & 1<=p59] | [p30<=0 & 0<=p30]]] & [p79<=1 & 1<=p79]]]] & [[[p250<=1 & 1<=p250] & [p172<=0 & 0<=p172]] | [[p0<=1 & 1<=p0] & [[p246<=1 & 1<=p246] & [[p45<=0 & 0<=p45] | [1<=p256 & p256<=1]]]]]]]]]]]]]

abstracting: (p256<=1)
states: 25,022,694,174,894 (13)
abstracting: (1<=p256)
states: 7,887,232,923,915 (12)
abstracting: (0<=p45)
states: 25,022,694,174,894 (13)
abstracting: (p45<=0)
states: 24,354,060,411,182 (13)
abstracting: (1<=p246)
states: 919,886,047,012 (11)
abstracting: (p246<=1)
states: 25,022,694,174,894 (13)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 25,022,694,174,894 (13)
abstracting: (0<=p172)
states: 25,022,694,174,894 (13)
abstracting: (p172<=0)
states: 12,674,438,657,779 (13)
abstracting: (1<=p250)
states: 22,964,339,766,439 (13)
abstracting: (p250<=1)
states: 25,022,694,174,894 (13)
abstracting: (1<=p79)
states: 11,947,352,194 (10)
abstracting: (p79<=1)
states: 25,022,694,174,894 (13)
abstracting: (0<=p30)
states: 25,022,694,174,894 (13)
abstracting: (p30<=0)
states: 24,354,060,411,182 (13)
abstracting: (1<=p59)
states: 668,633,763,712 (11)
abstracting: (p59<=1)
states: 25,022,694,174,894 (13)
abstracting: (0<=p104)
states: 25,022,694,174,894 (13)
abstracting: (p104<=0)
states: 24,379,037,343,740 (13)
abstracting: (1<=p208)
states: 15,778,930,935,092 (13)
abstracting: (p208<=1)
states: 25,022,694,174,894 (13)
abstracting: (0<=p88)
states: 25,022,694,174,894 (13)
abstracting: (p88<=0)
states: 24,379,037,343,740 (13)
abstracting: (1<=p238)
states: 8,361,517,821,480 (12)
abstracting: (p238<=1)
states: 25,022,694,174,894 (13)
abstracting: (0<=p155)
states: 25,022,694,174,894 (13)
abstracting: (p155<=0)
states: 24,354,060,411,182 (13)
abstracting: (0<=p99)
states: 25,022,694,174,894 (13)
abstracting: (p99<=0)
states: 24,379,037,343,740 (13)
abstracting: (1<=p201)
states: 9,243,763,239,801 (12)
abstracting: (p201<=1)
states: 25,022,694,174,894 (13)
abstracting: (1<=p267)
states: 2,526,221,684,970 (12)
abstracting: (p267<=1)
states: 25,022,694,174,894 (13)
abstracting: (0<=p13)
states: 25,022,694,174,894 (13)
abstracting: (p13<=0)
states: 24,354,060,411,182 (13)
abstracting: (1<=p193)
states: 16,593,256,224,247 (13)
abstracting: (p193<=1)
states: 25,022,694,174,894 (13)
abstracting: (1<=p254)
states: 4,285,290,783,710 (12)
abstracting: (p254<=1)
states: 25,022,694,174,894 (13)
abstracting: (0<=p226)
states: 25,022,694,174,894 (13)
abstracting: (p226<=0)
states: 9,243,763,239,802 (12)
abstracting: (1<=p112)
states: 643,656,831,154 (11)
abstracting: (p112<=1)
states: 25,022,694,174,894 (13)
abstracting: (1<=p181)
states: 5,475,684,502,306 (12)
abstracting: (p181<=1)
states: 25,022,694,174,894 (13)
abstracting: (0<=p159)
states: 25,022,694,174,894 (13)
abstracting: (p159<=0)
states: 24,735,960,442,253 (13)
abstracting: (1<=p113)
states: 643,656,831,154 (11)
abstracting: (p113<=1)
states: 25,022,694,174,894 (13)
abstracting: (0<=p159)
states: 25,022,694,174,894 (13)
abstracting: (p159<=0)
states: 24,735,960,442,253 (13)
abstracting: (0<=p229)
states: 25,022,694,174,894 (13)
abstracting: (p229<=0)
states: 15,778,930,935,093 (13)
abstracting: (0<=p55)
states: 25,022,694,174,894 (13)
abstracting: (p55<=0)
states: 24,354,060,411,182 (13)
abstracting: (1<=p263)
states: 4,202,747,057,867 (12)
abstracting: (p263<=1)
states: 25,022,694,174,894 (13)
abstracting: (0<=p89)
states: 25,022,694,174,894 (13)
abstracting: (p89<=0)
states: 24,379,037,343,740 (13)
abstracting: (0<=p266)
states: 25,022,694,174,894 (13)
abstracting: (p266<=0)
states: 18,596,752,182,374 (13)
abstracting: (0<=p3)
states: 25,022,694,174,894 (13)
abstracting: (p3<=0)
states: 24,354,898,868,268 (13)
abstracting: (1<=p81)
states: 643,656,831,154 (11)
abstracting: (p81<=1)
states: 25,022,694,174,894 (13)
abstracting: (1<=p80)
states: 5,974 (3)
abstracting: (p80<=1)
states: 25,022,694,174,894 (13)
abstracting: (1<=p68)
states: 668,633,763,712 (11)
abstracting: (p68<=1)
states: 25,022,694,174,894 (13)
abstracting: (0<=p245)
states: 25,022,694,174,894 (13)
abstracting: (p245<=0)
states: 10,148,473,413,354 (13)
abstracting: (1<=p98)
states: 643,656,831,154 (11)
abstracting: (p98<=1)
states: 25,022,694,174,894 (13)
abstracting: (0<=p1)
states: 25,022,694,174,894 (13)
abstracting: (p1<=0)
states: 24,915,986,985,330 (13)
abstracting: (1<=p31)
states: 668,633,763,712 (11)
abstracting: (p31<=1)
states: 25,022,694,174,894 (13)
abstracting: (1<=p92)
states: 643,656,831,154 (11)
abstracting: (p92<=1)
states: 25,022,694,174,894 (13)
abstracting: (0<=p12)
states: 25,022,694,174,894 (13)
abstracting: (p12<=0)
states: 24,354,060,411,182 (13)
abstracting: (1<=p63)
states: 668,633,763,712 (11)
abstracting: (p63<=1)
states: 25,022,694,174,894 (13)
abstracting: (0<=p76)
states: 25,022,694,174,894 (13)
abstracting: (p76<=0)
states: 24,488,848,094,115 (13)
abstracting: (1<=p30)
states: 668,633,763,712 (11)
abstracting: (p30<=1)
states: 25,022,694,174,894 (13)
abstracting: (1<=p102)
states: 643,656,831,154 (11)
abstracting: (p102<=1)
states: 25,022,694,174,894 (13)
abstracting: (0<=p190)
states: 25,022,694,174,894 (13)
abstracting: (p190<=0)
states: 8,418,675,433,748 (12)
abstracting: (1<=p212)
states: 15,778,930,935,092 (13)
abstracting: (p212<=1)
states: 25,022,694,174,894 (13)
abstracting: (0<=p85)
states: 25,022,694,174,894 (13)
abstracting: (p85<=0)
states: 24,379,037,343,740 (13)
abstracting: (1<=p12)
states: 668,633,763,712 (11)
abstracting: (p12<=1)
states: 25,022,694,174,894 (13)
abstracting: (0<=p104)
states: 25,022,694,174,894 (13)
abstracting: (p104<=0)
states: 24,379,037,343,740 (13)
abstracting: (1<=p102)
states: 643,656,831,154 (11)
abstracting: (p102<=1)
states: 25,022,694,174,894 (13)
abstracting: (0<=p89)
states: 25,022,694,174,894 (13)
abstracting: (p89<=0)
states: 24,379,037,343,740 (13)
abstracting: (1<=p20)
states: 668,633,763,712 (11)
abstracting: (p20<=1)
states: 25,022,694,174,894 (13)
abstracting: (1<=p17)
states: 668,633,763,712 (11)
abstracting: (p17<=1)
states: 25,022,694,174,894 (13)

before gc: list nodes free: 4668306

after gc: idd nodes used:13770070, unused:50229930; list nodes free:225049841
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6037344 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16098292 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 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

1075025 1862306 1969935 1800722 1818136 1825859 1809464 1825420 1982274 1819655 1884937 2089812 1965246 1838123
iterations count:1477080 (6838), effective:97494 (451)

initing FirstDep: 0m 0.000sec

2791419 2764884 3010609 2629011 2644855 3012117
iterations count:651691 (3017), effective:39696 (183)
2553725 2758396 3146948
iterations count:330788 (1531), effective:19780 (91)
2795000 3181269
iterations count:232889 (1078), effective:14621 (67)
2888517 2791378 2594202 2765001 2655724 3143139 2589652
iterations count:797472 (3692), effective:50065 (231)

sat_reach.icc:155: Timeout: after 757 sec


sat_reach.icc:155: Timeout: after 378 sec

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="DES-PT-40a"
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 DES-PT-40a, 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 r106-tall-167814482800462"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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