Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1008K
-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 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K 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.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 536K 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 FlexibleBarrier-PT-12b-ReachabilityFireability-2025-00
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2025-01
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2025-02
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2025-03
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2025-04
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2025-05
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2025-06
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2025-07
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2025-08
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2025-09
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2025-10
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2025-11
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2025-12
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2025-13
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2025-14
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748944682231

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-12b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-03 09:58:04] [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-06-03 09:58:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 09:58:05] [INFO ] Load time of PNML (sax parser for PT used): 399 ms
[2025-06-03 09:58:05] [INFO ] Transformed 1988 places.
[2025-06-03 09:58:05] [INFO ] Transformed 2289 transitions.
[2025-06-03 09:58:05] [INFO ] Found NUPN structural information;
[2025-06-03 09:58:05] [INFO ] Parsed PT model containing 1988 places and 2289 transitions and 5727 arcs in 658 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (461 resets) in 3236 ms. (12 steps per ms) remains 11/16 properties
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (47 resets) in 500 ms. (79 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (44 resets) in 231 ms. (172 steps per ms) remains 11/11 properties
[2025-06-03 09:58:07] [INFO ] Flatten gal took : 664 ms
BEST_FIRST walk for 40004 steps (44 resets) in 1464 ms. (27 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (46 resets) in 181 ms. (219 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (44 resets) in 601 ms. (66 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (46 resets) in 110 ms. (360 steps per ms) remains 10/11 properties
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2025-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (44 resets) in 83 ms. (476 steps per ms) remains 9/10 properties
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (22 resets) in 68 ms. (579 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 289 ms. (137 steps per ms) remains 9/9 properties
[2025-06-03 09:58:07] [INFO ] Flatten gal took : 457 ms
BEST_FIRST walk for 40004 steps (43 resets) in 117 ms. (339 steps per ms) remains 9/9 properties
[2025-06-03 09:58:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1492671029932266027.gal : 92 ms
[2025-06-03 09:58:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11656393340549771145.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/ReachabilityCardinality1492671029932266027.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11656393340549771145.prop' '--nowitness' '--gen-order' 'FOLLOW'
// Phase 1: matrix 2289 rows 1988 cols

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
[2025-06-03 09:58:08] [INFO ] Computed 14 invariants in 77 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Loading property file /tmp/ReachabilityCardinality11656393340549771145.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem FlexibleBarrier-PT-12b-ReachabilityFireability-2025-12 is UNSAT
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2025-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1857/1988 variables, 14/145 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1988 variables, 1857/2002 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1988 variables, 0/2002 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2289/4277 variables, 1988/3990 constraints. Problems are: Problem set: 1 solved, 8 unsolved
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :10 after 40
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :40 after 44
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :44 after 1036
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :1036 after 65612
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :65612 after 1.00765e+08
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :1.00765e+08 after 1.40879e+14
At refinement iteration 6 (INCLUDED_ONLY) 0/4277 variables, 0/3990 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/4277 variables, 0/3990 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4277/4277 variables, and 3990 constraints, problems are : Problem set: 1 solved, 8 unsolved in 4469 ms.
Refiners :[Domain max(s): 1988/1988 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 1988/1988 constraints, PredecessorRefiner: 9/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/84 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1904/1988 variables, 14/98 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1988 variables, 1904/2002 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:58:16] [INFO ] Deduced a trap composed of 639 places in 2351 ms of which 952 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:58:18] [INFO ] Deduced a trap composed of 637 places in 2159 ms of which 664 ms to minimize.
SMT process timed out in 10601ms, After SMT, problems are : Problem set: 1 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 84 out of 1988 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1988/1988 places, 2289/2289 transitions.
Graph (trivial) has 1423 edges and 1988 vertex of which 18 / 1988 are part of one of the 3 SCC in 9 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 348 transitions
Trivial Post-agglo rules discarded 348 transitions
Performed 348 trivial Post agglomeration. Transition count delta: 348
Iterating post reduction 0 with 348 rules applied. Total rules applied 349 place count 1973 transition count 1923
Reduce places removed 348 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 368 rules applied. Total rules applied 717 place count 1625 transition count 1903
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 737 place count 1605 transition count 1903
Performed 228 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 228 Pre rules applied. Total rules applied 737 place count 1605 transition count 1675
Deduced a syphon composed of 228 places in 4 ms
Reduce places removed 228 places and 0 transitions.
Iterating global reduction 3 with 456 rules applied. Total rules applied 1193 place count 1377 transition count 1675
Discarding 699 places :
Symmetric choice reduction at 3 with 699 rule applications. Total rules 1892 place count 678 transition count 976
Iterating global reduction 3 with 699 rules applied. Total rules applied 2591 place count 678 transition count 976
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 with 2 rules applied. Total rules applied 2593 place count 678 transition count 974
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2594 place count 677 transition count 974
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 2594 place count 677 transition count 970
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 2602 place count 673 transition count 970
Discarding 91 places :
Symmetric choice reduction at 5 with 91 rule applications. Total rules 2693 place count 582 transition count 879
Iterating global reduction 5 with 91 rules applied. Total rules applied 2784 place count 582 transition count 879
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 5 with 81 rules applied. Total rules applied 2865 place count 582 transition count 798
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 6 with 178 rules applied. Total rules applied 3043 place count 493 transition count 709
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 3051 place count 493 transition count 701
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 3058 place count 486 transition count 694
Iterating global reduction 7 with 7 rules applied. Total rules applied 3065 place count 486 transition count 694
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 3079 place count 479 transition count 694
Free-agglomeration rule applied 81 times.
Iterating global reduction 7 with 81 rules applied. Total rules applied 3160 place count 479 transition count 613
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 7 with 81 rules applied. Total rules applied 3241 place count 398 transition count 613
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3242 place count 397 transition count 612
Iterating global reduction 8 with 1 rules applied. Total rules applied 3243 place count 397 transition count 612
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3244 place count 397 transition count 611
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 3257 place count 397 transition count 598
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 3262 place count 397 transition count 598
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 3263 place count 396 transition count 597
Applied a total of 3263 rules in 740 ms. Remains 396 /1988 variables (removed 1592) and now considering 597/2289 (removed 1692) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 754 ms. Remains : 396/1988 places, 597/2289 transitions.
RANDOM walk for 40000 steps (650 resets) in 530 ms. (75 steps per ms) remains 7/8 properties
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (52 resets) in 94 ms. (421 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (54 resets) in 339 ms. (117 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (52 resets) in 70 ms. (563 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (55 resets) in 142 ms. (279 steps per ms) remains 6/7 properties
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (36 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 6/6 properties
[2025-06-03 09:58:19] [INFO ] Flow matrix only has 595 transitions (discarded 2 similar events)
// Phase 1: matrix 595 rows 396 cols
[2025-06-03 09:58:19] [INFO ] Computed 14 invariants in 9 ms
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/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 314/396 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 595/991 variables, 396/410 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/991 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/991 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 991/991 variables, and 410 constraints, problems are : Problem set: 0 solved, 6 unsolved in 819 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 396/396 constraints, PredecessorRefiner: 6/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 314/396 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:58:21] [INFO ] Deduced a trap composed of 162 places in 245 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:58:21] [INFO ] Deduced a trap composed of 163 places in 218 ms of which 38 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 595/991 variables, 396/412 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/991 variables, 4/416 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/991 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:58:22] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 8 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/991 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/991 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/991 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 991/991 variables, and 417 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2466 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 396/396 constraints, PredecessorRefiner: 6/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3353ms problems are : Problem set: 0 solved, 6 unsolved
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2025-13 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 1564 ms.
Support contains 71 out of 396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 396/396 places, 597/597 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 396 transition count 596
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 395 transition count 596
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 395 transition count 593
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 392 transition count 593
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 12 place count 388 transition count 589
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 388 transition count 589
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 388 transition count 588
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 27 place count 383 transition count 583
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 382 transition count 582
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 382 transition count 582
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 30 place count 382 transition count 581
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 32 place count 382 transition count 579
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t2.t3.t4.t1984.t1171.t1172 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 61 edges and 378 vertex of which 2 / 378 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 7 rules applied. Total rules applied 39 place count 377 transition count 573
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 7 rules applied. Total rules applied 46 place count 373 transition count 570
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 47 place count 372 transition count 570
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 13 Pre rules applied. Total rules applied 47 place count 372 transition count 557
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 73 place count 359 transition count 557
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 75 place count 357 transition count 555
Iterating global reduction 7 with 2 rules applied. Total rules applied 77 place count 357 transition count 555
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 79 place count 357 transition count 553
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 113 place count 340 transition count 536
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 127 place count 333 transition count 536
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 139 place count 333 transition count 524
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 142 place count 333 transition count 521
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 145 place count 333 transition count 518
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 150 place count 330 transition count 516
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 151 place count 330 transition count 516
Applied a total of 151 rules in 192 ms. Remains 330 /396 variables (removed 66) and now considering 516/597 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 330/396 places, 516/597 transitions.
RANDOM walk for 40000 steps (8 resets) in 356 ms. (112 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 235 ms. (169 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 224 ms. (177 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 162 ms. (245 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 290 ms. (137 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 248208 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 5
Probabilistic random walk after 248208 steps, saw 221392 distinct states, run finished after 3009 ms. (steps per millisecond=82 ) properties seen :0
[2025-06-03 09:58:28] [INFO ] Flow matrix only has 505 transitions (discarded 11 similar events)
// Phase 1: matrix 505 rows 330 cols
[2025-06-03 09:58:28] [INFO ] Computed 13 invariants in 10 ms
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 259/330 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/330 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 505/835 variables, 330/343 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/835 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/835 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 835/835 variables, and 343 constraints, problems are : Problem set: 0 solved, 5 unsolved in 574 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 330/330 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 259/330 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:58:29] [INFO ] Deduced a trap composed of 150 places in 246 ms of which 37 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/330 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:58:29] [INFO ] Deduced a trap composed of 151 places in 249 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:58:29] [INFO ] Deduced a trap composed of 149 places in 228 ms of which 31 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/330 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 505/835 variables, 330/346 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/835 variables, 4/350 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:58:30] [INFO ] Deduced a trap composed of 150 places in 226 ms of which 29 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/835 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/835 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/835 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 835/835 variables, and 351 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2288 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 330/330 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2893ms problems are : Problem set: 0 solved, 5 unsolved
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2025-02 FALSE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2025-01 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 349 ms.
Support contains 30 out of 330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 330/330 places, 516/516 transitions.
Graph (trivial) has 241 edges and 330 vertex of which 14 / 330 are part of one of the 5 SCC in 0 ms
Free SCC test removed 9 places
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 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 0 with 10 rules applied. Total rules applied 11 place count 321 transition count 490
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 311 transition count 489
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 310 transition count 489
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 23 place count 310 transition count 487
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 27 place count 308 transition count 487
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 45 place count 290 transition count 469
Iterating global reduction 3 with 18 rules applied. Total rules applied 63 place count 290 transition count 469
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 95 place count 274 transition count 453
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 100 place count 274 transition count 448
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 110 place count 264 transition count 438
Iterating global reduction 4 with 10 rules applied. Total rules applied 120 place count 264 transition count 438
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 130 place count 264 transition count 428
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 132 place count 263 transition count 427
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 149 place count 263 transition count 410
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 162 place count 263 transition count 397
Free-agglomeration rule applied 166 times.
Iterating global reduction 6 with 166 rules applied. Total rules applied 328 place count 263 transition count 231
Reduce places removed 169 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 40 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 6 with 223 rules applied. Total rules applied 551 place count 94 transition count 177
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 558 place count 87 transition count 170
Iterating global reduction 7 with 7 rules applied. Total rules applied 565 place count 87 transition count 170
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 572 place count 87 transition count 163
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 8 with 25 rules applied. Total rules applied 597 place count 87 transition count 138
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 598 place count 87 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 599 place count 86 transition count 137
Applied a total of 599 rules in 117 ms. Remains 86 /330 variables (removed 244) and now considering 137/516 (removed 379) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 86/330 places, 137/516 transitions.
RANDOM walk for 40000 steps (8 resets) in 137 ms. (289 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 55 ms. (714 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 529914 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :0 out of 3
Probabilistic random walk after 529914 steps, saw 287121 distinct states, run finished after 3001 ms. (steps per millisecond=176 ) properties seen :0
// Phase 1: matrix 137 rows 86 cols
[2025-06-03 09:58:34] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 56/86 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 137/223 variables, 86/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/223 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 96 constraints, problems are : Problem set: 0 solved, 3 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 3/3 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 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 56/86 variables, 10/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-03 09:58:35] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 137/223 variables, 86/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/223 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 100 constraints, problems are : Problem set: 0 solved, 3 unsolved in 329 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 459ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2025-03 FALSE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2025-09 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 67 ms.
Support contains 22 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 137/137 transitions.
Graph (trivial) has 22 edges and 86 vertex of which 5 / 86 are part of one of the 2 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 82 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 82 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 82 transition count 130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 9 rules applied. Total rules applied 13 place count 77 transition count 126
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 16 place count 77 transition count 123
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 73 transition count 119
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 73 transition count 119
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 28 place count 73 transition count 115
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 32 place count 73 transition count 111
Free-agglomeration rule applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 43 place count 73 transition count 100
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 57 place count 62 transition count 97
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 60 place count 62 transition count 94
Applied a total of 60 rules in 23 ms. Remains 62 /86 variables (removed 24) and now considering 94/137 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 62/86 places, 94/137 transitions.
RANDOM walk for 38879 steps (8 resets) in 122 ms. (316 steps per ms) remains 0/1 properties
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_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 30588 ms.

BK_STOP 1748944715439

--------------------
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="FlexibleBarrier-PT-12b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-12b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r086-smll-174860102600479"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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