fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r280-smll-167863550600383
Last Updated
May 14, 2023

About the Execution of Marcie+red for Peterson-PT-3

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
300.800 138283.00 257422.00 718.80 F normal

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.r280-smll-167863550600383.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 Peterson-PT-3, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-smll-167863550600383
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 29K Feb 25 22:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 157K Feb 25 22:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 40K Feb 25 22:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 194K Feb 25 22:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 15K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 93K Feb 25 22:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 439K Feb 25 22:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 58K Feb 25 22:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 283K Feb 25 22:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 143K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1678918974799

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=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Peterson-PT-3
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-15 22:22:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-15 22:22:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 22:22:58] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2023-03-15 22:22:58] [INFO ] Transformed 244 places.
[2023-03-15 22:22:58] [INFO ] Transformed 332 transitions.
[2023-03-15 22:22:58] [INFO ] Found NUPN structural information;
[2023-03-15 22:22:58] [INFO ] Completing missing partition info from NUPN : creating a component with [TestAlone_1_2_3, TestAlone_2_2_3]
[2023-03-15 22:22:58] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 334 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 982 ms. (steps per millisecond=10 ) properties (out of 244) seen :143
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 101) seen :0
Running SMT prover for 101 properties.
[2023-03-15 22:22:59] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2023-03-15 22:22:59] [INFO ] Computed 15 place invariants in 14 ms
[2023-03-15 22:23:01] [INFO ] After 1168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:101
[2023-03-15 22:23:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2023-03-15 22:23:02] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-15 22:23:04] [INFO ] After 1318ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :101
[2023-03-15 22:23:04] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-15 22:23:05] [INFO ] After 1380ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :101
[2023-03-15 22:23:05] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 8 ms to minimize.
[2023-03-15 22:23:05] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 1 ms to minimize.
[2023-03-15 22:23:06] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 1 ms to minimize.
[2023-03-15 22:23:06] [INFO ] Deduced a trap composed of 60 places in 232 ms of which 1 ms to minimize.
[2023-03-15 22:23:06] [INFO ] Deduced a trap composed of 73 places in 116 ms of which 1 ms to minimize.
[2023-03-15 22:23:06] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 0 ms to minimize.
[2023-03-15 22:23:06] [INFO ] Deduced a trap composed of 53 places in 94 ms of which 1 ms to minimize.
[2023-03-15 22:23:06] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 2 ms to minimize.
[2023-03-15 22:23:06] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1213 ms
[2023-03-15 22:23:07] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2023-03-15 22:23:07] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2023-03-15 22:23:07] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 1 ms to minimize.
[2023-03-15 22:23:07] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2023-03-15 22:23:07] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2023-03-15 22:23:07] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2023-03-15 22:23:07] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2023-03-15 22:23:07] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 612 ms
[2023-03-15 22:23:07] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2023-03-15 22:23:07] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2023-03-15 22:23:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 168 ms
[2023-03-15 22:23:07] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 1 ms to minimize.
[2023-03-15 22:23:07] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 0 ms to minimize.
[2023-03-15 22:23:08] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 0 ms to minimize.
[2023-03-15 22:23:08] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2023-03-15 22:23:08] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 1 ms to minimize.
[2023-03-15 22:23:08] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2023-03-15 22:23:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 700 ms
[2023-03-15 22:23:08] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 0 ms to minimize.
[2023-03-15 22:23:08] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2023-03-15 22:23:08] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 1 ms to minimize.
[2023-03-15 22:23:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 364 ms
[2023-03-15 22:23:09] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2023-03-15 22:23:09] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 0 ms to minimize.
[2023-03-15 22:23:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 229 ms
[2023-03-15 22:23:09] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 1 ms to minimize.
[2023-03-15 22:23:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2023-03-15 22:23:09] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 1 ms to minimize.
[2023-03-15 22:23:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2023-03-15 22:23:09] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 1 ms to minimize.
[2023-03-15 22:23:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-03-15 22:23:09] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 0 ms to minimize.
[2023-03-15 22:23:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-03-15 22:23:09] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 0 ms to minimize.
[2023-03-15 22:23:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2023-03-15 22:23:10] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 1 ms to minimize.
[2023-03-15 22:23:10] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 3 ms to minimize.
[2023-03-15 22:23:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 206 ms
[2023-03-15 22:23:10] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 0 ms to minimize.
[2023-03-15 22:23:10] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 1 ms to minimize.
[2023-03-15 22:23:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 231 ms
[2023-03-15 22:23:10] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 0 ms to minimize.
[2023-03-15 22:23:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-03-15 22:23:10] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 1 ms to minimize.
[2023-03-15 22:23:10] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 2 ms to minimize.
[2023-03-15 22:23:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 161 ms
[2023-03-15 22:23:10] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 1 ms to minimize.
[2023-03-15 22:23:11] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 0 ms to minimize.
[2023-03-15 22:23:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 193 ms
[2023-03-15 22:23:11] [INFO ] Deduced a trap composed of 97 places in 65 ms of which 0 ms to minimize.
[2023-03-15 22:23:11] [INFO ] Deduced a trap composed of 85 places in 68 ms of which 1 ms to minimize.
[2023-03-15 22:23:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 186 ms
[2023-03-15 22:23:11] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 0 ms to minimize.
[2023-03-15 22:23:11] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2023-03-15 22:23:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 153 ms
[2023-03-15 22:23:11] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 0 ms to minimize.
[2023-03-15 22:23:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-15 22:23:11] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 2 ms to minimize.
[2023-03-15 22:23:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-15 22:23:12] [INFO ] Deduced a trap composed of 86 places in 58 ms of which 1 ms to minimize.
[2023-03-15 22:23:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-03-15 22:23:12] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 1 ms to minimize.
[2023-03-15 22:23:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-15 22:23:13] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 0 ms to minimize.
[2023-03-15 22:23:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-03-15 22:23:13] [INFO ] After 9274ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :101
Attempting to minimize the solution found.
Minimization took 1641 ms.
[2023-03-15 22:23:15] [INFO ] After 14061ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :101
Parikh walk visited 54 properties in 1137 ms.
Support contains 47 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 244 transition count 261
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 142 place count 173 transition count 261
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 142 place count 173 transition count 221
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 222 place count 133 transition count 221
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 234 place count 127 transition count 215
Applied a total of 234 rules in 49 ms. Remains 127 /244 variables (removed 117) and now considering 215/332 (removed 117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 127/244 places, 215/332 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 28055 ms. (steps per millisecond=35 ) properties (out of 47) seen :4
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 566 ms. (steps per millisecond=176 ) properties (out of 43) seen :4
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 618 ms. (steps per millisecond=161 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 759 ms. (steps per millisecond=131 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 736 ms. (steps per millisecond=135 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 741 ms. (steps per millisecond=134 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 745 ms. (steps per millisecond=134 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 749 ms. (steps per millisecond=133 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 754 ms. (steps per millisecond=132 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 757 ms. (steps per millisecond=132 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 711 ms. (steps per millisecond=140 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 934 ms. (steps per millisecond=107 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 913 ms. (steps per millisecond=109 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 733 ms. (steps per millisecond=136 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 737 ms. (steps per millisecond=135 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 735 ms. (steps per millisecond=136 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 598 ms. (steps per millisecond=167 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 765 ms. (steps per millisecond=130 ) properties (out of 39) seen :4
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 721 ms. (steps per millisecond=138 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 718 ms. (steps per millisecond=139 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 709 ms. (steps per millisecond=141 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 718 ms. (steps per millisecond=139 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 733 ms. (steps per millisecond=136 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 740 ms. (steps per millisecond=135 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 700 ms. (steps per millisecond=142 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 773 ms. (steps per millisecond=129 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 783 ms. (steps per millisecond=127 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 722 ms. (steps per millisecond=138 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 691 ms. (steps per millisecond=144 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 696 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 679 ms. (steps per millisecond=147 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 702 ms. (steps per millisecond=142 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 678 ms. (steps per millisecond=147 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 699 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 718 ms. (steps per millisecond=139 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 690 ms. (steps per millisecond=144 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 703 ms. (steps per millisecond=142 ) properties (out of 35) seen :0
Running SMT prover for 35 properties.
[2023-03-15 22:24:10] [INFO ] Flow matrix only has 191 transitions (discarded 24 similar events)
// Phase 1: matrix 191 rows 127 cols
[2023-03-15 22:24:10] [INFO ] Computed 15 place invariants in 6 ms
[2023-03-15 22:24:10] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:35
[2023-03-15 22:24:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-15 22:24:10] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-15 22:24:11] [INFO ] After 522ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :35
[2023-03-15 22:24:11] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-15 22:24:12] [INFO ] After 494ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :35
[2023-03-15 22:24:12] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2023-03-15 22:24:12] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 0 ms to minimize.
[2023-03-15 22:24:12] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 0 ms to minimize.
[2023-03-15 22:24:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 300 ms
[2023-03-15 22:24:12] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 0 ms to minimize.
[2023-03-15 22:24:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-15 22:24:12] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 5 ms to minimize.
[2023-03-15 22:24:12] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 1 ms to minimize.
[2023-03-15 22:24:12] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 0 ms to minimize.
[2023-03-15 22:24:13] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2023-03-15 22:24:13] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2023-03-15 22:24:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 482 ms
[2023-03-15 22:24:13] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 0 ms to minimize.
[2023-03-15 22:24:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-03-15 22:24:13] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 0 ms to minimize.
[2023-03-15 22:24:13] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2023-03-15 22:24:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 164 ms
[2023-03-15 22:24:13] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 0 ms to minimize.
[2023-03-15 22:24:13] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2023-03-15 22:24:13] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2023-03-15 22:24:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 220 ms
[2023-03-15 22:24:13] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 2 ms to minimize.
[2023-03-15 22:24:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2023-03-15 22:24:13] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 0 ms to minimize.
[2023-03-15 22:24:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-03-15 22:24:14] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 0 ms to minimize.
[2023-03-15 22:24:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2023-03-15 22:24:14] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2023-03-15 22:24:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2023-03-15 22:24:14] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2023-03-15 22:24:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-15 22:24:14] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 0 ms to minimize.
[2023-03-15 22:24:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-15 22:24:14] [INFO ] After 3180ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :35
Attempting to minimize the solution found.
Minimization took 671 ms.
[2023-03-15 22:24:15] [INFO ] After 4761ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :35
Parikh walk visited 0 properties in 241 ms.
Support contains 35 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 215/215 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 6 rules applied. Total rules applied 6 place count 127 transition count 209
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 121 transition count 209
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 12 place count 121 transition count 206
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 118 transition count 206
Applied a total of 18 rules in 28 ms. Remains 118 /127 variables (removed 9) and now considering 206/215 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 118/127 places, 206/215 transitions.
Interrupted random walk after 889159 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=29 ) properties seen 0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 663 ms. (steps per millisecond=150 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 680 ms. (steps per millisecond=147 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 702 ms. (steps per millisecond=142 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 701 ms. (steps per millisecond=142 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 697 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 651 ms. (steps per millisecond=153 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 697 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 694 ms. (steps per millisecond=144 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 668 ms. (steps per millisecond=149 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 724 ms. (steps per millisecond=138 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 687 ms. (steps per millisecond=145 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 697 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 706 ms. (steps per millisecond=141 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 683 ms. (steps per millisecond=146 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 716 ms. (steps per millisecond=139 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 717 ms. (steps per millisecond=139 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 730 ms. (steps per millisecond=136 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 715 ms. (steps per millisecond=139 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 723 ms. (steps per millisecond=138 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 771 ms. (steps per millisecond=129 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 763 ms. (steps per millisecond=131 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 718 ms. (steps per millisecond=139 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 693 ms. (steps per millisecond=144 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 675 ms. (steps per millisecond=148 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 767 ms. (steps per millisecond=130 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 716 ms. (steps per millisecond=139 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 747 ms. (steps per millisecond=133 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 743 ms. (steps per millisecond=134 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 761 ms. (steps per millisecond=131 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 748 ms. (steps per millisecond=133 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 700 ms. (steps per millisecond=142 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 603 ms. (steps per millisecond=165 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 662 ms. (steps per millisecond=151 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 662 ms. (steps per millisecond=151 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 721 ms. (steps per millisecond=138 ) properties (out of 35) seen :0
Finished probabilistic random walk after 186975 steps, run visited all 35 properties in 1468 ms. (steps per millisecond=127 )
Probabilistic random walk after 186975 steps, saw 37538 distinct states, run finished after 1468 ms. (steps per millisecond=127 ) properties seen :35
Able to resolve query StableMarking after proving 244 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 133710 ms.
ITS solved all properties within timeout

BK_STOP 1678919113082

--------------------
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 StableMarking -timeout 180 -rebuildPNML

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="Peterson-PT-3"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 Peterson-PT-3, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r280-smll-167863550600383"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-3.tgz
mv Peterson-PT-3 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;