About the Execution of LTSMin+red for DES-PT-20b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
301.195 | 88881.00 | 173452.00 | 319.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.r119-tall-167814497500273.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 DES-PT-20b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r119-tall-167814497500273
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.6K Feb 26 15:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 15:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 15:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 15:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 91K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME StableMarking
=== Now, execution of the tool begins
BK_START 1679414006983
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=DES-PT-20b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 15:53:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-21 15:53:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 15:53:28] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2023-03-21 15:53:28] [INFO ] Transformed 360 places.
[2023-03-21 15:53:28] [INFO ] Transformed 311 transitions.
[2023-03-21 15:53:28] [INFO ] Found NUPN structural information;
[2023-03-21 15:53:28] [INFO ] Parsed PT model containing 360 places and 311 transitions and 987 arcs in 122 ms.
Structural test allowed to assert that 87 places are NOT stable. Took 7 ms.
Incomplete random walk after 10000 steps, including 83 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 273) seen :197
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 76) seen :0
Running SMT prover for 76 properties.
// Phase 1: matrix 311 rows 360 cols
[2023-03-21 15:53:29] [INFO ] Computed 65 place invariants in 24 ms
[2023-03-21 15:53:30] [INFO ] After 716ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:76
[2023-03-21 15:53:30] [INFO ] [Nat]Absence check using 39 positive place invariants in 20 ms returned sat
[2023-03-21 15:53:30] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 129 ms returned sat
[2023-03-21 15:53:35] [INFO ] After 2364ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :76
[2023-03-21 15:53:35] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 4 ms to minimize.
[2023-03-21 15:53:35] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2023-03-21 15:53:35] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2023-03-21 15:53:35] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2023-03-21 15:53:35] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2023-03-21 15:53:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 330 ms
[2023-03-21 15:53:35] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2023-03-21 15:53:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-21 15:53:35] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 1 ms to minimize.
[2023-03-21 15:53:35] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2023-03-21 15:53:35] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2023-03-21 15:53:36] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 0 ms to minimize.
[2023-03-21 15:53:36] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 0 ms to minimize.
[2023-03-21 15:53:36] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2023-03-21 15:53:36] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2023-03-21 15:53:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 624 ms
[2023-03-21 15:53:36] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 0 ms to minimize.
[2023-03-21 15:53:36] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 0 ms to minimize.
[2023-03-21 15:53:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 443 ms
[2023-03-21 15:53:36] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2023-03-21 15:53:37] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2023-03-21 15:53:37] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2023-03-21 15:53:37] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 0 ms to minimize.
[2023-03-21 15:53:37] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 0 ms to minimize.
[2023-03-21 15:53:37] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 1 ms to minimize.
[2023-03-21 15:53:37] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2023-03-21 15:53:37] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 0 ms to minimize.
[2023-03-21 15:53:37] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2023-03-21 15:53:37] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2023-03-21 15:53:37] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 0 ms to minimize.
[2023-03-21 15:53:37] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 0 ms to minimize.
[2023-03-21 15:53:37] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 0 ms to minimize.
[2023-03-21 15:53:38] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 0 ms to minimize.
[2023-03-21 15:53:38] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1128 ms
[2023-03-21 15:53:38] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2023-03-21 15:53:38] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2023-03-21 15:53:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 188 ms
[2023-03-21 15:53:38] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 0 ms to minimize.
[2023-03-21 15:53:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-03-21 15:53:41] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 0 ms to minimize.
[2023-03-21 15:53:41] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2023-03-21 15:53:41] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 4 ms to minimize.
[2023-03-21 15:53:41] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2023-03-21 15:53:41] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2023-03-21 15:53:41] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 0 ms to minimize.
[2023-03-21 15:53:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 798 ms
[2023-03-21 15:53:42] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2023-03-21 15:53:42] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2023-03-21 15:53:42] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2023-03-21 15:53:42] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2023-03-21 15:53:42] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2023-03-21 15:53:42] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2023-03-21 15:53:42] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2023-03-21 15:53:42] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2023-03-21 15:53:42] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 660 ms
[2023-03-21 15:53:42] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2023-03-21 15:53:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-03-21 15:53:43] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 0 ms to minimize.
[2023-03-21 15:53:43] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2023-03-21 15:53:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 157 ms
[2023-03-21 15:53:43] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 0 ms to minimize.
[2023-03-21 15:53:43] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2023-03-21 15:53:44] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2023-03-21 15:53:44] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2023-03-21 15:53:44] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2023-03-21 15:53:44] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2023-03-21 15:53:44] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 387 ms
[2023-03-21 15:53:44] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 0 ms to minimize.
[2023-03-21 15:53:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-03-21 15:53:44] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2023-03-21 15:53:44] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 0 ms to minimize.
[2023-03-21 15:53:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 176 ms
[2023-03-21 15:53:45] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 0 ms to minimize.
[2023-03-21 15:53:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2023-03-21 15:53:45] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 0 ms to minimize.
[2023-03-21 15:53:45] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 0 ms to minimize.
[2023-03-21 15:53:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 201 ms
[2023-03-21 15:53:45] [INFO ] After 13126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :76
Attempting to minimize the solution found.
Minimization took 3038 ms.
[2023-03-21 15:53:48] [INFO ] After 18829ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :76
Fused 76 Parikh solutions to 75 different solutions.
Parikh walk visited 8 properties in 22737 ms.
Support contains 68 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 311/311 transitions.
Graph (complete) has 741 edges and 360 vertex of which 354 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 354 transition count 284
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 333 transition count 284
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 333 transition count 275
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 324 transition count 275
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 305 transition count 256
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 305 transition count 256
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 305 transition count 255
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 304 transition count 255
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 289 transition count 240
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 289 transition count 240
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 148 place count 289 transition count 225
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 287 transition count 224
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 151 place count 287 transition count 221
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 284 transition count 221
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 207 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 205 transition count 146
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 205 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 204 transition count 145
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 203 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 319 place count 202 transition count 144
Applied a total of 319 rules in 106 ms. Remains 202 /360 variables (removed 158) and now considering 144/311 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 202/360 places, 144/311 transitions.
Incomplete random walk after 1000000 steps, including 47542 resets, run finished after 19032 ms. (steps per millisecond=52 ) properties (out of 68) seen :5
Incomplete Best-First random walk after 100001 steps, including 917 resets, run finished after 473 ms. (steps per millisecond=211 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 919 resets, run finished after 520 ms. (steps per millisecond=192 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 921 resets, run finished after 490 ms. (steps per millisecond=204 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 947 resets, run finished after 427 ms. (steps per millisecond=234 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 902 resets, run finished after 514 ms. (steps per millisecond=194 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 951 resets, run finished after 473 ms. (steps per millisecond=211 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 933 resets, run finished after 448 ms. (steps per millisecond=223 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 920 resets, run finished after 427 ms. (steps per millisecond=234 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 893 resets, run finished after 435 ms. (steps per millisecond=229 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 890 resets, run finished after 437 ms. (steps per millisecond=228 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100000 steps, including 897 resets, run finished after 457 ms. (steps per millisecond=218 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 891 resets, run finished after 428 ms. (steps per millisecond=233 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100000 steps, including 927 resets, run finished after 432 ms. (steps per millisecond=231 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 913 resets, run finished after 434 ms. (steps per millisecond=230 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 892 resets, run finished after 426 ms. (steps per millisecond=234 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100000 steps, including 901 resets, run finished after 430 ms. (steps per millisecond=232 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 938 resets, run finished after 452 ms. (steps per millisecond=221 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 899 resets, run finished after 437 ms. (steps per millisecond=228 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 912 resets, run finished after 443 ms. (steps per millisecond=225 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 893 resets, run finished after 435 ms. (steps per millisecond=229 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 863 resets, run finished after 436 ms. (steps per millisecond=229 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100000 steps, including 879 resets, run finished after 435 ms. (steps per millisecond=229 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 889 resets, run finished after 439 ms. (steps per millisecond=227 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 913 resets, run finished after 468 ms. (steps per millisecond=213 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 877 resets, run finished after 433 ms. (steps per millisecond=230 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 889 resets, run finished after 435 ms. (steps per millisecond=229 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 931 resets, run finished after 440 ms. (steps per millisecond=227 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 937 resets, run finished after 442 ms. (steps per millisecond=226 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 916 resets, run finished after 458 ms. (steps per millisecond=218 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 923 resets, run finished after 440 ms. (steps per millisecond=227 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 929 resets, run finished after 434 ms. (steps per millisecond=230 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 872 resets, run finished after 437 ms. (steps per millisecond=228 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100000 steps, including 968 resets, run finished after 458 ms. (steps per millisecond=218 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 913 resets, run finished after 454 ms. (steps per millisecond=220 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 896 resets, run finished after 445 ms. (steps per millisecond=224 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 953 resets, run finished after 453 ms. (steps per millisecond=220 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 956 resets, run finished after 447 ms. (steps per millisecond=223 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 925 resets, run finished after 445 ms. (steps per millisecond=224 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 879 resets, run finished after 428 ms. (steps per millisecond=233 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 937 resets, run finished after 424 ms. (steps per millisecond=235 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 952 resets, run finished after 427 ms. (steps per millisecond=234 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100000 steps, including 881 resets, run finished after 423 ms. (steps per millisecond=236 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 900 resets, run finished after 424 ms. (steps per millisecond=235 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 941 resets, run finished after 418 ms. (steps per millisecond=239 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 923 resets, run finished after 417 ms. (steps per millisecond=239 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 894 resets, run finished after 419 ms. (steps per millisecond=238 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 935 resets, run finished after 423 ms. (steps per millisecond=236 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 939 resets, run finished after 414 ms. (steps per millisecond=241 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100000 steps, including 931 resets, run finished after 446 ms. (steps per millisecond=224 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 100001 steps, including 944 resets, run finished after 451 ms. (steps per millisecond=221 ) properties (out of 63) seen :0
Finished probabilistic random walk after 370523 steps, run visited all 63 properties in 2280 ms. (steps per millisecond=162 )
Probabilistic random walk after 370523 steps, saw 94386 distinct states, run finished after 2281 ms. (steps per millisecond=162 ) properties seen :63
Able to resolve query StableMarking after proving 274 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 86751 ms.
ITS solved all properties within timeout
BK_STOP 1679414095864
--------------------
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="DES-PT-20b"
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 DES-PT-20b, 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 r119-tall-167814497500273"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-20b.tgz
mv DES-PT-20b 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 '
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 ;