Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339300127.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is Champagne-PT-H09T0R, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339300127
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 8.8K Jun 6 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Jun 6 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 6 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 6 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 11:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 11:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 11:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 11:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 12K Jun 6 08:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Jun 6 08:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Jun 6 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Jun 6 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 266K Jun 5 20:08 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 Champagne-PT-H09T0R-ReachabilityFireability-2025-00
FORMULA_NAME Champagne-PT-H09T0R-ReachabilityFireability-2025-01
FORMULA_NAME Champagne-PT-H09T0R-ReachabilityFireability-2025-02
FORMULA_NAME Champagne-PT-H09T0R-ReachabilityFireability-2025-03
FORMULA_NAME Champagne-PT-H09T0R-ReachabilityFireability-2025-04
FORMULA_NAME Champagne-PT-H09T0R-ReachabilityFireability-2025-05
FORMULA_NAME Champagne-PT-H09T0R-ReachabilityFireability-2025-06
FORMULA_NAME Champagne-PT-H09T0R-ReachabilityFireability-2025-07
FORMULA_NAME Champagne-PT-H09T0R-ReachabilityFireability-2025-08
FORMULA_NAME Champagne-PT-H09T0R-ReachabilityFireability-2025-09
FORMULA_NAME Champagne-PT-H09T0R-ReachabilityFireability-2025-10
FORMULA_NAME Champagne-PT-H09T0R-ReachabilityFireability-2025-11
FORMULA_NAME Champagne-PT-H09T0R-ReachabilityFireability-2025-12
FORMULA_NAME Champagne-PT-H09T0R-ReachabilityFireability-2025-13
FORMULA_NAME Champagne-PT-H09T0R-ReachabilityFireability-2025-14
FORMULA_NAME Champagne-PT-H09T0R-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1749330338728

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H09T0R
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-07 21:05:39] [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]
[2025-06-07 21:05:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 21:05:40] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2025-06-07 21:05:40] [INFO ] Transformed 979 places.
[2025-06-07 21:05:40] [INFO ] Transformed 1572 transitions.
[2025-06-07 21:05:40] [INFO ] Found NUPN structural information;
[2025-06-07 21:05:40] [INFO ] Parsed PT model containing 979 places and 1572 transitions and 4420 arcs in 290 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (53 resets) in 1924 ms. (20 steps per ms) remains 3/16 properties
FORMULA Champagne-PT-H09T0R-ReachabilityFireability-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T0R-ReachabilityFireability-2025-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T0R-ReachabilityFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T0R-ReachabilityFireability-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T0R-ReachabilityFireability-2025-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T0R-ReachabilityFireability-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T0R-ReachabilityFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T0R-ReachabilityFireability-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T0R-ReachabilityFireability-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T0R-ReachabilityFireability-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T0R-ReachabilityFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T0R-ReachabilityFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T0R-ReachabilityFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 396 ms. (100 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 2/3 properties
FORMULA Champagne-PT-H09T0R-ReachabilityFireability-2025-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 1/2 properties
FORMULA Champagne-PT-H09T0R-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2025-06-07 21:05:41] [INFO ] Flatten gal took : 239 ms
[2025-06-07 21:05:41] [INFO ] Flatten gal took : 82 ms
// Phase 1: matrix 1572 rows 979 cols
[2025-06-07 21:05:41] [INFO ] Computed 49 invariants in 55 ms
[2025-06-07 21:05:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17304080993422990100.gal : 108 ms
Excessive predecessor constraint size, skipping predecessor.
[2025-06-07 21:05:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10543794208696945981.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17304080993422990100.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10543794208696945981.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Loading property file /tmp/ReachabilityCardinality10543794208696945981.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 608/656 variables, 32/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/656 variables, 608/688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/656 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 323/979 variables, 17/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/979 variables, 323/1028 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/979 variables, 0/1028 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 13
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :13 after 197
At refinement iteration 8 (OVERLAPS) 1572/2551 variables, 979/2007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2551 variables, 0/2007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2551 variables, 0/2007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :197 after 54464
After SMT solving in domain Real declared 2551/2551 variables, and 2007 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1481 ms.
Refiners :[Domain max(s): 979/979 constraints, Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 979/979 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
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 608/656 variables, 32/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/656 variables, 608/688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:05:43] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:05:43] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:05:43] [INFO ] Deduced a trap composed of 43 places in 222 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:05:44] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:05:44] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/656 variables, 5/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/656 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 323/979 variables, 17/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/979 variables, 323/1033 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:05:44] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:05:44] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/979 variables, 2/1035 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/979 variables, 0/1035 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1572/2551 variables, 979/2014 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:05:45] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:05:45] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:05:45] [INFO ] Deduced a trap composed of 40 places in 244 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :54464 after 1.17219e+06
[2025-06-07 21:05:45] [INFO ] Deduced a trap composed of 42 places in 316 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.17219e+06 after 1.32253e+06
[2025-06-07 21:05:46] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:05:46] [INFO ] Deduced a trap composed of 66 places in 139 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:05:46] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:05:46] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:05:46] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.32253e+06 after 1.45278e+06
[2025-06-07 21:05:46] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2551 variables, 10/2024 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2551 variables, 0/2024 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2551 variables, 0/2024 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2551/2551 variables, and 2024 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3958 ms.
Refiners :[Domain max(s): 979/979 constraints, Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 979/979 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5703ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 167 ms.
Support contains 48 out of 979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 1572/1572 transitions.
Graph (trivial) has 799 edges and 979 vertex of which 57 / 979 are part of one of the 8 SCC in 4 ms
Free SCC test removed 49 places
Drop transitions (Empty/Sink Transition effects.) removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 346 transitions
Trivial Post-agglo rules discarded 346 transitions
Performed 346 trivial Post agglomeration. Transition count delta: 346
Iterating post reduction 0 with 346 rules applied. Total rules applied 347 place count 930 transition count 1161
Reduce places removed 346 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 1 with 426 rules applied. Total rules applied 773 place count 584 transition count 1081
Reduce places removed 40 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 2 with 64 rules applied. Total rules applied 837 place count 544 transition count 1057
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 3 with 34 rules applied. Total rules applied 871 place count 520 transition count 1047
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 876 place count 515 transition count 1047
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 46 Pre rules applied. Total rules applied 876 place count 515 transition count 1001
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 968 place count 469 transition count 1001
Discarding 168 places :
Symmetric choice reduction at 5 with 168 rule applications. Total rules 1136 place count 301 transition count 833
Iterating global reduction 5 with 168 rules applied. Total rules applied 1304 place count 301 transition count 833
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1308 place count 301 transition count 829
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 25 Pre rules applied. Total rules applied 1308 place count 301 transition count 804
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 6 with 50 rules applied. Total rules applied 1358 place count 276 transition count 804
Discarding 21 places :
Symmetric choice reduction at 6 with 21 rule applications. Total rules 1379 place count 255 transition count 664
Iterating global reduction 6 with 21 rules applied. Total rules applied 1400 place count 255 transition count 664
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 1421 place count 255 transition count 643
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 7 with 116 rules applied. Total rules applied 1537 place count 197 transition count 585
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1539 place count 196 transition count 587
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1540 place count 196 transition count 586
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1544 place count 196 transition count 582
Free-agglomeration rule applied 65 times.
Iterating global reduction 8 with 65 rules applied. Total rules applied 1609 place count 196 transition count 517
Reduce places removed 65 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Reduce isomorphic transitions removed 123 transitions.
Iterating post reduction 8 with 188 rules applied. Total rules applied 1797 place count 131 transition count 394
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 9 with 23 rules applied. Total rules applied 1820 place count 131 transition count 371
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.45278e+06 after 1.61802e+06
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1821 place count 130 transition count 370
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 9 with 77 rules applied. Total rules applied 1898 place count 114 transition count 309
Drop transitions (Redundant composition of simpler transitions.) removed 92 transitions
Redundant transition composition rules discarded 92 transitions
Iterating global reduction 10 with 92 rules applied. Total rules applied 1990 place count 114 transition count 217
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 10 with 1 rules applied. Total rules applied 1991 place count 114 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1992 place count 113 transition count 216
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1993 place count 113 transition count 215
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1995 place count 111 transition count 215
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 1997 place count 111 transition count 213
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 1999 place count 111 transition count 213
Applied a total of 1999 rules in 361 ms. Remains 111 /979 variables (removed 868) and now considering 213/1572 (removed 1359) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 373 ms. Remains : 111/979 places, 213/1572 transitions.
RANDOM walk for 33539 steps (7 resets) in 384 ms. (87 steps per ms) remains 0/1 properties
FORMULA Champagne-PT-H09T0R-ReachabilityFireability-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_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 7899 ms.

BK_STOP 1749330347941

--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="Champagne-PT-H09T0R"
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-5832"
echo " Executing tool itstools"
echo " Input is Champagne-PT-H09T0R, 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 r254-tall-174931339300127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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