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-178021499100118.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 ErlangenMainframeV1-PT-bP09C09, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499100118
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 64M
-rw-r--r-- 1 mcc users 7.0K May 27 08:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 27 08:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 27 08:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 27 08:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 27 10:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 27 10:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 27 10:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 8.3K May 27 08:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K May 27 08:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 27 08:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K May 27 08:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:34 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 64M 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 ErlangenMainframeV1-PT-bP09C09-ReachabilityCardinality-2024-00
FORMULA_NAME ErlangenMainframeV1-PT-bP09C09-ReachabilityCardinality-2024-01
FORMULA_NAME ErlangenMainframeV1-PT-bP09C09-ReachabilityCardinality-2024-02
FORMULA_NAME ErlangenMainframeV1-PT-bP09C09-ReachabilityCardinality-2024-03
FORMULA_NAME ErlangenMainframeV1-PT-bP09C09-ReachabilityCardinality-2024-04
FORMULA_NAME ErlangenMainframeV1-PT-bP09C09-ReachabilityCardinality-2024-05
FORMULA_NAME ErlangenMainframeV1-PT-bP09C09-ReachabilityCardinality-2024-06
FORMULA_NAME ErlangenMainframeV1-PT-bP09C09-ReachabilityCardinality-2024-07
FORMULA_NAME ErlangenMainframeV1-PT-bP09C09-ReachabilityCardinality-2024-08
FORMULA_NAME ErlangenMainframeV1-PT-bP09C09-ReachabilityCardinality-2024-09
FORMULA_NAME ErlangenMainframeV1-PT-bP09C09-ReachabilityCardinality-2024-10
FORMULA_NAME ErlangenMainframeV1-PT-bP09C09-ReachabilityCardinality-2024-11
FORMULA_NAME ErlangenMainframeV1-PT-bP09C09-ReachabilityCardinality-2024-12
FORMULA_NAME ErlangenMainframeV1-PT-bP09C09-ReachabilityCardinality-2024-13
FORMULA_NAME ErlangenMainframeV1-PT-bP09C09-ReachabilityCardinality-2024-14
FORMULA_NAME ErlangenMainframeV1-PT-bP09C09-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1780287003517

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV1-PT-bP09C09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-06-01 04:10:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-01 04:10:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-01 04:10:09] [INFO ] Load time of PNML (sax parser for PT used): 3496 ms
[2026-06-01 04:10:09] [INFO ] Transformed 333 places.
[2026-06-01 04:10:10] [INFO ] Transformed 59403 transitions.
[2026-06-01 04:10:10] [INFO ] Found NUPN structural information;
[2026-06-01 04:10:10] [INFO ] Parsed PT model containing 333 places and 59403 transitions and 1260648 arcs in 4246 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
FORMULA ErlangenMainframeV1-PT-bP09C09-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-01 04:10:27] [INFO ] Flatten gal took : 13395 ms
RANDOM walk for 40000 steps (8 resets) in 103997 ms. (0 steps per ms) remains 10/15 properties
FORMULA ErlangenMainframeV1-PT-bP09C09-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV1-PT-bP09C09-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV1-PT-bP09C09-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV1-PT-bP09C09-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV1-PT-bP09C09-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-06-01 04:10:37] [INFO ] Flatten gal took : 10870 ms
[2026-06-01 04:10:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1571480259641076844.gal : 2375 ms
[2026-06-01 04:10:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8305964158434014253.prop : 4 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/ReachabilityCardinality1571480259641076844.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8305964158434014253.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 ...328
BEST_FIRST walk for 23262 steps (4 resets) in 20015 ms. (1 steps per ms) remains 9/10 properties
FORMULA ErlangenMainframeV1-PT-bP09C09-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 16596 ms. (2 steps per ms) remains 9/9 properties
BEST_FIRST walk for 19665 steps (2 resets) in 20010 ms. (0 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 12591 ms. (3 steps per ms) remains 9/9 properties
BEST_FIRST walk for 14253 steps (1 resets) in 20008 ms. (0 steps per ms) remains 8/9 properties
FORMULA ErlangenMainframeV1-PT-bP09C09-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 14770 steps (1 resets) in 20008 ms. (0 steps per ms) remains 8/8 properties
BEST_FIRST walk for 32109 steps (7 resets) in 20008 ms. (1 steps per ms) remains 7/8 properties
FORMULA ErlangenMainframeV1-PT-bP09C09-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30881 steps (6 resets) in 20012 ms. (1 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 18165 ms. (2 steps per ms) remains 7/7 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9425073768597181528.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5645564232848854599.kers'
[2026-06-01 04:11:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9425073768597181528.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5645564232848854599.kers]
Culled 0 columns in 296 ms.
// Phase 1: matrix 59403 rows 333 cols 1260648 entries
Finished phase 1 with 306 SingleSign rule and 3 generalized
[2026-06-01 04:11:22] [INFO ] Computed 24 invariants in 1294 ms
Computed 24 P flows in 1300 ms.
Exported basis to /tmp/petrispot-output-5645564232848854599.kers
Total runtime 1585 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 168/213 variables, 15/60 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 168/228 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 120/333 variables, 9/237 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 120/357 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SMT process timed out in 8033ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 45 out of 333 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 333/333 places, 59403/59403 transitions.
Graph (trivial) has 212 edges and 333 vertex of which 6 / 333 are part of one of the 2 SCC in 25 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 84 place count 329 transition count 59313
Reduce places removed 83 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 101 rules applied. Total rules applied 185 place count 246 transition count 59295
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 199 place count 233 transition count 59294
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 199 place count 233 transition count 59280
Deduced a syphon composed of 14 places in 61 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 227 place count 219 transition count 59280
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 260 place count 186 transition count 59247
Iterating global reduction 3 with 33 rules applied. Total rules applied 293 place count 186 transition count 59247
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 295 place count 186 transition count 59245
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 296 place count 185 transition count 59245
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 309 place count 172 transition count 39685
Ensure Unique test removed 2 places
Iterating global reduction 5 with 15 rules applied. Total rules applied 324 place count 170 transition count 39685
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 332 place count 162 transition count 1183
Iterating global reduction 5 with 8 rules applied. Total rules applied 340 place count 162 transition count 1183
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 342 place count 160 transition count 1179
Iterating global reduction 5 with 2 rules applied. Total rules applied 344 place count 160 transition count 1179
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 394 place count 135 transition count 1154
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 6 places in 6 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 406 place count 129 transition count 1155
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 409 place count 129 transition count 1152
Free-agglomeration rule applied 14 times.
Iterating global reduction 5 with 14 rules applied. Total rules applied 423 place count 129 transition count 1138
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 437 place count 115 transition count 1138
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 438 place count 115 transition count 1137
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 440 place count 115 transition count 2213
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 442 place count 113 transition count 2213
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 446 place count 113 transition count 2213
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 447 place count 113 transition count 2212
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 448 place count 113 transition count 2212
Applied a total of 448 rules in 20495 ms. Remains 113 /333 variables (removed 220) and now considering 2212/59403 (removed 57191) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20517 ms. Remains : 113/333 places, 2212/59403 transitions.
RANDOM walk for 40000 steps (8 resets) in 3116 ms. (12 steps per ms) remains 4/7 properties
FORMULA ErlangenMainframeV1-PT-bP09C09-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV1-PT-bP09C09-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV1-PT-bP09C09-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 343 ms. (116 steps per ms) remains 3/4 properties
FORMULA ErlangenMainframeV1-PT-bP09C09-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1798 ms. (22 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 894 ms. (44 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 271 ms. (147 steps per ms) remains 3/3 properties
[2026-06-01 04:11:51] [INFO ] Flow matrix only has 1234 transitions (discarded 978 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4437054807551834956.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7777373310197608572.kers'
[2026-06-01 04:11:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4437054807551834956.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7777373310197608572.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1234 rows 113 cols 20474 entries
Finished phase 1 with 88 SingleSign rule and 3 generalized
[2026-06-01 04:11:51] [INFO ] Computed 22 invariants in 12 ms
Computed 22 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-7777373310197608572.kers
Total runtime 16 ms.
[2026-06-01 04:11:51] [INFO ] State equation strengthened by 985 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 50/68 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/79 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 34/113 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1234/1347 variables, 113/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1347 variables, 985/1120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1347 variables, 0/1120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1347 variables, 0/1120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1347/1347 variables, and 1120 constraints, problems are : Problem set: 0 solved, 3 unsolved in 989 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 113/113 constraints, ReadFeed: 985/985 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 50/68 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 11/79 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 34/113 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1234/1347 variables, 113/139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1347 variables, 985/1124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1347 variables, 2/1126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1347 variables, 1/1127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1347 variables, 0/1127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/1347 variables, 0/1127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1347/1347 variables, and 1127 constraints, problems are : Problem set: 0 solved, 3 unsolved in 7891 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 113/113 constraints, ReadFeed: 985/985 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8975ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA ErlangenMainframeV1-PT-bP09C09-ReachabilityCardinality-2024-04 TRUE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV1-PT-bP09C09-ReachabilityCardinality-2024-15 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 1631 ms.
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 2212/2212 transitions.
Graph (trivial) has 66 edges and 113 vertex of which 6 / 113 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 110 transition count 2192
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 96 transition count 2191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 95 transition count 2191
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 31 place count 95 transition count 2187
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 40 place count 90 transition count 2187
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 47 place count 83 transition count 1098
Ensure Unique test removed 1 places
Iterating global reduction 3 with 8 rules applied. Total rules applied 55 place count 82 transition count 1098
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 57 place count 80 transition count 558
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 80 transition count 558
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 101 place count 59 transition count 537
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 105 place count 59 transition count 533
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 108 place count 56 transition count 505
Ensure Unique test removed 3 places
Iterating global reduction 4 with 6 rules applied. Total rules applied 114 place count 53 transition count 505
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 115 place count 52 transition count 289
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 52 transition count 289
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 122 place count 49 transition count 292
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 123 place count 49 transition count 291
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 125 place count 47 transition count 288
Iterating global reduction 5 with 2 rules applied. Total rules applied 127 place count 47 transition count 288
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 140 place count 47 transition count 275
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 142 place count 46 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 144 place count 46 transition count 277
Free-agglomeration rule applied 8 times.
Iterating global reduction 5 with 8 rules applied. Total rules applied 152 place count 46 transition count 269
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 174 place count 38 transition count 255
Ensure Unique test removed 3 places
Iterating post reduction 6 with 3 rules applied. Total rules applied 177 place count 35 transition count 255
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 180 place count 35 transition count 252
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 181 place count 35 transition count 251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 182 place count 34 transition count 251
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 183 place count 34 transition count 250
Applied a total of 183 rules in 210 ms. Remains 34 /113 variables (removed 79) and now considering 250/2212 (removed 1962) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210 ms. Remains : 34/113 places, 250/2212 transitions.
RANDOM walk for 1570 steps (0 resets) in 58 ms. (26 steps per ms) remains 0/1 properties
FORMULA ErlangenMainframeV1-PT-bP09C09-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 116502 ms.

BK_STOP 1780287122476

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ErlangenMainframeV1-PT-bP09C09"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is ErlangenMainframeV1-PT-bP09C09, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r338-smll-178021499100118"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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