Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r034-tall-177946841800207.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is BridgeAndVehicles-PT-V20P20N10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946841800207
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 14K Mar 5 08:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Mar 5 08:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 75K Mar 5 08:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 298K Mar 5 08:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.6K Mar 15 07:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 07:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Mar 15 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 15 07:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K Mar 5 08:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 192K Mar 5 08:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 134K Mar 5 08:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 555K Mar 5 08:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Mar 15 07:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K Mar 15 07:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 434K Mar 3 18:30 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 BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779538777825

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V20P20N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-23 12:19:38] [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]
[2026-05-23 12:19:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 12:19:39] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2026-05-23 12:19:39] [INFO ] Transformed 68 places.
[2026-05-23 12:19:39] [INFO ] Transformed 548 transitions.
[2026-05-23 12:19:39] [INFO ] Parsed PT model containing 68 places and 548 transitions and 4070 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
[2026-05-23 12:19:40] [INFO ] Flatten gal took : 290 ms
RANDOM walk for 40000 steps (224 resets) in 2860 ms. (13 steps per ms) remains 10/16 properties
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-23 12:19:40] [INFO ] Flatten gal took : 137 ms
[2026-05-23 12:19:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10496956626307658557.gal : 42 ms
[2026-05-23 12:19:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1365200957087489642.prop : 67 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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10496956626307658557.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1365200957087489642.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality1365200957087489642.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :6 after 19
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :19 after 42
SDD proceeding with computation,10 properties remain. new max is 64
BEST_FIRST walk for 40002 steps (94 resets) in 5723 ms. (6 steps per ms) remains 10/10 properties
SDD size :42 after 132
BEST_FIRST walk for 40004 steps (96 resets) in 2515 ms. (15 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (92 resets) in 2362 ms. (16 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (80 resets) in 275 ms. (144 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (88 resets) in 330 ms. (120 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (88 resets) in 438 ms. (91 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (82 resets) in 268 ms. (148 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (85 resets) in 438 ms. (91 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (80 resets) in 312 ms. (127 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (84 resets) in 334 ms. (119 steps per ms) remains 10/10 properties
[2026-05-23 12:19:43] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12959787642308396662.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16453091007247919439.kers'
[2026-05-23 12:19:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12959787642308396662.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16453091007247919439.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 130 rows 68 cols 630 entries
Finished phase 1 with 21 SingleSign rule and 40 generalized
[2026-05-23 12:19:43] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-16453091007247919439.kers
Total runtime 5 ms.
[2026-05-23 12:19:43] [INFO ] State equation strengthened by 22 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Problem BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-00 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-01 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-02 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-10 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 5/5 constraints. Problems are: Problem set: 4 solved, 6 unsolved
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :132 after 706
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 2/68 variables, 2/7 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 130/198 variables, 68/75 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 22/97 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/97 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/97 constraints. Problems are: Problem set: 4 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 97 constraints, problems are : Problem set: 4 solved, 6 unsolved in 583 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 68/68 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 6/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 9/68 variables, 6/7 constraints. Problems are: Problem set: 4 solved, 6 unsolved
Problem BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-09 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/8 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/8 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 130/198 variables, 68/76 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 22/98 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 2/100 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/100 constraints. Problems are: Problem set: 5 solved, 5 unsolved
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :706 after 709
At refinement iteration 9 (OVERLAPS) 0/198 variables, 0/100 constraints. Problems are: Problem set: 5 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 100 constraints, problems are : Problem set: 5 solved, 5 unsolved in 941 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 68/68 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 6/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1689ms problems are : Problem set: 5 solved, 5 unsolved
Parikh walk visited 0 properties in 827 ms.
Support contains 58 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 562 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 65 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 65 transition count 547
Applied a total of 3 rules in 75 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
Running 544 sub problems to find dead transitions.
[2026-05-23 12:19:46] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7444888854643894809.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7099753532783744508.kers'
[2026-05-23 12:19:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7444888854643894809.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7099753532783744508.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 129 rows 64 cols 585 entries
Finished phase 1 with 60 SingleSign rule and 0 generalized
[2026-05-23 12:19:46] [INFO ] Computed 5 invariants in 4 ms
Computed 5 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-7099753532783744508.kers
Total runtime 5 ms.
[2026-05-23 12:19:46] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 544 unsolved
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :709 after 733
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD296 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/7 constraints. Problems are: Problem set: 40 solved, 504 unsolved
Reachability property BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-14 is true.
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 40 solved, 504 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD64 is UNSAT
At refinement iteration 3 (OVERLAPS) 129/194 variables, 65/72 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 22/94 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/94 constraints. Problems are: Problem set: 42 solved, 502 unsolved
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :733 after 1651
At refinement iteration 6 (OVERLAPS) 0/194 variables, 0/94 constraints. Problems are: Problem set: 42 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 94 constraints, problems are : Problem set: 42 solved, 502 unsolved in 15650 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 65/65 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 544/544 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 42 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 5/5 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/7 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 129/194 variables, 65/72 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 22/94 constraints. Problems are: Problem set: 42 solved, 502 unsolved
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :1651 after 2393
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 502/596 constraints. Problems are: Problem set: 42 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 194/194 variables, and 596 constraints, problems are : Problem set: 42 solved, 502 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 65/65 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 502/544 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36251ms problems are : Problem set: 42 solved, 502 unsolved
Search for dead transitions found 42 dead transitions in 36255ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 42 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 65/68 places, 505/548 transitions.
Applied a total of 0 rules in 21 ms. Remains 65 /65 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36378 ms. Remains : 65/68 places, 505/548 transitions.
RANDOM walk for 40000 steps (224 resets) in 461 ms. (86 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (87 resets) in 330 ms. (120 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (81 resets) in 172 ms. (231 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (85 resets) in 255 ms. (156 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (84 resets) in 208 ms. (191 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 711373 steps, run timeout after 3001 ms. (steps per millisecond=237 ) properties seen :3 out of 4
Probabilistic random walk after 711373 steps, saw 173432 distinct states, run finished after 3006 ms. (steps per millisecond=236 ) properties seen :3
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2026-05-23 12:20:26] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-681160014799098188.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7937440381540002739.kers'
[2026-05-23 12:20:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-681160014799098188.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7937440381540002739.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 125 rows 64 cols 573 entries
Finished phase 1 with 57 SingleSign rule and 1 generalized
[2026-05-23 12:20:26] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7937440381540002739.kers
Total runtime 1 ms.
[2026-05-23 12:20:26] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/61 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 124/185 variables, 61/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/190 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/190 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 92 constraints, problems are : Problem set: 0 solved, 1 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/61 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 124/185 variables, 61/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/190 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/190 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 93 constraints, problems are : Problem set: 0 solved, 1 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 292ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 505/505 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 63 transition count 504
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 61 transition count 502
Applied a total of 7 rules in 86 ms. Remains 61 /65 variables (removed 4) and now considering 502/505 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 61/65 places, 502/505 transitions.
RANDOM walk for 40000 steps (315 resets) in 336 ms. (118 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (144 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 41853 steps, run visited all 1 properties in 135 ms. (steps per millisecond=310 )
Probabilistic random walk after 41853 steps, saw 13250 distinct states, run finished after 139 ms. (steps per millisecond=301 ) properties seen :1
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-2024-15 FALSE 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 48065 ms.

BK_STOP 1779538827089

--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="BridgeAndVehicles-PT-V20P20N10"
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-5973"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-PT-V20P20N10, 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 r034-tall-177946841800207"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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