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-167905979000479.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-d2m36, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905979000479
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 8.6K Feb 26 10:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 10:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 10:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 10:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 10:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 10:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 10:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 10:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 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 1.1M 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-d2m36-ReachabilityFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679356373950

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-d2m36
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 23:52:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 23:52:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 23:52:56] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2023-03-20 23:52:56] [INFO ] Transformed 2398 places.
[2023-03-20 23:52:56] [INFO ] Transformed 1954 transitions.
[2023-03-20 23:52:56] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 255 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1984 places in 18 ms
Reduce places removed 1984 places and 0 transitions.
Incomplete random walk after 10000 steps, including 2182 resets, run finished after 514 ms. (steps per millisecond=19 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 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 42 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 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 100 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 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 36 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 90 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 39 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 35 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 36 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 152305 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{3=1, 4=1, 6=1, 7=1, 10=1, 13=1}
Probabilistic random walk after 152305 steps, saw 69859 distinct states, run finished after 3008 ms. (steps per millisecond=50 ) properties seen :6
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 10 properties.
// Phase 1: matrix 1954 rows 414 cols
[2023-03-20 23:53:00] [INFO ] Computed 6 place invariants in 102 ms
[2023-03-20 23:53:01] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 23:53:01] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 23:53:02] [INFO ] After 1601ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-20 23:53:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-20 23:53:02] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 6 ms returned sat
[2023-03-20 23:53:05] [INFO ] After 3196ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :8
[2023-03-20 23:53:06] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2023-03-20 23:53:12] [INFO ] After 6125ms SMT Verify possible using 1674 Read/Feed constraints in natural domain returned unsat :2 sat :8
[2023-03-20 23:53:13] [INFO ] Deduced a trap composed of 188 places in 151 ms of which 6 ms to minimize.
[2023-03-20 23:53:13] [INFO ] Deduced a trap composed of 103 places in 160 ms of which 2 ms to minimize.
[2023-03-20 23:53:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 569 ms
[2023-03-20 23:53:19] [INFO ] Deduced a trap composed of 46 places in 312 ms of which 1 ms to minimize.
[2023-03-20 23:53:20] [INFO ] Deduced a trap composed of 182 places in 275 ms of which 2 ms to minimize.
[2023-03-20 23:53:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 977 ms
[2023-03-20 23:53:20] [INFO ] After 14383ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 4456 ms.
[2023-03-20 23:53:24] [INFO ] After 22583ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 77 ms.
Support contains 27 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 388 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.5 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 388 transition count 1124
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 932 place count 287 transition count 608
Iterating global reduction 1 with 101 rules applied. Total rules applied 1033 place count 287 transition count 608
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1043 place count 287 transition count 598
Discarding 75 places :
Symmetric choice reduction at 2 with 75 rule applications. Total rules 1118 place count 212 transition count 523
Iterating global reduction 2 with 75 rules applied. Total rules applied 1193 place count 212 transition count 523
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 1225 place count 212 transition count 491
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 1252 place count 185 transition count 457
Iterating global reduction 3 with 27 rules applied. Total rules applied 1279 place count 185 transition count 457
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 3 with 65 rules applied. Total rules applied 1344 place count 185 transition count 392
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1348 place count 181 transition count 386
Iterating global reduction 4 with 4 rules applied. Total rules applied 1352 place count 181 transition count 386
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1356 place count 177 transition count 382
Iterating global reduction 4 with 4 rules applied. Total rules applied 1360 place count 177 transition count 382
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1361 place count 176 transition count 381
Iterating global reduction 4 with 1 rules applied. Total rules applied 1362 place count 176 transition count 381
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1363 place count 175 transition count 380
Iterating global reduction 4 with 1 rules applied. Total rules applied 1364 place count 175 transition count 380
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1365 place count 174 transition count 379
Iterating global reduction 4 with 1 rules applied. Total rules applied 1366 place count 174 transition count 379
Applied a total of 1366 rules in 127 ms. Remains 174 /414 variables (removed 240) and now considering 379/1954 (removed 1575) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 174/414 places, 379/1954 transitions.
Incomplete random walk after 10000 steps, including 2269 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 449 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 502 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 472 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 438 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 469 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 320880 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{5=1}
Probabilistic random walk after 320880 steps, saw 145508 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :1
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 7 properties.
// Phase 1: matrix 379 rows 174 cols
[2023-03-20 23:53:29] [INFO ] Computed 4 place invariants in 8 ms
[2023-03-20 23:53:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:53:29] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:53:29] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 23:53:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-20 23:53:29] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 23:53:29] [INFO ] After 340ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 23:53:29] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-20 23:53:30] [INFO ] After 729ms SMT Verify possible using 248 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-20 23:53:31] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 1 ms to minimize.
[2023-03-20 23:53:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-03-20 23:53:31] [INFO ] After 1675ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 801 ms.
[2023-03-20 23:53:32] [INFO ] After 2929ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 161 ms.
Support contains 27 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 379/379 transitions.
Applied a total of 0 rules in 18 ms. Remains 174 /174 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 174/174 places, 379/379 transitions.
Incomplete random walk after 10000 steps, including 2234 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 434 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 493 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 504 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 335631 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 335631 steps, saw 152146 distinct states, run finished after 3003 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-20 23:53:36] [INFO ] Invariant cache hit.
[2023-03-20 23:53:36] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:53:36] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 23:53:36] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 23:53:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 23:53:36] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:53:37] [INFO ] After 285ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 23:53:37] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-20 23:53:37] [INFO ] After 491ms SMT Verify possible using 248 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-20 23:53:38] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 2 ms to minimize.
[2023-03-20 23:53:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-03-20 23:53:38] [INFO ] After 1207ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 584 ms.
[2023-03-20 23:53:38] [INFO ] After 2150ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 132 ms.
Support contains 27 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 379/379 transitions.
Applied a total of 0 rules in 17 ms. Remains 174 /174 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 174/174 places, 379/379 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 379/379 transitions.
Applied a total of 0 rules in 15 ms. Remains 174 /174 variables (removed 0) and now considering 379/379 (removed 0) transitions.
[2023-03-20 23:53:39] [INFO ] Invariant cache hit.
[2023-03-20 23:53:39] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-20 23:53:39] [INFO ] Invariant cache hit.
[2023-03-20 23:53:39] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-20 23:53:39] [INFO ] Implicit Places using invariants and state equation in 870 ms returned []
Implicit Place search using SMT with State Equation took 960 ms to find 0 implicit places.
[2023-03-20 23:53:40] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-20 23:53:40] [INFO ] Invariant cache hit.
[2023-03-20 23:53:40] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1183 ms. Remains : 174/174 places, 379/379 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 174 transition count 372
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 168 transition count 372
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 13 place count 168 transition count 355
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 47 place count 151 transition count 355
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 69 place count 140 transition count 344
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 139 transition count 354
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 74 place count 139 transition count 351
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 77 place count 136 transition count 351
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 83 place count 136 transition count 351
Applied a total of 83 rules in 34 ms. Remains 136 /174 variables (removed 38) and now considering 351/379 (removed 28) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 351 rows 136 cols
[2023-03-20 23:53:40] [INFO ] Computed 4 place invariants in 5 ms
[2023-03-20 23:53:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 23:53:40] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 23:53:40] [INFO ] After 291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 23:53:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:53:40] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 23:53:41] [INFO ] After 441ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 23:53:41] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2023-03-20 23:53:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-20 23:53:41] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2023-03-20 23:53:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-03-20 23:53:41] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2023-03-20 23:53:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-20 23:53:41] [INFO ] After 1141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 411 ms.
[2023-03-20 23:53:42] [INFO ] After 1664ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2023-03-20 23:53:42] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-20 23:53:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 174 places, 379 transitions and 1501 arcs took 6 ms.
[2023-03-20 23:53:42] [INFO ] Flatten gal took : 68 ms
Total runtime 46265 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_d2m36
(NrP: 174 NrTr: 379 NrArc: 1501)

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

net check time: 0m 0.000sec

init dd package: 0m 3.116sec


before gc: list nodes free: 1376157

after gc: idd nodes used:528321, unused:63471679; list nodes free:354840734
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 5112136 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16098924 kB

BK_TIME_CONFINEMENT_REACHED

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

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


initing FirstDep: 0m 0.000sec

18439 29610 43495 39678 58718 65593 87586 114939 97873 140717 143776 187215 223287 196151 247724 250851 310856 353936 316796 408359 384111 446102 501390 504709 579168 576286 632187 697736 726579

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-d2m36"
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-d2m36, 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-167905979000479"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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