fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r338-smll-178021499200271
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for ErlangenMainframeV2-PT-bP08C08

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6747.023 1181922.00 2646281.00 2660.30 FTTFFFTTFFFTFFTF normal

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.r338-smll-178021499200271.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 ErlangenMainframeV2-PT-bP08C08, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499200271
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 22M
-rw-r--r-- 1 mcc users 7.7K May 27 09:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 27 09:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 27 09:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 27 09:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 27 10:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 27 10:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 27 10:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 12K May 27 09:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 27 09:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 27 09:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K May 27 09:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 8 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 21M May 26 18:17 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 ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-00
FORMULA_NAME ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-01
FORMULA_NAME ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-02
FORMULA_NAME ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-03
FORMULA_NAME ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-04
FORMULA_NAME ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-05
FORMULA_NAME ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-06
FORMULA_NAME ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-07
FORMULA_NAME ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-08
FORMULA_NAME ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-09
FORMULA_NAME ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-10
FORMULA_NAME ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-11
FORMULA_NAME ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-12
FORMULA_NAME ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-13
FORMULA_NAME ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-14
FORMULA_NAME ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1780394588889

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV2-PT-bP08C08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-06-02 10:03:11] [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-06-02 10:03:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-02 10:03:12] [INFO ] Load time of PNML (sax parser for PT used): 1509 ms
[2026-06-02 10:03:12] [INFO ] Transformed 319 places.
[2026-06-02 10:03:12] [INFO ] Transformed 20023 transitions.
[2026-06-02 10:03:12] [INFO ] Found NUPN structural information;
[2026-06-02 10:03:12] [INFO ] Parsed PT model containing 319 places and 20023 transitions and 420806 arcs in 1877 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 32 ms.
Working with output stream class java.io.PrintStream
[2026-06-02 10:03:21] [INFO ] Flatten gal took : 6389 ms
RANDOM walk for 40000 steps (8 resets) in 39525 ms. (1 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 477 ms. (8 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 136 ms. (29 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 197 ms. (20 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 817 ms. (4 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 227 ms. (17 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 171 ms. (23 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 214 ms. (18 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 394 ms. (10 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 92 ms. (43 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 202 ms. (19 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 73 ms. (54 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 89 ms. (44 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 69 ms. (57 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 147 ms. (27 steps per ms) remains 16/16 properties
[2026-06-02 10:03:25] [INFO ] Flatten gal took : 4092 ms
[2026-06-02 10:03:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15458075243127545297.gal : 691 ms
[2026-06-02 10:03:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17203207010509897273.prop : 18 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/ReachabilityCardinality15458075243127545297.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17203207010509897273.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 ...330
Loading property file /tmp/ReachabilityCardinality17203207010509897273.prop.
Interrupted probabilistic random walk after 452101 steps, run timeout after 33001 ms. (steps per millisecond=13 ) properties seen :0 out of 16
Probabilistic random walk after 452101 steps, saw 62971 distinct states, run finished after 33012 ms. (steps per millisecond=13 ) 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-12894610237775512323.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12350951167846453703.kers'
[2026-06-02 10:03:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12894610237775512323.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12350951167846453703.kers]
Culled 0 columns in 74 ms.
// Phase 1: matrix 20023 rows 319 cols 420806 entries
Finished phase 1 with 292 SingleSign rule and 3 generalized
[2026-06-02 10:03:58] [INFO ] Computed 24 invariants in 311 ms
Computed 24 P flows in 314 ms.
Exported basis to /tmp/petrispot-output-12350951167846453703.kers
Total runtime 371 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-13 is UNSAT
FORMULA ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 41/97 variables, 11/67 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 41/108 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/108 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 107/204 variables, 4/112 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 107/219 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/219 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Problem ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-00 is UNSAT
FORMULA ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 115/319 variables, 9/228 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 115/343 constraints. Problems are: Problem set: 2 solved, 14 unsolved
SMT process timed out in 26275ms, After SMT, problems are : Problem set: 2 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 56 out of 319 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 319/319 places, 20023/20023 transitions.
Graph (trivial) has 239 edges and 319 vertex of which 10 / 319 are part of one of the 4 SCC in 17 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 123 transitions
Trivial Post-agglo rules discarded 123 transitions
Performed 123 trivial Post agglomeration. Transition count delta: 123
Iterating post reduction 0 with 123 rules applied. Total rules applied 124 place count 313 transition count 19889
Reduce places removed 123 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 135 rules applied. Total rules applied 259 place count 190 transition count 19877
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 263 place count 187 transition count 19876
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :2 after 3
Reduce places removed 1 places and 0 transitions.
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :3 after 5
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :5 after 6
Iterating post reduction 3 with 1 rules applied. Total rules applied 264 place count 186 transition count 19876
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :6 after 13
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 264 place count 186 transition count 19871
Deduced a syphon composed of 5 places in 37 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 274 place count 181 transition count 19871
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 310 place count 145 transition count 19835
Iterating global reduction 4 with 36 rules applied. Total rules applied 346 place count 145 transition count 19835
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 346 place count 145 transition count 19830
Deduced a syphon composed of 5 places in 23 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 356 place count 140 transition count 19830
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :13 after 1154
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 362 place count 134 transition count 19804
Iterating global reduction 4 with 6 rules applied. Total rules applied 368 place count 134 transition count 19804
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :1154 after 6533
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :6533 after 6905
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 7 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 420 place count 108 transition count 19778
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :6905 after 7575
Performed 7 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 7 places in 9 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 434 place count 101 transition count 19807
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 446 place count 101 transition count 19795
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 448 place count 99 transition count 19789
Iterating global reduction 5 with 2 rules applied. Total rules applied 450 place count 99 transition count 19789
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 460 place count 99 transition count 19779
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 462 place count 98 transition count 19792
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 463 place count 98 transition count 19791
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :7575 after 123393
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :123393 after 135796
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 471 place count 98 transition count 19783
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 474 place count 98 transition count 19780
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 477 place count 95 transition count 19780
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :135796 after 3.33518e+06
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 478 place count 95 transition count 19779
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 479 place count 95 transition count 19785
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 482 place count 94 transition count 19783
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 495 place count 94 transition count 19770
Partial Post-agglomeration rule applied 8 times.
Drop transitions (Partial Post agglomeration) removed 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 503 place count 94 transition count 19770
SDD proceeding with computation,16 properties remain. new max is 16384
SDD size :3.33518e+06 after 3.64696e+08
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 511 place count 94 transition count 19762
Applied a total of 511 rules in 112883 ms. Remains 94 /319 variables (removed 225) and now considering 19762/20023 (removed 261) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112905 ms. Remains : 94/319 places, 19762/20023 transitions.
RANDOM walk for 40000 steps (8 resets) in 18945 ms. (2 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 9148 ms. (4 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2413 ms. (16 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3424 ms. (11 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2100 ms. (19 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 8219 ms. (4 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2258 ms. (17 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (8 resets) in 8501 ms. (4 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 7828 ms. (5 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2420 ms. (16 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (8 resets) in 8350 ms. (4 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1967 ms. (20 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1696 ms. (23 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2398 ms. (16 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 8950 ms. (4 steps per ms) remains 14/14 properties
SDD proceeding with computation,16 properties remain. new max is 32768
SDD size :3.64696e+08 after 3.0212e+09
Interrupted probabilistic random walk after 891319 steps, run timeout after 69001 ms. (steps per millisecond=12 ) properties seen :1 out of 14
Probabilistic random walk after 891319 steps, saw 138172 distinct states, run finished after 69001 ms. (steps per millisecond=12 ) properties seen :1
FORMULA ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-725678724966136856.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7970660700812106205.kers'
[2026-06-02 10:07:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-725678724966136856.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7970660700812106205.kers]
Culled 0 columns in 70 ms.
// Phase 1: matrix 19762 rows 94 cols 420166 entries
Finished phase 1 with 67 SingleSign rule and 3 generalized
[2026-06-02 10:07:50] [INFO ] Computed 24 invariants in 281 ms
Computed 24 P flows in 282 ms.
Exported basis to /tmp/petrispot-output-7970660700812106205.kers
Total runtime 358 ms.
[2026-06-02 10:07:50] [INFO ] State equation strengthened by 34 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 5/61 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 8/69 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 25/94 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 19762/19856 variables, 94/119 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/19856 variables, 34/153 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 19856/19856 variables, and 153 constraints, problems are : Problem set: 0 solved, 13 unsolved in 45030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 94/94 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 13/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-07 is UNSAT
FORMULA ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-11 is UNSAT
FORMULA ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 5/61 variables, 11/11 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/12 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 8/69 variables, 4/16 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 25/94 variables, 9/25 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/25 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 19762/19856 variables, 94/119 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/19856 variables, 34/153 constraints. Problems are: Problem set: 2 solved, 11 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 19856/19856 variables, and 153 constraints, problems are : Problem set: 2 solved, 11 unsolved in 45033 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 94/94 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 13/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 90822ms problems are : Problem set: 2 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 55 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 19762/19762 transitions.
Applied a total of 0 rules in 12653 ms. Remains 94 /94 variables (removed 0) and now considering 19762/19762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12654 ms. Remains : 94/94 places, 19762/19762 transitions.
RANDOM walk for 40000 steps (8 resets) in 18937 ms. (2 steps per ms) remains 10/11 properties
FORMULA ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 8230 ms. (4 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2395 ms. (16 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2009 ms. (19 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 7602 ms. (5 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1967 ms. (20 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 7938 ms. (5 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2485 ms. (16 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 7558 ms. (5 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1967 ms. (20 steps per ms) remains 10/10 properties
SDD proceeding with computation,16 properties remain. new max is 65536
SDD size :3.0212e+09 after 4.82715e+13
BEST_FIRST walk for 40003 steps (8 resets) in 7911 ms. (5 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 670524 steps, run timeout after 54001 ms. (steps per millisecond=12 ) properties seen :0 out of 10
Probabilistic random walk after 670524 steps, saw 108343 distinct states, run finished after 54001 ms. (steps per millisecond=12 ) properties seen :0
[2026-06-02 10:10:46] [INFO ] Invariant cache hit.
[2026-06-02 10:10:46] [INFO ] State equation strengthened by 34 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 5/60 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 8/68 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 26/94 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 19762/19856 variables, 94/119 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/19856 variables, 34/153 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/19856 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/19856 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19856/19856 variables, and 153 constraints, problems are : Problem set: 0 solved, 10 unsolved in 74147 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 94/94 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 10/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 5/60 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 8/68 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 26/94 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 19762/19856 variables, 94/119 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/19856 variables, 34/153 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/19856 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/19856 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
No progress, stopping.
After SMT solving in domain Int declared 19856/19856 variables, and 153 constraints, problems are : Problem set: 0 solved, 10 unsolved in 75029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 94/94 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 10/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 149388ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 55 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 19762/19762 transitions.
Applied a total of 0 rules in 12288 ms. Remains 94 /94 variables (removed 0) and now considering 19762/19762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12289 ms. Remains : 94/94 places, 19762/19762 transitions.
RANDOM walk for 40000 steps (8 resets) in 15226 ms. (2 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 7947 ms. (5 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2488 ms. (16 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2188 ms. (18 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 7872 ms. (5 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1953 ms. (20 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 8123 ms. (4 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2125 ms. (18 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 7881 ms. (5 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1936 ms. (20 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 8073 ms. (4 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 659356 steps, run timeout after 51001 ms. (steps per millisecond=12 ) properties seen :0 out of 10
Probabilistic random walk after 659356 steps, saw 106689 distinct states, run finished after 51001 ms. (steps per millisecond=12 ) properties seen :0
[2026-06-02 10:14:36] [INFO ] Invariant cache hit.
[2026-06-02 10:14:36] [INFO ] State equation strengthened by 34 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 5/60 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 8/68 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 26/94 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 19762/19856 variables, 94/119 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/19856 variables, 34/153 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/19856 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/19856 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19856/19856 variables, and 153 constraints, problems are : Problem set: 0 solved, 10 unsolved in 68459 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 94/94 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 10/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 5/60 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 8/68 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 26/94 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 19762/19856 variables, 94/119 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/19856 variables, 34/153 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/19856 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/19856 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19856/19856 variables, and 153 constraints, problems are : Problem set: 0 solved, 10 unsolved in 90026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 94/94 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 10/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 158772ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 55 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 19762/19762 transitions.
Applied a total of 0 rules in 12419 ms. Remains 94 /94 variables (removed 0) and now considering 19762/19762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12419 ms. Remains : 94/94 places, 19762/19762 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 19762/19762 transitions.
Applied a total of 0 rules in 12329 ms. Remains 94 /94 variables (removed 0) and now considering 19762/19762 (removed 0) transitions.
[2026-06-02 10:17:39] [INFO ] Invariant cache hit.
[2026-06-02 10:17:40] [INFO ] Implicit Places using invariants in 254 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 295 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 93/94 places, 19762/19762 transitions.
Applied a total of 0 rules in 12481 ms. Remains 93 /93 variables (removed 0) and now considering 19762/19762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 25112 ms. Remains : 93/94 places, 19762/19762 transitions.
RANDOM walk for 40000 steps (8 resets) in 19439 ms. (2 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 8258 ms. (4 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2259 ms. (17 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1933 ms. (20 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 7932 ms. (5 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1926 ms. (20 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 7541 ms. (5 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1994 ms. (20 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 7907 ms. (5 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1954 ms. (20 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 8086 ms. (4 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 675881 steps, run timeout after 54001 ms. (steps per millisecond=12 ) properties seen :0 out of 10
Probabilistic random walk after 675881 steps, saw 109123 distinct states, run finished after 54002 ms. (steps per millisecond=12 ) 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-11765575183573503255.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10252994203753618424.kers'
[2026-06-02 10:19:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11765575183573503255.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10252994203753618424.kers]
Culled 0 columns in 70 ms.
// Phase 1: matrix 19762 rows 93 cols 420164 entries
Finished phase 1 with 67 SingleSign rule and 3 generalized
[2026-06-02 10:19:05] [INFO ] Computed 23 invariants in 287 ms
Computed 23 P flows in 287 ms.
Exported basis to /tmp/petrispot-output-10252994203753618424.kers
Total runtime 355 ms.
[2026-06-02 10:19:05] [INFO ] State equation strengthened by 17 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 5/60 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 7/67 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 26/93 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 19762/19855 variables, 93/117 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/19855 variables, 17/134 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/19855 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/19855 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19855/19855 variables, and 134 constraints, problems are : Problem set: 0 solved, 10 unsolved in 54597 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 93/93 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 10/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 5/60 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 7/67 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 26/93 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 19762/19855 variables, 93/117 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/19855 variables, 17/134 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/19855 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/19855 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19855/19855 variables, and 134 constraints, problems are : Problem set: 0 solved, 10 unsolved in 67664 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 93/93 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 10/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 122900ms problems are : Problem set: 0 solved, 10 unsolved
FORMULA ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-01 TRUE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-05 FALSE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-08 FALSE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-09 FALSE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-10 FALSE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-15 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 8 properties in 11227 ms.
Support contains 47 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 19762/19762 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 93 transition count 19761
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 92 transition count 19761
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 92 transition count 19760
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 91 transition count 19760
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 90 transition count 19759
Applied a total of 6 rules in 14708 ms. Remains 90 /93 variables (removed 3) and now considering 19759/19762 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14710 ms. Remains : 90/93 places, 19759/19762 transitions.
RANDOM walk for 40000 steps (8 resets) in 15385 ms. (2 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2376 ms. (16 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2433 ms. (16 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 156461 steps, run timeout after 15001 ms. (steps per millisecond=10 ) properties seen :0 out of 2
Probabilistic random walk after 156461 steps, saw 29769 distinct states, run finished after 15001 ms. (steps per millisecond=10 ) 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-1065782730273688248.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9883269596995265166.kers'
[2026-06-02 10:21:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1065782730273688248.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9883269596995265166.kers]
Culled 0 columns in 70 ms.
// Phase 1: matrix 19759 rows 90 cols 420158 entries
Finished phase 1 with 64 SingleSign rule and 3 generalized
[2026-06-02 10:21:54] [INFO ] Computed 23 invariants in 316 ms
Computed 23 P flows in 317 ms.
Exported basis to /tmp/petrispot-output-9883269596995265166.kers
Total runtime 384 ms.
[2026-06-02 10:21:54] [INFO ] State equation strengthened by 17 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/58 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/65 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 25/90 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 19759/19849 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19849 variables, 17/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/19849 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/19849 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19849/19849 variables, and 130 constraints, problems are : Problem set: 0 solved, 2 unsolved in 12878 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 90/90 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 2/0 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/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/58 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 7/65 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 25/90 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 19759/19849 variables, 90/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/19849 variables, 17/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/19849 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/19849 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19849/19849 variables, and 131 constraints, problems are : Problem set: 0 solved, 2 unsolved in 40905 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 90/90 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54475ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-02 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 1755 steps, including 66 resets, run visited all 1 properties in 667 ms. (steps per millisecond=2 )
FORMULA ErlangenMainframeV2-PT-bP08C08-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 1636 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 1179647 ms.

BK_STOP 1780395770811

--------------------
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="ErlangenMainframeV2-PT-bP08C08"
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 ErlangenMainframeV2-PT-bP08C08, 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 r338-smll-178021499200271"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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