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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 6.3K Feb 26 01:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 01:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 01:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 01:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Feb 26 01:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 01:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 26 01:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:56 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 247K 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 Dekker-PT-020-ReachabilityCardinality-00
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-01
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-02
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-03
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-04
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-05
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-06
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-07
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-08
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-09
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-10
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-11
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-12
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-13
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-14
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678531548274

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=Dekker-PT-020
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 10:45:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 10:45:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 10:45:51] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2023-03-11 10:45:52] [INFO ] Transformed 100 places.
[2023-03-11 10:45:52] [INFO ] Transformed 440 transitions.
[2023-03-11 10:45:52] [INFO ] Found NUPN structural information;
[2023-03-11 10:45:52] [INFO ] Parsed PT model containing 100 places and 440 transitions and 3240 arcs in 313 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA Dekker-PT-020-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 470 ms. (steps per millisecond=21 ) properties (out of 5) seen :2
FORMULA Dekker-PT-020-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 10:45:52] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 100 cols
[2023-03-11 10:45:52] [INFO ] Computed 60 place invariants in 18 ms
[2023-03-11 10:45:53] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 10:45:53] [INFO ] [Nat]Absence check using 40 positive place invariants in 23 ms returned sat
[2023-03-11 10:45:53] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 6 ms returned sat
[2023-03-11 10:45:53] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 10:45:53] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-11 10:45:53] [INFO ] After 64ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 10:45:53] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 12 ms to minimize.
[2023-03-11 10:45:53] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2023-03-11 10:45:53] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 2 ms to minimize.
[2023-03-11 10:45:53] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 3 ms to minimize.
[2023-03-11 10:45:53] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2023-03-11 10:45:53] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2023-03-11 10:45:54] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2023-03-11 10:45:54] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2023-03-11 10:45:54] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2023-03-11 10:45:54] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2023-03-11 10:45:54] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2023-03-11 10:45:54] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2023-03-11 10:45:54] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2023-03-11 10:45:54] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 832 ms
[2023-03-11 10:45:54] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2023-03-11 10:45:54] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2023-03-11 10:45:54] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-11 10:45:54] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2023-03-11 10:45:54] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2023-03-11 10:45:54] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2023-03-11 10:45:54] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2023-03-11 10:45:54] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-11 10:45:54] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
[2023-03-11 10:45:54] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-11 10:45:54] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 469 ms
[2023-03-11 10:45:54] [INFO ] After 1492ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 188 ms.
[2023-03-11 10:45:55] [INFO ] After 1960ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 8 ms.
Support contains 30 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 440/440 transitions.
Applied a total of 0 rules in 103 ms. Remains 100 /100 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 100/100 places, 440/440 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 291333 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 291333 steps, saw 160477 distinct states, run finished after 3002 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 10:45:58] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2023-03-11 10:45:58] [INFO ] Invariant cache hit.
[2023-03-11 10:45:58] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 10:45:58] [INFO ] [Nat]Absence check using 40 positive place invariants in 11 ms returned sat
[2023-03-11 10:45:58] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 6 ms returned sat
[2023-03-11 10:45:58] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 10:45:58] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-11 10:45:58] [INFO ] After 42ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 10:45:58] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2023-03-11 10:45:58] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2023-03-11 10:45:59] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2023-03-11 10:45:59] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-11 10:45:59] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2023-03-11 10:45:59] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2023-03-11 10:45:59] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 231 ms
[2023-03-11 10:45:59] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2023-03-11 10:45:59] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 0 ms to minimize.
[2023-03-11 10:45:59] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2023-03-11 10:45:59] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2023-03-11 10:45:59] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2023-03-11 10:45:59] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2023-03-11 10:45:59] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2023-03-11 10:45:59] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2023-03-11 10:45:59] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-11 10:45:59] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
[2023-03-11 10:45:59] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2023-03-11 10:45:59] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2023-03-11 10:45:59] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-11 10:45:59] [INFO ] Trap strengthening procedure interrupted after too many repetitions 542 ms
[2023-03-11 10:45:59] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 542 ms
[2023-03-11 10:45:59] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2023-03-11 10:45:59] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2023-03-11 10:45:59] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2023-03-11 10:45:59] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-11 10:45:59] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2023-03-11 10:45:59] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2023-03-11 10:45:59] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 225 ms
[2023-03-11 10:45:59] [INFO ] After 1079ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-11 10:45:59] [INFO ] After 1292ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1 ms.
Support contains 30 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 440/440 transitions.
Applied a total of 0 rules in 39 ms. Remains 100 /100 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 100/100 places, 440/440 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 440/440 transitions.
Applied a total of 0 rules in 36 ms. Remains 100 /100 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2023-03-11 10:46:00] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2023-03-11 10:46:00] [INFO ] Invariant cache hit.
[2023-03-11 10:46:00] [INFO ] Implicit Places using invariants in 200 ms returned [40, 43, 46, 49, 52, 55, 58, 61, 67, 70, 76, 88, 91]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 203 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 87/100 places, 440/440 transitions.
Applied a total of 0 rules in 20 ms. Remains 87 /87 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 260 ms. Remains : 87/100 places, 440/440 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :1
FORMULA Dekker-PT-020-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
[2023-03-11 10:46:00] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 87 cols
[2023-03-11 10:46:00] [INFO ] Computed 47 place invariants in 2 ms
[2023-03-11 10:46:00] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 10:46:00] [INFO ] [Nat]Absence check using 40 positive place invariants in 10 ms returned sat
[2023-03-11 10:46:00] [INFO ] [Nat]Absence check using 40 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-11 10:46:00] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 10:46:00] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-11 10:46:00] [INFO ] After 30ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 10:46:00] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2023-03-11 10:46:00] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-11 10:46:00] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2023-03-11 10:46:00] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2023-03-11 10:46:00] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2023-03-11 10:46:00] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2023-03-11 10:46:00] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2023-03-11 10:46:00] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2023-03-11 10:46:01] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2023-03-11 10:46:01] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2023-03-11 10:46:01] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 336 ms
[2023-03-11 10:46:01] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2023-03-11 10:46:01] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2023-03-11 10:46:01] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2023-03-11 10:46:01] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2023-03-11 10:46:01] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2023-03-11 10:46:01] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2023-03-11 10:46:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 169 ms
[2023-03-11 10:46:01] [INFO ] After 563ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-11 10:46:01] [INFO ] After 719ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 26 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 440/440 transitions.
Applied a total of 0 rules in 17 ms. Remains 87 /87 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 87/87 places, 440/440 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 446187 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :{}
Probabilistic random walk after 446187 steps, saw 238317 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 10:46:04] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2023-03-11 10:46:04] [INFO ] Invariant cache hit.
[2023-03-11 10:46:04] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 10:46:04] [INFO ] [Nat]Absence check using 40 positive place invariants in 13 ms returned sat
[2023-03-11 10:46:04] [INFO ] [Nat]Absence check using 40 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-11 10:46:04] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 10:46:04] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-11 10:46:04] [INFO ] After 32ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 10:46:04] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2023-03-11 10:46:04] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2023-03-11 10:46:04] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2023-03-11 10:46:04] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2023-03-11 10:46:04] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2023-03-11 10:46:04] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2023-03-11 10:46:05] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2023-03-11 10:46:05] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2023-03-11 10:46:05] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2023-03-11 10:46:05] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2023-03-11 10:46:05] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2023-03-11 10:46:05] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 550 ms
[2023-03-11 10:46:05] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2023-03-11 10:46:05] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2023-03-11 10:46:05] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2023-03-11 10:46:05] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2023-03-11 10:46:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 208 ms
[2023-03-11 10:46:05] [INFO ] After 826ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-11 10:46:05] [INFO ] After 1001ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 26 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 440/440 transitions.
Applied a total of 0 rules in 21 ms. Remains 87 /87 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 87/87 places, 440/440 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 440/440 transitions.
Applied a total of 0 rules in 20 ms. Remains 87 /87 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2023-03-11 10:46:05] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2023-03-11 10:46:05] [INFO ] Invariant cache hit.
[2023-03-11 10:46:05] [INFO ] Implicit Places using invariants in 224 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 227 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 86/87 places, 440/440 transitions.
Applied a total of 0 rules in 18 ms. Remains 86 /86 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 267 ms. Remains : 86/87 places, 440/440 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 410088 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :{}
Probabilistic random walk after 410088 steps, saw 220121 distinct states, run finished after 3007 ms. (steps per millisecond=136 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 10:46:09] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 86 cols
[2023-03-11 10:46:09] [INFO ] Computed 46 place invariants in 14 ms
[2023-03-11 10:46:09] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 10:46:09] [INFO ] [Nat]Absence check using 40 positive place invariants in 15 ms returned sat
[2023-03-11 10:46:09] [INFO ] [Nat]Absence check using 40 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-11 10:46:09] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 10:46:09] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-11 10:46:09] [INFO ] After 46ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 10:46:09] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2023-03-11 10:46:09] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2023-03-11 10:46:09] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2023-03-11 10:46:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 125 ms
[2023-03-11 10:46:09] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2023-03-11 10:46:09] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2023-03-11 10:46:09] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2023-03-11 10:46:09] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2023-03-11 10:46:09] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2023-03-11 10:46:09] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2023-03-11 10:46:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 189 ms
[2023-03-11 10:46:09] [INFO ] After 392ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-11 10:46:09] [INFO ] After 605ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 0 ms.
Support contains 26 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 440/440 transitions.
Applied a total of 0 rules in 11 ms. Remains 86 /86 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 86/86 places, 440/440 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 440/440 transitions.
Applied a total of 0 rules in 11 ms. Remains 86 /86 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2023-03-11 10:46:09] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2023-03-11 10:46:09] [INFO ] Invariant cache hit.
[2023-03-11 10:46:09] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-11 10:46:09] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2023-03-11 10:46:09] [INFO ] Invariant cache hit.
[2023-03-11 10:46:10] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-11 10:46:10] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
[2023-03-11 10:46:10] [INFO ] Redundant transitions in 51 ms returned []
[2023-03-11 10:46:10] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2023-03-11 10:46:10] [INFO ] Invariant cache hit.
[2023-03-11 10:46:10] [INFO ] Dead Transitions using invariants and state equation in 567 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1113 ms. Remains : 86/86 places, 440/440 transitions.
Graph (complete) has 150 edges and 86 vertex of which 74 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 66 output transitions
Drop transitions removed 66 transitions
Ensure Unique test removed 3 places
Ensure Unique test removed 306 transitions
Reduce isomorphic transitions removed 306 transitions.
Iterating post reduction 0 with 309 rules applied. Total rules applied 310 place count 71 transition count 68
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 322 place count 63 transition count 64
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 326 place count 63 transition count 60
Free-agglomeration rule applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 333 place count 63 transition count 53
Ensure Unique test removed 7 places
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 354 place count 49 transition count 46
Applied a total of 354 rules in 40 ms. Remains 49 /86 variables (removed 37) and now considering 46/440 (removed 394) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 46 rows 49 cols
[2023-03-11 10:46:10] [INFO ] Computed 26 place invariants in 4 ms
[2023-03-11 10:46:10] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 10:46:10] [INFO ] [Nat]Absence check using 25 positive place invariants in 5 ms returned sat
[2023-03-11 10:46:10] [INFO ] [Nat]Absence check using 25 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 10:46:11] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 10:46:11] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-11 10:46:11] [INFO ] After 116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-11 10:46:11] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2023-03-11 10:46:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 86 places, 440 transitions and 2946 arcs took 5 ms.
[2023-03-11 10:46:11] [INFO ] Flatten gal took : 163 ms
Total runtime 19880 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: Dekker_PT_020
(NrP: 86 NrTr: 440 NrArc: 2946)

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

net check time: 0m 0.000sec

init dd package: 0m 3.606sec


RS generation: 0m 0.929sec


-> reachability set: #nodes 6047 (6.0e+03) #states 11,534,336 (7)



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

checking: AG [[[p51<=0 & 0<=p51] | [[[p77<=0 & 0<=p77] & [p73<=1 & 1<=p73]] & [[[p11<=1 & 1<=p11] | [[p80<=0 & 0<=p80] | [p25<=1 & 1<=p25]]] & [[p22<=0 & 0<=p22] | [[p27<=1 & 1<=p27] | [[p28<=1 & 1<=p28] & [[p72<=1 & 1<=p72] | [p83<=1 & 1<=p83]]]]]]]]]
normalized: ~ [E [true U ~ [[[p51<=0 & 0<=p51] | [[[[[p80<=0 & 0<=p80] | [p25<=1 & 1<=p25]] | [p11<=1 & 1<=p11]] & [[p22<=0 & 0<=p22] | [[p27<=1 & 1<=p27] | [[[p72<=1 & 1<=p72] | [p83<=1 & 1<=p83]] & [p28<=1 & 1<=p28]]]]] & [[p73<=1 & 1<=p73] & [p77<=0 & 0<=p77]]]]]]]

abstracting: (0<=p77)
states: 11,534,336 (7)
abstracting: (p77<=0)
states: 11,010,048 (7)
abstracting: (1<=p73)
states: 5,505,024 (6)
abstracting: (p73<=1)
states: 11,534,336 (7)
abstracting: (1<=p28)
states: 5,505,024 (6)
abstracting: (p28<=1)
states: 11,534,336 (7)
abstracting: (1<=p83)
states: 5,505,024 (6)
abstracting: (p83<=1)
states: 11,534,336 (7)
abstracting: (1<=p72)
states: 524,288 (5)
abstracting: (p72<=1)
states: 11,534,336 (7)
abstracting: (1<=p27)
states: 6,029,312 (6)
abstracting: (p27<=1)
states: 11,534,336 (7)
abstracting: (0<=p22)
states: 11,534,336 (7)
abstracting: (p22<=0)
states: 6,029,312 (6)
abstracting: (1<=p11)
states: 6,029,312 (6)
abstracting: (p11<=1)
states: 11,534,336 (7)
abstracting: (1<=p25)
states: 6,029,312 (6)
abstracting: (p25<=1)
states: 11,534,336 (7)
abstracting: (0<=p80)
states: 11,534,336 (7)
abstracting: (p80<=0)
states: 6,029,312 (6)
abstracting: (0<=p51)
states: 11,534,336 (7)
abstracting: (p51<=0)
states: 11,010,048 (7)
-> the formula is FALSE

FORMULA Dekker-PT-020-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.205sec

checking: EF [[[[p73<=1 & 1<=p73] & [[p70<=0 & 0<=p70] & [p79<=1 & 1<=p79]]] & [[p40<=1 & 1<=p40] & [[p51<=0 & 0<=p51] & [[p68<=0 & 0<=p68] | [[p18<=1 & 1<=p18] | [[[p18<=0 & 0<=p18] | [[[p66<=1 & 1<=p66] & [p5<=1 & 1<=p5]] & [[p55<=0 & 0<=p55] & [[p60<=1 & 1<=p60] & [p67<=1 & 1<=p67]]]]] & [[p39<=1 & 1<=p39] | [[p62<=0 & 0<=p62] & [[p53<=0 & 0<=p53] | [[p36<=1 & 1<=p36] | [p7<=0 & 0<=p7]]]]]]]]]]]]
normalized: E [true U [[[[[[[[[[[p7<=0 & 0<=p7] | [p36<=1 & 1<=p36]] | [p53<=0 & 0<=p53]] & [p62<=0 & 0<=p62]] | [p39<=1 & 1<=p39]] & [[[[[p67<=1 & 1<=p67] & [p60<=1 & 1<=p60]] & [p55<=0 & 0<=p55]] & [[p5<=1 & 1<=p5] & [p66<=1 & 1<=p66]]] | [p18<=0 & 0<=p18]]] | [p18<=1 & 1<=p18]] | [p68<=0 & 0<=p68]] & [p51<=0 & 0<=p51]] & [p40<=1 & 1<=p40]] & [[[p79<=1 & 1<=p79] & [p70<=0 & 0<=p70]] & [p73<=1 & 1<=p73]]]]

abstracting: (1<=p73)
states: 5,505,024 (6)
abstracting: (p73<=1)
states: 11,534,336 (7)
abstracting: (0<=p70)
states: 11,534,336 (7)
abstracting: (p70<=0)
states: 6,029,312 (6)
abstracting: (1<=p79)
states: 524,288 (5)
abstracting: (p79<=1)
states: 11,534,336 (7)
abstracting: (1<=p40)
states: 5,505,024 (6)
abstracting: (p40<=1)
states: 11,534,336 (7)
abstracting: (0<=p51)
states: 11,534,336 (7)
abstracting: (p51<=0)
states: 11,010,048 (7)
abstracting: (0<=p68)
states: 11,534,336 (7)
abstracting: (p68<=0)
states: 6,029,312 (6)
abstracting: (1<=p18)
states: 5,505,024 (6)
abstracting: (p18<=1)
states: 11,534,336 (7)
abstracting: (0<=p18)
states: 11,534,336 (7)
abstracting: (p18<=0)
states: 6,029,312 (6)
abstracting: (1<=p66)
states: 524,288 (5)
abstracting: (p66<=1)
states: 11,534,336 (7)
abstracting: (1<=p5)
states: 6,029,312 (6)
abstracting: (p5<=1)
states: 11,534,336 (7)
abstracting: (0<=p55)
states: 11,534,336 (7)
abstracting: (p55<=0)
states: 11,010,048 (7)
abstracting: (1<=p60)
states: 5,505,024 (6)
abstracting: (p60<=1)
states: 11,534,336 (7)
abstracting: (1<=p67)
states: 5,505,024 (6)
abstracting: (p67<=1)
states: 11,534,336 (7)
abstracting: (1<=p39)
states: 6,029,312 (6)
abstracting: (p39<=1)
states: 11,534,336 (7)
abstracting: (0<=p62)
states: 11,534,336 (7)
abstracting: (p62<=0)
states: 6,029,312 (6)
abstracting: (0<=p53)
states: 11,534,336 (7)
abstracting: (p53<=0)
states: 11,010,048 (7)
abstracting: (1<=p36)
states: 5,505,024 (6)
abstracting: (p36<=1)
states: 11,534,336 (7)
abstracting: (0<=p7)
states: 11,534,336 (7)
abstracting: (p7<=0)
states: 5,505,024 (6)
-> the formula is TRUE

FORMULA Dekker-PT-020-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.301sec

totally nodes used: 263653 (2.6e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 779445 5013827 5793272
used/not used/entry size/cache size: 4865560 62243304 16 1024MB
basic ops cache: hits/miss/sum: 79621 387266 466887
used/not used/entry size/cache size: 641610 16135606 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: 11595 62441 74036
used/not used/entry size/cache size: 62368 8326240 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 66867244
1 222012
2 17362
3 2075
4 163
5 8
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 7.788sec


BK_STOP 1678531580441

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

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


initing FirstDep: 0m 0.001sec


iterations count:11708 (26), effective:296 (0)

initing FirstDep: 0m 0.001sec


iterations count:5460 (12), effective:70 (0)

iterations count:8742 (19), effective:229 (0)

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="Dekker-PT-020"
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 Dekker-PT-020, 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 r138-smll-167819419200022"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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