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

About the Execution of 2021-gold for BusinessProcesses-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
250.048 17481.00 26418.00 1390.60 FFTTFFTFTFTTFFTT 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.r028-tall-165251936100149.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-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-tall-165251936100149
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 5.5K Apr 30 00:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 30 00:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Apr 30 00:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Apr 30 00:02 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 4.0K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 30 00:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Apr 30 00:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 30 00:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 30 00:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:09 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 131K 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-10-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655083131958

Running Version 0
[2022-06-13 01:18:55] [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:18:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 01:18:55] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2022-06-13 01:18:55] [INFO ] Transformed 518 places.
[2022-06-13 01:18:55] [INFO ] Transformed 471 transitions.
[2022-06-13 01:18:55] [INFO ] Found NUPN structural information;
[2022-06-13 01:18:55] [INFO ] Parsed PT model containing 518 places and 471 transitions in 121 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 84 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 13) seen :4
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :1
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :1
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :1
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 471 rows 518 cols
[2022-06-13 01:18:55] [INFO ] Computed 85 place invariants in 36 ms
[2022-06-13 01:18:55] [INFO ] [Real]Absence check using 48 positive place invariants in 41 ms returned sat
[2022-06-13 01:18:55] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 19 ms returned sat
[2022-06-13 01:18:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:18:56] [INFO ] [Real]Absence check using state equation in 543 ms returned sat
[2022-06-13 01:18:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:18:56] [INFO ] [Real]Absence check using 48 positive place invariants in 30 ms returned sat
[2022-06-13 01:18:56] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 19 ms returned sat
[2022-06-13 01:18:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:18:57] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2022-06-13 01:18:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:18:57] [INFO ] [Nat]Absence check using 48 positive place invariants in 23 ms returned sat
[2022-06-13 01:18:57] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 15 ms returned sat
[2022-06-13 01:18:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:18:57] [INFO ] [Nat]Absence check using state equation in 429 ms returned sat
[2022-06-13 01:18:57] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 3 ms to minimize.
[2022-06-13 01:18:58] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 1 ms to minimize.
[2022-06-13 01:18:58] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 1 ms to minimize.
[2022-06-13 01:18:58] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 2 ms to minimize.
[2022-06-13 01:18:58] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 1 ms to minimize.
[2022-06-13 01:18:58] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2022-06-13 01:18:58] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 0 ms to minimize.
[2022-06-13 01:18:58] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 0 ms to minimize.
[2022-06-13 01:18:58] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 0 ms to minimize.
[2022-06-13 01:18:59] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2022-06-13 01:18:59] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 0 ms to minimize.
[2022-06-13 01:18:59] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 0 ms to minimize.
[2022-06-13 01:18:59] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 0 ms to minimize.
[2022-06-13 01:18:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 1579 ms
[2022-06-13 01:18:59] [INFO ] [Real]Absence check using 48 positive place invariants in 28 ms returned sat
[2022-06-13 01:18:59] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 18 ms returned sat
[2022-06-13 01:18:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:19:00] [INFO ] [Real]Absence check using state equation in 518 ms returned sat
[2022-06-13 01:19:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:19:00] [INFO ] [Real]Absence check using 48 positive place invariants in 22 ms returned sat
[2022-06-13 01:19:00] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 10 ms returned sat
[2022-06-13 01:19:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:19:00] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2022-06-13 01:19:00] [INFO ] Deduced a trap composed of 116 places in 125 ms of which 0 ms to minimize.
[2022-06-13 01:19:00] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 1 ms to minimize.
[2022-06-13 01:19:00] [INFO ] Deduced a trap composed of 122 places in 121 ms of which 1 ms to minimize.
[2022-06-13 01:19:00] [INFO ] Deduced a trap composed of 123 places in 128 ms of which 0 ms to minimize.
[2022-06-13 01:19:01] [INFO ] Deduced a trap composed of 137 places in 120 ms of which 1 ms to minimize.
[2022-06-13 01:19:01] [INFO ] Deduced a trap composed of 130 places in 116 ms of which 0 ms to minimize.
[2022-06-13 01:19:01] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 1 ms to minimize.
[2022-06-13 01:19:01] [INFO ] Deduced a trap composed of 133 places in 112 ms of which 1 ms to minimize.
[2022-06-13 01:19:01] [INFO ] Deduced a trap composed of 130 places in 110 ms of which 1 ms to minimize.
[2022-06-13 01:19:01] [INFO ] Deduced a trap composed of 131 places in 109 ms of which 0 ms to minimize.
[2022-06-13 01:19:01] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 1 ms to minimize.
[2022-06-13 01:19:02] [INFO ] Deduced a trap composed of 128 places in 127 ms of which 1 ms to minimize.
[2022-06-13 01:19:02] [INFO ] Deduced a trap composed of 124 places in 118 ms of which 1 ms to minimize.
[2022-06-13 01:19:02] [INFO ] Deduced a trap composed of 124 places in 116 ms of which 1 ms to minimize.
[2022-06-13 01:19:02] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 0 ms to minimize.
[2022-06-13 01:19:02] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 0 ms to minimize.
[2022-06-13 01:19:02] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 1 ms to minimize.
[2022-06-13 01:19:03] [INFO ] Deduced a trap composed of 133 places in 123 ms of which 0 ms to minimize.
[2022-06-13 01:19:03] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 0 ms to minimize.
[2022-06-13 01:19:03] [INFO ] Deduced a trap composed of 126 places in 117 ms of which 0 ms to minimize.
[2022-06-13 01:19:03] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 1 ms to minimize.
[2022-06-13 01:19:03] [INFO ] Deduced a trap composed of 134 places in 121 ms of which 5 ms to minimize.
[2022-06-13 01:19:03] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 1 ms to minimize.
[2022-06-13 01:19:03] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 0 ms to minimize.
[2022-06-13 01:19:04] [INFO ] Deduced a trap composed of 132 places in 111 ms of which 0 ms to minimize.
[2022-06-13 01:19:04] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 0 ms to minimize.
[2022-06-13 01:19:04] [INFO ] Deduced a trap composed of 122 places in 119 ms of which 0 ms to minimize.
[2022-06-13 01:19:04] [INFO ] Deduced a trap composed of 124 places in 115 ms of which 1 ms to minimize.
[2022-06-13 01:19:04] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 1 ms to minimize.
[2022-06-13 01:19:04] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 1 ms to minimize.
[2022-06-13 01:19:04] [INFO ] Deduced a trap composed of 126 places in 122 ms of which 0 ms to minimize.
[2022-06-13 01:19:05] [INFO ] Deduced a trap composed of 123 places in 115 ms of which 1 ms to minimize.
[2022-06-13 01:19:05] [INFO ] Deduced a trap composed of 120 places in 123 ms of which 0 ms to minimize.
[2022-06-13 01:19:05] [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 3
[2022-06-13 01:19:05] [INFO ] [Real]Absence check using 48 positive place invariants in 12 ms returned unsat
[2022-06-13 01:19:05] [INFO ] [Real]Absence check using 48 positive place invariants in 22 ms returned sat
[2022-06-13 01:19:05] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 25 ms returned sat
[2022-06-13 01:19:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:19:06] [INFO ] [Real]Absence check using state equation in 681 ms returned sat
[2022-06-13 01:19:06] [INFO ] Solution in real domain found non-integer solution.
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 1 different solutions.
Support contains 6 out of 518 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 518/518 places, 471/471 transitions.
Graph (trivial) has 290 edges and 518 vertex of which 7 / 518 are part of one of the 1 SCC in 14 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1063 edges and 512 vertex of which 510 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 113 place count 510 transition count 351
Reduce places removed 111 places and 0 transitions.
Iterating post reduction 1 with 111 rules applied. Total rules applied 224 place count 399 transition count 351
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 224 place count 399 transition count 275
Deduced a syphon composed of 76 places in 2 ms
Ensure Unique test removed 12 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 388 place count 311 transition count 275
Discarding 65 places :
Symmetric choice reduction at 2 with 65 rule applications. Total rules 453 place count 246 transition count 210
Iterating global reduction 2 with 65 rules applied. Total rules applied 518 place count 246 transition count 210
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 518 place count 246 transition count 203
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 533 place count 238 transition count 203
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 157 rules applied. Total rules applied 690 place count 158 transition count 126
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 2 with 2 rules applied. Total rules applied 692 place count 157 transition count 129
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 694 place count 157 transition count 127
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 696 place count 155 transition count 127
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 697 place count 155 transition count 127
Applied a total of 697 rules in 147 ms. Remains 155 /518 variables (removed 363) and now considering 127/471 (removed 344) transitions.
Finished structural reductions, in 1 iterations. Remains : 155/518 places, 127/471 transitions.
[2022-06-13 01:19:06] [INFO ] Flatten gal took : 69 ms
[2022-06-13 01:19:06] [INFO ] Flatten gal took : 18 ms
[2022-06-13 01:19:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality858715189739101584.gal : 11 ms
[2022-06-13 01:19:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15326448769076880521.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/ReachabilityCardinality858715189739101584.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15326448769076880521.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/ReachabilityCardinality858715189739101584.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15326448769076880521.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality15326448769076880521.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 13
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :13 after 49
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :49 after 127
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :127 after 436
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :436 after 2261
Reachability property BusinessProcesses-PT-10-ReachabilityCardinality-08 is true.
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-08 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 257 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,5949,0.304447,13040,2,4769,13,28874,6,0,747,14251,0
Total reachable state count : 5949

Verifying 1 reachability properties.
Reachability property BusinessProcesses-PT-10-ReachabilityCardinality-08 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-10-ReachabilityCardinality-08,14,0.349027,13040,2,233,13,28874,7,0,764,14251,0
All properties solved without resorting to model-checking.

BK_STOP 1655083149439

--------------------
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-10"
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-10, 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-165251936100149"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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