fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r254-tall-174931339300135
Last Updated
June 24, 2025

About the Execution of ITS-Tools for Champagne-PT-H09T1U

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 16508.00 0.00 0.00 TFTTTTFTFFTTTFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339300135.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-H09T1U, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339300135
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 6.2K Jun 6 08:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Jun 6 08:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K 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 4.0K Jun 6 13:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Jun 6 13:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 13:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 13:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 8.3K Jun 6 08:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Jun 6 08:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Jun 6 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Jun 6 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 13:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 13:15 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 314K 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-H09T1U-ReachabilityFireability-2025-00
FORMULA_NAME Champagne-PT-H09T1U-ReachabilityFireability-2025-01
FORMULA_NAME Champagne-PT-H09T1U-ReachabilityFireability-2025-02
FORMULA_NAME Champagne-PT-H09T1U-ReachabilityFireability-2025-03
FORMULA_NAME Champagne-PT-H09T1U-ReachabilityFireability-2025-04
FORMULA_NAME Champagne-PT-H09T1U-ReachabilityFireability-2025-05
FORMULA_NAME Champagne-PT-H09T1U-ReachabilityFireability-2025-06
FORMULA_NAME Champagne-PT-H09T1U-ReachabilityFireability-2025-07
FORMULA_NAME Champagne-PT-H09T1U-ReachabilityFireability-2025-08
FORMULA_NAME Champagne-PT-H09T1U-ReachabilityFireability-2025-09
FORMULA_NAME Champagne-PT-H09T1U-ReachabilityFireability-2025-10
FORMULA_NAME Champagne-PT-H09T1U-ReachabilityFireability-2025-11
FORMULA_NAME Champagne-PT-H09T1U-ReachabilityFireability-2025-12
FORMULA_NAME Champagne-PT-H09T1U-ReachabilityFireability-2025-13
FORMULA_NAME Champagne-PT-H09T1U-ReachabilityFireability-2025-14
FORMULA_NAME Champagne-PT-H09T1U-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1749331579116

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-H09T1U
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-07 21:26:20] [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:26:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 21:26:20] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2025-06-07 21:26:20] [INFO ] Transformed 1273 places.
[2025-06-07 21:26:20] [INFO ] Transformed 1915 transitions.
[2025-06-07 21:26:20] [INFO ] Found NUPN structural information;
[2025-06-07 21:26:20] [INFO ] Parsed PT model containing 1273 places and 1915 transitions and 5106 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (41 resets) in 1660 ms. (24 steps per ms) remains 4/16 properties
FORMULA Champagne-PT-H09T1U-ReachabilityFireability-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T1U-ReachabilityFireability-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T1U-ReachabilityFireability-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T1U-ReachabilityFireability-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T1U-ReachabilityFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T1U-ReachabilityFireability-2025-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T1U-ReachabilityFireability-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T1U-ReachabilityFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T1U-ReachabilityFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T1U-ReachabilityFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T1U-ReachabilityFireability-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T1U-ReachabilityFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-07 21:26:21] [INFO ] Flatten gal took : 177 ms
[2025-06-07 21:26:21] [INFO ] Flatten gal took : 113 ms
[2025-06-07 21:26:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality712458857611531327.gal : 50 ms
BEST_FIRST walk for 40004 steps (8 resets) in 582 ms. (68 steps per ms) remains 4/4 properties
[2025-06-07 21:26:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14173763566909455856.prop : 2 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/ReachabilityCardinality712458857611531327.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14173763566909455856.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 ...328
BEST_FIRST walk for 40004 steps (8 resets) in 572 ms. (69 steps per ms) remains 4/4 properties
Loading property file /tmp/ReachabilityCardinality14173763566909455856.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 327 ms. (121 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 4/4 properties
// Phase 1: matrix 1915 rows 1273 cols
[2025-06-07 21:26:21] [INFO ] Computed 49 invariants in 25 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1070/1198 variables, 46/174 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1198 variables, 1070/1244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1198 variables, 0/1244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 75/1273 variables, 3/1247 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1273 variables, 75/1322 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1273 variables, 0/1322 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 13
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :13 after 102
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :102 after 4097
At refinement iteration 8 (OVERLAPS) 1915/3188 variables, 1273/2595 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3188 variables, 0/2595 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/3188 variables, 0/2595 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3188/3188 variables, and 2595 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1629 ms.
Refiners :[Domain max(s): 1273/1273 constraints, Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 1273/1273 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1070/1198 variables, 46/174 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1198 variables, 1070/1244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:24] [INFO ] Deduced a trap composed of 57 places in 252 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:24] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:24] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:24] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1198 variables, 4/1248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:24] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1198 variables, 1/1249 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:25] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:25] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1198 variables, 2/1251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1198 variables, 0/1251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 75/1273 variables, 3/1254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1273 variables, 75/1329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :4097 after 413344
At refinement iteration 10 (INCLUDED_ONLY) 0/1273 variables, 0/1329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :413344 after 1.15274e+06
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1.15274e+06 after 1.15354e+06
At refinement iteration 11 (OVERLAPS) 1915/3188 variables, 1273/2602 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1.15354e+06 after 1.15557e+06
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :1.15557e+06 after 1.1585e+06
At refinement iteration 12 (INCLUDED_ONLY) 0/3188 variables, 1/2603 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1.1585e+06 after 1.17542e+06
[2025-06-07 21:26:26] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 8 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :1.17542e+06 after 1.20765e+06
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:27] [INFO ] Deduced a trap composed of 52 places in 111 ms of which 15 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/3188 variables, 2/2605 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :1.20765e+06 after 1.33168e+06
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:27] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 16 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/3188 variables, 1/2606 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :1.33168e+06 after 1.80019e+06
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3188/3188 variables, and 2606 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5013 ms.
Refiners :[Domain max(s): 1273/1273 constraints, Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 1273/1273 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6757ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 128 out of 1273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1273/1273 places, 1915/1915 transitions.
Graph (trivial) has 903 edges and 1273 vertex of which 96 / 1273 are part of one of the 13 SCC in 8 ms
Free SCC test removed 83 places
Drop transitions (Empty/Sink Transition effects.) removed 103 transitions
Reduce isomorphic transitions removed 103 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 0 with 392 rules applied. Total rules applied 393 place count 1190 transition count 1420
Reduce places removed 392 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 1 with 457 rules applied. Total rules applied 850 place count 798 transition count 1355
Reduce places removed 30 places and 0 transitions.
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Iterating post reduction 2 with 104 rules applied. Total rules applied 954 place count 768 transition count 1281
Reduce places removed 74 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 79 rules applied. Total rules applied 1033 place count 694 transition count 1276
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1035 place count 692 transition count 1276
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 79 Pre rules applied. Total rules applied 1035 place count 692 transition count 1197
Deduced a syphon composed of 79 places in 3 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 5 with 158 rules applied. Total rules applied 1193 place count 613 transition count 1197
Discarding 169 places :
Symmetric choice reduction at 5 with 169 rule applications. Total rules 1362 place count 444 transition count 1028
Iterating global reduction 5 with 169 rules applied. Total rules applied 1531 place count 444 transition count 1028
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1536 place count 444 transition count 1023
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 1536 place count 444 transition count 1017
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1548 place count 438 transition count 1017
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1550 place count 436 transition count 1011
Iterating global reduction 6 with 2 rules applied. Total rules applied 1552 place count 436 transition count 1011
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1554 place count 436 transition count 1009
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 1 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 7 with 162 rules applied. Total rules applied 1716 place count 355 transition count 928
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -109
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 1758 place count 334 transition count 1037
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 1778 place count 334 transition count 1017
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 8 with 36 rules applied. Total rules applied 1814 place count 334 transition count 981
Free-agglomeration rule applied 32 times.
Iterating global reduction 8 with 32 rules applied. Total rules applied 1846 place count 334 transition count 949
Reduce places removed 32 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 43 rules applied. Total rules applied 1889 place count 302 transition count 938
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 9 with 19 rules applied. Total rules applied 1908 place count 302 transition count 919
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 9 with 15 rules applied. Total rules applied 1923 place count 302 transition count 919
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1924 place count 301 transition count 918
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1926 place count 299 transition count 918
Drop transitions (Redundant composition of simpler transitions.) removed 60 transitions
Redundant transition composition rules discarded 60 transitions
Iterating global reduction 10 with 60 rules applied. Total rules applied 1986 place count 299 transition count 858
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1987 place count 298 transition count 854
Iterating global reduction 10 with 1 rules applied. Total rules applied 1988 place count 298 transition count 854
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1989 place count 298 transition count 853
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1990 place count 298 transition count 852
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1991 place count 297 transition count 852
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 12 with 8 rules applied. Total rules applied 1999 place count 297 transition count 852
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 2000 place count 297 transition count 851
Applied a total of 2000 rules in 473 ms. Remains 297 /1273 variables (removed 976) and now considering 851/1915 (removed 1064) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 481 ms. Remains : 297/1273 places, 851/1915 transitions.
RANDOM walk for 40000 steps (8 resets) in 709 ms. (56 steps per ms) remains 3/4 properties
FORMULA Champagne-PT-H09T1U-ReachabilityFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 2/3 properties
FORMULA Champagne-PT-H09T1U-ReachabilityFireability-2025-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 2/2 properties
[2025-06-07 21:26:29] [INFO ] Flow matrix only has 807 transitions (discarded 44 similar events)
// Phase 1: matrix 807 rows 297 cols
[2025-06-07 21:26:29] [INFO ] Computed 47 invariants in 3 ms
[2025-06-07 21:26:29] [INFO ] State equation strengthened by 23 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 187/281 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/292 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 801/1093 variables, 292/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1093 variables, 23/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1093 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 10/1103 variables, 4/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1103 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/1104 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1104 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1104 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1104 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1104/1104 variables, and 367 constraints, problems are : Problem set: 0 solved, 2 unsolved in 388 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, State Equation: 297/297 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 187/281 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:29] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:29] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 11/292 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:29] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 801/1093 variables, 292/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1093 variables, 23/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:30] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1093 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1093 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 10/1103 variables, 4/369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1103 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/1104 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1104 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1104 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:30] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 2 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/1104 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1104 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1104 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1104/1104 variables, and 372 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1062 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, State Equation: 297/297 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1474ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 341 ms.
Support contains 94 out of 297 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 297/297 places, 851/851 transitions.
Graph (trivial) has 95 edges and 297 vertex of which 43 / 297 are part of one of the 14 SCC in 1 ms
Free SCC test removed 29 places
Drop transitions (Empty/Sink Transition effects.) removed 52 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 67 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 268 transition count 780
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 264 transition count 779
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 263 transition count 779
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 262 transition count 778
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 262 transition count 778
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 28 place count 254 transition count 771
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 45 edges and 254 vertex of which 6 / 254 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 12 rules applied. Total rules applied 40 place count 250 transition count 760
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 56 place count 250 transition count 744
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 60 place count 248 transition count 742
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 64 place count 248 transition count 738
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 65 place count 247 transition count 734
Iterating global reduction 6 with 1 rules applied. Total rules applied 66 place count 247 transition count 734
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 67 place count 247 transition count 733
Drop transitions (Redundant composition of simpler transitions.) removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 7 with 71 rules applied. Total rules applied 138 place count 247 transition count 662
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 139 place count 247 transition count 661
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 140 place count 246 transition count 661
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 141 place count 246 transition count 660
Free-agglomeration rule applied 18 times.
Iterating global reduction 9 with 18 rules applied. Total rules applied 159 place count 246 transition count 642
Reduce places removed 18 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 26 rules applied. Total rules applied 185 place count 228 transition count 634
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 10 with 13 rules applied. Total rules applied 198 place count 228 transition count 621
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 10 with 8 rules applied. Total rules applied 206 place count 228 transition count 621
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 208 place count 226 transition count 618
Iterating global reduction 10 with 2 rules applied. Total rules applied 210 place count 226 transition count 618
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 211 place count 226 transition count 617
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 212 place count 226 transition count 616
Applied a total of 212 rules in 115 ms. Remains 226 /297 variables (removed 71) and now considering 616/851 (removed 235) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 226/297 places, 616/851 transitions.
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :1.80019e+06 after 6.72022e+06
RANDOM walk for 40000 steps (8 resets) in 345 ms. (115 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 492469 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :0 out of 2
Probabilistic random walk after 492469 steps, saw 433229 distinct states, run finished after 3006 ms. (steps per millisecond=163 ) properties seen :0
[2025-06-07 21:26:34] [INFO ] Flow matrix only has 575 transitions (discarded 41 similar events)
// Phase 1: matrix 575 rows 226 cols
[2025-06-07 21:26:34] [INFO ] Computed 46 invariants in 3 ms
[2025-06-07 21:26:34] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 129/223 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/226 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 575/801 variables, 226/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/801 variables, 9/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/801 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/801 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 801/801 variables, and 281 constraints, problems are : Problem set: 0 solved, 2 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 226/226 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 129/223 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:34] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:34] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:34] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 3/226 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:34] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:35] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 575/801 variables, 226/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/801 variables, 9/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/801 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:26:35] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/801 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/801 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/801 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 801/801 variables, and 287 constraints, problems are : Problem set: 0 solved, 2 unsolved in 753 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 226/226 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1002ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA Champagne-PT-H09T1U-ReachabilityFireability-2025-05 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 59 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=29 )
FORMULA Champagne-PT-H09T1U-ReachabilityFireability-2025-07 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 59 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 15298 ms.

BK_STOP 1749331595624

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

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