Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r034-tall-177946842000574.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is BusinessProcesses-PT-16, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842000574
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 8.9K Mar 5 17:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Mar 5 17:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 5 17:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Mar 5 17:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 5 17:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Mar 5 17:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 5 17:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Mar 5 17:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 159K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-12
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-13
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-14
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779624666989

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-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-24 12:11:08] [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]
[2026-05-24 12:11:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 12:11:08] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2026-05-24 12:11:08] [INFO ] Transformed 638 places.
[2026-05-24 12:11:08] [INFO ] Transformed 578 transitions.
[2026-05-24 12:11:08] [INFO ] Found NUPN structural information;
[2026-05-24 12:11:08] [INFO ] Parsed PT model containing 638 places and 578 transitions and 1694 arcs in 196 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 12 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (267 resets) in 1590 ms. (25 steps per ms) remains 9/14 properties
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-24 12:11:08] [INFO ] Flatten gal took : 152 ms
BEST_FIRST walk for 40004 steps (45 resets) in 306 ms. (130 steps per ms) remains 6/9 properties
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2026-05-24 12:11:09] [INFO ] Flatten gal took : 109 ms
[2026-05-24 12:11:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16596468394665800722.gal : 56 ms
[2026-05-24 12:11:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3997530840043355106.prop : 5 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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16596468394665800722.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3997530840043355106.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (44 resets) in 521 ms. (76 steps per ms) remains 6/6 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (46 resets) in 206 ms. (193 steps per ms) remains 6/6 properties
Loading property file /tmp/ReachabilityCardinality3997530840043355106.prop.
BEST_FIRST walk for 40004 steps (52 resets) in 301 ms. (132 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (52 resets) in 327 ms. (121 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 10
BEST_FIRST walk for 40003 steps (45 resets) in 138 ms. (287 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :19 after 29
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :29 after 141
BEST_FIRST walk for 40003 steps (47 resets) in 128 ms. (310 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :141 after 279
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :279 after 2.73815e+14
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17665432109189353356.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17895165080028037179.kers'
[2026-05-24 12:11:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17665432109189353356.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17895165080028037179.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 570 rows 630 cols 1678 entries
Finished phase 1 with 452 SingleSign rule and 78 generalized
[2026-05-24 12:11:09] [INFO ] Computed 100 invariants in 3 ms
Computed 100 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17895165080028037179.kers
Total runtime 4 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 389/502 variables, 79/192 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 389/581 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 1/582 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 7/509 variables, 3/585 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 7/592 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem BusinessProcesses-PT-16-ReachabilityCardinality-2024-06 is UNSAT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-16-ReachabilityCardinality-2024-10 is UNSAT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 121/630 variables, 17/609 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/630 variables, 121/730 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/630 variables, 0/730 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 570/1200 variables, 630/1360 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1200 variables, 0/1360 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1200 variables, 0/1360 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1200/1200 variables, and 1360 constraints, problems are : Problem set: 2 solved, 4 unsolved in 3665 ms.
Refiners :[Domain max(s): 630/630 constraints, Positive P Invariants (semi-flows): 82/82 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 630/630 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 37/37 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 312/349 variables, 49/86 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 312/398 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 12/410 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 0/410 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 140/489 variables, 33/443 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/489 variables, 140/583 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/489 variables, 6/589 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/489 variables, 2/591 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/489 variables, 0/591 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 141/630 variables, 18/609 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/630 variables, 141/750 constraints. Problems are: Problem set: 2 solved, 4 unsolved
SMT process timed out in 8933ms, After SMT, problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 37 out of 630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 570/570 transitions.
Graph (complete) has 1291 edges and 630 vertex of which 626 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 122 place count 626 transition count 449
Reduce places removed 121 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 129 rules applied. Total rules applied 251 place count 505 transition count 441
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 259 place count 497 transition count 441
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 86 Pre rules applied. Total rules applied 259 place count 497 transition count 355
Deduced a syphon composed of 86 places in 2 ms
Ensure Unique test removed 14 places
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 445 place count 397 transition count 355
Discarding 81 places :
Symmetric choice reduction at 3 with 81 rule applications. Total rules 526 place count 316 transition count 274
Iterating global reduction 3 with 81 rules applied. Total rules applied 607 place count 316 transition count 274
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 607 place count 316 transition count 266
Deduced a syphon composed of 8 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 625 place count 306 transition count 266
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 795 place count 220 transition count 182
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 796 place count 220 transition count 181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 797 place count 219 transition count 181
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 802 place count 219 transition count 181
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 803 place count 218 transition count 180
Applied a total of 803 rules in 190 ms. Remains 218 /630 variables (removed 412) and now considering 180/570 (removed 390) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 218/630 places, 180/570 transitions.
RANDOM walk for 40000 steps (1494 resets) in 919 ms. (43 steps per ms) remains 3/4 properties
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (339 resets) in 165 ms. (240 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (295 resets) in 141 ms. (281 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (294 resets) in 108 ms. (367 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16811157884322011409.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15090587241256493157.kers'
[2026-05-24 12:11:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16811157884322011409.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15090587241256493157.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 180 rows 215 cols 837 entries
Finished phase 1 with 66 SingleSign rule and 74 generalized
[2026-05-24 12:11:19] [INFO ] Computed 78 invariants in 1 ms
Computed 78 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15090587241256493157.kers
Total runtime 1 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 99/135 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 37/172 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 39/211 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 180/391 variables, 211/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 7/398 variables, 7/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/398 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 296 constraints, problems are : Problem set: 0 solved, 3 unsolved in 528 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 99/135 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 37/172 variables, 18/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 39/211 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 14/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/211 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 180/391 variables, 211/362 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/391 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/391 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/391 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/391 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem BusinessProcesses-PT-16-ReachabilityCardinality-2024-03 is UNSAT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 17 (OVERLAPS) 7/398 variables, 7/373 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/398 variables, 2/375 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/398 variables, 3/378 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/398 variables, 0/378 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/398 variables, 0/378 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 378 constraints, problems are : Problem set: 1 solved, 2 unsolved in 7805 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 79/79 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 8357ms problems are : Problem set: 1 solved, 2 unsolved
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-04 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 67 ms.
Support contains 1 out of 218 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 218/218 places, 180/180 transitions.
Graph (trivial) has 42 edges and 218 vertex of which 3 / 218 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 719 edges and 216 vertex of which 214 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 10 place count 214 transition count 167
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 18 place count 206 transition count 167
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 18 place count 206 transition count 155
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 45 place count 191 transition count 155
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 48 place count 188 transition count 152
Iterating global reduction 2 with 3 rules applied. Total rules applied 51 place count 188 transition count 152
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 35 rules applied. Total rules applied 86 place count 170 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 88 place count 169 transition count 139
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 169 transition count 137
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 92 place count 167 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 166 transition count 136
Applied a total of 93 rules in 64 ms. Remains 166 /218 variables (removed 52) and now considering 136/180 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 166/218 places, 136/180 transitions.
RANDOM walk for 40000 steps (1746 resets) in 270 ms. (147 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (979 resets) in 195 ms. (204 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2157 steps, run visited all 1 properties in 23 ms. (steps per millisecond=93 )
Probabilistic random walk after 2157 steps, saw 904 distinct states, run finished after 26 ms. (steps per millisecond=82 ) properties seen :1
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-12 FALSE 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 19616 ms.

BK_STOP 1779624687846

--------------------
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
++ 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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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-16"
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-5973"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-16, 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 r034-tall-177946842000574"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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