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.r028-tall-165251936100164.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 BusinessProcesses-PT-15, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-tall-165251936100164
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 7.6K Apr 29 23:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 29 23:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Apr 29 23:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K Apr 29 23:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 29 23:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 29 23:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 29 23:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 29 23:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 157K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655083301060

Running Version 0
[2022-06-13 01:21:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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, 3600]
[2022-06-13 01:21:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 01:21:42] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2022-06-13 01:21:42] [INFO ] Transformed 630 places.
[2022-06-13 01:21:42] [INFO ] Transformed 566 transitions.
[2022-06-13 01:21:42] [INFO ] Found NUPN structural information;
[2022-06-13 01:21:42] [INFO ] Parsed PT model containing 630 places and 566 transitions in 134 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 20 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 68 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Probabilistic random walk after 1000000 steps, saw 155225 distinct states, run finished after 3691 ms. (steps per millisecond=270 ) properties seen :{1=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 12=1, 14=1}
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 6 properties.
// Phase 1: matrix 562 rows 626 cols
[2022-06-13 01:21:46] [INFO ] Computed 102 place invariants in 37 ms
[2022-06-13 01:21:47] [INFO ] [Real]Absence check using 61 positive place invariants in 36 ms returned sat
[2022-06-13 01:21:47] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 21 ms returned sat
[2022-06-13 01:21:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:21:47] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2022-06-13 01:21:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:21:47] [INFO ] [Real]Absence check using 61 positive place invariants in 105 ms returned sat
[2022-06-13 01:21:47] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 16 ms returned sat
[2022-06-13 01:21:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:21:48] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2022-06-13 01:21:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:21:48] [INFO ] [Real]Absence check using 61 positive place invariants in 30 ms returned sat
[2022-06-13 01:21:48] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 24 ms returned sat
[2022-06-13 01:21:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:21:49] [INFO ] [Real]Absence check using state equation in 1019 ms returned sat
[2022-06-13 01:21:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:21:49] [INFO ] [Real]Absence check using 61 positive place invariants in 34 ms returned sat
[2022-06-13 01:21:49] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 31 ms returned sat
[2022-06-13 01:21:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:21:51] [INFO ] [Real]Absence check using state equation in 1583 ms returned sat
[2022-06-13 01:21:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:21:51] [INFO ] [Nat]Absence check using 61 positive place invariants in 42 ms returned sat
[2022-06-13 01:21:51] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 8 ms returned unsat
[2022-06-13 01:21:51] [INFO ] [Real]Absence check using 61 positive place invariants in 23 ms returned sat
[2022-06-13 01:21:51] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 16 ms returned sat
[2022-06-13 01:21:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:21:51] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2022-06-13 01:21:52] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 5 ms to minimize.
[2022-06-13 01:21:52] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 1 ms to minimize.
[2022-06-13 01:21:52] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 1 ms to minimize.
[2022-06-13 01:21:52] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 1 ms to minimize.
[2022-06-13 01:21:52] [INFO ] Deduced a trap composed of 143 places in 181 ms of which 1 ms to minimize.
[2022-06-13 01:21:53] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 0 ms to minimize.
[2022-06-13 01:21:53] [INFO ] Deduced a trap composed of 63 places in 154 ms of which 1 ms to minimize.
[2022-06-13 01:21:53] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 1 ms to minimize.
[2022-06-13 01:21:53] [INFO ] Deduced a trap composed of 159 places in 192 ms of which 0 ms to minimize.
[2022-06-13 01:21:53] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 1 ms to minimize.
[2022-06-13 01:21:53] [INFO ] Deduced a trap composed of 133 places in 118 ms of which 0 ms to minimize.
[2022-06-13 01:21:54] [INFO ] Deduced a trap composed of 135 places in 115 ms of which 1 ms to minimize.
[2022-06-13 01:21:54] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 1 ms to minimize.
[2022-06-13 01:21:54] [INFO ] Deduced a trap composed of 151 places in 116 ms of which 1 ms to minimize.
[2022-06-13 01:21:54] [INFO ] Deduced a trap composed of 143 places in 126 ms of which 2 ms to minimize.
[2022-06-13 01:21:54] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 0 ms to minimize.
[2022-06-13 01:21:54] [INFO ] Deduced a trap composed of 147 places in 131 ms of which 1 ms to minimize.
[2022-06-13 01:21:54] [INFO ] Deduced a trap composed of 147 places in 134 ms of which 0 ms to minimize.
[2022-06-13 01:21:55] [INFO ] Deduced a trap composed of 141 places in 131 ms of which 1 ms to minimize.
[2022-06-13 01:21:55] [INFO ] Deduced a trap composed of 140 places in 116 ms of which 0 ms to minimize.
[2022-06-13 01:21:55] [INFO ] Deduced a trap composed of 141 places in 123 ms of which 1 ms to minimize.
[2022-06-13 01:21:55] [INFO ] Deduced a trap composed of 149 places in 136 ms of which 14 ms to minimize.
[2022-06-13 01:21:55] [INFO ] Deduced a trap composed of 157 places in 120 ms of which 1 ms to minimize.
[2022-06-13 01:21:55] [INFO ] Deduced a trap composed of 138 places in 111 ms of which 0 ms to minimize.
[2022-06-13 01:21:56] [INFO ] Deduced a trap composed of 139 places in 118 ms of which 1 ms to minimize.
[2022-06-13 01:21:56] [INFO ] Deduced a trap composed of 143 places in 111 ms of which 1 ms to minimize.
[2022-06-13 01:21:56] [INFO ] Deduced a trap composed of 144 places in 112 ms of which 0 ms to minimize.
[2022-06-13 01:21:56] [INFO ] Deduced a trap composed of 151 places in 107 ms of which 0 ms to minimize.
[2022-06-13 01:21:56] [INFO ] Deduced a trap composed of 148 places in 108 ms of which 1 ms to minimize.
[2022-06-13 01:21:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2022-06-13 01:21:56] [INFO ] [Real]Absence check using 61 positive place invariants in 32 ms returned sat
[2022-06-13 01:21:56] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 30 ms returned sat
[2022-06-13 01:21:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:21:57] [INFO ] [Real]Absence check using state equation in 908 ms returned sat
[2022-06-13 01:21:57] [INFO ] Solution in real domain found non-integer solution.
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 1 different solutions.
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 626/626 places, 562/562 transitions.
Graph (trivial) has 360 edges and 626 vertex of which 7 / 626 are part of one of the 1 SCC in 10 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1267 edges and 620 vertex of which 616 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 142 place count 616 transition count 413
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 282 place count 476 transition count 413
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 282 place count 476 transition count 317
Deduced a syphon composed of 96 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 212 rules applied. Total rules applied 494 place count 360 transition count 317
Discarding 81 places :
Symmetric choice reduction at 2 with 81 rule applications. Total rules 575 place count 279 transition count 236
Iterating global reduction 2 with 81 rules applied. Total rules applied 656 place count 279 transition count 236
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 656 place count 279 transition count 228
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 674 place count 269 transition count 228
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 866 place count 172 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 868 place count 171 transition count 137
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 870 place count 171 transition count 135
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 872 place count 169 transition count 135
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 873 place count 169 transition count 135
Applied a total of 873 rules in 155 ms. Remains 169 /626 variables (removed 457) and now considering 135/562 (removed 427) transitions.
Finished structural reductions, in 1 iterations. Remains : 169/626 places, 135/562 transitions.
[2022-06-13 01:21:58] [INFO ] Flatten gal took : 78 ms
[2022-06-13 01:21:58] [INFO ] Flatten gal took : 31 ms
[2022-06-13 01:21:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3407859764189901599.gal : 11 ms
[2022-06-13 01:21:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3661864468217915448.prop : 0 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/ReachabilityCardinality3407859764189901599.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3661864468217915448.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/ReachabilityCardinality3407859764189901599.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3661864468217915448.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality3661864468217915448.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 21
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :21 after 41
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :41 after 81
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :81 after 233
Invariant property BusinessProcesses-PT-15-ReachabilityCardinality-11 does not hold.
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 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,865,0.079799,5752,2,1209,11,4292,6,0,811,2066,0
Total reachable state count : 865

Verifying 1 reachability properties.
Invariant property BusinessProcesses-PT-15-ReachabilityCardinality-11 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
BusinessProcesses-PT-15-ReachabilityCardinality-11,1,0.080917,5752,2,170,11,4292,7,0,817,2066,0
All properties solved without resorting to model-checking.

BK_STOP 1655083319238

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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 ReachabilityCardinality -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 3600 -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="BusinessProcesses-PT-15"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 BusinessProcesses-PT-15, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r028-tall-165251936100164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-15.tgz
mv BusinessProcesses-PT-15 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;