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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.8K Mar 5 17:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 5 17:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Mar 5 17:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Mar 5 17:50 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.7K Mar 15 07:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 07:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Mar 5 17:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 5 17:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Mar 5 17:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Mar 5 17:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:46 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 148K 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-13-ReachabilityFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779620481878

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-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-24 11:01:23] [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 11:01:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 11:01:23] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2026-05-24 11:01:23] [INFO ] Transformed 593 places.
[2026-05-24 11:01:23] [INFO ] Transformed 536 transitions.
[2026-05-24 11:01:23] [INFO ] Found NUPN structural information;
[2026-05-24 11:01:23] [INFO ] Parsed PT model containing 593 places and 536 transitions and 1582 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
RANDOM walk for 40000 steps (285 resets) in 1987 ms. (20 steps per ms) remains 13/16 properties
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-24 11:01:24] [INFO ] Flatten gal took : 173 ms
BEST_FIRST walk for 40003 steps (51 resets) in 327 ms. (121 steps per ms) remains 13/13 properties
[2026-05-24 11:01:24] [INFO ] Flatten gal took : 91 ms
BEST_FIRST walk for 40004 steps (50 resets) in 220 ms. (181 steps per ms) remains 13/13 properties
[2026-05-24 11:01:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17435901507079741833.gal : 60 ms
BEST_FIRST walk for 40003 steps (49 resets) in 201 ms. (198 steps per ms) remains 13/13 properties
[2026-05-24 11:01:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9318724191337278059.prop : 15 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/ReachabilityCardinality17435901507079741833.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9318724191337278059.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (64 resets) in 256 ms. (155 steps per ms) remains 13/13 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
Loading property file /tmp/ReachabilityCardinality9318724191337278059.prop.
BEST_FIRST walk for 40004 steps (36 resets) in 269 ms. (148 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (47 resets) in 200 ms. (199 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (51 resets) in 181 ms. (219 steps per ms) remains 13/13 properties
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 5
BEST_FIRST walk for 40004 steps (50 resets) in 243 ms. (163 steps per ms) remains 13/13 properties
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :19 after 28
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :28 after 125
BEST_FIRST walk for 40003 steps (51 resets) in 347 ms. (114 steps per ms) remains 13/13 properties
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :125 after 247
BEST_FIRST walk for 40003 steps (50 resets) in 137 ms. (289 steps per ms) remains 10/13 properties
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (50 resets) in 123 ms. (322 steps per ms) remains 10/10 properties
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :247 after 4.84367e+14
BEST_FIRST walk for 40004 steps (48 resets) in 164 ms. (242 steps per ms) remains 10/10 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3550567175751614214.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6316297755289801551.kers'
[2026-05-24 11:01:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3550567175751614214.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6316297755289801551.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 528 rows 585 cols 1566 entries
Finished phase 1 with 416 SingleSign rule and 74 generalized
[2026-05-24 11:01:24] [INFO ] Computed 95 invariants in 4 ms
Computed 95 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-6316297755289801551.kers
Total runtime 6 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem BusinessProcesses-PT-13-ReachabilityFireability-2024-05 is UNSAT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 355/465 variables, 74/184 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/465 variables, 355/539 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 0/539 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 9/474 variables, 3/542 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 9/551 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 0/551 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem BusinessProcesses-PT-13-ReachabilityFireability-2024-11 is UNSAT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-13-ReachabilityFireability-2024-12 is UNSAT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 109/583 variables, 17/568 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 109/677 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/583 variables, 0/677 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 2/585 variables, 1/678 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/585 variables, 2/680 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/585 variables, 0/680 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 528/1113 variables, 585/1265 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1113 variables, 0/1265 constraints. Problems are: Problem set: 3 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1113/1113 variables, and 1265 constraints, problems are : Problem set: 3 solved, 7 unsolved in 5080 ms.
Refiners :[Domain max(s): 585/585 constraints, Positive P Invariants (semi-flows): 77/77 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 10/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 273/324 variables, 48/99 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 273/372 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 4/376 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 1/377 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/377 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 129/453 variables, 29/406 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 129/535 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/453 variables, 14/549 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/453 variables, 0/549 constraints. Problems are: Problem set: 3 solved, 7 unsolved
Problem BusinessProcesses-PT-13-ReachabilityFireability-2024-06 is UNSAT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 11 (OVERLAPS) 128/581 variables, 16/565 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/581 variables, 128/693 constraints. Problems are: Problem set: 4 solved, 6 unsolved
SMT process timed out in 10295ms, After SMT, problems are : Problem set: 4 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 44 out of 585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 585/585 places, 528/528 transitions.
Graph (complete) has 1197 edges and 585 vertex of which 579 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 579 transition count 452
Reduce places removed 75 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 81 rules applied. Total rules applied 157 place count 504 transition count 446
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 163 place count 498 transition count 446
Performed 119 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 119 Pre rules applied. Total rules applied 163 place count 498 transition count 327
Deduced a syphon composed of 119 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 249 rules applied. Total rules applied 412 place count 368 transition count 327
Discarding 72 places :
Symmetric choice reduction at 3 with 72 rule applications. Total rules 484 place count 296 transition count 255
Iterating global reduction 3 with 72 rules applied. Total rules applied 556 place count 296 transition count 255
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 556 place count 296 transition count 250
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 567 place count 290 transition count 250
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 711 place count 218 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 712 place count 218 transition count 177
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 714 place count 217 transition count 181
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 718 place count 217 transition count 181
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 719 place count 216 transition count 180
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 720 place count 215 transition count 180
Applied a total of 720 rules in 144 ms. Remains 215 /585 variables (removed 370) and now considering 180/528 (removed 348) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 215/585 places, 180/528 transitions.
RANDOM walk for 40000 steps (2070 resets) in 679 ms. (58 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (422 resets) in 99 ms. (400 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (425 resets) in 97 ms. (408 steps per ms) remains 5/6 properties
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (432 resets) in 86 ms. (459 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (407 resets) in 72 ms. (547 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (414 resets) in 95 ms. (416 steps per ms) remains 5/5 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10588264776225277234.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15424522787034128121.kers'
[2026-05-24 11:01:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10588264776225277234.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15424522787034128121.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 180 rows 203 cols 799 entries
Finished phase 1 with 101 SingleSign rule and 37 generalized
[2026-05-24 11:01:35] [INFO ] Computed 77 invariants in 1 ms
Computed 77 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15424522787034128121.kers
Total runtime 1 ms.
[2026-05-24 11:01:35] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 56/77 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 66/143 variables, 31/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 46/189 variables, 17/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 6/195 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 179/374 variables, 195/264 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 5/269 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 21/395 variables, 20/289 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/395 variables, 8/297 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/395 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/395 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 297 constraints, problems are : Problem set: 0 solved, 5 unsolved in 523 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 215/215 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 56/77 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 66/143 variables, 31/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 46/189 variables, 17/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 6/195 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/195 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 179/374 variables, 195/277 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/374 variables, 5/282 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/374 variables, 3/285 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/374 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/374 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/374 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/374 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 21/395 variables, 20/308 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/395 variables, 8/316 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/395 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/395 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/395 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/395 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 0/395 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 395/395 variables, and 322 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3614 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 215/215 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 4156ms problems are : Problem set: 0 solved, 5 unsolved
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-13 TRUE TECHNIQUES PARIKH_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-09 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 4611 steps, including 290 resets, run visited all 1 properties in 12 ms. (steps per millisecond=384 )
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-2024-10 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 245 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 17024 ms.

BK_STOP 1779620500081

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

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