Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812600446.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is Parking-PT-864, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876812600446
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 880K
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 427K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-2025-00
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-2025-01
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-2025-02
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-2025-03
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-2025-04
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-2025-05
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-2025-06
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-2025-07
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-2025-08
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-2025-09
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-2025-10
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-2025-11
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-2025-12
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-2025-13
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-2025-14
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748890377878

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-864
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-02 18:52:59] [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]
[2025-06-02 18:52:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 18:52:59] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2025-06-02 18:52:59] [INFO ] Transformed 1185 places.
[2025-06-02 18:52:59] [INFO ] Transformed 1697 transitions.
[2025-06-02 18:52:59] [INFO ] Found NUPN structural information;
[2025-06-02 18:52:59] [INFO ] Parsed PT model containing 1185 places and 1697 transitions and 5073 arcs in 226 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 688 transitions
Reduce redundant transitions removed 688 transitions.
FORMULA Parking-PT-864-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-ReachabilityCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-ReachabilityCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 18:53:00] [INFO ] Flatten gal took : 331 ms
[2025-06-02 18:53:00] [INFO ] Flatten gal took : 131 ms
RANDOM walk for 40000 steps (153 resets) in 3019 ms. (13 steps per ms) remains 6/10 properties
FORMULA Parking-PT-864-ReachabilityCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-02 18:53:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11363453511241842085.gal : 42 ms
[2025-06-02 18:53:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9855790008950904967.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11363453511241842085.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9855790008950904967.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (8 resets) in 441 ms. (90 steps per ms) remains 6/6 properties
Loading property file /tmp/ReachabilityCardinality9855790008950904967.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 617 ms. (64 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 335 ms. (119 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 980 ms. (40 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 369 ms. (108 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 436 ms. (91 steps per ms) remains 6/6 properties
// Phase 1: matrix 1009 rows 1185 cols
[2025-06-02 18:53:01] [INFO ] Computed 280 invariants in 34 ms
[2025-06-02 18:53:01] [INFO ] State equation strengthened by 248 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 17
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :17 after 257
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 478/603 variables, 86/211 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem Parking-PT-864-ReachabilityCardinality-2025-06 is UNSAT
FORMULA Parking-PT-864-ReachabilityCardinality-2025-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (INCLUDED_ONLY) 0/603 variables, 478/689 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/603 variables, 0/689 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 529/1132 variables, 186/875 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1132 variables, 529/1404 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1132 variables, 0/1404 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 53/1185 variables, 8/1412 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1185 variables, 53/1465 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1185 variables, 0/1465 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2194/2194 variables, and 2650 constraints, problems are : Problem set: 1 solved, 5 unsolved in 5088 ms.
Refiners :[Domain max(s): 1185/1185 constraints, Positive P Invariants (semi-flows): 272/272 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 1185/1185 constraints, ReadFeed: 0/248 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 410/488 variables, 60/138 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 410/548 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/488 variables, 0/548 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 643/1131 variables, 212/760 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1131 variables, 643/1403 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1131 variables, 0/1403 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1185/2194 variables, and 1411 constraints, problems are : Problem set: 1 solved, 5 unsolved in 5012 ms.
Refiners :[Domain max(s): 1131/1185 constraints, Positive P Invariants (semi-flows): 272/272 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/1185 constraints, ReadFeed: 0/248 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10222ms problems are : Problem set: 1 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 78 out of 1185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1185/1185 places, 1009/1009 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1185 transition count 978
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 1154 transition count 977
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 1153 transition count 977
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 64 place count 1153 transition count 946
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 126 place count 1122 transition count 946
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 134 place count 1114 transition count 938
Iterating global reduction 3 with 8 rules applied. Total rules applied 142 place count 1114 transition count 938
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 214 place count 1078 transition count 902
Free-agglomeration rule applied 168 times.
Iterating global reduction 3 with 168 rules applied. Total rules applied 382 place count 1078 transition count 734
Reduce places removed 168 places and 0 transitions.
Iterating post reduction 3 with 168 rules applied. Total rules applied 550 place count 910 transition count 734
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 551 place count 910 transition count 733
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 552 place count 910 transition count 733
Applied a total of 552 rules in 607 ms. Remains 910 /1185 variables (removed 275) and now considering 733/1009 (removed 276) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 617 ms. Remains : 910/1185 places, 733/1009 transitions.
RANDOM walk for 40000 steps (8 resets) in 748 ms. (53 steps per ms) remains 3/5 properties
FORMULA Parking-PT-864-ReachabilityCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (8 resets) in 364 ms. (109 steps per ms) remains 2/3 properties
FORMULA Parking-PT-864-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 414 ms. (96 steps per ms) remains 1/2 properties
FORMULA Parking-PT-864-ReachabilityCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 343 ms. (116 steps per ms) remains 1/1 properties
// Phase 1: matrix 733 rows 910 cols
[2025-06-02 18:53:12] [INFO ] Computed 280 invariants in 9 ms
[2025-06-02 18:53:12] [INFO ] State equation strengthened by 528 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 826/861 variables, 270/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/861 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 49/910 variables, 8/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/910 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 733/1643 variables, 910/1190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1643 variables, 528/1718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1643 variables, 0/1718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1643 variables, 0/1718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1643/1643 variables, and 1718 constraints, problems are : Problem set: 0 solved, 1 unsolved in 550 ms.
Refiners :[Positive P Invariants (semi-flows): 272/272 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 910/910 constraints, ReadFeed: 528/528 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 826/861 variables, 270/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/861 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 49/910 variables, 8/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/910 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 733/1643 variables, 910/1190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1643 variables, 528/1718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1643 variables, 1/1719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1643 variables, 0/1719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1643 variables, 0/1719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1643/1643 variables, and 1719 constraints, problems are : Problem set: 0 solved, 1 unsolved in 565 ms.
Refiners :[Positive P Invariants (semi-flows): 272/272 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 910/910 constraints, ReadFeed: 528/528 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1151ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 59 ms.
Support contains 2 out of 910 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 910/910 places, 733/733 transitions.
Graph (complete) has 1916 edges and 910 vertex of which 700 are kept as prefixes of interest. Removing 210 places using SCC suffix rule.1 ms
Discarding 210 places :
Also discarding 154 output transitions
Drop transitions (Output transitions of discarded places.) removed 154 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 700 transition count 555
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 25 place count 700 transition count 553
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 698 transition count 553
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 696 transition count 551
Free-agglomeration rule applied 23 times.
Iterating global reduction 1 with 23 rules applied. Total rules applied 56 place count 696 transition count 528
Reduce places removed 23 places and 0 transitions.
Graph (complete) has 1390 edges and 673 vertex of which 234 are kept as prefixes of interest. Removing 439 places using SCC suffix rule.1 ms
Discarding 439 places :
Also discarding 334 output transitions
Drop transitions (Output transitions of discarded places.) removed 334 transitions
Iterating post reduction 1 with 24 rules applied. Total rules applied 80 place count 234 transition count 194
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 96 place count 234 transition count 178
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 233 transition count 177
Reduce places removed 59 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 3 with 151 rules applied. Total rules applied 248 place count 174 transition count 85
Reduce places removed 92 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 4 with 116 rules applied. Total rules applied 364 place count 82 transition count 61
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 17 rules applied. Total rules applied 381 place count 66 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 382 place count 65 transition count 60
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 19 Pre rules applied. Total rules applied 382 place count 65 transition count 41
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 420 place count 46 transition count 41
Applied a total of 420 rules in 104 ms. Remains 46 /910 variables (removed 864) and now considering 41/733 (removed 692) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 46/910 places, 41/733 transitions.
RANDOM walk for 26792 steps (6 resets) in 180 ms. (148 steps per ms) remains 0/1 properties
FORMULA Parking-PT-864-ReachabilityCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 15027 ms.

BK_STOP 1748890394105

--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="Parking-PT-864"
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-5832"
echo " Executing tool itstools"
echo " Input is Parking-PT-864, 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 r142-tall-174876812600446"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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