Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978900423.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is SieveSingleMsgMbox-PT-d1m18, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978900423
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 928K
-rw-r--r-- 1 mcc users 6.3K Feb 26 10:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 10:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 10:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 10:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 10:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 122K Feb 26 10:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 450K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679352455593

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m18
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 22:47:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 22:47:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 22:47:37] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2023-03-20 22:47:37] [INFO ] Transformed 1295 places.
[2023-03-20 22:47:37] [INFO ] Transformed 749 transitions.
[2023-03-20 22:47:37] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 141 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1036 places in 7 ms
Reduce places removed 1036 places and 0 transitions.
Incomplete random walk after 10000 steps, including 2197 resets, run finished after 494 ms. (steps per millisecond=20 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 39 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 97 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 37 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 232062 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{0=1, 5=1, 7=1, 9=1, 12=1}
Probabilistic random walk after 232062 steps, saw 106152 distinct states, run finished after 3003 ms. (steps per millisecond=77 ) properties seen :5
FORMULA SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 11 properties.
// Phase 1: matrix 749 rows 259 cols
[2023-03-20 22:47:41] [INFO ] Computed 6 place invariants in 17 ms
[2023-03-20 22:47:41] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 22:47:41] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-20 22:47:41] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:9
[2023-03-20 22:47:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 22:47:41] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 22:47:42] [INFO ] After 486ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :3
[2023-03-20 22:47:42] [INFO ] State equation strengthened by 587 read => feed constraints.
[2023-03-20 22:47:42] [INFO ] After 477ms SMT Verify possible using 587 Read/Feed constraints in natural domain returned unsat :8 sat :3
[2023-03-20 22:47:43] [INFO ] Deduced a trap composed of 107 places in 129 ms of which 8 ms to minimize.
[2023-03-20 22:47:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2023-03-20 22:47:43] [INFO ] After 1432ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :3
Attempting to minimize the solution found.
Minimization took 726 ms.
[2023-03-20 22:47:44] [INFO ] After 2816ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :3
FORMULA SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 126 ms.
Support contains 33 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 749/749 transitions.
Graph (complete) has 1159 edges and 259 vertex of which 242 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.3 ms
Discarding 17 places :
Also discarding 0 output transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 240 rules applied. Total rules applied 241 place count 242 transition count 509
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 284 place count 199 transition count 398
Iterating global reduction 1 with 43 rules applied. Total rules applied 327 place count 199 transition count 398
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 334 place count 199 transition count 391
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 358 place count 175 transition count 367
Iterating global reduction 2 with 24 rules applied. Total rules applied 382 place count 175 transition count 367
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 392 place count 175 transition count 357
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 404 place count 163 transition count 344
Iterating global reduction 3 with 12 rules applied. Total rules applied 416 place count 163 transition count 344
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 3 with 50 rules applied. Total rules applied 466 place count 163 transition count 294
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 469 place count 160 transition count 290
Iterating global reduction 4 with 3 rules applied. Total rules applied 472 place count 160 transition count 290
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 474 place count 158 transition count 288
Iterating global reduction 4 with 2 rules applied. Total rules applied 476 place count 158 transition count 288
Applied a total of 476 rules in 114 ms. Remains 158 /259 variables (removed 101) and now considering 288/749 (removed 461) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 158/259 places, 288/749 transitions.
Incomplete random walk after 10000 steps, including 2244 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 450 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 458 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 599627 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :{2=1}
Probabilistic random walk after 599627 steps, saw 271394 distinct states, run finished after 3005 ms. (steps per millisecond=199 ) properties seen :1
FORMULA SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 288 rows 158 cols
[2023-03-20 22:47:48] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-20 22:47:48] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 22:47:48] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-20 22:47:48] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 22:47:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 22:47:48] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 22:47:48] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 22:47:48] [INFO ] State equation strengthened by 176 read => feed constraints.
[2023-03-20 22:47:48] [INFO ] After 220ms SMT Verify possible using 176 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 22:47:48] [INFO ] After 367ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-20 22:47:49] [INFO ] After 693ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 20 ms.
Support contains 27 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 288/288 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 156 transition count 283
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 156 transition count 283
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 154 transition count 281
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 154 transition count 281
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 154 transition count 278
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 153 transition count 277
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 153 transition count 277
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 153 transition count 276
Applied a total of 14 rules in 25 ms. Remains 153 /158 variables (removed 5) and now considering 276/288 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 153/158 places, 276/288 transitions.
Incomplete random walk after 10000 steps, including 2252 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 462 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 486 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 610378 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :{}
Probabilistic random walk after 610378 steps, saw 275923 distinct states, run finished after 3002 ms. (steps per millisecond=203 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 276 rows 153 cols
[2023-03-20 22:47:52] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 22:47:52] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 22:47:52] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 22:47:52] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 22:47:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 22:47:52] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 22:47:52] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 22:47:52] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-03-20 22:47:52] [INFO ] After 109ms SMT Verify possible using 168 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 22:47:52] [INFO ] After 360ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 278 ms.
[2023-03-20 22:47:53] [INFO ] After 830ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 39 ms.
Support contains 27 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 276/276 transitions.
Applied a total of 0 rules in 21 ms. Remains 153 /153 variables (removed 0) and now considering 276/276 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 153/153 places, 276/276 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 276/276 transitions.
Applied a total of 0 rules in 17 ms. Remains 153 /153 variables (removed 0) and now considering 276/276 (removed 0) transitions.
[2023-03-20 22:47:53] [INFO ] Invariant cache hit.
[2023-03-20 22:47:53] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-20 22:47:53] [INFO ] Invariant cache hit.
[2023-03-20 22:47:53] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-03-20 22:47:53] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
[2023-03-20 22:47:53] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-20 22:47:53] [INFO ] Invariant cache hit.
[2023-03-20 22:47:54] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 804 ms. Remains : 153/153 places, 276/276 transitions.
Graph (complete) has 467 edges and 153 vertex of which 152 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 152 transition count 270
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 148 transition count 270
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 11 place count 148 transition count 255
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 41 place count 133 transition count 255
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 61 place count 123 transition count 245
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 65 place count 121 transition count 253
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 121 transition count 252
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 120 transition count 252
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 120 transition count 252
Applied a total of 68 rules in 33 ms. Remains 120 /153 variables (removed 33) and now considering 252/276 (removed 24) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 252 rows 120 cols
[2023-03-20 22:47:54] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-20 22:47:54] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-20 22:47:54] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 22:47:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-20 22:47:54] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 22:47:54] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2023-03-20 22:47:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-20 22:47:54] [INFO ] After 306ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 126 ms.
[2023-03-20 22:47:54] [INFO ] After 494ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-20 22:47:54] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-20 22:47:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 153 places, 276 transitions and 1090 arcs took 4 ms.
[2023-03-20 22:47:55] [INFO ] Flatten gal took : 60 ms
Total runtime 18003 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: SieveSingleMsgMbox_PT_d1m18
(NrP: 153 NrTr: 276 NrArc: 1090)

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

net check time: 0m 0.000sec

init dd package: 0m 3.300sec


before gc: list nodes free: 430442

after gc: idd nodes used:128450, unused:63871550; list nodes free:341029014

RS generation: 33m52.923sec


-> reachability set: #nodes 82118 (8.2e+04) #states 8,754,097,639,031 (12)



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

checking: EF [[1<=p1 & 1<=p83]]
normalized: E [true U [1<=p1 & 1<=p83]]

abstracting: (1<=p83)
states: 231,683,254,808 (11)
abstracting: (1<=p1)
states: 767,662,906,530 (11)
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 5.181sec

checking: AG [[[[[[[[[[[[1<=p146 & 1<=p87] | 1<=p71] | [p1<=0 | p139<=0]] & [[p1<=0 | [p140<=0 | 1<=p86]] | [1<=p91 | [1<=p138 | [[p1<=0 | p139<=0] & [p1<=0 | p140<=0]]]]]] & [p140<=0 | p1<=0]] & [1<=p1 & 1<=p82]] | [1<=p147 & 1<=p1]] & [[[[[p136<=0 | p1<=0] & [p145<=0 | p1<=0]] | [[[[1<=p146 & 1<=p1] | [1<=p103 & 1<=p39]] & [p137<=0 | p1<=0]] & [p132<=0 | p1<=0]]] | [[1<=p136 & 1<=p1] | [1<=p1 & 1<=p143]]] | [p1<=0 | [p144<=0 | p137<=0]]]] | [[p1<=0 | p142<=0] & [[[[1<=p107 & 1<=p24] | p138<=0] | p1<=0] & [[p128<=0 | p1<=0] | [p140<=0 | [1<=p1 & 1<=p142]]]]]] | [1<=p121 & 1<=p1]] | [[1<=p1 & 1<=p147] | [1<=p127 & 1<=p48]]]]
normalized: ~ [E [true U ~ [[[[1<=p127 & 1<=p48] | [1<=p1 & 1<=p147]] | [[1<=p121 & 1<=p1] | [[[[[p140<=0 | [1<=p1 & 1<=p142]] | [p128<=0 | p1<=0]] & [p1<=0 | [p138<=0 | [1<=p107 & 1<=p24]]]] & [p1<=0 | p142<=0]] | [[[p1<=0 | [p144<=0 | p137<=0]] | [[[1<=p1 & 1<=p143] | [1<=p136 & 1<=p1]] | [[[p132<=0 | p1<=0] & [[p137<=0 | p1<=0] & [[1<=p103 & 1<=p39] | [1<=p146 & 1<=p1]]]] | [[p145<=0 | p1<=0] & [p136<=0 | p1<=0]]]]] & [[1<=p147 & 1<=p1] | [[1<=p1 & 1<=p82] & [[p140<=0 | p1<=0] & [[[1<=p91 | [1<=p138 | [[p1<=0 | p140<=0] & [p1<=0 | p139<=0]]]] | [p1<=0 | [p140<=0 | 1<=p86]]] & [[p1<=0 | p139<=0] | [1<=p71 | [1<=p146 & 1<=p87]]]]]]]]]]]]]]

abstracting: (1<=p87)
states: 231,683,254,808 (11)
abstracting: (1<=p146)
states: 128,518,033,248 (11)
abstracting: (1<=p71)
states: 231,683,254,808 (11)
abstracting: (p139<=0)
states: 8,625,597,468,839 (12)
abstracting: (p1<=0)
states: 7,986,434,732,501 (12)
abstracting: (1<=p86)
states: 44
abstracting: (p140<=0)
states: 8,625,579,605,783 (12)
abstracting: (p1<=0)
states: 7,986,434,732,501 (12)
abstracting: (p139<=0)
states: 8,625,597,468,839 (12)
abstracting: (p1<=0)
states: 7,986,434,732,501 (12)
abstracting: (p140<=0)
states: 8,625,579,605,783 (12)
abstracting: (p1<=0)
states: 7,986,434,732,501 (12)
abstracting: (1<=p138)
states: 128,500,170,192 (11)
abstracting: (1<=p91)
states: 368
abstracting: (p1<=0)
states: 7,986,434,732,501 (12)
abstracting: (p140<=0)
states: 8,625,579,605,783 (12)
abstracting: (1<=p82)
states: 44
abstracting: (1<=p1)
states: 767,662,906,530 (11)
abstracting: (1<=p1)
states: 767,662,906,530 (11)
abstracting: (1<=p147)
states: 128,500,170,192 (11)
abstracting: (p1<=0)
states: 7,986,434,732,501 (12)
abstracting: (p136<=0)
states: 8,625,579,605,783 (12)
abstracting: (p1<=0)
states: 7,986,434,732,501 (12)
abstracting: (p145<=0)
states: 8,625,579,605,783 (12)
abstracting: (1<=p1)
states: 767,662,906,530 (11)
abstracting: (1<=p146)
states: 128,518,033,248 (11)
abstracting: (1<=p39)
states: 304,032,734,508 (11)
abstracting: (1<=p103)
states: 344,444,129,736 (11)
abstracting: (p1<=0)
states: 7,986,434,732,501 (12)
abstracting: (p137<=0)
states: 8,625,579,605,783 (12)
abstracting: (p1<=0)
states: 7,986,434,732,501 (12)
abstracting: (p132<=0)
states: 5,389,783,746,957 (12)
abstracting: (1<=p1)
states: 767,662,906,530 (11)
abstracting: (1<=p136)
states: 128,518,033,248 (11)
abstracting: (1<=p143)
states: 128,518,033,248 (11)
abstracting: (1<=p1)
states: 767,662,906,530 (11)
abstracting: (p137<=0)
states: 8,625,579,605,783 (12)
abstracting: (p144<=0)
states: 8,625,597,468,839 (12)
abstracting: (p1<=0)
states: 7,986,434,732,501 (12)
abstracting: (p142<=0)
states: 8,625,597,468,839 (12)
abstracting: (p1<=0)
states: 7,986,434,732,501 (12)
abstracting: (1<=p24)
states: 249,916,580,428 (11)
abstracting: (1<=p107)
states: 327,216,536,408 (11)
abstracting: (p138<=0)
states: 8,625,597,468,839 (12)
abstracting: (p1<=0)
states: 7,986,434,732,501 (12)
abstracting: (p1<=0)
states: 7,986,434,732,501 (12)
abstracting: (p128<=0)
states: 5,391,562,583,301 (12)
abstracting: (1<=p142)
states: 128,500,170,192 (11)
abstracting: (1<=p1)
states: 767,662,906,530 (11)
abstracting: (p140<=0)
states: 8,625,579,605,783 (12)
abstracting: (1<=p1)
states: 767,662,906,530 (11)
abstracting: (1<=p121)
states: 3,362,535,055,730 (12)
abstracting: (1<=p147)
states: 128,500,170,192 (11)
abstracting: (1<=p1)
states: 767,662,906,530 (11)
abstracting: (1<=p48)
states: 309,132,084,660 (11)
abstracting: (1<=p127)
states: 326,322,668,792 (11)

before gc: list nodes free: 109712

after gc: idd nodes used:539122, unused:63460878; list nodes free:338547505
-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m10.226sec

totally nodes used: 133767986 (1.3e+08)
number of garbage collections: 2
fire ops cache: hits/miss/sum: 1512051453 1978260988 3490312441
used/not used/entry size/cache size: 38653305 28455559 16 1024MB
basic ops cache: hits/miss/sum: 55053117 63663782 118716899
used/not used/entry size/cache size: 8549810 8227406 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: 602294 401407 1003701
used/not used/entry size/cache size: 0 8388608 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 61382410
1 5116917
2 526008
3 72506
4 9421
5 1011
6 124
7 61
8 46
9 14
>= 10 346

Total processing time: 38m15.059sec


BK_STOP 1679354770527

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

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


initing FirstDep: 0m 0.000sec

14935 16522 34696 30769 44347 51997 73005 110816 74597 103913 114571 138605 213588 108509 162222 168194 159809 194604 131422 193837 157418 152227 174674 140856 174899 139672 134009 130732 120682 131223 106508
iterations count:3132213 (11348), effective:63589 (230)

initing FirstDep: 0m 0.000sec


iterations count:26063 (94), effective:253 (0)
136627
iterations count:105135 (380), effective:1499 (5)

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="SieveSingleMsgMbox-PT-d1m18"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is SieveSingleMsgMbox-PT-d1m18, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r426-tajo-167905978900423"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m18.tgz
mv SieveSingleMsgMbox-PT-d1m18 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;