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

About the Execution of ITS-Tools for DLCround-PT-12b

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

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r072-tall-174860067100271.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 DLCround-PT-12b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860067100271
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.9M May 29 14:32 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 DLCround-PT-12b-ReachabilityFireability-2025-00
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-2025-01
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-2025-02
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-2025-03
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-2025-04
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-2025-05
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-2025-06
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-2025-07
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-2025-08
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-2025-09
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-2025-10
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-2025-11
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-2025-12
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-2025-13
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-2025-14
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748684960767

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-12b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-05-31 09:49:21] [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-05-31 09:49:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 09:49:22] [INFO ] Load time of PNML (sax parser for PT used): 266 ms
[2025-05-31 09:49:22] [INFO ] Transformed 4848 places.
[2025-05-31 09:49:22] [INFO ] Transformed 7836 transitions.
[2025-05-31 09:49:22] [INFO ] Found NUPN structural information;
[2025-05-31 09:49:22] [INFO ] Parsed PT model containing 4848 places and 7836 transitions and 22188 arcs in 518 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 2446 ms. (16 steps per ms) remains 7/16 properties
FORMULA DLCround-PT-12b-ReachabilityFireability-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 7/7 properties
[2025-05-31 09:49:23] [INFO ] Flatten gal took : 552 ms
BEST_FIRST walk for 40004 steps (8 resets) in 931 ms. (42 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 204 ms. (195 steps per ms) remains 7/7 properties
[2025-05-31 09:49:24] [INFO ] Flatten gal took : 297 ms
BEST_FIRST walk for 40004 steps (8 resets) in 1020 ms. (39 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 162 ms. (245 steps per ms) remains 7/7 properties
[2025-05-31 09:49:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3361887070012219460.gal : 188 ms
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 7/7 properties
[2025-05-31 09:49:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9691432704163278844.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/ReachabilityCardinality3361887070012219460.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9691432704163278844.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 252 ms. (158 steps per ms) remains 7/7 properties
// Phase 1: matrix 7836 rows 4848 cols
[2025-05-31 09:49:24] [INFO ] Computed 277 invariants in 61 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/255 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Loading property file /tmp/ReachabilityCardinality9691432704163278844.prop.
At refinement iteration 2 (OVERLAPS) 4533/4788 variables, 271/526 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4788 variables, 4533/5059 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4788 variables, 0/5059 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SMT process timed out in 5270ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 255 out of 4848 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4848/4848 places, 7836/7836 transitions.
Graph (trivial) has 3943 edges and 4848 vertex of which 398 / 4848 are part of one of the 49 SCC in 43 ms
Free SCC test removed 349 places
Drop transitions (Empty/Sink Transition effects.) removed 403 transitions
Reduce isomorphic transitions removed 403 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1693 transitions
Trivial Post-agglo rules discarded 1693 transitions
Performed 1693 trivial Post agglomeration. Transition count delta: 1693
Iterating post reduction 0 with 1693 rules applied. Total rules applied 1694 place count 4499 transition count 5740
Reduce places removed 1693 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 1742 rules applied. Total rules applied 3436 place count 2806 transition count 5691
Reduce places removed 24 places and 0 transitions.
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Iterating post reduction 2 with 98 rules applied. Total rules applied 3534 place count 2782 transition count 5617
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 3 with 74 rules applied. Total rules applied 3608 place count 2708 transition count 5617
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 107 Pre rules applied. Total rules applied 3608 place count 2708 transition count 5510
Deduced a syphon composed of 107 places in 37 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 4 with 214 rules applied. Total rules applied 3822 place count 2601 transition count 5510
Discarding 626 places :
Symmetric choice reduction at 4 with 626 rule applications. Total rules 4448 place count 1975 transition count 4884
Iterating global reduction 4 with 626 rules applied. Total rules applied 5074 place count 1975 transition count 4884
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 4 with 30 rules applied. Total rules applied 5104 place count 1975 transition count 4854
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 5115 place count 1967 transition count 4851
Performed 240 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 240 Pre rules applied. Total rules applied 5115 place count 1967 transition count 4611
Deduced a syphon composed of 240 places in 44 ms
Reduce places removed 240 places and 0 transitions.
Iterating global reduction 6 with 480 rules applied. Total rules applied 5595 place count 1727 transition count 4611
Discarding 33 places :
Symmetric choice reduction at 6 with 33 rule applications. Total rules 5628 place count 1694 transition count 4173
Iterating global reduction 6 with 33 rules applied. Total rules applied 5661 place count 1694 transition count 4173
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 5664 place count 1694 transition count 4170
Performed 417 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 417 places in 3 ms
Reduce places removed 417 places and 0 transitions.
Iterating global reduction 7 with 834 rules applied. Total rules applied 6498 place count 1277 transition count 3747
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 6499 place count 1277 transition count 3746
Discarding 13 places :
Symmetric choice reduction at 8 with 13 rule applications. Total rules 6512 place count 1264 transition count 3538
Iterating global reduction 8 with 13 rules applied. Total rules applied 6525 place count 1264 transition count 3538
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: -703
Deduced a syphon composed of 77 places in 3 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 8 with 154 rules applied. Total rules applied 6679 place count 1187 transition count 4241
Drop transitions (Empty/Sink Transition effects.) removed 45 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 8 with 46 rules applied. Total rules applied 6725 place count 1187 transition count 4195
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 6727 place count 1185 transition count 4133
Iterating global reduction 9 with 2 rules applied. Total rules applied 6729 place count 1185 transition count 4133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 6730 place count 1185 transition count 4132
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 10 with 38 rules applied. Total rules applied 6768 place count 1185 transition count 4094
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 6778 place count 1180 transition count 4089
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 6780 place count 1178 transition count 4045
Iterating global reduction 10 with 2 rules applied. Total rules applied 6782 place count 1178 transition count 4045
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 6783 place count 1178 transition count 4044
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 6787 place count 1176 transition count 4070
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 6788 place count 1176 transition count 4069
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 6789 place count 1176 transition count 4068
Free-agglomeration rule applied 357 times with reduction of 43 identical transitions.
Iterating global reduction 12 with 357 rules applied. Total rules applied 7146 place count 1176 transition count 3668
Reduce places removed 357 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 288 transitions.
Iterating post reduction 12 with 645 rules applied. Total rules applied 7791 place count 819 transition count 3380
Drop transitions (Redundant composition of simpler transitions.) removed 76 transitions
Redundant transition composition rules discarded 76 transitions
Iterating global reduction 13 with 76 rules applied. Total rules applied 7867 place count 819 transition count 3304
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 7868 place count 819 transition count 3303
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 13 with 14 rules applied. Total rules applied 7882 place count 818 transition count 3290
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 14 with 8 rules applied. Total rules applied 7890 place count 818 transition count 3282
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 14 with 2 rules applied. Total rules applied 7892 place count 818 transition count 3318
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 14 with 25 rules applied. Total rules applied 7917 place count 816 transition count 3295
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 15 with 8 rules applied. Total rules applied 7925 place count 816 transition count 3287
Partial Free-agglomeration rule applied 31 times.
Drop transitions (Partial Free agglomeration) removed 31 transitions
Iterating global reduction 15 with 31 rules applied. Total rules applied 7956 place count 816 transition count 3287
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 15 with 9 rules applied. Total rules applied 7965 place count 816 transition count 3278
Discarding 5 places :
Symmetric choice reduction at 15 with 5 rule applications. Total rules 7970 place count 811 transition count 3273
Iterating global reduction 15 with 5 rules applied. Total rules applied 7975 place count 811 transition count 3273
Discarding 4 places :
Symmetric choice reduction at 15 with 4 rule applications. Total rules 7979 place count 807 transition count 3203
Iterating global reduction 15 with 4 rules applied. Total rules applied 7983 place count 807 transition count 3203
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 7985 place count 807 transition count 3201
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 7987 place count 807 transition count 3199
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 7990 place count 807 transition count 3199
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 7991 place count 807 transition count 3198
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 7992 place count 806 transition count 3197
Iterating global reduction 16 with 1 rules applied. Total rules applied 7993 place count 806 transition count 3197
Applied a total of 7993 rules in 2368 ms. Remains 806 /4848 variables (removed 4042) and now considering 3197/7836 (removed 4639) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2389 ms. Remains : 806/4848 places, 3197/7836 transitions.
RANDOM walk for 40000 steps (8 resets) in 1542 ms. (25 steps per ms) remains 3/7 properties
FORMULA DLCround-PT-12b-ReachabilityFireability-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-2025-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 316 ms. (126 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 286 ms. (139 steps per ms) remains 3/3 properties
[2025-05-31 09:49:32] [INFO ] Flow matrix only has 1791 transitions (discarded 1406 similar events)
// Phase 1: matrix 1791 rows 806 cols
[2025-05-31 09:49:32] [INFO ] Computed 277 invariants in 11 ms
[2025-05-31 09:49:32] [INFO ] State equation strengthened by 243 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/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 598/756 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/756 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 50/806 variables, 35/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/806 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1791/2597 variables, 806/1083 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2597 variables, 243/1326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2597 variables, 0/1326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/2597 variables, 0/1326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2597/2597 variables, and 1326 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1614 ms.
Refiners :[Positive P Invariants (semi-flows): 277/277 constraints, State Equation: 806/806 constraints, ReadFeed: 243/243 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 598/756 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 09:49:35] [INFO ] Deduced a trap composed of 29 places in 261 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 09:49:35] [INFO ] Deduced a trap composed of 29 places in 196 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 09:49:35] [INFO ] Deduced a trap composed of 34 places in 179 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 09:49:35] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 09:49:35] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/756 variables, 5/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 09:49:36] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/756 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 09:49:36] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/756 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/756 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 50/806 variables, 35/284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1791/2597 variables, 806/1090 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2597 variables, 243/1333 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2597 variables, 1/1334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2597 variables, 0/1334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 09:49:38] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 09:49:38] [INFO ] Deduced a trap along path composed of 2 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 09:49:38] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 09:49:38] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 09:49:38] [INFO ] Deduced a trap along path composed of 2 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 09:49:38] [INFO ] Deduced a trap along path composed of 2 places in 50 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 09:49:38] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 09:49:39] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 09:49:39] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 09:49:39] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 09:49:39] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 09:49:39] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 09:49:39] [INFO ] Deduced a trap along path composed of 2 places in 57 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/2597 variables, 13/1347 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 09:49:40] [INFO ] Deduced a trap along path composed of 2 places in 33 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2597 variables, 1/1348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2597 variables, 0/1348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/2597 variables, 0/1348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2597/2597 variables, and 1348 constraints, problems are : Problem set: 0 solved, 3 unsolved in 7172 ms.
Refiners :[Positive P Invariants (semi-flows): 277/277 constraints, State Equation: 806/806 constraints, ReadFeed: 243/243 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 14/14 constraints]
After SMT, in 8865ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA DLCround-PT-12b-ReachabilityFireability-2025-11 FALSE TECHNIQUES PARIKH_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-2025-13 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 123 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=20 )
FORMULA DLCround-PT-12b-ReachabilityFireability-2025-15 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 347 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 20097 ms.

BK_STOP 1748684982127

--------------------
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="DLCround-PT-12b"
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 DLCround-PT-12b, 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 r072-tall-174860067100271"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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