Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r002-oct2-177944366000182.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 Anderson-PT-08, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366000182
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.1K Mar 4 18:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Mar 4 18:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Mar 4 18:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 4 18:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 15 07:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 07:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 15 07:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Mar 4 18:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Mar 4 18:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 4 18:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 4 18:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:03 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 667K 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 Anderson-PT-08-ReachabilityCardinality-2024-00
FORMULA_NAME Anderson-PT-08-ReachabilityCardinality-2024-01
FORMULA_NAME Anderson-PT-08-ReachabilityCardinality-2024-02
FORMULA_NAME Anderson-PT-08-ReachabilityCardinality-2024-03
FORMULA_NAME Anderson-PT-08-ReachabilityCardinality-2024-04
FORMULA_NAME Anderson-PT-08-ReachabilityCardinality-2024-05
FORMULA_NAME Anderson-PT-08-ReachabilityCardinality-2024-06
FORMULA_NAME Anderson-PT-08-ReachabilityCardinality-2024-07
FORMULA_NAME Anderson-PT-08-ReachabilityCardinality-2024-08
FORMULA_NAME Anderson-PT-08-ReachabilityCardinality-2024-09
FORMULA_NAME Anderson-PT-08-ReachabilityCardinality-2024-10
FORMULA_NAME Anderson-PT-08-ReachabilityCardinality-2024-11
FORMULA_NAME Anderson-PT-08-ReachabilityCardinality-2024-12
FORMULA_NAME Anderson-PT-08-ReachabilityCardinality-2024-13
FORMULA_NAME Anderson-PT-08-ReachabilityCardinality-2024-14
FORMULA_NAME Anderson-PT-08-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779462524943

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-22 15:08:46] [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-22 15:08:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 15:08:46] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2026-05-22 15:08:46] [INFO ] Transformed 401 places.
[2026-05-22 15:08:46] [INFO ] Transformed 1328 transitions.
[2026-05-22 15:08:46] [INFO ] Found NUPN structural information;
[2026-05-22 15:08:46] [INFO ] Parsed PT model containing 401 places and 1328 transitions and 5088 arcs in 303 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-22 15:08:47] [INFO ] Flatten gal took : 269 ms
RANDOM walk for 40000 steps (8 resets) in 2327 ms. (17 steps per ms) remains 2/12 properties
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 273 ms. (145 steps per ms) remains 2/2 properties
[2026-05-22 15:08:47] [INFO ] Flatten gal took : 116 ms
BEST_FIRST walk for 40003 steps (8 resets) in 182 ms. (218 steps per ms) remains 2/2 properties
[2026-05-22 15:08:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2698852341829376773.gal : 69 ms
[2026-05-22 15:08:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2959481347659003089.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2698852341829376773.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2959481347659003089.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 ...328
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5896084830860601014.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4441968896247938835.kers'
[2026-05-22 15:08:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5896084830860601014.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4441968896247938835.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1328 rows 401 cols 4960 entries
Finished phase 1 with 232 SingleSign rule and 150 generalized
[2026-05-22 15:08:47] [INFO ] Computed 19 invariants in 4 ms
Computed 19 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-4441968896247938835.kers
Total runtime 6 ms.
[2026-05-22 15:08:47] [INFO ] State equation strengthened by 56 read => feed constraints.
Loading property file /tmp/ReachabilityCardinality2959481347659003089.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 183/188 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 183/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 12/200 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 12/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 11
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :11 after 12
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :12 after 19
At refinement iteration 8 (OVERLAPS) 138/338 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :19 after 55
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 138/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :55 after 76
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 62/400 variables, 10/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :76 after 391
At refinement iteration 12 (INCLUDED_ONLY) 0/400 variables, 62/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :391 after 841
At refinement iteration 13 (INCLUDED_ONLY) 0/400 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/401 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/401 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :841 after 4198
At refinement iteration 16 (INCLUDED_ONLY) 0/401 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1328/1729 variables, 401/821 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1729 variables, 56/877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1729 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1729 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1729/1729 variables, and 877 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1450 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 401/401 constraints, ReadFeed: 56/56 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/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 183/188 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 183/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 12/200 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 12/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 138/338 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 138/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 62/400 variables, 10/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/400 variables, 62/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4198 after 28393
At refinement iteration 13 (INCLUDED_ONLY) 0/400 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/400 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/400 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/401 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/401 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/401 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1328/1729 variables, 401/823 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1729 variables, 56/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1729 variables, 2/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :28393 after 188444
At refinement iteration 22 (INCLUDED_ONLY) 0/1729 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1729/1729 variables, and 881 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5014 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 401/401 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6594ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 1328/1328 transitions.
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 53 Pre rules applied. Total rules applied 0 place count 401 transition count 1275
Deduced a syphon composed of 53 places in 2 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 0 with 106 rules applied. Total rules applied 106 place count 348 transition count 1275
Discarding 108 places :
Symmetric choice reduction at 0 with 108 rule applications. Total rules 214 place count 240 transition count 397
Iterating global reduction 0 with 108 rules applied. Total rules applied 322 place count 240 transition count 397
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 328 place count 237 transition count 394
Applied a total of 328 rules in 153 ms. Remains 237 /401 variables (removed 164) and now considering 394/1328 (removed 934) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 237/401 places, 394/1328 transitions.
RANDOM walk for 40000 steps (8 resets) in 387 ms. (103 steps per ms) remains 1/2 properties
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13983057664568634791.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5103667252405540654.kers'
[2026-05-22 15:08:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13983057664568634791.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5103667252405540654.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 394 rows 237 cols 1442 entries
Finished phase 1 with 68 SingleSign rule and 150 generalized
[2026-05-22 15:08:54] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5103667252405540654.kers
Total runtime 2 ms.
[2026-05-22 15:08:54] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 196/198 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/227 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/237 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 394/631 variables, 237/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/631 variables, 56/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/631 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/631 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 631/631 variables, and 312 constraints, problems are : Problem set: 0 solved, 1 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 237/237 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 196/198 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/227 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/237 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 394/631 variables, 237/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/631 variables, 56/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/631 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/631 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/631 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 631/631 variables, and 313 constraints, problems are : Problem set: 0 solved, 1 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 237/237 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 519ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 394/394 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 235 transition count 392
Applied a total of 4 rules in 19 ms. Remains 235 /237 variables (removed 2) and now considering 392/394 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 235/237 places, 392/394 transitions.
RANDOM walk for 40000 steps (8 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 384279 steps, run visited all 1 properties in 1019 ms. (steps per millisecond=377 )
Probabilistic random walk after 384279 steps, saw 255800 distinct states, run finished after 1023 ms. (steps per millisecond=375 ) properties seen :1
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
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 9985 ms.

BK_STOP 1779462536540

--------------------
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="Anderson-PT-08"
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 Anderson-PT-08, 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 r002-oct2-177944366000182"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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