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.r047-smll-165252126400268.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 gold2021
Input is DES-PT-02b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-smll-165252126400268
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 5.2K Apr 29 15:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Apr 29 15:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 29 15:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 29 15:54 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:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 9 07:22 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 69K 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 1652550380135

Running Version 0
[2022-05-14 17:46:23] [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-14 17:46:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 17:46:23] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2022-05-14 17:46:23] [INFO ] Transformed 288 places.
[2022-05-14 17:46:23] [INFO ] Transformed 239 transitions.
[2022-05-14 17:46:23] [INFO ] Found NUPN structural information;
[2022-05-14 17:46:23] [INFO ] Parsed PT model containing 288 places and 239 transitions in 224 ms.
Structural test allowed to assert that 87 places are NOT stable. Took 21 ms.
Incomplete random walk after 10000 steps, including 87 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 201) seen :196
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 239 rows 288 cols
[2022-05-14 17:46:23] [INFO ] Computed 65 place invariants in 39 ms
[2022-05-14 17:46:24] [INFO ] [Real]Absence check using 39 positive place invariants in 36 ms returned sat
[2022-05-14 17:46:24] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 25 ms returned sat
[2022-05-14 17:46:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 17:46:24] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2022-05-14 17:46:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 17:46:24] [INFO ] [Nat]Absence check using 39 positive place invariants in 45 ms returned sat
[2022-05-14 17:46:24] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 20 ms returned sat
[2022-05-14 17:46:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 17:46:24] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2022-05-14 17:46:25] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 4 ms to minimize.
[2022-05-14 17:46:25] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 2 ms to minimize.
[2022-05-14 17:46:25] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2022-05-14 17:46:25] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2022-05-14 17:46:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 541 ms
[2022-05-14 17:46:25] [INFO ] Computed and/alt/rep : 237/406/237 causal constraints (skipped 1 transitions) in 31 ms.
[2022-05-14 17:46:27] [INFO ] Added : 218 causal constraints over 44 iterations in 1982 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-14 17:46:27] [INFO ] [Real]Absence check using 39 positive place invariants in 40 ms returned sat
[2022-05-14 17:46:27] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 19 ms returned sat
[2022-05-14 17:46:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 17:46:27] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2022-05-14 17:46:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 17:46:27] [INFO ] [Nat]Absence check using 39 positive place invariants in 30 ms returned sat
[2022-05-14 17:46:28] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 19 ms returned sat
[2022-05-14 17:46:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 17:46:28] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2022-05-14 17:46:28] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 2 ms to minimize.
[2022-05-14 17:46:28] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2022-05-14 17:46:28] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2022-05-14 17:46:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 314 ms
[2022-05-14 17:46:28] [INFO ] Computed and/alt/rep : 237/406/237 causal constraints (skipped 1 transitions) in 38 ms.
[2022-05-14 17:46:30] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 1 ms to minimize.
[2022-05-14 17:46:31] [INFO ] Deduced a trap composed of 34 places in 170 ms of which 1 ms to minimize.
[2022-05-14 17:46:31] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 0 ms to minimize.
[2022-05-14 17:46:31] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 0 ms to minimize.
[2022-05-14 17:46:31] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 0 ms to minimize.
[2022-05-14 17:46:31] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 0 ms to minimize.
[2022-05-14 17:46:31] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2022-05-14 17:46:31] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2022-05-14 17:46:31] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2022-05-14 17:46:31] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1128 ms
[2022-05-14 17:46:31] [INFO ] Added : 228 causal constraints over 48 iterations in 3360 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-14 17:46:32] [INFO ] [Real]Absence check using 39 positive place invariants in 28 ms returned sat
[2022-05-14 17:46:32] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 21 ms returned sat
[2022-05-14 17:46:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 17:46:32] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2022-05-14 17:46:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 17:46:32] [INFO ] [Nat]Absence check using 39 positive place invariants in 30 ms returned sat
[2022-05-14 17:46:32] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 18 ms returned sat
[2022-05-14 17:46:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 17:46:32] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2022-05-14 17:46:32] [INFO ] Computed and/alt/rep : 237/406/237 causal constraints (skipped 1 transitions) in 29 ms.
[2022-05-14 17:46:34] [INFO ] Deduced a trap composed of 36 places in 152 ms of which 1 ms to minimize.
[2022-05-14 17:46:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2022-05-14 17:46:35] [INFO ] Added : 212 causal constraints over 44 iterations in 2501 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-05-14 17:46:35] [INFO ] [Real]Absence check using 39 positive place invariants in 29 ms returned sat
[2022-05-14 17:46:35] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 20 ms returned sat
[2022-05-14 17:46:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 17:46:35] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2022-05-14 17:46:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 17:46:35] [INFO ] [Nat]Absence check using 39 positive place invariants in 31 ms returned sat
[2022-05-14 17:46:35] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 20 ms returned sat
[2022-05-14 17:46:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 17:46:35] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2022-05-14 17:46:35] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 0 ms to minimize.
[2022-05-14 17:46:36] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 1 ms to minimize.
[2022-05-14 17:46:36] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 1 ms to minimize.
[2022-05-14 17:46:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 398 ms
[2022-05-14 17:46:36] [INFO ] Computed and/alt/rep : 237/406/237 causal constraints (skipped 1 transitions) in 27 ms.
[2022-05-14 17:46:37] [INFO ] Added : 182 causal constraints over 37 iterations in 1216 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-14 17:46:37] [INFO ] [Real]Absence check using 39 positive place invariants in 16 ms returned sat
[2022-05-14 17:46:37] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 12 ms returned sat
[2022-05-14 17:46:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 17:46:37] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2022-05-14 17:46:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 17:46:37] [INFO ] [Nat]Absence check using 39 positive place invariants in 29 ms returned sat
[2022-05-14 17:46:37] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 18 ms returned sat
[2022-05-14 17:46:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 17:46:38] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2022-05-14 17:46:38] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 1 ms to minimize.
[2022-05-14 17:46:38] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2022-05-14 17:46:38] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 0 ms to minimize.
[2022-05-14 17:46:38] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 0 ms to minimize.
[2022-05-14 17:46:38] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 0 ms to minimize.
[2022-05-14 17:46:38] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2022-05-14 17:46:38] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2022-05-14 17:46:38] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 0 ms to minimize.
[2022-05-14 17:46:39] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2022-05-14 17:46:39] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 2 ms to minimize.
[2022-05-14 17:46:39] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 9 ms to minimize.
[2022-05-14 17:46:39] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 1 ms to minimize.
[2022-05-14 17:46:39] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 0 ms to minimize.
[2022-05-14 17:46:39] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1468 ms
[2022-05-14 17:46:39] [INFO ] Computed and/alt/rep : 237/406/237 causal constraints (skipped 1 transitions) in 24 ms.
[2022-05-14 17:46:40] [INFO ] Added : 174 causal constraints over 35 iterations in 1064 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
Incomplete Parikh walk after 40600 steps, including 457 resets, run finished after 132 ms. (steps per millisecond=307 ) properties (out of 5) seen :3 could not realise parikh vector
Incomplete Parikh walk after 46100 steps, including 910 resets, run finished after 90 ms. (steps per millisecond=512 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 37500 steps, including 726 resets, run finished after 74 ms. (steps per millisecond=506 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 20800 steps, including 185 resets, run finished after 50 ms. (steps per millisecond=416 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 19900 steps, including 392 resets, run finished after 41 ms. (steps per millisecond=485 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 288 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 288/288 places, 239/239 transitions.
Graph (complete) has 525 edges and 288 vertex of which 282 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 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 282 transition count 212
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 261 transition count 212
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 261 transition count 203
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 252 transition count 203
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 233 transition count 184
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 233 transition count 184
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 233 transition count 183
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 232 transition count 183
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 217 transition count 168
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 217 transition count 168
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 217 transition count 153
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 215 transition count 152
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 215 transition count 149
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 212 transition count 149
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 135 transition count 72
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 133 transition count 74
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 133 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 132 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 131 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 319 place count 130 transition count 72
Applied a total of 319 rules in 213 ms. Remains 130 /288 variables (removed 158) and now considering 72/239 (removed 167) transitions.
Finished structural reductions, in 1 iterations. Remains : 130/288 places, 72/239 transitions.
[2022-05-14 17:46:41] [INFO ] Flatten gal took : 90 ms
[2022-05-14 17:46:41] [INFO ] Flatten gal took : 31 ms
[2022-05-14 17:46:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10662731587893212361.gal : 17 ms
[2022-05-14 17:46:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10588942166196585506.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality10662731587893212361.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10588942166196585506.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality10662731587893212361.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10588942166196585506.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality10588942166196585506.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 41
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :41 after 80
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :80 after 992
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :992 after 2305
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2305 after 14822
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :29644 after 123135
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :123135 after 1.11502e+07
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.11502e+07 after 4.27202e+08
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4.27202e+08 after 6.14978e+08
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :6.14978e+08 after 8.44403e+08
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :8.44403e+08 after 1.91406e+09
Invariant property smplace_6 does not hold.
Invariant property smplace_2 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6.04419e+09,8.14291,167092,2,186020,21,771124,6,0,588,676107,0
Total reachable state count : 6044186444

Verifying 2 reachability properties.
Invariant property smplace_2 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_2,1348,8.17996,167092,2,357,21,771124,7,0,591,676107,0
Invariant property smplace_6 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_6,3024,8.21532,167092,2,596,21,771124,8,0,593,676107,0
Able to resolve query StableMarking after proving 202 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST DECISION_DIAGRAMS COLLATERAL_PROCESSING TOPOLOGICAL

BK_STOP 1652550411124

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-02b"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is DES-PT-02b, 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 r047-smll-165252126400268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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