Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r037-tajo-167813690500526.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
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 r037-tajo-167813690500526
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 131K Mar 5 18:22 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 1678361570449

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-10
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-09 11:32:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 11:32:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 11:32:52] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2023-03-09 11:32:52] [INFO ] Transformed 518 places.
[2023-03-09 11:32:52] [INFO ] Transformed 471 transitions.
[2023-03-09 11:32:52] [INFO ] Found NUPN structural information;
[2023-03-09 11:32:52] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs 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-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-09 11:32:53] [INFO ] Flatten gal took : 97 ms
[2023-03-09 11:32:53] [INFO ] Flatten gal took : 42 ms
[2023-03-09 11:32:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12005934473330460315.gal : 29 ms
[2023-03-09 11:32:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7259158636234723570.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12005934473330460315.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7259158636234723570.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Incomplete random walk after 10000 steps, including 82 resets, run finished after 573 ms. (steps per millisecond=17 ) properties (out of 11) seen :5
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Loading property file /tmp/ReachabilityCardinality7259158636234723570.prop.
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :1
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :19 after 22
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :22 after 197
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :197 after 391
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Invariant property BusinessProcesses-PT-10-ReachabilityCardinality-14 does not hold.
Reachability property BusinessProcesses-PT-10-ReachabilityCardinality-13 is true.
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 471 rows 518 cols
[2023-03-09 11:32:53] [INFO ] Computed 85 place invariants in 47 ms
[2023-03-09 11:32:54] [INFO ] After 557ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 11:32:54] [INFO ] [Nat]Absence check using 48 positive place invariants in 14 ms returned sat
[2023-03-09 11:32:54] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 10 ms returned sat
[2023-03-09 11:32:54] [INFO ] After 273ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-09 11:32:55] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 23 ms to minimize.
[2023-03-09 11:32:55] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 1 ms to minimize.
[2023-03-09 11:32:55] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 1 ms to minimize.
[2023-03-09 11:32:55] [INFO ] Deduced a trap composed of 38 places in 182 ms of which 1 ms to minimize.
[2023-03-09 11:32:55] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 1 ms to minimize.
[2023-03-09 11:32:55] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 0 ms to minimize.
[2023-03-09 11:32:56] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2023-03-09 11:32:56] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1129 ms
[2023-03-09 11:32:56] [INFO ] Deduced a trap composed of 113 places in 275 ms of which 0 ms to minimize.
[2023-03-09 11:32:56] [INFO ] Deduced a trap composed of 127 places in 193 ms of which 1 ms to minimize.
[2023-03-09 11:32:56] [INFO ] Deduced a trap composed of 118 places in 123 ms of which 3 ms to minimize.
[2023-03-09 11:32:56] [INFO ] Deduced a trap composed of 117 places in 165 ms of which 0 ms to minimize.
[2023-03-09 11:32:57] [INFO ] Deduced a trap composed of 123 places in 168 ms of which 1 ms to minimize.
[2023-03-09 11:32:57] [INFO ] Deduced a trap composed of 123 places in 149 ms of which 1 ms to minimize.
[2023-03-09 11:32:57] [INFO ] Deduced a trap composed of 122 places in 167 ms of which 1 ms to minimize.
[2023-03-09 11:32:57] [INFO ] Deduced a trap composed of 125 places in 136 ms of which 1 ms to minimize.
[2023-03-09 11:32:57] [INFO ] Deduced a trap composed of 119 places in 195 ms of which 1 ms to minimize.
[2023-03-09 11:32:58] [INFO ] Deduced a trap composed of 129 places in 176 ms of which 1 ms to minimize.
[2023-03-09 11:32:58] [INFO ] Deduced a trap composed of 113 places in 196 ms of which 1 ms to minimize.
[2023-03-09 11:32:58] [INFO ] Deduced a trap composed of 120 places in 160 ms of which 1 ms to minimize.
[2023-03-09 11:32:58] [INFO ] Deduced a trap composed of 120 places in 161 ms of which 0 ms to minimize.
[2023-03-09 11:32:58] [INFO ] Deduced a trap composed of 133 places in 180 ms of which 0 ms to minimize.
[2023-03-09 11:32:59] [INFO ] Deduced a trap composed of 123 places in 153 ms of which 1 ms to minimize.
[2023-03-09 11:32:59] [INFO ] Deduced a trap composed of 131 places in 206 ms of which 1 ms to minimize.
[2023-03-09 11:32:59] [INFO ] Deduced a trap composed of 130 places in 147 ms of which 1 ms to minimize.
[2023-03-09 11:33:07] [INFO ] Deduced a trap composed of 130 places in 8415 ms of which 30 ms to minimize.
[2023-03-09 11:33:08] [INFO ] Deduced a trap composed of 139 places in 162 ms of which 0 ms to minimize.
[2023-03-09 11:33:08] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 0 ms to minimize.
[2023-03-09 11:33:08] [INFO ] Deduced a trap composed of 119 places in 193 ms of which 1 ms to minimize.
[2023-03-09 11:33:08] [INFO ] Deduced a trap composed of 121 places in 113 ms of which 1 ms to minimize.
[2023-03-09 11:33:08] [INFO ] Deduced a trap composed of 120 places in 160 ms of which 1 ms to minimize.
[2023-03-09 11:33:09] [INFO ] Deduced a trap composed of 122 places in 105 ms of which 0 ms to minimize.
[2023-03-09 11:33:09] [INFO ] Deduced a trap composed of 121 places in 99 ms of which 0 ms to minimize.
[2023-03-09 11:33:09] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 13183 ms
[2023-03-09 11:33:09] [INFO ] After 14761ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 240 ms.
[2023-03-09 11:33:09] [INFO ] After 15239ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 4 different solutions.
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 85 ms.
Support contains 37 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 471/471 transitions.
Graph (trivial) has 269 edges and 518 vertex of which 7 / 518 are part of one of the 1 SCC in 7 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 93 rules applied. Total rules applied 94 place count 512 transition count 370
Reduce places removed 93 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 105 rules applied. Total rules applied 199 place count 419 transition count 358
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 211 place count 407 transition count 358
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 211 place count 407 transition count 290
Deduced a syphon composed of 68 places in 6 ms
Ensure Unique test removed 10 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 357 place count 329 transition count 290
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 415 place count 271 transition count 232
Iterating global reduction 3 with 58 rules applied. Total rules applied 473 place count 271 transition count 232
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 473 place count 271 transition count 226
Deduced a syphon composed of 6 places in 0 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 486 place count 264 transition count 226
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 614 place count 200 transition count 162
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 616 place count 199 transition count 165
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 618 place count 199 transition count 163
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 620 place count 197 transition count 163
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 623 place count 197 transition count 163
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 624 place count 196 transition count 162
Applied a total of 624 rules in 155 ms. Remains 196 /518 variables (removed 322) and now considering 162/471 (removed 309) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 196/518 places, 162/471 transitions.
Incomplete random walk after 10000 steps, including 204 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 3) seen :1
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 162 rows 196 cols
[2023-03-09 11:33:10] [INFO ] Computed 74 place invariants in 9 ms
[2023-03-09 11:33:10] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 11:33:10] [INFO ] [Nat]Absence check using 48 positive place invariants in 9 ms returned sat
[2023-03-09 11:33:10] [INFO ] [Nat]Absence check using 48 positive and 26 generalized place invariants in 4 ms returned sat
[2023-03-09 11:33:10] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 11:33:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 11:33:10] [INFO ] After 51ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 11:33:10] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 4 ms to minimize.
[2023-03-09 11:33:10] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2023-03-09 11:33:10] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 0 ms to minimize.
[2023-03-09 11:33:10] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 0 ms to minimize.
[2023-03-09 11:33:10] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2023-03-09 11:33:10] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2023-03-09 11:33:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 378 ms
[2023-03-09 11:33:10] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2023-03-09 11:33:10] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 1 ms to minimize.
[2023-03-09 11:33:11] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2023-03-09 11:33:11] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2023-03-09 11:33:11] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 0 ms to minimize.
[2023-03-09 11:33:11] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 0 ms to minimize.
[2023-03-09 11:33:11] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 0 ms to minimize.
[2023-03-09 11:33:11] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 627 ms
[2023-03-09 11:33:11] [INFO ] After 1135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-09 11:33:11] [INFO ] After 1366ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 36 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 162/162 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 196 transition count 161
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 195 transition count 161
Applied a total of 2 rules in 9 ms. Remains 195 /196 variables (removed 1) and now considering 161/162 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 195/196 places, 161/162 transitions.
Incomplete random walk after 10000 steps, including 190 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 559831 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :{}
Probabilistic random walk after 559831 steps, saw 111870 distinct states, run finished after 3002 ms. (steps per millisecond=186 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 161 rows 195 cols
[2023-03-09 11:33:14] [INFO ] Computed 74 place invariants in 4 ms
[2023-03-09 11:33:14] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 11:33:15] [INFO ] [Nat]Absence check using 46 positive place invariants in 7 ms returned sat
[2023-03-09 11:33:15] [INFO ] [Nat]Absence check using 46 positive and 28 generalized place invariants in 5 ms returned sat
[2023-03-09 11:33:15] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 11:33:15] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 11:33:15] [INFO ] After 63ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 11:33:15] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2023-03-09 11:33:16] [INFO ] Deduced a trap composed of 11 places in 656 ms of which 26 ms to minimize.
[2023-03-09 11:33:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 746 ms
[2023-03-09 11:33:16] [INFO ] After 934ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-09 11:33:16] [INFO ] After 1264ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 36 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 161/161 transitions.
Applied a total of 0 rules in 31 ms. Remains 195 /195 variables (removed 0) and now considering 161/161 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 195/195 places, 161/161 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 161/161 transitions.
Applied a total of 0 rules in 12 ms. Remains 195 /195 variables (removed 0) and now considering 161/161 (removed 0) transitions.
[2023-03-09 11:33:16] [INFO ] Invariant cache hit.
[2023-03-09 11:33:19] [INFO ] Implicit Places using invariants in 3246 ms returned [14, 16, 18, 33, 51, 53, 55, 62, 64, 66, 68, 141]
Discarding 12 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT only with invariants took 3248 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 183/195 places, 159/161 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 179 transition count 143
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 179 transition count 143
Applied a total of 8 rules in 51 ms. Remains 179 /183 variables (removed 4) and now considering 143/159 (removed 16) transitions.
// Phase 1: matrix 143 rows 179 cols
[2023-03-09 11:33:19] [INFO ] Computed 64 place invariants in 3 ms
[2023-03-09 11:33:19] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-09 11:33:19] [INFO ] Invariant cache hit.
[2023-03-09 11:33:19] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 11:33:19] [INFO ] Implicit Places using invariants and state equation in 183 ms returned [112, 118, 120]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 375 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 176/195 places, 143/161 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 175 transition count 142
Applied a total of 2 rules in 11 ms. Remains 175 /176 variables (removed 1) and now considering 142/143 (removed 1) transitions.
// Phase 1: matrix 142 rows 175 cols
[2023-03-09 11:33:20] [INFO ] Computed 61 place invariants in 2 ms
[2023-03-09 11:33:20] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-09 11:33:20] [INFO ] Invariant cache hit.
[2023-03-09 11:33:20] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-09 11:33:20] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 175/195 places, 142/161 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4148 ms. Remains : 175/195 places, 142/161 transitions.
Incomplete random walk after 10000 steps, including 201 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 737138 steps, run timeout after 3001 ms. (steps per millisecond=245 ) properties seen :{}
Probabilistic random walk after 737138 steps, saw 145214 distinct states, run finished after 3001 ms. (steps per millisecond=245 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-09 11:33:23] [INFO ] Invariant cache hit.
[2023-03-09 11:33:23] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 11:33:23] [INFO ] [Nat]Absence check using 41 positive place invariants in 8 ms returned sat
[2023-03-09 11:33:23] [INFO ] [Nat]Absence check using 41 positive and 20 generalized place invariants in 5 ms returned sat
[2023-03-09 11:33:23] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 11:33:23] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-09 11:33:24] [INFO ] After 56ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 11:33:24] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 2 ms to minimize.
[2023-03-09 11:33:24] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2023-03-09 11:33:24] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2023-03-09 11:33:24] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2023-03-09 11:33:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 226 ms
[2023-03-09 11:33:24] [INFO ] After 337ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-09 11:33:24] [INFO ] After 608ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 36 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 142/142 transitions.
Applied a total of 0 rules in 17 ms. Remains 175 /175 variables (removed 0) and now considering 142/142 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 175/175 places, 142/142 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 142/142 transitions.
Applied a total of 0 rules in 9 ms. Remains 175 /175 variables (removed 0) and now considering 142/142 (removed 0) transitions.
[2023-03-09 11:33:24] [INFO ] Invariant cache hit.
[2023-03-09 11:33:24] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-09 11:33:24] [INFO ] Invariant cache hit.
[2023-03-09 11:33:24] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-09 11:33:24] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
[2023-03-09 11:33:24] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 11:33:24] [INFO ] Invariant cache hit.
[2023-03-09 11:33:25] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 653 ms. Remains : 175/175 places, 142/142 transitions.
Graph (complete) has 506 edges and 175 vertex of which 173 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 173 transition count 141
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 170 transition count 138
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 170 transition count 138
Applied a total of 9 rules in 24 ms. Remains 170 /175 variables (removed 5) and now considering 138/142 (removed 4) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 138 rows 170 cols
[2023-03-09 11:33:25] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-09 11:33:25] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 11:33:25] [INFO ] [Nat]Absence check using 41 positive place invariants in 20 ms returned sat
[2023-03-09 11:33:25] [INFO ] [Nat]Absence check using 41 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 11:33:25] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 11:33:25] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-09 11:33:25] [INFO ] After 46ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 11:33:25] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 10 ms to minimize.
[2023-03-09 11:33:25] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2023-03-09 11:33:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 115 ms
[2023-03-09 11:33:25] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2023-03-09 11:33:25] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2023-03-09 11:33:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 161 ms
[2023-03-09 11:33:25] [INFO ] After 383ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-09 11:33:25] [INFO ] After 679ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-09 11:33:25] [INFO ] Flatten gal took : 39 ms
[2023-03-09 11:33:25] [INFO ] Flatten gal took : 24 ms
[2023-03-09 11:33:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16573091370097582103.gal : 10 ms
[2023-03-09 11:33:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4681587902722612376.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16573091370097582103.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4681587902722612376.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality4681587902722612376.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 11
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :11 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 39
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :39 after 69
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :69 after 690
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :690 after 5660
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :5660 after 289940
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :289940 after 1.19925e+06
Invariant property BusinessProcesses-PT-10-ReachabilityCardinality-00 does not hold.
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.19925e+06 after 3.49522e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3.49522e+06 after 6.41879e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6.41879e+06 after 1.42843e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.42843e+07 after 5.27991e+07
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5.27991e+07 after 1.24727e+08
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,2.49709e+10,12.115,206744,2,50967,20,994260,7,0,857,719651,0
Total reachable state count : 24970936462

Verifying 2 reachability properties.
Invariant property BusinessProcesses-PT-10-ReachabilityCardinality-00 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-10-ReachabilityCardinality-00,1.14033e+07,12.218,206744,2,9688,20,994260,8,0,880,719651,0
Invariant property BusinessProcesses-PT-10-ReachabilityCardinality-01 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-10-ReachabilityCardinality-01,1.60592e+08,12.3933,206744,2,12537,20,994260,8,0,914,719651,0
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-09 11:33:38] [INFO ] Flatten gal took : 73 ms
[2023-03-09 11:33:38] [INFO ] Applying decomposition
[2023-03-09 11:33:38] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8955616228803164141.txt' '-o' '/tmp/graph8955616228803164141.bin' '-w' '/tmp/graph8955616228803164141.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8955616228803164141.bin' '-l' '-1' '-v' '-w' '/tmp/graph8955616228803164141.weights' '-q' '0' '-e' '0.001'
[2023-03-09 11:33:39] [INFO ] Decomposing Gal with order
[2023-03-09 11:33:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 11:33:39] [INFO ] Removed a total of 259 redundant transitions.
[2023-03-09 11:33:39] [INFO ] Flatten gal took : 162 ms
[2023-03-09 11:33:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 11 ms.
[2023-03-09 11:33:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17073673013960982719.gal : 29 ms
[2023-03-09 11:33:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5215246417685058696.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17073673013960982719.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5215246417685058696.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality5215246417685058696.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 1225
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :6435 after 1.88113e+06
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-09 12:03:39] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2625313728652927695
[2023-03-09 12:03:39] [INFO ] Computing symmetric may disable matrix : 142 transitions.
[2023-03-09 12:03:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:03:39] [INFO ] Computing symmetric may enable matrix : 142 transitions.
[2023-03-09 12:03:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:03:39] [INFO ] Applying decomposition
[2023-03-09 12:03:39] [INFO ] Computing Do-Not-Accords matrix : 142 transitions.
[2023-03-09 12:03:39] [INFO ] Flatten gal took : 13 ms
[2023-03-09 12:03:39] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:03:39] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2625313728652927695
Running compilation step : cd /tmp/ltsmin2625313728652927695;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4519174610883456238.txt' '-o' '/tmp/graph4519174610883456238.bin' '-w' '/tmp/graph4519174610883456238.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4519174610883456238.bin' '-l' '-1' '-v' '-w' '/tmp/graph4519174610883456238.weights' '-q' '0' '-e' '0.001'
[2023-03-09 12:03:39] [INFO ] Decomposing Gal with order
[2023-03-09 12:03:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 12:03:39] [INFO ] Removed a total of 80 redundant transitions.
[2023-03-09 12:03:39] [INFO ] Flatten gal took : 15 ms
[2023-03-09 12:03:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 4 ms.
[2023-03-09 12:03:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14035786851950075000.gal : 3 ms
[2023-03-09 12:03:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5850830636929415632.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14035786851950075000.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5850830636929415632.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality5850830636929415632.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 34
Invariant property BusinessProcesses-PT-10-ReachabilityCardinality-00 does not hold.
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :34 after 110076
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :110076 after 2.13954e+09
Invariant property BusinessProcesses-PT-10-ReachabilityCardinality-01 does not hold.
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 17 fixpoint passes
Compilation finished in 538 ms.
Running link step : cd /tmp/ltsmin2625313728652927695;'gcc' '-shared' '-o' 'gal.so' 'model.o'
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\_mod\_flat,1.274e+10,0.465612,19392,1073,235,32723,1118,684,48687,149,4114,0
Total reachable state count : 12739961560

Verifying 2 reachability properties.
Invariant property BusinessProcesses-PT-10-ReachabilityCardinality-00 does not hold.

Link finished in 60 ms.
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1847935 ms.

BK_STOP 1678363420551

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="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-5348"
echo " Executing tool itstools"
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 r037-tajo-167813690500526"
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 ;