Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 11 16:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 16:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 11 16:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 141K May 18 16:42 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-11-ReachabilityCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-12
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-13
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-14
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716334902884

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-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-21 23:41:44] [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]
[2024-05-21 23:41:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:41:44] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2024-05-21 23:41:44] [INFO ] Transformed 567 places.
[2024-05-21 23:41:44] [INFO ] Transformed 508 transitions.
[2024-05-21 23:41:44] [INFO ] Found NUPN structural information;
[2024-05-21 23:41:44] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 241 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 7 places in 11 ms
Reduce places removed 7 places and 7 transitions.
[2024-05-21 23:41:45] [INFO ] Flatten gal took : 116 ms
[2024-05-21 23:41:45] [INFO ] Flatten gal took : 72 ms
[2024-05-21 23:41:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13653179306020435636.gal : 38 ms
[2024-05-21 23:41:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2714843562743249344.prop : 3 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13653179306020435636.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2714843562743249344.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality2714843562743249344.prop.
RANDOM walk for 40000 steps (294 resets) in 2288 ms. (17 steps per ms) remains 8/16 properties
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :7 after 11
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :11 after 61
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :61 after 101
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :101 after 353
BEST_FIRST walk for 40003 steps (54 resets) in 479 ms. (83 steps per ms) remains 8/8 properties
Invariant property BusinessProcesses-PT-11-ReachabilityCardinality-2024-14 does not hold.
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :353 after 609
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :609 after 1041
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :1041 after 2455
BEST_FIRST walk for 40002 steps (55 resets) in 241 ms. (165 steps per ms) remains 8/8 properties
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :2455 after 146087
BEST_FIRST walk for 40004 steps (61 resets) in 311 ms. (128 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (56 resets) in 163 ms. (243 steps per ms) remains 8/8 properties
Invariant property BusinessProcesses-PT-11-ReachabilityCardinality-2024-08 does not hold.
BEST_FIRST walk for 40002 steps (49 resets) in 237 ms. (168 steps per ms) remains 8/8 properties
Invariant property BusinessProcesses-PT-11-ReachabilityCardinality-2024-02 does not hold.
SDD proceeding with computation,13 properties remain. new max is 2048
SDD size :1.99523e+06 after 1.60567e+07
BEST_FIRST walk for 40003 steps (47 resets) in 170 ms. (233 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (64 resets) in 208 ms. (191 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (66 resets) in 140 ms. (283 steps per ms) remains 8/8 properties
// Phase 1: matrix 501 rows 560 cols
[2024-05-21 23:41:46] [INFO ] Computed 95 invariants in 23 ms
SDD proceeding with computation,13 properties remain. new max is 4096
SDD size :1.60567e+07 after 1.01535e+08
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 323/409 variables, 45/131 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/409 variables, 323/454 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 34/443 variables, 8/462 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 34/496 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 115/558 variables, 40/536 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 115/651 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/558 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 2/560 variables, 2/653 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/560 variables, 2/655 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/560 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 501/1061 variables, 560/1215 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1061 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 0/1061 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1061/1061 variables, and 1215 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1707 ms.
Refiners :[Domain max(s): 560/560 constraints, Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 560/560 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem BusinessProcesses-PT-11-ReachabilityCardinality-2024-01 is UNSAT
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 323/409 variables, 45/131 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/409 variables, 323/454 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-21 23:41:48] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 23 ms to minimize.
[2024-05-21 23:41:48] [INFO ] Deduced a trap composed of 26 places in 209 ms of which 4 ms to minimize.
[2024-05-21 23:41:48] [INFO ] Deduced a trap composed of 126 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:41:48] [INFO ] Deduced a trap composed of 128 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:41:48] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:41:48] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:41:48] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:41:48] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:41:48] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:41:49] [INFO ] Deduced a trap composed of 120 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:41:49] [INFO ] Deduced a trap composed of 133 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:41:49] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:41:49] [INFO ] Deduced a trap composed of 116 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:41:49] [INFO ] Deduced a trap composed of 126 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:41:49] [INFO ] Deduced a trap composed of 121 places in 171 ms of which 2 ms to minimize.
[2024-05-21 23:41:49] [INFO ] Deduced a trap composed of 107 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:41:50] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:41:50] [INFO ] Deduced a trap composed of 117 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:41:50] [INFO ] Deduced a trap composed of 99 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:41:50] [INFO ] Deduced a trap composed of 118 places in 112 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 20/474 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-21 23:41:50] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:41:50] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:41:50] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:41:50] [INFO ] Deduced a trap composed of 119 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:41:50] [INFO ] Deduced a trap composed of 115 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:41:51] [INFO ] Deduced a trap composed of 122 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:41:51] [INFO ] Deduced a trap composed of 120 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:41:51] [INFO ] Deduced a trap composed of 114 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:41:51] [INFO ] Deduced a trap composed of 116 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:41:51] [INFO ] Deduced a trap composed of 120 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:41:51] [INFO ] Deduced a trap composed of 115 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:41:51] [INFO ] Deduced a trap composed of 119 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:41:51] [INFO ] Deduced a trap composed of 118 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:41:51] [INFO ] Deduced a trap composed of 124 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:41:51] [INFO ] Deduced a trap composed of 121 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:41:52] [INFO ] Deduced a trap composed of 126 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:41:52] [INFO ] Deduced a trap composed of 117 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:41:52] [INFO ] Deduced a trap composed of 120 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:41:52] [INFO ] Deduced a trap composed of 121 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:41:52] [INFO ] Deduced a trap composed of 114 places in 81 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 20/494 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-21 23:41:52] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:41:52] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:41:52] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:41:52] [INFO ] Deduced a trap composed of 119 places in 79 ms of which 1 ms to minimize.
SMT process timed out in 6855ms, After SMT, problems are : Problem set: 1 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 68 out of 560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 501/501 transitions.
Graph (trivial) has 245 edges and 560 vertex of which 4 / 560 are part of one of the 1 SCC in 3 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1136 edges and 557 vertex of which 552 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 552 transition count 415
Reduce places removed 81 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 95 rules applied. Total rules applied 178 place count 471 transition count 401
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 192 place count 457 transition count 401
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 192 place count 457 transition count 330
Deduced a syphon composed of 71 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 342 place count 378 transition count 330
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 388 place count 332 transition count 284
Iterating global reduction 3 with 46 rules applied. Total rules applied 434 place count 332 transition count 284
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 434 place count 332 transition count 281
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 440 place count 329 transition count 281
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 147 rules applied. Total rules applied 587 place count 254 transition count 209
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 589 place count 253 transition count 213
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 590 place count 253 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 591 place count 252 transition count 212
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 593 place count 252 transition count 212
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 594 place count 251 transition count 211
Applied a total of 594 rules in 144 ms. Remains 251 /560 variables (removed 309) and now considering 211/501 (removed 290) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 251/560 places, 211/501 transitions.
RANDOM walk for 40000 steps (1027 resets) in 778 ms. (51 steps per ms) remains 4/7 properties
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (217 resets) in 186 ms. (213 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (194 resets) in 137 ms. (289 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (172 resets) in 109 ms. (363 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (237 resets) in 124 ms. (320 steps per ms) remains 4/4 properties
// Phase 1: matrix 211 rows 251 cols
[2024-05-21 23:41:53] [INFO ] Computed 80 invariants in 19 ms
[2024-05-21 23:41:53] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 127/152 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 15/167 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 59/226 variables, 30/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/228 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 206/434 variables, 228/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 4/304 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/434 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 21/455 variables, 18/322 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/455 variables, 6/328 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/455 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 4/459 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/459 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 3/462 variables, 5/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/462 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/462 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 335 constraints, problems are : Problem set: 0 solved, 4 unsolved in 412 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 251/251 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 127/152 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:41:54] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:41:54] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 3 ms to minimize.
[2024-05-21 23:41:54] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:41:54] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 15/167 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 59/226 variables, 30/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:41:54] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:41:54] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:41:54] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:41:54] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:41:54] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:41:54] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:41:54] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:41:54] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:41:54] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:41:54] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:41:55] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:41:55] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:41:55] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:41:55] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:41:55] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:41:55] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:41:55] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 17/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:41:55] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:41:55] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:41:55] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:41:55] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:41:55] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:41:55] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:41:55] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:41:55] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 15/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/228 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 206/434 variables, 228/340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/434 variables, 4/344 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/434 variables, 2/346 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/434 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/434 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 21/455 variables, 18/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/455 variables, 6/371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/455 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:41:57] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:41:57] [INFO ] Deduced a trap composed of 60 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:41:57] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:41:57] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:41:57] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:41:57] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:41:57] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:41:57] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:41:58] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:41:58] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:41:58] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:41:58] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:41:58] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:41:58] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:41:58] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:41:58] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:41:58] [INFO ] Deduced a trap composed of 56 places in 149 ms of which 1 ms to minimize.
[2024-05-21 23:41:58] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:41:59] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:41:59] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/455 variables, 20/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/455 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 4/459 variables, 2/395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/459 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 3/462 variables, 5/400 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:41:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/462 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/462 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 0/462 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 401 constraints, problems are : Problem set: 0 solved, 4 unsolved in 6356 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 251/251 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 62/62 constraints]
After SMT, in 6801ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 656 ms.
Support contains 25 out of 251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 211/211 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 251 transition count 199
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 239 transition count 199
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 24 place count 239 transition count 183
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 63 place count 216 transition count 183
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 70 place count 209 transition count 176
Iterating global reduction 2 with 7 rules applied. Total rules applied 77 place count 209 transition count 176
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 77 place count 209 transition count 175
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 79 place count 208 transition count 175
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 103 place count 196 transition count 163
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 195 transition count 174
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 108 place count 195 transition count 174
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 110 place count 193 transition count 172
Iterating global reduction 2 with 2 rules applied. Total rules applied 112 place count 193 transition count 172
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 192 transition count 171
Applied a total of 113 rules in 45 ms. Remains 192 /251 variables (removed 59) and now considering 171/211 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 192/251 places, 171/211 transitions.
RANDOM walk for 40000 steps (1821 resets) in 230 ms. (173 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (504 resets) in 148 ms. (268 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (478 resets) in 104 ms. (380 steps per ms) remains 3/4 properties
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (407 resets) in 120 ms. (330 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (597 resets) in 92 ms. (430 steps per ms) remains 3/3 properties
// Phase 1: matrix 171 rows 192 cols
[2024-05-21 23:42:01] [INFO ] Computed 73 invariants in 12 ms
[2024-05-21 23:42:01] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 96/120 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/122 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 44/166 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 5/171 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 170/341 variables, 171/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 4/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 21/362 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/362 variables, 9/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/362 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1/363 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/363 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/363 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 269 constraints, problems are : Problem set: 0 solved, 3 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 96/120 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:42:01] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
[2024-05-21 23:42:01] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:42:01] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:42:01] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:42:01] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:42:01] [INFO ] Deduced a trap composed of 42 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:42:01] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:42:01] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:42:01] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 0 ms to minimize.
[2024-05-21 23:42:01] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:42:01] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:42:01] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:42:02] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 0 ms to minimize.
[2024-05-21 23:42:02] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:42:02] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:42:02] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/122 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 44/166 variables, 24/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:42:02] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:42:02] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:42:02] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:42:02] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:42:02] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:42:02] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:42:02] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:42:02] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:42:02] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:42:02] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 5/171 variables, 5/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 170/341 variables, 171/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/341 variables, 4/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/341 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:42:02] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/341 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/341 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 21/362 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/362 variables, 9/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/362 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/362 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 1/363 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:42:03] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:42:03] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:42:03] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:42:03] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/363 variables, 4/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:42:03] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:42:03] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:42:03] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/363 variables, 3/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:42:03] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/363 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/363 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 0/363 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 307 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2705 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 35/35 constraints]
After SMT, in 2919ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 454 ms.
Support contains 24 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 171/171 transitions.
Applied a total of 0 rules in 15 ms. Remains 192 /192 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 192/192 places, 171/171 transitions.
RANDOM walk for 40000 steps (1805 resets) in 239 ms. (166 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (491 resets) in 173 ms. (229 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (421 resets) in 82 ms. (481 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (605 resets) in 89 ms. (444 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 45586 steps, run visited all 3 properties in 188 ms. (steps per millisecond=242 )
Probabilistic random walk after 45586 steps, saw 9848 distinct states, run finished after 195 ms. (steps per millisecond=233 ) properties seen :3
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 20822 ms.

BK_STOP 1716334925118

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-11"
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-5568"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-11, 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 r048-tajo-171620399700534"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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