fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r050-smll-177946901000087
Last Updated
Jun 17, 2026

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
616.487 14085.00 40033.00 94.80 FTTTTTFTFFFTTFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r050-smll-177946901000087.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is Champagne-PT-H07T1U, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r050-smll-177946901000087
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 840K
-rw-r--r-- 1 mcc users 8.6K Mar 6 10:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Mar 6 10:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 6 10:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 6 10:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Mar 6 10:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 213K Mar 6 10:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Mar 6 10:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 123K Mar 6 10:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 208K 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 Champagne-PT-H07T1U-ReachabilityFireability-2024-00
FORMULA_NAME Champagne-PT-H07T1U-ReachabilityFireability-2024-01
FORMULA_NAME Champagne-PT-H07T1U-ReachabilityFireability-2024-02
FORMULA_NAME Champagne-PT-H07T1U-ReachabilityFireability-2024-03
FORMULA_NAME Champagne-PT-H07T1U-ReachabilityFireability-2024-04
FORMULA_NAME Champagne-PT-H07T1U-ReachabilityFireability-2024-05
FORMULA_NAME Champagne-PT-H07T1U-ReachabilityFireability-2024-06
FORMULA_NAME Champagne-PT-H07T1U-ReachabilityFireability-2024-07
FORMULA_NAME Champagne-PT-H07T1U-ReachabilityFireability-2024-08
FORMULA_NAME Champagne-PT-H07T1U-ReachabilityFireability-2024-09
FORMULA_NAME Champagne-PT-H07T1U-ReachabilityFireability-2024-10
FORMULA_NAME Champagne-PT-H07T1U-ReachabilityFireability-2024-11
FORMULA_NAME Champagne-PT-H07T1U-ReachabilityFireability-2024-12
FORMULA_NAME Champagne-PT-H07T1U-ReachabilityFireability-2024-13
FORMULA_NAME Champagne-PT-H07T1U-ReachabilityFireability-2024-14
FORMULA_NAME Champagne-PT-H07T1U-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779505570235

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-H07T1U
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-23 03:06:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 03:06:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 03:06:13] [INFO ] Load time of PNML (sax parser for PT used): 263 ms
[2026-05-23 03:06:13] [INFO ] Transformed 701 places.
[2026-05-23 03:06:13] [INFO ] Transformed 931 transitions.
[2026-05-23 03:06:13] [INFO ] Found NUPN structural information;
[2026-05-23 03:06:13] [INFO ] Parsed PT model containing 701 places and 931 transitions and 2312 arcs in 522 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 44 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (89 resets) in 3033 ms. (13 steps per ms) remains 5/16 properties
FORMULA Champagne-PT-H07T1U-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H07T1U-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H07T1U-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H07T1U-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H07T1U-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H07T1U-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H07T1U-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H07T1U-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H07T1U-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H07T1U-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H07T1U-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 925 ms. (43 steps per ms) remains 5/5 properties
[2026-05-23 03:06:14] [INFO ] Flatten gal took : 463 ms
BEST_FIRST walk for 40003 steps (8 resets) in 370 ms. (107 steps per ms) remains 5/5 properties
[2026-05-23 03:06:15] [INFO ] Flatten gal took : 193 ms
BEST_FIRST walk for 40004 steps (8 resets) in 1187 ms. (33 steps per ms) remains 4/5 properties
FORMULA Champagne-PT-H07T1U-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2026-05-23 03:06:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9248760457723355248.gal : 90 ms
[2026-05-23 03:06:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5396443529609918641.prop : 12 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/ReachabilityCardinality9248760457723355248.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5396443529609918641.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
BEST_FIRST walk for 40003 steps (8 resets) in 436 ms. (91 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 558 ms. (71 steps per ms) remains 4/4 properties
Loading property file /tmp/ReachabilityCardinality5396443529609918641.prop.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1648616426995276624.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9793627517478274038.kers'
[2026-05-23 03:06:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1648616426995276624.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9793627517478274038.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 931 rows 701 cols 2312 entries
Finished phase 1 with 674 SingleSign rule and 0 generalized
[2026-05-23 03:06:15] [INFO ] Computed 27 invariants in 6 ms
Computed 27 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-9793627517478274038.kers
Total runtime 9 ms.
Excessive predecessor constraint size, skipping predecessor.
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 9
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :9 after 13
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :13 after 36
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :36 after 240
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :240 after 386
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :386 after 449
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :449 after 4542
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :4542 after 71285
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :71285 after 379199
At refinement iteration 2 (OVERLAPS) 579/701 variables, 27/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :379199 after 3.30315e+07
At refinement iteration 3 (INCLUDED_ONLY) 0/701 variables, 579/728 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/701 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 931/1632 variables, 701/1429 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1632 variables, 0/1429 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/1632 variables, 0/1429 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1632/1632 variables, and 1429 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1761 ms.
Refiners :[Domain max(s): 701/701 constraints, Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 701/701 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :3.30315e+07 after 1.37266e+10
At refinement iteration 2 (OVERLAPS) 579/701 variables, 27/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/701 variables, 579/728 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :1.37266e+10 after 2.13422e+10
At refinement iteration 4 (INCLUDED_ONLY) 0/701 variables, 3/731 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/701 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 931/1632 variables, 701/1432 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1632 variables, 1/1433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :2.13422e+10 after 3.34521e+10
At refinement iteration 8 (INCLUDED_ONLY) 0/1632 variables, 0/1433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/1632 variables, 1/1434 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1632/1632 variables, and 1434 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5010 ms.
Refiners :[Domain max(s): 701/701 constraints, Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 701/701 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6929ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 122 out of 701 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 701/701 places, 931/931 transitions.
Graph (trivial) has 465 edges and 701 vertex of which 82 / 701 are part of one of the 11 SCC in 10 ms
Free SCC test removed 71 places
Drop transitions (Empty/Sink Transition effects.) removed 85 transitions
Reduce isomorphic transitions removed 85 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 176 transitions
Trivial Post-agglo rules discarded 176 transitions
Performed 176 trivial Post agglomeration. Transition count delta: 176
Iterating post reduction 0 with 176 rules applied. Total rules applied 177 place count 630 transition count 670
Reduce places removed 176 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 198 rules applied. Total rules applied 375 place count 454 transition count 648
Reduce places removed 10 places and 0 transitions.
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Iterating post reduction 2 with 54 rules applied. Total rules applied 429 place count 444 transition count 604
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 48 rules applied. Total rules applied 477 place count 400 transition count 600
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 479 place count 398 transition count 600
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 37 Pre rules applied. Total rules applied 479 place count 398 transition count 563
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 553 place count 361 transition count 563
Discarding 86 places :
Symmetric choice reduction at 5 with 86 rule applications. Total rules 639 place count 275 transition count 477
Iterating global reduction 5 with 86 rules applied. Total rules applied 725 place count 275 transition count 477
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 726 place count 275 transition count 476
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 726 place count 275 transition count 472
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 734 place count 271 transition count 472
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 6 with 76 rules applied. Total rules applied 810 place count 233 transition count 434
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 830 place count 223 transition count 475
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 834 place count 223 transition count 471
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 7 with 11 rules applied. Total rules applied 845 place count 223 transition count 460
Free-agglomeration rule applied 16 times.
Iterating global reduction 7 with 16 rules applied. Total rules applied 861 place count 223 transition count 444
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 882 place count 207 transition count 439
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 896 place count 207 transition count 425
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 897 place count 207 transition count 425
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 898 place count 206 transition count 424
Applied a total of 898 rules in 301 ms. Remains 206 /701 variables (removed 495) and now considering 424/931 (removed 507) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 312 ms. Remains : 206/701 places, 424/931 transitions.
RANDOM walk for 40000 steps (211 resets) in 906 ms. (44 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 233 ms. (170 steps per ms) remains 3/4 properties
FORMULA Champagne-PT-H07T1U-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (11 resets) in 259 ms. (153 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (13 resets) in 596 ms. (67 steps per ms) remains 2/3 properties
FORMULA Champagne-PT-H07T1U-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 526 ms. (75 steps per ms) remains 1/2 properties
FORMULA Champagne-PT-H07T1U-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2026-05-23 03:06:23] [INFO ] Flow matrix only has 395 transitions (discarded 29 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6507744220783108885.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9207972499497616770.kers'
[2026-05-23 03:06:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6507744220783108885.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9207972499497616770.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 395 rows 206 cols 1154 entries
Finished phase 1 with 179 SingleSign rule and 0 generalized
[2026-05-23 03:06:23] [INFO ] Computed 27 invariants in 2 ms
Computed 27 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9207972499497616770.kers
Total runtime 3 ms.
[2026-05-23 03:06:23] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 148/206 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 395/601 variables, 206/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 15/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/601 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/601 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 601/601 variables, and 248 constraints, problems are : Problem set: 0 solved, 1 unsolved in 328 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 206/206 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 148/206 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 395/601 variables, 206/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 15/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/601 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/601 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 601/601 variables, and 248 constraints, problems are : Problem set: 0 solved, 1 unsolved in 361 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 206/206 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 739ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 82 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=82 )
FORMULA Champagne-PT-H07T1U-ReachabilityFireability-2024-08 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 12 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 11493 ms.

BK_STOP 1779505584320

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is Champagne-PT-H07T1U, 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 r050-smll-177946901000087"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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