Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K 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.6K 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.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K 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 963K 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-07b-ReachabilityCardinality-2025-00
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-2025-01
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-2025-02
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-2025-03
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-2025-04
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-2025-05
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-2025-06
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-2025-07
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-2025-08
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-2025-09
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-2025-10
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-2025-11
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-2025-12
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-2025-13
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-2025-14
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748671413862

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-07b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-05-31 06:03:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 06:03:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 06:03:35] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2025-05-31 06:03:35] [INFO ] Transformed 2703 places.
[2025-05-31 06:03:35] [INFO ] Transformed 4071 transitions.
[2025-05-31 06:03:35] [INFO ] Found NUPN structural information;
[2025-05-31 06:03:35] [INFO ] Parsed PT model containing 2703 places and 4071 transitions and 11073 arcs in 336 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCround-PT-07b-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2072 ms. (19 steps per ms) remains 6/15 properties
FORMULA DLCround-PT-07b-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 6/6 properties
[2025-05-31 06:03:36] [INFO ] Flatten gal took : 397 ms
BEST_FIRST walk for 40004 steps (8 resets) in 322 ms. (123 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 332 ms. (120 steps per ms) remains 6/6 properties
[2025-05-31 06:03:36] [INFO ] Flatten gal took : 249 ms
// Phase 1: matrix 4071 rows 2703 cols
[2025-05-31 06:03:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12051076771773620679.gal : 81 ms
[2025-05-31 06:03:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14811643145501728050.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12051076771773620679.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14811643145501728050.prop' '--nowitness' '--gen-order' 'FOLLOW'
[2025-05-31 06:03:36] [INFO ] Computed 132 invariants in 71 ms

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Loading property file /tmp/ReachabilityCardinality14811643145501728050.prop.
At refinement iteration 2 (OVERLAPS) 2647/2703 variables, 132/188 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2703 variables, 2647/2835 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2703 variables, 0/2835 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 4071/6774 variables, 2703/5538 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6774 variables, 0/5538 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6774/6774 variables, and 5538 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5038 ms.
Refiners :[Domain max(s): 2703/2703 constraints, Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 2703/2703 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 2647/2703 variables, 132/188 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2703 variables, 2647/2835 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:43] [INFO ] Deduced a trap composed of 160 places in 350 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:43] [INFO ] Deduced a trap composed of 168 places in 226 ms of which 8 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :10 after 31
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :31 after 1272
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :1272 after 22372
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :22372 after 26089
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :26089 after 35157
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :35157 after 40137
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :40137 after 163454
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :163454 after 1.40237e+06
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :1.40237e+06 after 3.60075e+07
[2025-05-31 06:03:44] [INFO ] Deduced a trap composed of 107 places in 489 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :3.60075e+07 after 1.08724e+08
[2025-05-31 06:03:44] [INFO ] Deduced a trap composed of 107 places in 387 ms of which 20 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2703 variables, 4/2839 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :1.08724e+08 after 3.33786e+09
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2703/6774 variables, and 2839 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5011 ms.
Refiners :[Domain max(s): 2703/2703 constraints, Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 0/2703 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10245ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 56 out of 2703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2703/2703 places, 4071/4071 transitions.
Graph (trivial) has 2444 edges and 2703 vertex of which 390 / 2703 are part of one of the 37 SCC in 15 ms
Free SCC test removed 353 places
Drop transitions (Empty/Sink Transition effects.) removed 401 transitions
Reduce isomorphic transitions removed 401 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1009 transitions
Trivial Post-agglo rules discarded 1009 transitions
Performed 1009 trivial Post agglomeration. Transition count delta: 1009
Iterating post reduction 0 with 1009 rules applied. Total rules applied 1010 place count 2350 transition count 2661
Reduce places removed 1009 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 1066 rules applied. Total rules applied 2076 place count 1341 transition count 2604
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 32 rules applied. Total rules applied 2108 place count 1316 transition count 2597
Reduce places removed 3 places and 0 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Iterating post reduction 3 with 29 rules applied. Total rules applied 2137 place count 1313 transition count 2571
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 4 with 26 rules applied. Total rules applied 2163 place count 1287 transition count 2571
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 26 Pre rules applied. Total rules applied 2163 place count 1287 transition count 2545
Deduced a syphon composed of 26 places in 7 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 2215 place count 1261 transition count 2545
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :3.33786e+09 after 1.55073e+10
Discarding 309 places :
Symmetric choice reduction at 5 with 309 rule applications. Total rules 2524 place count 952 transition count 2236
Iterating global reduction 5 with 309 rules applied. Total rules applied 2833 place count 952 transition count 2236
Performed 126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 126 Pre rules applied. Total rules applied 2833 place count 952 transition count 2110
Deduced a syphon composed of 126 places in 7 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 5 with 252 rules applied. Total rules applied 3085 place count 826 transition count 2110
Discarding 43 places :
Symmetric choice reduction at 5 with 43 rule applications. Total rules 3128 place count 783 transition count 1655
Iterating global reduction 5 with 43 rules applied. Total rules applied 3171 place count 783 transition count 1655
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 3183 place count 783 transition count 1643
Performed 196 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 196 places in 1 ms
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 6 with 392 rules applied. Total rules applied 3575 place count 587 transition count 1441
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 3578 place count 587 transition count 1438
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 3581 place count 584 transition count 1405
Iterating global reduction 7 with 3 rules applied. Total rules applied 3584 place count 584 transition count 1405
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: -598
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 7 with 134 rules applied. Total rules applied 3718 place count 517 transition count 2003
Drop transitions (Empty/Sink Transition effects.) removed 105 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 7 with 108 rules applied. Total rules applied 3826 place count 517 transition count 1895
Discarding 17 places :
Symmetric choice reduction at 8 with 17 rule applications. Total rules 3843 place count 500 transition count 1507
Iterating global reduction 8 with 17 rules applied. Total rules applied 3860 place count 500 transition count 1507
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 3865 place count 500 transition count 1502
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 9 with 12 rules applied. Total rules applied 3877 place count 494 transition count 1568
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 3886 place count 494 transition count 1559
Drop transitions (Redundant composition of simpler transitions.) removed 176 transitions
Redundant transition composition rules discarded 176 transitions
Iterating global reduction 10 with 176 rules applied. Total rules applied 4062 place count 494 transition count 1383
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 4069 place count 487 transition count 1291
Iterating global reduction 10 with 7 rules applied. Total rules applied 4076 place count 487 transition count 1291
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 4081 place count 487 transition count 1286
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 4083 place count 487 transition count 1284
Free-agglomeration rule applied 204 times with reduction of 80 identical transitions.
Iterating global reduction 11 with 204 rules applied. Total rules applied 4287 place count 487 transition count 1000
Reduce places removed 204 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 234 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 241 transitions.
Graph (complete) has 888 edges and 283 vertex of which 280 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Iterating post reduction 11 with 446 rules applied. Total rules applied 4733 place count 280 transition count 759
Discarding 7 places :
Symmetric choice reduction at 12 with 7 rule applications. Total rules 4740 place count 273 transition count 746
Iterating global reduction 12 with 7 rules applied. Total rules applied 4747 place count 273 transition count 746
Drop transitions (Redundant composition of simpler transitions.) removed 77 transitions
Redundant transition composition rules discarded 77 transitions
Iterating global reduction 12 with 77 rules applied. Total rules applied 4824 place count 273 transition count 669
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 4825 place count 272 transition count 669
Discarding 7 places :
Symmetric choice reduction at 13 with 7 rule applications. Total rules 4832 place count 265 transition count 656
Iterating global reduction 13 with 7 rules applied. Total rules applied 4839 place count 265 transition count 656
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 4845 place count 262 transition count 678
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 13 with 19 rules applied. Total rules applied 4864 place count 262 transition count 659
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 4865 place count 262 transition count 658
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 4866 place count 262 transition count 657
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 14 with 11 rules applied. Total rules applied 4877 place count 261 transition count 647
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 15 with 4 rules applied. Total rules applied 4881 place count 261 transition count 643
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 15 with 4 rules applied. Total rules applied 4885 place count 261 transition count 643
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 4886 place count 261 transition count 642
Applied a total of 4886 rules in 852 ms. Remains 261 /2703 variables (removed 2442) and now considering 642/4071 (removed 3429) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 861 ms. Remains : 261/2703 places, 642/4071 transitions.
RANDOM walk for 40000 steps (8 resets) in 1151 ms. (34 steps per ms) remains 4/6 properties
FORMULA DLCround-PT-07b-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 2/4 properties
FORMULA DLCround-PT-07b-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 162 ms. (245 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
[2025-05-31 06:03:48] [INFO ] Flow matrix only has 408 transitions (discarded 234 similar events)
// Phase 1: matrix 408 rows 261 cols
[2025-05-31 06:03:48] [INFO ] Computed 114 invariants in 3 ms
[2025-05-31 06:03:48] [INFO ] State equation strengthened by 98 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/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 223/258 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/261 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 408/669 variables, 261/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/669 variables, 98/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/669 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/669 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 473 constraints, problems are : Problem set: 0 solved, 2 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 114/114 constraints, State Equation: 261/261 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 223/258 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/261 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 408/669 variables, 261/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/669 variables, 98/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/669 variables, 2/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:51] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:51] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 1 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :1.55073e+10 after 3.03645e+11
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/669 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 477 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3293 ms.
Refiners :[Positive P Invariants (semi-flows): 114/114 constraints, State Equation: 261/261 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 3533ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 128 steps, including 1 resets, run visited all 2 properties in 3 ms. (steps per millisecond=42 )
FORMULA DLCround-PT-07b-ReachabilityCardinality-2025-15 TRUE TECHNIQUES PARIKH_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-2025-12 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 15 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 16897 ms.

BK_STOP 1748671431979

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is DLCround-PT-07b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r072-tall-174860067000190"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-07b.tgz
mv DLCround-PT-07b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;