Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102400390.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 FireWire-PT-19, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102400390
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 221K 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 FireWire-PT-19-ReachabilityCardinality-2025-00
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2025-01
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2025-02
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2025-03
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2025-04
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2025-05
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2025-06
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2025-07
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2025-08
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2025-09
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2025-10
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2025-11
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2025-12
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2025-13
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2025-14
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748902869992

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-02 22:21:12] [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-06-02 22:21:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 22:21:13] [INFO ] Load time of PNML (sax parser for PT used): 264 ms
[2025-06-02 22:21:13] [INFO ] Transformed 602 places.
[2025-06-02 22:21:13] [INFO ] Transformed 944 transitions.
[2025-06-02 22:21:13] [INFO ] Found NUPN structural information;
[2025-06-02 22:21:13] [INFO ] Parsed PT model containing 602 places and 944 transitions and 2776 arcs in 561 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 41 ms.
Working with output stream class java.io.PrintStream
FORMULA FireWire-PT-19-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-19-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-19-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (22 resets) in 2734 ms. (14 steps per ms) remains 10/13 properties
FORMULA FireWire-PT-19-ReachabilityCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-19-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-19-ReachabilityCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (15 resets) in 628 ms. (63 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (17 resets) in 366 ms. (108 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (13 resets) in 434 ms. (91 steps per ms) remains 9/10 properties
FORMULA FireWire-PT-19-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2025-06-02 22:21:14] [INFO ] Flatten gal took : 475 ms
BEST_FIRST walk for 40000 steps (15 resets) in 412 ms. (96 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (19 resets) in 250 ms. (159 steps per ms) remains 9/9 properties
[2025-06-02 22:21:15] [INFO ] Flatten gal took : 312 ms
BEST_FIRST walk for 40001 steps (15 resets) in 552 ms. (72 steps per ms) remains 9/9 properties
[2025-06-02 22:21:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9083592062352887226.gal : 153 ms
[2025-06-02 22:21:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11403640001882792639.prop : 3 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/ReachabilityCardinality9083592062352887226.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11403640001882792639.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (14 resets) in 398 ms. (100 steps per ms) remains 9/9 properties

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 ...329
BEST_FIRST walk for 40000 steps (10 resets) in 347 ms. (114 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (12 resets) in 331 ms. (120 steps per ms) remains 9/9 properties
Loading property file /tmp/ReachabilityCardinality11403640001882792639.prop.
// Phase 1: matrix 944 rows 602 cols
[2025-06-02 22:21:15] [INFO ] Computed 13 invariants in 59 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/69 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :4 after 7
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :7 after 13
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :13 after 42
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :42 after 46
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :46 after 51
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :51 after 341
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :341 after 453
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :453 after 706
Invariant property FireWire-PT-19-ReachabilityCardinality-2025-06 does not hold.
FORMULA FireWire-PT-19-ReachabilityCardinality-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :706 after 1916
Problem FireWire-PT-19-ReachabilityCardinality-2025-11 is UNSAT
FORMULA FireWire-PT-19-ReachabilityCardinality-2025-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 533/602 variables, 13/82 constraints. Problems are: Problem set: 2 solved, 7 unsolved
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :1916 after 11565
At refinement iteration 3 (INCLUDED_ONLY) 0/602 variables, 533/615 constraints. Problems are: Problem set: 2 solved, 7 unsolved
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :11565 after 28593
At refinement iteration 4 (INCLUDED_ONLY) 0/602 variables, 0/615 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Invariant property FireWire-PT-19-ReachabilityCardinality-2025-15 does not hold.
FORMULA FireWire-PT-19-ReachabilityCardinality-2025-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
At refinement iteration 5 (OVERLAPS) 944/1546 variables, 602/1217 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1546 variables, 0/1217 constraints. Problems are: Problem set: 3 solved, 6 unsolved
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :28593 after 562933
At refinement iteration 7 (OVERLAPS) 0/1546 variables, 0/1217 constraints. Problems are: Problem set: 3 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1546/1546 variables, and 1217 constraints, problems are : Problem set: 3 solved, 6 unsolved in 2507 ms.
Refiners :[Domain max(s): 602/602 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 602/602 constraints, PredecessorRefiner: 9/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/34 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 568/602 variables, 13/47 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/602 variables, 568/615 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:21:19] [INFO ] Deduced a trap composed of 17 places in 562 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:21:20] [INFO ] Deduced a trap composed of 18 places in 435 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:21:20] [INFO ] Deduced a trap composed of 35 places in 456 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:21:21] [INFO ] Deduced a trap composed of 97 places in 547 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:21:21] [INFO ] Deduced a trap composed of 105 places in 497 ms of which 86 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/602 variables, 5/620 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/602 variables, 0/620 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Reachability property FireWire-PT-19-ReachabilityCardinality-2025-08 is true.
FORMULA FireWire-PT-19-ReachabilityCardinality-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :562933 after 581457
SMT process timed out in 7761ms, After SMT, problems are : Problem set: 4 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 9 out of 602 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 602/602 places, 944/944 transitions.
Graph (trivial) has 474 edges and 602 vertex of which 19 / 602 are part of one of the 3 SCC in 5 ms
Free SCC test removed 16 places
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 1585 edges and 586 vertex of which 577 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 166 transitions
Trivial Post-agglo rules discarded 166 transitions
Performed 166 trivial Post agglomeration. Transition count delta: 166
Iterating post reduction 0 with 169 rules applied. Total rules applied 171 place count 577 transition count 755
Reduce places removed 166 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 169 rules applied. Total rules applied 340 place count 411 transition count 752
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 342 place count 409 transition count 752
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 342 place count 409 transition count 740
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 366 place count 397 transition count 740
Discarding 68 places :
Symmetric choice reduction at 3 with 68 rule applications. Total rules 434 place count 329 transition count 670
Iterating global reduction 3 with 68 rules applied. Total rules applied 502 place count 329 transition count 670
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 504 place count 329 transition count 668
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 504 place count 329 transition count 652
Deduced a syphon composed of 16 places in 7 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 536 place count 313 transition count 652
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 551 place count 298 transition count 569
Iterating global reduction 4 with 15 rules applied. Total rules applied 566 place count 298 transition count 569
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 4 with 7 rules applied. Total rules applied 573 place count 298 transition count 562
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 576 place count 295 transition count 562
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 3 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 96 rules applied. Total rules applied 672 place count 247 transition count 514
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: -123
Deduced a syphon composed of 43 places in 3 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 6 with 86 rules applied. Total rules applied 758 place count 204 transition count 637
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 765 place count 204 transition count 630
Drop transitions (Redundant composition of simpler transitions.) removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 7 with 46 rules applied. Total rules applied 811 place count 204 transition count 584
Free-agglomeration rule applied 29 times.
Iterating global reduction 7 with 29 rules applied. Total rules applied 840 place count 204 transition count 555
Reduce places removed 29 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 36 rules applied. Total rules applied 876 place count 175 transition count 548
Drop transitions (Redundant composition of simpler transitions.) removed 79 transitions
Redundant transition composition rules discarded 79 transitions
Iterating global reduction 8 with 79 rules applied. Total rules applied 955 place count 175 transition count 469
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 958 place count 175 transition count 469
Applied a total of 958 rules in 374 ms. Remains 175 /602 variables (removed 427) and now considering 469/944 (removed 475) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 389 ms. Remains : 175/602 places, 469/944 transitions.
RANDOM walk for 40000 steps (1540 resets) in 1266 ms. (31 steps per ms) remains 4/5 properties
FORMULA FireWire-PT-19-ReachabilityCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (284 resets) in 268 ms. (148 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (303 resets) in 170 ms. (233 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (297 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (300 resets) in 117 ms. (339 steps per ms) remains 3/4 properties
FORMULA FireWire-PT-19-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2025-06-02 22:21:24] [INFO ] Flow matrix only has 414 transitions (discarded 55 similar events)
// Phase 1: matrix 414 rows 175 cols
[2025-06-02 22:21:24] [INFO ] Computed 10 invariants in 8 ms
[2025-06-02 22:21:24] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 53/57 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 110/167 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:21:24] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 412/579 variables, 167/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 94/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 9/588 variables, 7/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/588 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/589 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/589 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 589/589 variables, and 280 constraints, problems are : Problem set: 0 solved, 3 unsolved in 615 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 53/57 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 110/167 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:21:25] [INFO ] Deduced a trap composed of 57 places in 167 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:21:25] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 22 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 412/579 variables, 167/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 94/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/579 variables, 3/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:21:25] [INFO ] Deduced a trap composed of 25 places in 205 ms of which 19 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/579 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/579 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 9/588 variables, 7/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/588 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1/589 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/589 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/589 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 589/589 variables, and 286 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1547 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2193ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 201 ms.
Support contains 4 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 469/469 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 175 transition count 467
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 173 transition count 467
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 173 transition count 466
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 172 transition count 466
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 172 transition count 464
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 12 place count 170 transition count 462
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 16 place count 170 transition count 458
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 18 place count 169 transition count 459
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 23 place count 169 transition count 454
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 24 place count 169 transition count 453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 25 place count 168 transition count 453
Applied a total of 25 rules in 66 ms. Remains 168 /175 variables (removed 7) and now considering 453/469 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 168/175 places, 453/469 transitions.
RANDOM walk for 40000 steps (1589 resets) in 219 ms. (181 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (277 resets) in 87 ms. (454 steps per ms) remains 2/3 properties
FORMULA FireWire-PT-19-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (324 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (315 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
[2025-06-02 22:21:27] [INFO ] Flow matrix only has 399 transitions (discarded 54 similar events)
// Phase 1: matrix 399 rows 168 cols
[2025-06-02 22:21:27] [INFO ] Computed 10 invariants in 2 ms
[2025-06-02 22:21:27] [INFO ] State equation strengthened by 93 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 113/162 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:21:27] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:21:27] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 399/561 variables, 162/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 93/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/567 variables, 6/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/567 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 567/567 variables, and 273 constraints, problems are : Problem set: 0 solved, 2 unsolved in 555 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 113/162 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:21:27] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:21:27] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 399/561 variables, 162/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 93/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/561 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:21:28] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 15 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/561 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/561 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/567 variables, 6/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/567 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/567 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 567/567 variables, and 278 constraints, problems are : Problem set: 0 solved, 2 unsolved in 820 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1396ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 205 ms.
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 453/453 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 168 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 167 transition count 452
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 167 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 166 transition count 451
Applied a total of 4 rules in 34 ms. Remains 166 /168 variables (removed 2) and now considering 451/453 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 166/168 places, 451/453 transitions.
RANDOM walk for 40000 steps (1596 resets) in 190 ms. (209 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (328 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (319 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 7342 steps, run visited all 2 properties in 96 ms. (steps per millisecond=76 )
Probabilistic random walk after 7342 steps, saw 2548 distinct states, run finished after 105 ms. (steps per millisecond=69 ) properties seen :2
FORMULA FireWire-PT-19-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-19-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
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 16233 ms.

BK_STOP 1748902888994

--------------------
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="FireWire-PT-19"
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 FireWire-PT-19, 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 r086-smll-174860102400390"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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