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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 7.1K Apr 30 00:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 30 00:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 30 00:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 30 00:04 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.1K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 30 00:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 30 00:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 30 00:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 30 00:06 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 177K 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-18-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655083397715

Running Version 0
[2022-06-13 01:23:19] [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:23:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 01:23:21] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2022-06-13 01:23:21] [INFO ] Transformed 717 places.
[2022-06-13 01:23:21] [INFO ] Transformed 642 transitions.
[2022-06-13 01:23:21] [INFO ] Found NUPN structural information;
[2022-06-13 01:23:21] [INFO ] Parsed PT model containing 717 places and 642 transitions in 2356 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 15 places in 21 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 52 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 15) seen :7
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :1
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 627 rows 702 cols
[2022-06-13 01:23:22] [INFO ] Computed 114 place invariants in 50 ms
[2022-06-13 01:23:22] [INFO ] [Real]Absence check using 73 positive place invariants in 56 ms returned sat
[2022-06-13 01:23:22] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 30 ms returned sat
[2022-06-13 01:23:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:24] [INFO ] [Real]Absence check using state equation in 1639 ms returned sat
[2022-06-13 01:23:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:23:24] [INFO ] [Nat]Absence check using 73 positive place invariants in 41 ms returned sat
[2022-06-13 01:23:24] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 17 ms returned sat
[2022-06-13 01:23:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:24] [INFO ] [Nat]Absence check using state equation in 485 ms returned sat
[2022-06-13 01:23:25] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 4 ms to minimize.
[2022-06-13 01:23:25] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 2 ms to minimize.
[2022-06-13 01:23:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 397 ms
[2022-06-13 01:23:25] [INFO ] [Real]Absence check using 73 positive place invariants in 34 ms returned sat
[2022-06-13 01:23:25] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 10 ms returned sat
[2022-06-13 01:23:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:25] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2022-06-13 01:23:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:23:25] [INFO ] [Real]Absence check using 73 positive place invariants in 34 ms returned sat
[2022-06-13 01:23:25] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 17 ms returned sat
[2022-06-13 01:23:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:26] [INFO ] [Real]Absence check using state equation in 491 ms returned sat
[2022-06-13 01:23:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:23:26] [INFO ] [Real]Absence check using 73 positive place invariants in 31 ms returned sat
[2022-06-13 01:23:26] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 19 ms returned sat
[2022-06-13 01:23:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:26] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2022-06-13 01:23:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:23:27] [INFO ] [Real]Absence check using 73 positive place invariants in 32 ms returned sat
[2022-06-13 01:23:27] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 18 ms returned sat
[2022-06-13 01:23:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:28] [INFO ] [Real]Absence check using state equation in 806 ms returned sat
[2022-06-13 01:23:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:23:28] [INFO ] [Real]Absence check using 73 positive place invariants in 30 ms returned sat
[2022-06-13 01:23:28] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 11 ms returned sat
[2022-06-13 01:23:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:28] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2022-06-13 01:23:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:23:28] [INFO ] [Nat]Absence check using 73 positive place invariants in 30 ms returned sat
[2022-06-13 01:23:28] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 13 ms returned sat
[2022-06-13 01:23:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:28] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2022-06-13 01:23:29] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 1 ms to minimize.
[2022-06-13 01:23:29] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 0 ms to minimize.
[2022-06-13 01:23:29] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2022-06-13 01:23:29] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2022-06-13 01:23:29] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2022-06-13 01:23:29] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 0 ms to minimize.
[2022-06-13 01:23:29] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2022-06-13 01:23:29] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 0 ms to minimize.
[2022-06-13 01:23:29] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2022-06-13 01:23:29] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2022-06-13 01:23:29] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 0 ms to minimize.
[2022-06-13 01:23:30] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 0 ms to minimize.
[2022-06-13 01:23:30] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 0 ms to minimize.
[2022-06-13 01:23:30] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2022-06-13 01:23:30] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2022-06-13 01:23:30] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 0 ms to minimize.
[2022-06-13 01:23:30] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2022-06-13 01:23:30] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2022-06-13 01:23:30] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 0 ms to minimize.
[2022-06-13 01:23:30] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1703 ms
[2022-06-13 01:23:30] [INFO ] Computed and/alt/rep : 589/934/589 causal constraints (skipped 37 transitions) in 59 ms.
[2022-06-13 01:23:33] [INFO ] Added : 340 causal constraints over 68 iterations in 2965 ms. Result :unknown
[2022-06-13 01:23:33] [INFO ] [Real]Absence check using 73 positive place invariants in 40 ms returned sat
[2022-06-13 01:23:33] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 20 ms returned sat
[2022-06-13 01:23:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:34] [INFO ] [Real]Absence check using state equation in 614 ms returned sat
[2022-06-13 01:23:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:23:34] [INFO ] [Nat]Absence check using 73 positive place invariants in 38 ms returned sat
[2022-06-13 01:23:34] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 18 ms returned sat
[2022-06-13 01:23:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:35] [INFO ] [Nat]Absence check using state equation in 460 ms returned sat
[2022-06-13 01:23:35] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 1 ms to minimize.
[2022-06-13 01:23:35] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2022-06-13 01:23:35] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2022-06-13 01:23:35] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2022-06-13 01:23:35] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2022-06-13 01:23:35] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2022-06-13 01:23:35] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2022-06-13 01:23:35] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 0 ms to minimize.
[2022-06-13 01:23:35] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2022-06-13 01:23:36] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 0 ms to minimize.
[2022-06-13 01:23:36] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1098 ms
[2022-06-13 01:23:36] [INFO ] Computed and/alt/rep : 589/934/589 causal constraints (skipped 37 transitions) in 37 ms.
[2022-06-13 01:23:39] [INFO ] Added : 325 causal constraints over 66 iterations in 2895 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 46300 steps, including 305 resets, run finished after 121 ms. (steps per millisecond=382 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 34700 steps, including 232 resets, run finished after 88 ms. (steps per millisecond=394 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 702 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 702/702 places, 627/627 transitions.
Graph (trivial) has 406 edges and 702 vertex of which 8 / 702 are part of one of the 1 SCC in 4 ms
Free SCC test removed 7 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 1408 edges and 695 vertex of which 686 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 162 place count 686 transition count 456
Reduce places removed 160 places and 0 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 322 place count 526 transition count 456
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 322 place count 526 transition count 352
Deduced a syphon composed of 104 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 233 rules applied. Total rules applied 555 place count 397 transition count 352
Discarding 91 places :
Symmetric choice reduction at 2 with 91 rule applications. Total rules 646 place count 306 transition count 261
Iterating global reduction 2 with 91 rules applied. Total rules applied 737 place count 306 transition count 261
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 737 place count 306 transition count 251
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 760 place count 293 transition count 251
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 761 place count 292 transition count 250
Iterating global reduction 2 with 1 rules applied. Total rules applied 762 place count 292 transition count 250
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 980 place count 183 transition count 141
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 982 place count 182 transition count 144
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 983 place count 182 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 984 place count 181 transition count 143
Applied a total of 984 rules in 139 ms. Remains 181 /702 variables (removed 521) and now considering 143/627 (removed 484) transitions.
Finished structural reductions, in 1 iterations. Remains : 181/702 places, 143/627 transitions.
[2022-06-13 01:23:39] [INFO ] Flatten gal took : 57 ms
[2022-06-13 01:23:39] [INFO ] Flatten gal took : 26 ms
[2022-06-13 01:23:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11280577270962757856.gal : 12 ms
[2022-06-13 01:23:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1294799336111248961.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/ReachabilityCardinality11280577270962757856.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1294799336111248961.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/ReachabilityCardinality11280577270962757856.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1294799336111248961.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality1294799336111248961.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 21
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :21 after 87
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :87 after 145
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :145 after 299
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :299 after 659
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :659 after 1807
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1807 after 4251
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4251 after 21505
Invariant property BusinessProcesses-PT-18-ReachabilityCardinality-13 does not hold.
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-13 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 513 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,377185,1.99123,39224,2,21468,14,133948,6,0,867,50470,0
Total reachable state count : 377185

Verifying 1 reachability properties.
Invariant property BusinessProcesses-PT-18-ReachabilityCardinality-13 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-18-ReachabilityCardinality-13,1,1.99379,39224,2,182,14,133948,7,0,875,50470,0
All properties solved without resorting to model-checking.

BK_STOP 1655083422575

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

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