fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r279-smll-167863550000382
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
268.888 64953.00 130135.00 679.00 T 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-167863550000382.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 QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r279-smll-167863550000382
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1678898780189

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=QuasiLiveness
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:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-15 16:46:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 16:46:23] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2023-03-15 16:46:23] [INFO ] Transformed 244 places.
[2023-03-15 16:46:23] [INFO ] Transformed 332 transitions.
[2023-03-15 16:46:23] [INFO ] Found NUPN structural information;
[2023-03-15 16:46:23] [INFO ] Completing missing partition info from NUPN : creating a component with [TestAlone_1_2_3, TestAlone_2_2_3]
[2023-03-15 16:46:23] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 225 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 244 transition count 236
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 148 transition count 236
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 192 place count 148 transition count 188
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 288 place count 100 transition count 188
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 312 place count 88 transition count 176
Applied a total of 312 rules in 42 ms. Remains 88 /244 variables (removed 156) and now considering 176/332 (removed 156) transitions.
[2023-03-15 16:46:23] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
// Phase 1: matrix 152 rows 88 cols
[2023-03-15 16:46:23] [INFO ] Computed 15 place invariants in 11 ms
[2023-03-15 16:46:23] [INFO ] Implicit Places using invariants in 389 ms returned [81, 82, 83, 84]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 434 ms to find 4 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 84/244 places, 176/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 84 /84 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 482 ms. Remains : 84/244 places, 176/332 transitions.
Discarding 4 transitions out of 176. Remains 172
Incomplete random walk after 10000 steps, including 2 resets, run finished after 806 ms. (steps per millisecond=12 ) properties (out of 172) seen :104
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 68) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 60) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 54) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 53) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 45) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 44) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 43) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 41) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 40) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 39) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 38) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 36) 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 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 36) 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 36) 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 36) 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 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 36) 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 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 36) seen :0
Running SMT prover for 36 properties.
[2023-03-15 16:46:25] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
// Phase 1: matrix 152 rows 84 cols
[2023-03-15 16:46:25] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-15 16:46:25] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-15 16:46:25] [INFO ] After 713ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:36
[2023-03-15 16:46:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-15 16:46:26] [INFO ] After 318ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :36
[2023-03-15 16:46:26] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-15 16:46:26] [INFO ] After 266ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :36
[2023-03-15 16:46:26] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 8 ms to minimize.
[2023-03-15 16:46:27] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2023-03-15 16:46:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 201 ms
[2023-03-15 16:46:27] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 2 ms to minimize.
[2023-03-15 16:46:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-03-15 16:46:27] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2023-03-15 16:46:27] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2023-03-15 16:46:27] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 0 ms to minimize.
[2023-03-15 16:46:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 199 ms
[2023-03-15 16:46:27] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2023-03-15 16:46:27] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2023-03-15 16:46:27] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2023-03-15 16:46:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 146 ms
[2023-03-15 16:46:27] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 0 ms to minimize.
[2023-03-15 16:46:27] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2023-03-15 16:46:27] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2023-03-15 16:46:27] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2023-03-15 16:46:27] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2023-03-15 16:46:27] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2023-03-15 16:46:27] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2023-03-15 16:46:27] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 375 ms
[2023-03-15 16:46:27] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2023-03-15 16:46:27] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2023-03-15 16:46:27] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2023-03-15 16:46:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 132 ms
[2023-03-15 16:46:28] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2023-03-15 16:46:28] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2023-03-15 16:46:28] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2023-03-15 16:46:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 197 ms
[2023-03-15 16:46:28] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2023-03-15 16:46:28] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2023-03-15 16:46:28] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2023-03-15 16:46:28] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2023-03-15 16:46:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 271 ms
[2023-03-15 16:46:28] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2023-03-15 16:46:28] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2023-03-15 16:46:28] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2023-03-15 16:46:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 148 ms
[2023-03-15 16:46:28] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2023-03-15 16:46:28] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2023-03-15 16:46:28] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2023-03-15 16:46:28] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2023-03-15 16:46:28] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2023-03-15 16:46:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 269 ms
[2023-03-15 16:46:29] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 2 ms to minimize.
[2023-03-15 16:46:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-15 16:46:29] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2023-03-15 16:46:29] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2023-03-15 16:46:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 106 ms
[2023-03-15 16:46:29] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2023-03-15 16:46:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-15 16:46:29] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2023-03-15 16:46:29] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2023-03-15 16:46:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 130 ms
[2023-03-15 16:46:29] [INFO ] After 3177ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :36
Attempting to minimize the solution found.
Minimization took 359 ms.
[2023-03-15 16:46:30] [INFO ] After 4191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :36
Parikh walk visited 0 properties in 699 ms.
Support contains 41 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 176/176 transitions.
Applied a total of 0 rules in 18 ms. Remains 84 /84 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 84/84 places, 176/176 transitions.
Interrupted random walk after 988866 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 503 ms. (steps per millisecond=198 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 779 ms. (steps per millisecond=128 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 469 ms. (steps per millisecond=213 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 650 ms. (steps per millisecond=153 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 758 ms. (steps per millisecond=131 ) properties (out of 36) 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 36) 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 36) 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 36) 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 36) 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 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 731 ms. (steps per millisecond=136 ) properties (out of 36) 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 36) 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 36) 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 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 563 ms. (steps per millisecond=177 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 447 ms. (steps per millisecond=223 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 496 ms. (steps per millisecond=201 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 435 ms. (steps per millisecond=229 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 504 ms. (steps per millisecond=198 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 434 ms. (steps per millisecond=230 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 561 ms. (steps per millisecond=178 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 477 ms. (steps per millisecond=209 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 495 ms. (steps per millisecond=202 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 600 ms. (steps per millisecond=166 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 546 ms. (steps per millisecond=183 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 523 ms. (steps per millisecond=191 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 476 ms. (steps per millisecond=210 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 556 ms. (steps per millisecond=179 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 649 ms. (steps per millisecond=154 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 576 ms. (steps per millisecond=173 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 644 ms. (steps per millisecond=155 ) properties (out of 36) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 780 ms. (steps per millisecond=128 ) 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 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 752 ms. (steps per millisecond=132 ) properties (out of 35) 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 35) seen :0
Finished probabilistic random walk after 121825 steps, run visited all 35 properties in 1152 ms. (steps per millisecond=105 )
Probabilistic random walk after 121825 steps, saw 24599 distinct states, run finished after 1152 ms. (steps per millisecond=105 ) properties seen :35
Able to resolve query QuasiLiveness after proving 172 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 61224 ms.
ITS solved all properties within timeout

BK_STOP 1678898845142

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