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-177961107700102.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961107700102
=====================================================================

--------------------
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-ReachabilityCardinality-2024-00
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityCardinality-2024-01
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityCardinality-2024-02
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityCardinality-2024-03
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityCardinality-2024-04
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityCardinality-2024-05
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityCardinality-2024-06
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityCardinality-2024-07
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityCardinality-2024-08
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityCardinality-2024-09
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityCardinality-2024-10
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityCardinality-2024-11
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityCardinality-2024-12
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityCardinality-2024-13
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityCardinality-2024-14
FORMULA_NAME IBMB2S565S3960-PT-none-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779728478302

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
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
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-25 17:01:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 17:01:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 17:01:21] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2026-05-25 17:01:21] [INFO ] Transformed 273 places.
[2026-05-25 17:01:21] [INFO ] Transformed 179 transitions.
[2026-05-25 17:01:21] [INFO ] Parsed PT model containing 273 places and 179 transitions and 572 arcs in 341 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
FORMULA IBMB2S565S3960-PT-none-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40005 steps (170 resets) in 1554 ms. (25 steps per ms) remains 8/15 properties
FORMULA IBMB2S565S3960-PT-none-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-25 17:01:22] [INFO ] Flatten gal took : 254 ms
BEST_FIRST walk for 40004 steps (25 resets) in 710 ms. (56 steps per ms) remains 8/8 properties
[2026-05-25 17:01:22] [INFO ] Flatten gal took : 131 ms
BEST_FIRST walk for 40003 steps (37 resets) in 664 ms. (60 steps per ms) remains 7/8 properties
FORMULA IBMB2S565S3960-PT-none-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2026-05-25 17:01:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality949580719904062929.gal : 65 ms
BEST_FIRST walk for 40004 steps (27 resets) in 267 ms. (149 steps per ms) remains 7/7 properties
[2026-05-25 17:01:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7971336302476539730.prop : 14 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/ReachabilityCardinality949580719904062929.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7971336302476539730.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
Loading property file /tmp/ReachabilityCardinality7971336302476539730.prop.
BEST_FIRST walk for 40003 steps (25 resets) in 760 ms. (52 steps per ms) remains 7/7 properties
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :6 after 17
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :17 after 20
BEST_FIRST walk for 40004 steps (25 resets) in 651 ms. (61 steps per ms) remains 7/7 properties
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :20 after 2316
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :2316 after 2441
BEST_FIRST walk for 40004 steps (26 resets) in 297 ms. (134 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (25 resets) in 197 ms. (202 steps per ms) remains 7/7 properties
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :2441 after 3039
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :3039 after 5069
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3492727335425635423.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7789468919807475274.kers'
[2026-05-25 17:01:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3492727335425635423.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7789468919807475274.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:23] [INFO ] Computed 101 invariants in 1 ms
Computed 101 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7789468919807475274.kers
Total runtime 3 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 31/155 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 92/247 variables, 48/76 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 25/272 variables, 25/101 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 179/451 variables, 272/373 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1/452 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/452 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/452 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 374 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4005 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 98/98 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 31/155 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 92/247 variables, 48/76 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 25/272 variables, 25/103 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem IBMB2S565S3960-PT-none-ReachabilityCardinality-2024-03 is UNSAT
FORMULA IBMB2S565S3960-PT-none-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 11 (OVERLAPS) 179/451 variables, 272/376 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 5/381 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 451/452 variables, and 381 constraints, problems are : Problem set: 1 solved, 6 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 98/98 constraints, State Equation: 272/273 constraints, PredecessorRefiner: 5/7 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9220ms problems are : Problem set: 1 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 95 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 252 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Discarding 21 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Ensure Unique test removed 77 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 90 rules applied. Total rules applied 91 place count 175 transition count 157
Reduce places removed 10 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 19 rules applied. Total rules applied 110 place count 165 transition count 148
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 119 place count 156 transition count 148
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 119 place count 156 transition count 144
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 127 place count 152 transition count 144
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 129 place count 150 transition count 142
Iterating global reduction 3 with 2 rules applied. Total rules applied 131 place count 150 transition count 142
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 139 place count 146 transition count 138
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 140 place count 146 transition count 137
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 144 place count 146 transition count 133
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 148 place count 142 transition count 133
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 149 place count 142 transition count 133
Applied a total of 149 rules in 120 ms. Remains 142 /273 variables (removed 131) and now considering 133/179 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 142/273 places, 133/179 transitions.
RANDOM walk for 40000 steps (178 resets) in 182 ms. (218 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (29 resets) in 267 ms. (149 steps per ms) remains 5/6 properties
FORMULA IBMB2S565S3960-PT-none-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (26 resets) in 179 ms. (222 steps per ms) remains 2/5 properties
FORMULA IBMB2S565S3960-PT-none-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA IBMB2S565S3960-PT-none-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA IBMB2S565S3960-PT-none-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (30 resets) in 152 ms. (261 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6835998352428435572.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16111181088946823579.kers'
[2026-05-25 17:01:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6835998352428435572.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16111181088946823579.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 133 rows 130 cols 285 entries
Finished phase 1 with 121 SingleSign rule and 3 generalized
[2026-05-25 17:01:32] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16111181088946823579.kers
Total runtime 2 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 23/53 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 4/57 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 68/125 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 70/195 variables, 38/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 49/244 variables, 29/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/244 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 21/265 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/265 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/265 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 7/272 variables, 4/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/272 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 3/275 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/275 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/275 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 160 constraints, problems are : Problem set: 0 solved, 2 unsolved in 343 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 142/142 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, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 23/53 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 4/57 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 68/125 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 70/195 variables, 38/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/195 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 49/244 variables, 29/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/244 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/244 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 21/265 variables, 12/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/265 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/265 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 7/272 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/272 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 3/275 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/275 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/275 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/275 variables, and 162 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1520 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1885ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA IBMB2S565S3960-PT-none-ReachabilityCardinality-2024-01 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 312 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=312 )
FORMULA IBMB2S565S3960-PT-none-ReachabilityCardinality-2024-11 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 123 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 13861 ms.

BK_STOP 1779728494711

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="IBMB2S565S3960-PT-none"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is IBMB2S565S3960-PT-none, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r162-smll-177961107700102"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;