Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.0M
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 139K 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 96K 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.7K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 6.5M 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 DLCflexbar-PT-5b-ReachabilityFireability-2025-00
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityFireability-2025-01
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityFireability-2025-02
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityFireability-2025-03
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityFireability-2025-04
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityFireability-2025-05
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityFireability-2025-06
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityFireability-2025-07
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityFireability-2025-08
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityFireability-2025-09
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityFireability-2025-10
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityFireability-2025-11
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityFireability-2025-12
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityFireability-2025-13
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityFireability-2025-14
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748652664761

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCflexbar-PT-5b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-05-31 00:51:05] [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 00:51:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 00:51:06] [INFO ] Load time of PNML (sax parser for PT used): 692 ms
[2025-05-31 00:51:06] [INFO ] Transformed 17305 places.
[2025-05-31 00:51:07] [INFO ] Transformed 26483 transitions.
[2025-05-31 00:51:07] [INFO ] Found NUPN structural information;
[2025-05-31 00:51:07] [INFO ] Parsed PT model containing 17305 places and 26483 transitions and 73264 arcs in 1521 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 2508 ms. (15 steps per ms) remains 13/16 properties
FORMULA DLCflexbar-PT-5b-ReachabilityFireability-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-5b-ReachabilityFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-5b-ReachabilityFireability-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 319 ms. (125 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1192 ms. (33 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1079 ms. (37 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 486 ms. (82 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 256 ms. (155 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 13/13 properties
// Phase 1: matrix 26483 rows 17305 cols
[2025-05-31 00:51:11] [INFO ] Computed 979 invariants in 215 ms
[2025-05-31 00:51:11] [INFO ] Flatten gal took : 1599 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 00:51:12] [INFO ] Flatten gal took : 612 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 267/267 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/267 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2025-05-31 00:51:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14940870842344257641.gal : 211 ms
[2025-05-31 00:51:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13692677151917305338.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/ReachabilityCardinality14940870842344257641.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13692677151917305338.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
At refinement iteration 2 (OVERLAPS) 10968/11235 variables, 558/825 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11235 variables, 10968/11793 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 11235/43788 variables, and 11793 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5118 ms.
Refiners :[Domain max(s): 11235/17305 constraints, Positive P Invariants (semi-flows): 558/979 constraints, State Equation: 0/17305 constraints, PredecessorRefiner: 13/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 267/267 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/267 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Loading property file /tmp/ReachabilityCardinality13692677151917305338.prop.
At refinement iteration 2 (OVERLAPS) 10968/11235 variables, 558/825 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 11235/43788 variables, and 11793 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5023 ms.
Refiners :[Domain max(s): 11235/17305 constraints, Positive P Invariants (semi-flows): 558/979 constraints, State Equation: 0/17305 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10906ms problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 267 out of 17305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17305/17305 places, 26483/26483 transitions.
Graph (trivial) has 15279 edges and 17305 vertex of which 1096 / 17305 are part of one of the 88 SCC in 55 ms
Free SCC test removed 1008 places
Drop transitions (Empty/Sink Transition effects.) removed 1149 transitions
Reduce isomorphic transitions removed 1149 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7609 transitions
Trivial Post-agglo rules discarded 7609 transitions
Performed 7609 trivial Post agglomeration. Transition count delta: 7609
Iterating post reduction 0 with 7609 rules applied. Total rules applied 7610 place count 16297 transition count 17725
Reduce places removed 7609 places and 0 transitions.
Ensure Unique test removed 178 transitions
Reduce isomorphic transitions removed 178 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 181 transitions
Trivial Post-agglo rules discarded 181 transitions
Performed 181 trivial Post agglomeration. Transition count delta: 181
Iterating post reduction 1 with 7968 rules applied. Total rules applied 15578 place count 8688 transition count 17366
Reduce places removed 181 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 2 with 286 rules applied. Total rules applied 15864 place count 8507 transition count 17261
Reduce places removed 52 places and 0 transitions.
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Iterating post reduction 3 with 146 rules applied. Total rules applied 16010 place count 8455 transition count 17167
Reduce places removed 94 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 95 rules applied. Total rules applied 16105 place count 8361 transition count 17166
Performed 203 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 203 Pre rules applied. Total rules applied 16105 place count 8361 transition count 16963
Deduced a syphon composed of 203 places in 460 ms
Reduce places removed 203 places and 0 transitions.
Iterating global reduction 5 with 406 rules applied. Total rules applied 16511 place count 8158 transition count 16963
Discarding 2203 places :
Symmetric choice reduction at 5 with 2203 rule applications. Total rules 18714 place count 5955 transition count 14760
Iterating global reduction 5 with 2203 rules applied. Total rules applied 20917 place count 5955 transition count 14760
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 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 5 with 35 rules applied. Total rules applied 20952 place count 5955 transition count 14725
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 6 with 17 rules applied. Total rules applied 20969 place count 5945 transition count 14718
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 20972 place count 5943 transition count 14717
Performed 890 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 890 Pre rules applied. Total rules applied 20972 place count 5943 transition count 13827
Deduced a syphon composed of 890 places in 359 ms
Reduce places removed 890 places and 0 transitions.
Iterating global reduction 8 with 1780 rules applied. Total rules applied 22752 place count 5053 transition count 13827
Discarding 112 places :
Symmetric choice reduction at 8 with 112 rule applications. Total rules 22864 place count 4941 transition count 12347
Iterating global reduction 8 with 112 rules applied. Total rules applied 22976 place count 4941 transition count 12347
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Iterating post reduction 8 with 94 rules applied. Total rules applied 23070 place count 4941 transition count 12253
Performed 1238 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 1238 places in 7 ms
Reduce places removed 1238 places and 0 transitions.
Iterating global reduction 9 with 2476 rules applied. Total rules applied 25546 place count 3703 transition count 11011
Renaming transitions due to excessive name length > 1024 char.
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 25551 place count 3698 transition count 10671
Iterating global reduction 9 with 5 rules applied. Total rules applied 25556 place count 3698 transition count 10671
Performed 101 Post agglomeration using F-continuation condition with reduction of 196 identical transitions.
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 9 with 202 rules applied. Total rules applied 25758 place count 3597 transition count 11406
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 25759 place count 3597 transition count 11405
Discarding 28 places :
Symmetric choice reduction at 10 with 28 rule applications. Total rules 25787 place count 3569 transition count 11013
Iterating global reduction 10 with 28 rules applied. Total rules applied 25815 place count 3569 transition count 11013
Ensure Unique test removed 182 transitions
Reduce isomorphic transitions removed 182 transitions.
Iterating post reduction 10 with 182 rules applied. Total rules applied 25997 place count 3569 transition count 10831
Performed 101 Post agglomeration using F-continuation condition with reduction of 126 identical transitions.
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 11 with 202 rules applied. Total rules applied 26199 place count 3468 transition count 11569
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 11 with 14 rules applied. Total rules applied 26213 place count 3468 transition count 11555
Discarding 22 places :
Symmetric choice reduction at 12 with 22 rule applications. Total rules 26235 place count 3446 transition count 11247
Iterating global reduction 12 with 22 rules applied. Total rules applied 26257 place count 3446 transition count 11247
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 12 with 126 rules applied. Total rules applied 26383 place count 3446 transition count 11121
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: -657
Deduced a syphon composed of 70 places in 4 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 13 with 140 rules applied. Total rules applied 26523 place count 3376 transition count 11778
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 13 with 75 rules applied. Total rules applied 26598 place count 3376 transition count 11703
Drop transitions (Redundant composition of simpler transitions.) removed 134 transitions
Redundant transition composition rules discarded 134 transitions
Iterating global reduction 14 with 134 rules applied. Total rules applied 26732 place count 3376 transition count 11569
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 14 with 6 rules applied. Total rules applied 26738 place count 3373 transition count 11566
Free-agglomeration rule applied 1760 times with reduction of 663 identical transitions.
Iterating global reduction 14 with 1760 rules applied. Total rules applied 28498 place count 3373 transition count 9143
Reduce places removed 1760 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1832 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 1859 transitions.
Graph (complete) has 7513 edges and 1613 vertex of which 1607 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 0 output transitions
Iterating post reduction 14 with 3620 rules applied. Total rules applied 32118 place count 1607 transition count 7284
Drop transitions (Empty/Sink Transition effects.) removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 15 with 42 rules applied. Total rules applied 32160 place count 1607 transition count 7242
Discarding 24 places :
Symmetric choice reduction at 16 with 24 rule applications. Total rules 32184 place count 1583 transition count 7137
Iterating global reduction 16 with 24 rules applied. Total rules applied 32208 place count 1583 transition count 7137
Drop transitions (Redundant composition of simpler transitions.) removed 103 transitions
Redundant transition composition rules discarded 103 transitions
Iterating global reduction 16 with 103 rules applied. Total rules applied 32311 place count 1583 transition count 7034
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 16 with 3 rules applied. Total rules applied 32314 place count 1583 transition count 7238
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 176 transitions
Reduce isomorphic transitions removed 176 transitions.
Iterating post reduction 16 with 179 rules applied. Total rules applied 32493 place count 1580 transition count 7062
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 17 with 12 rules applied. Total rules applied 32505 place count 1580 transition count 7050
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 17 with 16 rules applied. Total rules applied 32521 place count 1580 transition count 7050
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 17 with 2 rules applied. Total rules applied 32523 place count 1580 transition count 7048
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 32524 place count 1580 transition count 7048
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 32525 place count 1580 transition count 7047
Applied a total of 32525 rules in 9800 ms. Remains 1580 /17305 variables (removed 15725) and now considering 7047/26483 (removed 19436) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9809 ms. Remains : 1580/17305 places, 7047/26483 transitions.
RANDOM walk for 40000 steps (8 resets) in 3066 ms. (13 steps per ms) remains 3/13 properties
FORMULA DLCflexbar-PT-5b-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-5b-ReachabilityFireability-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-5b-ReachabilityFireability-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-5b-ReachabilityFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-5b-ReachabilityFireability-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-5b-ReachabilityFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-5b-ReachabilityFireability-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-5b-ReachabilityFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-5b-ReachabilityFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-5b-ReachabilityFireability-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 406 ms. (98 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 370 ms. (107 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 352 ms. (113 steps per ms) remains 3/3 properties
[2025-05-31 00:51:33] [INFO ] Flow matrix only has 2100 transitions (discarded 4947 similar events)
// Phase 1: matrix 2100 rows 1580 cols
[2025-05-31 00:51:33] [INFO ] Computed 952 invariants in 28 ms
[2025-05-31 00:51:33] [INFO ] State equation strengthened by 464 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/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 627/659 variables, 385/385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/659 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 919/1578 variables, 567/952 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1578 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2098/3676 variables, 1578/2530 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3676 variables, 464/2994 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3676 variables, 0/2994 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/3678 variables, 1/2995 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3678 variables, 0/2995 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/3680 variables, 1/2996 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3680 variables, 0/2996 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/3680 variables, 0/2996 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3680/3680 variables, and 2996 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2555 ms.
Refiners :[Positive P Invariants (semi-flows): 952/952 constraints, State Equation: 1580/1580 constraints, ReadFeed: 464/464 constraints, PredecessorRefiner: 3/2 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/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 627/659 variables, 385/385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/659 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 919/1578 variables, 567/952 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1578 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2098/3676 variables, 1578/2530 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3676 variables, 464/2994 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3676 variables, 2/2996 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 00:51:38] [INFO ] Deduced a trap along path composed of 2 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:38] [INFO ] Deduced a trap along path composed of 2 places in 93 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:38] [INFO ] Deduced a trap along path composed of 2 places in 70 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:38] [INFO ] Deduced a trap along path composed of 2 places in 49 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:39] [INFO ] Deduced a trap along path composed of 3 places in 51 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:39] [INFO ] Deduced a trap along path composed of 2 places in 57 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:39] [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 00:51:39] [INFO ] Deduced a trap along path composed of 2 places in 60 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:39] [INFO ] Deduced a trap along path composed of 2 places in 49 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:39] [INFO ] Deduced a trap along path composed of 2 places in 49 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:39] [INFO ] Deduced a trap along path composed of 2 places in 61 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:40] [INFO ] Deduced a trap along path composed of 2 places in 51 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:40] [INFO ] Deduced a trap along path composed of 2 places in 63 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:40] [INFO ] Deduced a trap along path composed of 2 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:40] [INFO ] Deduced a trap along path composed of 2 places in 46 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:40] [INFO ] Deduced a trap along path composed of 2 places in 45 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:40] [INFO ] Deduced a trap along path composed of 2 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:41] [INFO ] Deduced a trap along path composed of 2 places in 55 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:41] [INFO ] Deduced a trap along path composed of 2 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:41] [INFO ] Deduced a trap along path composed of 2 places in 47 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/3676 variables, 20/3016 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 00:51:42] [INFO ] Deduced a trap along path composed of 2 places in 47 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:42] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:42] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:43] [INFO ] Deduced a trap along path composed of 2 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/3676 variables, 4/3020 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 00:51:43] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:43] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:44] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:44] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:44] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:44] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:44] [INFO ] Deduced a trap along path composed of 2 places in 33 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:44] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/3676 variables, 8/3028 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3676 variables, 0/3028 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/3678 variables, 1/3029 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3678 variables, 0/3029 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/3680 variables, 1/3030 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3680 variables, 0/3030 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/3680 variables, 0/3030 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3680/3680 variables, and 3030 constraints, problems are : Problem set: 0 solved, 3 unsolved in 13081 ms.
Refiners :[Positive P Invariants (semi-flows): 952/952 constraints, State Equation: 1580/1580 constraints, ReadFeed: 464/464 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 32/32 constraints]
After SMT, in 15775ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
FORMULA DLCflexbar-PT-5b-ReachabilityFireability-2025-07 FALSE TECHNIQUES PARIKH_WALK
FORMULA DLCflexbar-PT-5b-ReachabilityFireability-2025-05 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 135 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=33 )
FORMULA DLCflexbar-PT-5b-ReachabilityFireability-2025-12 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 212 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 43132 ms.

BK_STOP 1748652709122

--------------------
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="DLCflexbar-PT-5b"
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 DLCflexbar-PT-5b, 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-174860066700063"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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