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.r146-tall-177961074100367.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 GPPP-PT-C1000N0000000100, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074100367
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 8.3K Mar 7 11:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Mar 7 11:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 7 11:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 7 11:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 10:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 15 10:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 7 11:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Mar 7 11:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 7 11:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Mar 7 11:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1 Mar 3 18:30 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-00
FORMULA_NAME GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-01
FORMULA_NAME GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-02
FORMULA_NAME GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-03
FORMULA_NAME GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-04
FORMULA_NAME GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-05
FORMULA_NAME GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-06
FORMULA_NAME GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-07
FORMULA_NAME GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-08
FORMULA_NAME GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-09
FORMULA_NAME GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-10
FORMULA_NAME GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-11
FORMULA_NAME GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-12
FORMULA_NAME GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-13
FORMULA_NAME GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-14
FORMULA_NAME GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779721399703

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C1000N0000000100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-25 15:03:20] [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-25 15:03:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 15:03:21] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2026-05-25 15:03:21] [INFO ] Transformed 33 places.
[2026-05-25 15:03:21] [INFO ] Transformed 22 transitions.
[2026-05-25 15:03:21] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
FORMULA GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40189 steps (12 resets) in 321 ms. (124 steps per ms) remains 10/13 properties
FORMULA GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-25 15:03:21] [INFO ] Flatten gal took : 27 ms
BEST_FIRST walk for 40003 steps (8 resets) in 554 ms. (72 steps per ms) remains 10/10 properties
[2026-05-25 15:03:21] [INFO ] Flatten gal took : 6 ms
[2026-05-25 15:03:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17897197032771724988.gal : 6 ms
[2026-05-25 15:03:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17977824089275132611.prop : 9 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/ReachabilityCardinality17897197032771724988.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17977824089275132611.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 322 ms. (123 steps per ms) remains 10/10 properties

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 ...330
Loading property file /tmp/ReachabilityCardinality17977824089275132611.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :8 after 22
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :22 after 54
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :54 after 77
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :77 after 214
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :214 after 950
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :950 after 3084
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :3084 after 16875
BEST_FIRST walk for 40003 steps (8 resets) in 348 ms. (114 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 364 ms. (109 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 189 ms. (210 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :16875 after 96702
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 492 ms. (81 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 76 ms. (519 steps per ms) remains 10/10 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1338214409851952611.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11764063707553005704.kers'
[2026-05-25 15:03:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1338214409851952611.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11764063707553005704.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 22 rows 27 cols 71 entries
Finished phase 1 with 13 SingleSign rule and 8 generalized
[2026-05-25 15:03:22] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11764063707553005704.kers
Total runtime 1 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-00 is UNSAT
FORMULA GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-02 is UNSAT
FORMULA GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-09 is UNSAT
FORMULA GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-14 is UNSAT
FORMULA GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-15 is UNSAT
FORMULA GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 5/12 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 5 solved, 5 unsolved
Problem GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-03 is UNSAT
FORMULA GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-04 is UNSAT
FORMULA GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-10 is UNSAT
FORMULA GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 22/55 variables, 33/45 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/45 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/55 variables, 0/45 constraints. Problems are: Problem set: 8 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 45 constraints, problems are : Problem set: 8 solved, 2 unsolved in 261 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 2/30 variables, 2/7 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 3/33 variables, 5/12 constraints. Problems are: Problem set: 8 solved, 2 unsolved
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :96702 after 640134
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 33/55 variables, and 12 constraints, problems are : Problem set: 8 solved, 2 unsolved in 2109 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/33 constraints, PredecessorRefiner: 0/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2466ms problems are : Problem set: 8 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 28 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 11 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
[2026-05-25 15:03:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem TDEAD19 is UNSAT
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 45 constraints, problems are : Problem set: 1 solved, 20 unsolved in 415 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 3/10 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 20 unsolved
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :640134 after 4.81326e+06
At refinement iteration 3 (OVERLAPS) 2/33 variables, 2/12 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 20/65 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 65 constraints, problems are : Problem set: 1 solved, 20 unsolved in 18464 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 20/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18886ms problems are : Problem set: 1 solved, 20 unsolved
Search for dead transitions found 1 dead transitions in 18887ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 33/33 places, 21/22 transitions.
Graph (complete) has 81 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 32 /33 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 18954 ms. Remains : 32/33 places, 21/22 transitions.
RANDOM walk for 40343 steps (12 resets) in 98 ms. (407 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 156 ms. (254 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1736975 steps, run timeout after 3001 ms. (steps per millisecond=578 ) properties seen :0 out of 2
Probabilistic random walk after 1736975 steps, saw 297722 distinct states, run finished after 3006 ms. (steps per millisecond=577 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6450081322906508498.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1503018903091362224.kers'
[2026-05-25 15:03:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6450081322906508498.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1503018903091362224.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 21 rows 26 cols 67 entries
Finished phase 1 with 13 SingleSign rule and 7 generalized
[2026-05-25 15:03:46] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1503018903091362224.kers
Total runtime 0 ms.
[2026-05-25 15:03:46] [WARNING] KERS value -104999993000 at col=4 row=24 overflows int; skipping row.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 3/31 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/32 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 21/53 variables, 32/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/53 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 43 constraints, problems are : Problem set: 0 solved, 2 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 3/31 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/32 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-11 is UNSAT
FORMULA GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 21/53 variables, 32/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 1/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/53 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/53 variables, and 44 constraints, problems are : Problem set: 1 solved, 1 unsolved in 223 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 388ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 48 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=24 )
FORMULA GPPP-PT-C1000N0000000100-ReachabilityFireability-2024-13 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 6 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 26196 ms.

BK_STOP 1779721427121

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ 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="GPPP-PT-C1000N0000000100"
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 GPPP-PT-C1000N0000000100, 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 r146-tall-177961074100367"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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