fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r085-tall-165260115500108
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for DoubleExponent-PT-002

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
254.943 133943.00 281015.00 257.70 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/mcc2022-input.r085-tall-165260115500108.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DoubleExponent-PT-002, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r085-tall-165260115500108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 6.0K Apr 29 13:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 29 13:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 13:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 13:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 33K May 10 09:33 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 1652702003738

Running Version 202205111006
[2022-05-16 11:53:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2022-05-16 11:53:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 11:53:25] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2022-05-16 11:53:25] [INFO ] Transformed 110 places.
[2022-05-16 11:53:25] [INFO ] Transformed 98 transitions.
[2022-05-16 11:53:25] [INFO ] Parsed PT model containing 110 places and 98 transitions in 160 ms.
Structural test allowed to assert that 11 places are NOT stable. Took 6 ms.
Incomplete random walk after 10000 steps, including 334 resets, run finished after 513 ms. (steps per millisecond=19 ) properties (out of 99) seen :44
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 23 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 55) seen :0
Running SMT prover for 55 properties.
// Phase 1: matrix 98 rows 110 cols
[2022-05-16 11:53:27] [INFO ] Computed 14 place invariants in 16 ms
[2022-05-16 11:53:27] [INFO ] After 306ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:55
[2022-05-16 11:53:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2022-05-16 11:53:27] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2022-05-16 11:53:28] [INFO ] After 293ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :55
[2022-05-16 11:53:28] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 4 ms to minimize.
[2022-05-16 11:53:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2022-05-16 11:53:28] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 2 ms to minimize.
[2022-05-16 11:53:28] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2022-05-16 11:53:28] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2022-05-16 11:53:28] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 1 ms to minimize.
[2022-05-16 11:53:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 311 ms
[2022-05-16 11:53:29] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2022-05-16 11:53:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2022-05-16 11:53:29] [INFO ] Deduced a trap composed of 38 places in 383 ms of which 1 ms to minimize.
[2022-05-16 11:53:29] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2022-05-16 11:53:29] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2022-05-16 11:53:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 532 ms
[2022-05-16 11:53:29] [INFO ] After 1843ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :55
Attempting to minimize the solution found.
Minimization took 359 ms.
[2022-05-16 11:53:30] [INFO ] After 2523ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :55
Fused 55 Parikh solutions to 50 different solutions.
Parikh walk visited 0 properties in 2097 ms.
Support contains 55 out of 110 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 110/110 places, 98/98 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 110 transition count 89
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 101 transition count 89
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 101 transition count 87
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 99 transition count 87
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 50 place count 85 transition count 73
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 83 transition count 73
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 83 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 82 transition count 72
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 59 place count 82 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 81 transition count 71
Applied a total of 60 rules in 30 ms. Remains 81 /110 variables (removed 29) and now considering 71/98 (removed 27) transitions.
Finished structural reductions, in 1 iterations. Remains : 81/110 places, 71/98 transitions.
Incomplete random walk after 1000000 steps, including 127648 resets, run finished after 28635 ms. (steps per millisecond=34 ) properties (out of 55) seen :38
Incomplete Best-First random walk after 100000 steps, including 8533 resets, run finished after 1796 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8400 resets, run finished after 1880 ms. (steps per millisecond=53 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8398 resets, run finished after 1903 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8514 resets, run finished after 1824 ms. (steps per millisecond=54 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8455 resets, run finished after 1605 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8470 resets, run finished after 1623 ms. (steps per millisecond=61 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8390 resets, run finished after 1681 ms. (steps per millisecond=59 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8360 resets, run finished after 1672 ms. (steps per millisecond=59 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8526 resets, run finished after 1559 ms. (steps per millisecond=64 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8465 resets, run finished after 2372 ms. (steps per millisecond=42 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8427 resets, run finished after 1633 ms. (steps per millisecond=61 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8398 resets, run finished after 2513 ms. (steps per millisecond=39 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8459 resets, run finished after 1609 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8490 resets, run finished after 1727 ms. (steps per millisecond=57 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8429 resets, run finished after 2230 ms. (steps per millisecond=44 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8430 resets, run finished after 2044 ms. (steps per millisecond=48 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8337 resets, run finished after 1993 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 71 rows 81 cols
[2022-05-16 11:54:32] [INFO ] Computed 14 place invariants in 8 ms
[2022-05-16 11:54:32] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2022-05-16 11:54:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-16 11:54:32] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2022-05-16 11:54:32] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2022-05-16 11:54:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 11:54:32] [INFO ] After 62ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2022-05-16 11:54:32] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2022-05-16 11:54:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2022-05-16 11:54:32] [INFO ] After 220ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 58 ms.
[2022-05-16 11:54:33] [INFO ] After 516ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 887 ms.
Support contains 17 out of 81 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 81/81 places, 71/71 transitions.
Graph (complete) has 168 edges and 81 vertex of which 78 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Discarding 3 places :
Also discarding 0 output 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 12 place count 78 transition count 60
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 67 transition count 60
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 23 place count 67 transition count 59
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 66 transition count 59
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 37 place count 60 transition count 53
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 60 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 59 transition count 52
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 43 place count 59 transition count 52
Applied a total of 43 rules in 18 ms. Remains 59 /81 variables (removed 22) and now considering 52/71 (removed 19) transitions.
Finished structural reductions, in 1 iterations. Remains : 59/81 places, 52/71 transitions.
Incomplete random walk after 1000000 steps, including 128316 resets, run finished after 29203 ms. (steps per millisecond=34 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8518 resets, run finished after 1975 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8521 resets, run finished after 1962 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8419 resets, run finished after 1958 ms. (steps per millisecond=51 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8446 resets, run finished after 1670 ms. (steps per millisecond=59 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8535 resets, run finished after 1757 ms. (steps per millisecond=56 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8491 resets, run finished after 1769 ms. (steps per millisecond=56 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8519 resets, run finished after 2232 ms. (steps per millisecond=44 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8507 resets, run finished after 2426 ms. (steps per millisecond=41 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8554 resets, run finished after 1662 ms. (steps per millisecond=60 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8482 resets, run finished after 1664 ms. (steps per millisecond=60 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8558 resets, run finished after 1963 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8404 resets, run finished after 2220 ms. (steps per millisecond=45 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8547 resets, run finished after 1518 ms. (steps per millisecond=65 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8463 resets, run finished after 1746 ms. (steps per millisecond=57 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8492 resets, run finished after 2551 ms. (steps per millisecond=39 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8506 resets, run finished after 2603 ms. (steps per millisecond=38 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8508 resets, run finished after 2769 ms. (steps per millisecond=36 ) properties (out of 17) seen :0
Finished probabilistic random walk after 2252 steps, run visited all 17 properties in 45 ms. (steps per millisecond=50 )
Probabilistic random walk after 2252 steps, saw 1155 distinct states, run finished after 46 ms. (steps per millisecond=48 ) properties seen :17
Able to resolve query StableMarking after proving 100 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 132725 ms.

BK_STOP 1652702137681

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination StableMarking -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="DoubleExponent-PT-002"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-002, 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 r085-tall-165260115500108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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