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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.8K Mar 5 17:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Mar 5 17:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 5 17:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 5 17:53 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.0K Mar 15 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Mar 5 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Mar 5 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 5 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Mar 5 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:48 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 189K 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-19-ReachabilityFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779629102830

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-24 13:25:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 13:25:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 13:25:04] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2026-05-24 13:25:04] [INFO ] Transformed 772 places.
[2026-05-24 13:25:04] [INFO ] Transformed 685 transitions.
[2026-05-24 13:25:04] [INFO ] Found NUPN structural information;
[2026-05-24 13:25:04] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 15 places in 14 ms
Reduce places removed 15 places and 15 transitions.
RANDOM walk for 40000 steps (221 resets) in 1376 ms. (29 steps per ms) remains 8/16 properties
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-24 13:25:04] [INFO ] Flatten gal took : 111 ms
[2026-05-24 13:25:04] [INFO ] Flatten gal took : 59 ms
[2026-05-24 13:25:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14708799282672271479.gal : 60 ms
[2026-05-24 13:25:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality92779322931811336.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/ReachabilityCardinality14708799282672271479.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality92779322931811336.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.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
BEST_FIRST walk for 40004 steps (28 resets) in 872 ms. (45 steps per ms) remains 6/8 properties
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Loading property file /tmp/ReachabilityCardinality92779322931811336.prop.
BEST_FIRST walk for 40004 steps (38 resets) in 241 ms. (165 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (38 resets) in 229 ms. (173 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (28 resets) in 206 ms. (193 steps per ms) remains 6/6 properties
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,8 properties remain. new max is 16
BEST_FIRST walk for 40003 steps (25 resets) in 179 ms. (222 steps per ms) remains 6/6 properties
SDD size :10 after 19
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :36 after 43
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :43 after 169
BEST_FIRST walk for 40003 steps (49 resets) in 224 ms. (177 steps per ms) remains 6/6 properties
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :169 after 4331
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14155323562042271118.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4769033875600704995.kers'
[2026-05-24 13:25:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14155323562042271118.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4769033875600704995.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 670 rows 757 cols 1951 entries
Finished phase 1 with 540 SingleSign rule and 92 generalized
[2026-05-24 13:25:05] [INFO ] Computed 125 invariants in 4 ms
Computed 125 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-4769033875600704995.kers
Total runtime 6 ms.
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :4331 after 1.41698e+22
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 498/581 variables, 100/183 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 498/681 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 34/615 variables, 7/688 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/615 variables, 34/722 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/615 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 140/755 variables, 17/739 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/755 variables, 140/879 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/755 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 2/757 variables, 1/880 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/757 variables, 2/882 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/757 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem BusinessProcesses-PT-19-ReachabilityFireability-2024-02 is UNSAT
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-19-ReachabilityFireability-2024-13 is UNSAT
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 14 (OVERLAPS) 670/1427 variables, 757/1639 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1427 variables, 0/1639 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/1427 variables, 0/1639 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1427/1427 variables, and 1639 constraints, problems are : Problem set: 2 solved, 4 unsolved in 4323 ms.
Refiners :[Domain max(s): 757/757 constraints, Positive P Invariants (semi-flows): 107/107 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 757/757 constraints, PredecessorRefiner: 6/3 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) 501/538 variables, 94/131 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 501/632 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 14/646 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 0/646 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 64/602 variables, 13/659 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/602 variables, 64/723 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/602 variables, 5/728 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/602 variables, 0/728 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 149/751 variables, 15/743 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/751 variables, 149/892 constraints. Problems are: Problem set: 2 solved, 4 unsolved
SMT process timed out in 9552ms, 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 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 670/670 transitions.
Graph (complete) has 1520 edges and 757 vertex of which 748 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 107 place count 748 transition count 563
Reduce places removed 106 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 117 rules applied. Total rules applied 224 place count 642 transition count 552
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 235 place count 631 transition count 552
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 151 Pre rules applied. Total rules applied 235 place count 631 transition count 401
Deduced a syphon composed of 151 places in 2 ms
Ensure Unique test removed 23 places
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 3 with 325 rules applied. Total rules applied 560 place count 457 transition count 401
Discarding 97 places :
Symmetric choice reduction at 3 with 97 rule applications. Total rules 657 place count 360 transition count 304
Iterating global reduction 3 with 97 rules applied. Total rules applied 754 place count 360 transition count 304
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 754 place count 360 transition count 296
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 772 place count 350 transition count 296
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 773 place count 349 transition count 295
Iterating global reduction 3 with 1 rules applied. Total rules applied 774 place count 349 transition count 295
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 106
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 214 rules applied. Total rules applied 988 place count 241 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 989 place count 241 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 991 place count 240 transition count 191
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 994 place count 240 transition count 191
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 995 place count 239 transition count 190
Applied a total of 995 rules in 201 ms. Remains 239 /757 variables (removed 518) and now considering 190/670 (removed 480) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210 ms. Remains : 239/757 places, 190/670 transitions.
RANDOM walk for 40000 steps (1934 resets) in 743 ms. (53 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (291 resets) in 171 ms. (232 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (455 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (303 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (286 resets) in 126 ms. (314 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 917220 steps, run timeout after 3001 ms. (steps per millisecond=305 ) properties seen :2 out of 4
Probabilistic random walk after 917220 steps, saw 141454 distinct states, run finished after 3005 ms. (steps per millisecond=305 ) properties seen :2
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5650733821688279794.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14996978596148809148.kers'
[2026-05-24 13:25:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5650733821688279794.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14996978596148809148.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 190 rows 226 cols 863 entries
Finished phase 1 with 74 SingleSign rule and 75 generalized
[2026-05-24 13:25:18] [INFO ] Computed 90 invariants in 1 ms
Computed 90 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14996978596148809148.kers
Total runtime 1 ms.
[2026-05-24 13:25:18] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 137/167 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 37/204 variables, 15/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/206 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 189/395 variables, 206/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 4/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 34/429 variables, 33/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/429 variables, 14/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/429 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/429 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 333 constraints, problems are : Problem set: 0 solved, 2 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 239/239 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 137/167 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 37/204 variables, 15/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/206 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 189/395 variables, 206/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 4/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/395 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem BusinessProcesses-PT-19-ReachabilityFireability-2024-00 is UNSAT
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 12 (OVERLAPS) 34/429 variables, 33/322 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/429 variables, 14/336 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/429 variables, 1/337 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/429 variables, 2/339 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/429 variables, 0/339 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/429 variables, 0/339 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 429/429 variables, and 339 constraints, problems are : Problem set: 1 solved, 1 unsolved in 665 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 239/239 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 877ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 392 steps, including 15 resets, run visited all 1 properties in 2 ms. (steps per millisecond=196 )
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-2024-12 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 7 ms.
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 15439 ms.

BK_STOP 1779629119435

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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-19"
export BK_EXAMINATION="ReachabilityFireability"
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-19, examination is ReachabilityFireability"
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-177946842100599"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-19.tgz
mv BusinessProcesses-PT-19 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;