Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r026-tajo-162038143800374.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-07, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143800374
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 100K May 5 16:51 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-07-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620543523523

Running Version 0
[2021-05-09 06:58:45] [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]
[2021-05-09 06:58:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 06:58:46] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2021-05-09 06:58:46] [INFO ] Transformed 386 places.
[2021-05-09 06:58:46] [INFO ] Transformed 360 transitions.
[2021-05-09 06:58:46] [INFO ] Found NUPN structural information;
[2021-05-09 06:58:46] [INFO ] Parsed PT model containing 386 places and 360 transitions in 153 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 37 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 110 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 15) seen :6
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :1
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 360 rows 386 cols
[2021-05-09 06:58:46] [INFO ] Computed 62 place invariants in 32 ms
[2021-05-09 06:58:46] [INFO ] [Real]Absence check using 33 positive place invariants in 17 ms returned sat
[2021-05-09 06:58:46] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 9 ms returned sat
[2021-05-09 06:58:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:58:46] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2021-05-09 06:58:47] [INFO ] Deduced a trap composed of 12 places in 229 ms of which 5 ms to minimize.
[2021-05-09 06:58:47] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 1 ms to minimize.
[2021-05-09 06:58:47] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 1 ms to minimize.
[2021-05-09 06:58:47] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 2 ms to minimize.
[2021-05-09 06:58:47] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 1 ms to minimize.
[2021-05-09 06:58:48] [INFO ] Deduced a trap composed of 21 places in 171 ms of which 1 ms to minimize.
[2021-05-09 06:58:48] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1101 ms
[2021-05-09 06:58:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:58:48] [INFO ] [Nat]Absence check using 33 positive place invariants in 19 ms returned sat
[2021-05-09 06:58:48] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 9 ms returned sat
[2021-05-09 06:58:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:58:48] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2021-05-09 06:58:48] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 1 ms to minimize.
[2021-05-09 06:58:48] [INFO ] Deduced a trap composed of 22 places in 192 ms of which 1 ms to minimize.
[2021-05-09 06:58:48] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 1 ms to minimize.
[2021-05-09 06:58:49] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 0 ms to minimize.
[2021-05-09 06:58:49] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 0 ms to minimize.
[2021-05-09 06:58:49] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 0 ms to minimize.
[2021-05-09 06:58:49] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 955 ms
[2021-05-09 06:58:49] [INFO ] Computed and/alt/rep : 339/625/339 causal constraints (skipped 20 transitions) in 34 ms.
[2021-05-09 06:58:50] [INFO ] Deduced a trap composed of 113 places in 114 ms of which 1 ms to minimize.
[2021-05-09 06:58:50] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 1 ms to minimize.
[2021-05-09 06:58:51] [INFO ] Deduced a trap composed of 114 places in 111 ms of which 0 ms to minimize.
[2021-05-09 06:58:51] [INFO ] Deduced a trap composed of 104 places in 94 ms of which 1 ms to minimize.
[2021-05-09 06:58:51] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 0 ms to minimize.
[2021-05-09 06:58:51] [INFO ] Deduced a trap composed of 100 places in 94 ms of which 1 ms to minimize.
[2021-05-09 06:58:51] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 0 ms to minimize.
[2021-05-09 06:58:51] [INFO ] Deduced a trap composed of 106 places in 120 ms of which 0 ms to minimize.
[2021-05-09 06:58:51] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 1 ms to minimize.
[2021-05-09 06:58:52] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 1 ms to minimize.
[2021-05-09 06:58:52] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 1 ms to minimize.
[2021-05-09 06:58:52] [INFO ] Deduced a trap composed of 90 places in 127 ms of which 0 ms to minimize.
[2021-05-09 06:58:52] [INFO ] Deduced a trap composed of 102 places in 145 ms of which 1 ms to minimize.
[2021-05-09 06:58:52] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 1 ms to minimize.
[2021-05-09 06:58:52] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2138 ms
[2021-05-09 06:58:52] [INFO ] Added : 215 causal constraints over 44 iterations in 3569 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
[2021-05-09 06:58:53] [INFO ] [Real]Absence check using 33 positive place invariants in 21 ms returned sat
[2021-05-09 06:58:53] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 8 ms returned unsat
[2021-05-09 06:58:53] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned sat
[2021-05-09 06:58:53] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 11 ms returned sat
[2021-05-09 06:58:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:58:53] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2021-05-09 06:58:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:58:53] [INFO ] [Real]Absence check using 33 positive place invariants in 15 ms returned sat
[2021-05-09 06:58:53] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 13 ms returned sat
[2021-05-09 06:58:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:58:53] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2021-05-09 06:58:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:58:53] [INFO ] [Real]Absence check using 33 positive place invariants in 18 ms returned sat
[2021-05-09 06:58:53] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 8 ms returned unsat
[2021-05-09 06:58:54] [INFO ] [Real]Absence check using 33 positive place invariants in 28 ms returned sat
[2021-05-09 06:58:54] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 16 ms returned sat
[2021-05-09 06:58:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:58:54] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2021-05-09 06:58:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:58:54] [INFO ] [Real]Absence check using 33 positive place invariants in 16 ms returned sat
[2021-05-09 06:58:54] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 11 ms returned sat
[2021-05-09 06:58:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:58:54] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2021-05-09 06:58:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:58:54] [INFO ] [Nat]Absence check using 33 positive place invariants in 15 ms returned sat
[2021-05-09 06:58:54] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 9 ms returned sat
[2021-05-09 06:58:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:58:54] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2021-05-09 06:58:55] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 1 ms to minimize.
[2021-05-09 06:58:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 135 ms
[2021-05-09 06:58:55] [INFO ] [Real]Absence check using 33 positive place invariants in 13 ms returned sat
[2021-05-09 06:58:55] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 12 ms returned sat
[2021-05-09 06:58:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:58:55] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2021-05-09 06:58:55] [INFO ] Solution in real domain found non-integer solution.
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 1 different solutions.
Incomplete Parikh walk after 23800 steps, including 274 resets, run finished after 63 ms. (steps per millisecond=377 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 5 out of 386 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 386/386 places, 360/360 transitions.
Graph (trivial) has 212 edges and 386 vertex of which 7 / 386 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 805 edges and 380 vertex of which 378 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 81 place count 378 transition count 272
Reduce places removed 79 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 81 rules applied. Total rules applied 162 place count 299 transition count 270
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 164 place count 297 transition count 270
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 164 place count 297 transition count 214
Deduced a syphon composed of 56 places in 2 ms
Ensure Unique test removed 8 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 284 place count 233 transition count 214
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 328 place count 189 transition count 170
Iterating global reduction 3 with 44 rules applied. Total rules applied 372 place count 189 transition count 170
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 372 place count 189 transition count 164
Deduced a syphon composed of 6 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 385 place count 182 transition count 164
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 503 place count 122 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 505 place count 121 transition count 109
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 507 place count 121 transition count 107
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 509 place count 119 transition count 107
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 510 place count 119 transition count 107
Applied a total of 510 rules in 126 ms. Remains 119 /386 variables (removed 267) and now considering 107/360 (removed 253) transitions.
Finished structural reductions, in 1 iterations. Remains : 119/386 places, 107/360 transitions.
[2021-05-09 06:58:55] [INFO ] Flatten gal took : 75 ms
[2021-05-09 06:58:55] [INFO ] Flatten gal took : 25 ms
[2021-05-09 06:58:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12728226011101677883.gal : 11 ms
[2021-05-09 06:58:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1743763267506756209.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/ReachabilityCardinality12728226011101677883.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1743763267506756209.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/ReachabilityCardinality12728226011101677883.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1743763267506756209.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality1743763267506756209.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 17
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :17 after 31
Reachability property BusinessProcesses-PT-07-ReachabilityCardinality-00 is true.
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-00 TRUE 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 9 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,95,0.035701,5020,2,520,8,2139,6,0,583,984,0
Total reachable state count : 95

Verifying 1 reachability properties.
Reachability property BusinessProcesses-PT-07-ReachabilityCardinality-00 is true.

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-07-ReachabilityCardinality-00,1,0.036406,5392,2,120,8,2139,7,0,596,984,0
All properties solved without resorting to model-checking.

BK_STOP 1620543536241

--------------------
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-07"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BusinessProcesses-PT-07, 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 r026-tajo-162038143800374"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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