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.r162-smll-177961107700103.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 IBMB2S565S3960-PT-none, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961107700103
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 11K Mar 7 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 7 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 7 17:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 17:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.1K Mar 15 11:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Mar 15 11:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 11:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Mar 7 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Mar 7 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 7 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Mar 7 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 15 11:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 127K 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 IBMB2S565S3960-PT-none-ReachabilityFireability-2024-00
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityFireability-2024-01
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityFireability-2024-02
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityFireability-2024-03
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityFireability-2024-04
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityFireability-2024-05
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityFireability-2024-06
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityFireability-2024-07
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityFireability-2024-08
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityFireability-2024-09
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityFireability-2024-10
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityFireability-2024-11
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityFireability-2024-12
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityFireability-2024-13
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityFireability-2024-14
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779728506088

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBMB2S565S3960-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-25 17:01:48] [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-25 17:01:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 17:01:49] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2026-05-25 17:01:49] [INFO ] Transformed 273 places.
[2026-05-25 17:01:49] [INFO ] Transformed 179 transitions.
[2026-05-25 17:01:49] [INFO ] Parsed PT model containing 273 places and 179 transitions and 572 arcs in 392 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40002 steps (163 resets) in 1901 ms. (21 steps per ms) remains 7/16 properties
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-25 17:01:50] [INFO ] Flatten gal took : 175 ms
BEST_FIRST walk for 40004 steps (22 resets) in 676 ms. (59 steps per ms) remains 6/7 properties
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2026-05-25 17:01:50] [INFO ] Flatten gal took : 62 ms
[2026-05-25 17:01:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13394000319670961754.gal : 43 ms
[2026-05-25 17:01:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15892085126687765873.prop : 17 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/ReachabilityCardinality13394000319670961754.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15892085126687765873.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 ...330
Loading property file /tmp/ReachabilityCardinality15892085126687765873.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :6 after 17
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :17 after 20
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :20 after 2316
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :2316 after 2441
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :2441 after 3039
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :3039 after 5069
BEST_FIRST walk for 40004 steps (24 resets) in 1851 ms. (21 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :5069 after 3.15788e+06
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :3.15788e+06 after 3.32152e+06
BEST_FIRST walk for 40003 steps (25 resets) in 726 ms. (55 steps per ms) remains 5/6 properties
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (26 resets) in 264 ms. (150 steps per ms) remains 4/5 properties
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (24 resets) in 114 ms. (347 steps per ms) remains 3/4 properties
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :3.32152e+06 after 3.59649e+07
BEST_FIRST walk for 40004 steps (26 resets) in 278 ms. (143 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (26 resets) in 296 ms. (134 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14026462573170318092.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7067750691775662681.kers'
[2026-05-25 17:01:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14026462573170318092.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7067750691775662681.kers]
Culling duplicate invariants (modulo rational): removing 91 columns.
Culled 91 columns in 0 ms.
// Phase 1: matrix 179 rows 182 cols 390 entries
Finished phase 1 with 168 SingleSign rule and 4 generalized
[2026-05-25 17:01:51] [INFO ] Computed 101 invariants in 3 ms
Computed 101 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-7067750691775662681.kers
Total runtime 4 ms.
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :3.59649e+07 after 3.46612e+08
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 20/148 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 83/231 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :3.46612e+08 after 8.58799e+09
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 38/269 variables, 38/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 179/448 variables, 269/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :8.58799e+09 after 4.83598e+10
At refinement iteration 9 (INCLUDED_ONLY) 0/448 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 4/452 variables, 4/373 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/452 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/452 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/452 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 374 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5056 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 98/98 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 3/1 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/128 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 20/148 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 83/231 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 38/269 variables, 38/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :4.83598e+10 after 3.37423e+12
At refinement iteration 9 (OVERLAPS) 179/448 variables, 269/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/448 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/452 variables, 4/374 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/452 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/452 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/452 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/452 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 452/452 variables, and 376 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 98/98 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10279ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 128 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 179/179 transitions.
Graph (complete) has 415 edges and 273 vertex of which 253 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.7 ms
Discarding 20 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Ensure Unique test removed 42 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 211 transition count 164
Reduce places removed 7 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 21 rules applied. Total rules applied 72 place count 204 transition count 150
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 86 place count 190 transition count 150
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 86 place count 190 transition count 140
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 106 place count 180 transition count 140
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 110 place count 176 transition count 136
Iterating global reduction 3 with 4 rules applied. Total rules applied 114 place count 176 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 175 transition count 135
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 175 transition count 134
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 118 place count 175 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 119 place count 174 transition count 133
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 120 place count 174 transition count 133
Applied a total of 120 rules in 176 ms. Remains 174 /273 variables (removed 99) and now considering 133/179 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 174/273 places, 133/179 transitions.
RANDOM walk for 40004 steps (201 resets) in 328 ms. (121 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (31 resets) in 680 ms. (58 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (33 resets) in 362 ms. (110 steps per ms) remains 2/3 properties
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (33 resets) in 410 ms. (97 steps per ms) remains 1/2 properties
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12879758115745460498.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6962053611949054529.kers'
[2026-05-25 17:02:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12879758115745460498.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6962053611949054529.kers]
Culling duplicate invariants (modulo rational): removing 47 columns.
Culled 47 columns in 0 ms.
// Phase 1: matrix 133 rows 127 cols 283 entries
Finished phase 1 with 118 SingleSign rule and 3 generalized
[2026-05-25 17:02:02] [INFO ] Computed 53 invariants in 0 ms
Computed 53 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6962053611949054529.kers
Total runtime 1 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 18/84 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2/86 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 91/177 variables, 86/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 91/268 variables, 59/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 34/302 variables, 25/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/302 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/302 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/307 variables, 4/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/307 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/307 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/307 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 227 constraints, problems are : Problem set: 0 solved, 1 unsolved in 672 ms.
Refiners :[Generalized P Invariants (flows): 53/53 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 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/66 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 18/84 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2/86 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 91/177 variables, 86/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 91/268 variables, 59/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 34/302 variables, 25/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/302 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/302 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/307 variables, 4/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/307 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/307 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/307 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 227 constraints, problems are : Problem set: 0 solved, 1 unsolved in 607 ms.
Refiners :[Generalized P Invariants (flows): 53/53 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1297ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 229 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=76 )
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-2024-05 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 14 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 14842 ms.

BK_STOP 1779728523530

--------------------
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="IBMB2S565S3960-PT-none"
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 IBMB2S565S3960-PT-none, 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 r162-smll-177961107700103"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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