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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 7.5K Mar 5 17:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 5 17:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 5 17:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K 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 4.4K Mar 15 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 15 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Mar 5 17:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 5 17:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 5 17:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 5 17:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:49 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 192K 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-20-ReachabilityCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-12
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-13
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-14
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779630279239

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-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-24 13:44:40] [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 13:44:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 13:44:40] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2026-05-24 13:44:40] [INFO ] Transformed 782 places.
[2026-05-24 13:44:40] [INFO ] Transformed 697 transitions.
[2026-05-24 13:44:40] [INFO ] Found NUPN structural information;
[2026-05-24 13:44:40] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 63 places in 13 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (200 resets) in 1322 ms. (30 steps per ms) remains 3/8 properties
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-24 13:44:41] [INFO ] Flatten gal took : 110 ms
[2026-05-24 13:44:41] [INFO ] Flatten gal took : 68 ms
BEST_FIRST walk for 40004 steps (36 resets) in 365 ms. (109 steps per ms) remains 3/3 properties
[2026-05-24 13:44:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14506418663892933403.gal : 33 ms
[2026-05-24 13:44:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10477974649459196611.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14506418663892933403.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10477974649459196611.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (36 resets) in 375 ms. (106 steps per ms) remains 3/3 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 ...330
BEST_FIRST walk for 40003 steps (37 resets) in 225 ms. (177 steps per ms) remains 3/3 properties
Loading property file /tmp/ReachabilityCardinality10477974649459196611.prop.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13268809835629743059.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13196889738941778248.kers'
[2026-05-24 13:44:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13268809835629743059.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13196889738941778248.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 638 rows 719 cols 1853 entries
Finished phase 1 with 518 SingleSign rule and 80 generalized
[2026-05-24 13:44:41] [INFO ] Computed 121 invariants in 4 ms
Computed 121 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13196889738941778248.kers
Total runtime 5 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :6 after 7
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :8 after 11
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :11 after 41
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :41 after 81
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :81 after 248
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :248 after 456
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :456 after 604
At refinement iteration 2 (OVERLAPS) 411/442 variables, 74/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :604 after 382835
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 411/516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :3.61047e+06 after 4.87704e+06
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 130/572 variables, 28/544 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 130/674 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 145/717 variables, 18/692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/717 variables, 145/837 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/717 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/719 variables, 1/838 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/719 variables, 2/840 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/719 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :1.17848e+08 after 1.84874e+08
At refinement iteration 14 (OVERLAPS) 638/1357 variables, 719/1559 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1357 variables, 0/1559 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :1.84874e+08 after 7.89485e+08
At refinement iteration 16 (OVERLAPS) 0/1357 variables, 0/1559 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1357/1357 variables, and 1559 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1939 ms.
Refiners :[Domain max(s): 719/719 constraints, Positive P Invariants (semi-flows): 102/102 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 719/719 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/31 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 411/442 variables, 74/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 411/516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 8/524 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 130/572 variables, 28/552 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 130/682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 9/691 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 145/717 variables, 18/709 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/717 variables, 145/854 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 7163ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 31 out of 719 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 638/638 transitions.
Graph (trivial) has 377 edges and 719 vertex of which 7 / 719 are part of one of the 1 SCC in 6 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1410 edges and 713 vertex of which 686 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.3 ms
Discarding 27 places :
Also discarding 13 output transitions
Drop transitions (Output transitions of discarded places.) removed 13 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 147 rules applied. Total rules applied 149 place count 686 transition count 470
Reduce places removed 147 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 154 rules applied. Total rules applied 303 place count 539 transition count 463
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 310 place count 532 transition count 463
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 310 place count 532 transition count 367
Deduced a syphon composed of 96 places in 2 ms
Ensure Unique test removed 18 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 520 place count 418 transition count 367
Discarding 80 places :
Symmetric choice reduction at 3 with 80 rule applications. Total rules 600 place count 338 transition count 287
Iterating global reduction 3 with 80 rules applied. Total rules applied 680 place count 338 transition count 287
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 680 place count 338 transition count 279
Deduced a syphon composed of 8 places in 1 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 698 place count 328 transition count 279
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 890 place count 231 transition count 184
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 894 place count 229 transition count 190
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 896 place count 229 transition count 188
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 898 place count 227 transition count 188
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 902 place count 227 transition count 188
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 903 place count 226 transition count 187
Applied a total of 903 rules in 166 ms. Remains 226 /719 variables (removed 493) and now considering 187/638 (removed 451) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 226/719 places, 187/638 transitions.
RANDOM walk for 40000 steps (964 resets) in 1214 ms. (32 steps per ms) remains 1/3 properties
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (214 resets) in 318 ms. (125 steps per ms) remains 1/1 properties
[2026-05-24 13:44:49] [INFO ] Flow matrix only has 186 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7183752853463961256.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9712175356054741977.kers'
[2026-05-24 13:44:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7183752853463961256.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9712175356054741977.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 186 rows 216 cols 859 entries
Finished phase 1 with 84 SingleSign rule and 57 generalized
[2026-05-24 13:44:49] [INFO ] Computed 85 invariants in 1 ms
Computed 85 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9712175356054741977.kers
Total runtime 2 ms.
[2026-05-24 13:44:49] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/33 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 129/162 variables, 54/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/204 variables, 14/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/206 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 185/391 variables, 206/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/391 variables, 7/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/391 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 20/411 variables, 19/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/411 variables, 9/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/411 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/412 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/412 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/412 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 412/412 variables, and 331 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1132 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 226/226 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/33 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 129/162 variables, 54/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 42/204 variables, 14/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 13/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/206 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 185/391 variables, 206/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/391 variables, 7/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/391 variables, 3/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :7.89485e+08 after 1.1715e+10
At refinement iteration 16 (INCLUDED_ONLY) 0/391 variables, 10/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/391 variables, 4/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/391 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem BusinessProcesses-PT-20-ReachabilityCardinality-2024-02 is UNSAT
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 411/412 variables, and 371 constraints, problems are : Problem set: 1 solved, 0 unsolved in 3804 ms.
Refiners :[Positive P Invariants (semi-flows): 60/69 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 225/226 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 4960ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
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 13809 ms.

BK_STOP 1779630294361

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

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