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

About the Execution of LTSMin+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
286.071 128222.00 239496.00 616.50 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.r279-smll-167863550000383.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 ltsminxred
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 r279-smll-167863550000383
=====================================================================

--------------------
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 1678898802160

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=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Peterson-PT-3
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 16:46:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-15 16:46:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 16:46:45] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2023-03-15 16:46:45] [INFO ] Transformed 244 places.
[2023-03-15 16:46:45] [INFO ] Transformed 332 transitions.
[2023-03-15 16:46:45] [INFO ] Found NUPN structural information;
[2023-03-15 16:46:45] [INFO ] Completing missing partition info from NUPN : creating a component with [TestAlone_1_2_3, TestAlone_2_2_3]
[2023-03-15 16:46:45] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 198 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 731 ms. (steps per millisecond=13 ) properties (out of 244) seen :143
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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
Running SMT prover for 101 properties.
[2023-03-15 16:46:46] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2023-03-15 16:46:46] [INFO ] Computed 15 place invariants in 24 ms
[2023-03-15 16:46:47] [INFO ] After 1194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:101
[2023-03-15 16:46:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2023-03-15 16:46:48] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-15 16:46:50] [INFO ] After 1438ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :101
[2023-03-15 16:46:50] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-15 16:46:51] [INFO ] After 1462ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :101
[2023-03-15 16:46:51] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 11 ms to minimize.
[2023-03-15 16:46:52] [INFO ] Deduced a trap composed of 35 places in 227 ms of which 2 ms to minimize.
[2023-03-15 16:46:52] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 1 ms to minimize.
[2023-03-15 16:46:52] [INFO ] Deduced a trap composed of 60 places in 125 ms of which 2 ms to minimize.
[2023-03-15 16:46:52] [INFO ] Deduced a trap composed of 73 places in 116 ms of which 1 ms to minimize.
[2023-03-15 16:46:52] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 1 ms to minimize.
[2023-03-15 16:46:52] [INFO ] Deduced a trap composed of 53 places in 97 ms of which 1 ms to minimize.
[2023-03-15 16:46:52] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 2 ms to minimize.
[2023-03-15 16:46:52] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1230 ms
[2023-03-15 16:46:53] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2023-03-15 16:46:53] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2023-03-15 16:46:53] [INFO ] Deduced a trap composed of 56 places in 91 ms of which 0 ms to minimize.
[2023-03-15 16:46:53] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2023-03-15 16:46:53] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2023-03-15 16:46:53] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 1 ms to minimize.
[2023-03-15 16:46:53] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 1 ms to minimize.
[2023-03-15 16:46:53] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 744 ms
[2023-03-15 16:46:53] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2023-03-15 16:46:53] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2023-03-15 16:46:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 219 ms
[2023-03-15 16:46:54] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 1 ms to minimize.
[2023-03-15 16:46:54] [INFO ] Deduced a trap composed of 56 places in 132 ms of which 1 ms to minimize.
[2023-03-15 16:46:54] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 1 ms to minimize.
[2023-03-15 16:46:54] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2023-03-15 16:46:54] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 1 ms to minimize.
[2023-03-15 16:46:54] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2023-03-15 16:46:54] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 817 ms
[2023-03-15 16:46:55] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 1 ms to minimize.
[2023-03-15 16:46:55] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2023-03-15 16:46:55] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 1 ms to minimize.
[2023-03-15 16:46:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 379 ms
[2023-03-15 16:46:55] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 0 ms to minimize.
[2023-03-15 16:46:55] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
[2023-03-15 16:46:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 197 ms
[2023-03-15 16:46:55] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 1 ms to minimize.
[2023-03-15 16:46:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2023-03-15 16:46:55] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 0 ms to minimize.
[2023-03-15 16:46:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-03-15 16:46:55] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 1 ms to minimize.
[2023-03-15 16:46:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-03-15 16:46:55] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2023-03-15 16:46:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2023-03-15 16:46:56] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2023-03-15 16:46:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2023-03-15 16:46:56] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 1 ms to minimize.
[2023-03-15 16:46:56] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2023-03-15 16:46:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 218 ms
[2023-03-15 16:46:56] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 1 ms to minimize.
[2023-03-15 16:46:56] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 1 ms to minimize.
[2023-03-15 16:46:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 216 ms
[2023-03-15 16:46:56] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 1 ms to minimize.
[2023-03-15 16:46:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-03-15 16:46:56] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
[2023-03-15 16:46:57] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 0 ms to minimize.
[2023-03-15 16:46:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 203 ms
[2023-03-15 16:46:57] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 1 ms to minimize.
[2023-03-15 16:46:57] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 0 ms to minimize.
[2023-03-15 16:46:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 205 ms
[2023-03-15 16:46:57] [INFO ] Deduced a trap composed of 97 places in 75 ms of which 0 ms to minimize.
[2023-03-15 16:46:57] [INFO ] Deduced a trap composed of 85 places in 73 ms of which 1 ms to minimize.
[2023-03-15 16:46:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 202 ms
[2023-03-15 16:46:57] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 0 ms to minimize.
[2023-03-15 16:46:57] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2023-03-15 16:46:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 163 ms
[2023-03-15 16:46:57] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2023-03-15 16:46:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-15 16:46:58] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 0 ms to minimize.
[2023-03-15 16:46:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-03-15 16:46:58] [INFO ] Deduced a trap composed of 86 places in 66 ms of which 0 ms to minimize.
[2023-03-15 16:46:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-15 16:46:58] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 1 ms to minimize.
[2023-03-15 16:46:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-15 16:47:00] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
[2023-03-15 16:47:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-03-15 16:47:00] [INFO ] After 10082ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :101
Attempting to minimize the solution found.
Minimization took 1948 ms.
[2023-03-15 16:47:02] [INFO ] After 14853ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :101
Parikh walk visited 54 properties in 1488 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 0 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 0 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 45 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 45 ms. Remains : 127/244 places, 215/332 transitions.
Interrupted random walk after 897525 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=29 ) properties seen 8
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 742 ms. (steps per millisecond=134 ) properties (out of 39) seen :4
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 1009 ms. (steps per millisecond=99 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 689 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 624 ms. (steps per millisecond=160 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 645 ms. (steps per millisecond=155 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 655 ms. (steps per millisecond=152 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 705 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 581 ms. (steps per millisecond=172 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 521 ms. (steps per millisecond=191 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 613 ms. (steps per millisecond=163 ) properties (out of 35) 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 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 764 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 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 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 704 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 855 ms. (steps per millisecond=116 ) properties (out of 35) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 780 ms. (steps per millisecond=128 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 775 ms. (steps per millisecond=129 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 766 ms. (steps per millisecond=130 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 750 ms. (steps per millisecond=133 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 764 ms. (steps per millisecond=130 ) properties (out of 33) 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 33) 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 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 762 ms. (steps per millisecond=131 ) properties (out of 33) 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 33) 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 33) 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 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 750 ms. (steps per millisecond=133 ) properties (out of 33) 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 33) 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 33) 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 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 673 ms. (steps per millisecond=148 ) properties (out of 33) 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 33) seen :5
Running SMT prover for 28 properties.
[2023-03-15 16:47:57] [INFO ] Flow matrix only has 191 transitions (discarded 24 similar events)
// Phase 1: matrix 191 rows 127 cols
[2023-03-15 16:47:57] [INFO ] Computed 15 place invariants in 3 ms
[2023-03-15 16:47:57] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:28
[2023-03-15 16:47:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-15 16:47:57] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-15 16:47:58] [INFO ] After 279ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :28
[2023-03-15 16:47:58] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-15 16:47:58] [INFO ] After 250ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :28
[2023-03-15 16:47:58] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2023-03-15 16:47:58] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 0 ms to minimize.
[2023-03-15 16:47:58] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2023-03-15 16:47:58] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2023-03-15 16:47:58] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2023-03-15 16:47:58] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2023-03-15 16:47:59] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2023-03-15 16:47:59] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 438 ms
[2023-03-15 16:47:59] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2023-03-15 16:47:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-15 16:47:59] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2023-03-15 16:47:59] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2023-03-15 16:47:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
[2023-03-15 16:47:59] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2023-03-15 16:47:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-15 16:47:59] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 0 ms to minimize.
[2023-03-15 16:47:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-03-15 16:47:59] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2023-03-15 16:47:59] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2023-03-15 16:47:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 122 ms
[2023-03-15 16:47:59] [INFO ] After 1490ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :28
Attempting to minimize the solution found.
Minimization took 240 ms.
[2023-03-15 16:48:00] [INFO ] After 2247ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :28
Parikh walk visited 0 properties in 147 ms.
Support contains 28 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 215/215 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 127 transition count 204
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 116 transition count 204
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 22 place count 116 transition count 200
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 30 place count 112 transition count 200
Applied a total of 30 rules in 15 ms. Remains 112 /127 variables (removed 15) and now considering 200/215 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 112/127 places, 200/215 transitions.
Interrupted random walk after 980156 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=32 ) properties seen 0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 587 ms. (steps per millisecond=170 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 609 ms. (steps per millisecond=164 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 658 ms. (steps per millisecond=151 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 569 ms. (steps per millisecond=175 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 632 ms. (steps per millisecond=158 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 621 ms. (steps per millisecond=161 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 627 ms. (steps per millisecond=159 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 646 ms. (steps per millisecond=154 ) properties (out of 28) 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 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 681 ms. (steps per millisecond=146 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 619 ms. (steps per millisecond=161 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 639 ms. (steps per millisecond=156 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 661 ms. (steps per millisecond=151 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 511 ms. (steps per millisecond=195 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 485 ms. (steps per millisecond=206 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 540 ms. (steps per millisecond=185 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 608 ms. (steps per millisecond=164 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 615 ms. (steps per millisecond=162 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 796 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 642 ms. (steps per millisecond=155 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 626 ms. (steps per millisecond=159 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 647 ms. (steps per millisecond=154 ) properties (out of 28) 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 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 611 ms. (steps per millisecond=163 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 555 ms. (steps per millisecond=180 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 630 ms. (steps per millisecond=158 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 620 ms. (steps per millisecond=161 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 671 ms. (steps per millisecond=149 ) properties (out of 28) seen :0
Finished probabilistic random walk after 184220 steps, run visited all 28 properties in 1500 ms. (steps per millisecond=122 )
Probabilistic random walk after 184220 steps, saw 36950 distinct states, run finished after 1500 ms. (steps per millisecond=122 ) properties seen :28
Able to resolve query StableMarking after proving 244 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 124261 ms.
ITS solved all properties within timeout

BK_STOP 1678898930382

--------------------
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="ltsminxred"
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 ltsminxred"
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 r279-smll-167863550000383"
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 ;