Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729800710.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 AutonomousCar-PT-07b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729800710
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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 134K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 334K 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 AutonomousCar-PT-07b-ReachabilityCardinality-2025-00
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2025-01
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2025-02
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2025-03
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2025-04
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2025-05
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2025-06
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2025-07
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2025-08
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2025-09
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2025-10
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2025-11
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2025-12
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2025-13
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2025-14
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748652558870

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-07b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-05-31 00:49:20] [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-05-31 00:49:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 00:49:20] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2025-05-31 00:49:20] [INFO ] Transformed 323 places.
[2025-05-31 00:49:20] [INFO ] Transformed 846 transitions.
[2025-05-31 00:49:20] [INFO ] Found NUPN structural information;
[2025-05-31 00:49:20] [INFO ] Parsed PT model containing 323 places and 846 transitions and 5865 arcs in 221 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 36 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (342 resets) in 1495 ms. (26 steps per ms) remains 3/15 properties
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (63 resets) in 321 ms. (124 steps per ms) remains 2/3 properties
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (63 resets) in 443 ms. (90 steps per ms) remains 2/2 properties
[2025-05-31 00:49:21] [INFO ] Flatten gal took : 335 ms
BEST_FIRST walk for 40004 steps (66 resets) in 406 ms. (98 steps per ms) remains 2/2 properties
[2025-05-31 00:49:21] [INFO ] Flatten gal took : 92 ms
// Phase 1: matrix 846 rows 323 cols
[2025-05-31 00:49:21] [INFO ] Computed 12 invariants in 52 ms
[2025-05-31 00:49:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13378263769982265560.gal : 53 ms
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
[2025-05-31 00:49:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13971829651322228520.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/ReachabilityCardinality13378263769982265560.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13971829651322228520.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 ...330
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Loading property file /tmp/ReachabilityCardinality13971829651322228520.prop.
Problem AutonomousCar-PT-07b-ReachabilityCardinality-2025-11 is UNSAT
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2025-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 268/323 variables, 12/67 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 268/335 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/335 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 5
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :5 after 6
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :6 after 24
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :24 after 49
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :49 after 109
At refinement iteration 5 (OVERLAPS) 846/1169 variables, 323/658 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1169 variables, 0/658 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1169 variables, 0/658 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1169/1169 variables, and 658 constraints, problems are : Problem set: 1 solved, 1 unsolved in 683 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 21/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 249/270 variables, 9/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 249/279 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :109 after 355243
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :355243 after 357798
[2025-05-31 00:49:22] [INFO ] Deduced a trap composed of 12 places in 315 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :357798 after 428242
[2025-05-31 00:49:23] [INFO ] Deduced a trap composed of 17 places in 343 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :428242 after 2.23929e+06
[2025-05-31 00:49:23] [INFO ] Deduced a trap composed of 35 places in 229 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:23] [INFO ] Deduced a trap composed of 17 places in 235 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 4/283 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:23] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 17 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 1/284 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/284 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 53/323 variables, 3/287 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/323 variables, 53/340 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:24] [INFO ] Deduced a trap composed of 9 places in 246 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:24] [INFO ] Deduced a trap composed of 35 places in 223 ms of which 24 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.23929e+06 after 1.0764e+08
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:24] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:24] [INFO ] Deduced a trap composed of 38 places in 201 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:25] [INFO ] Deduced a trap composed of 38 places in 198 ms of which 23 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/323 variables, 5/345 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/323 variables, 0/345 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 846/1169 variables, 323/668 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:25] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1169 variables, 1/669 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:25] [INFO ] Deduced a trap composed of 12 places in 269 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:25] [INFO ] Deduced a trap composed of 14 places in 241 ms of which 20 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1169 variables, 2/671 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:26] [INFO ] Deduced a trap along path composed of 3 places in 39 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:26] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1169 variables, 2/673 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1169 variables, 0/673 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:49:26] [INFO ] Deduced a trap composed of 35 places in 224 ms of which 21 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/1169 variables, 1/674 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1169 variables, 0/674 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1169 variables, 0/674 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1169/1169 variables, and 674 constraints, problems are : Problem set: 1 solved, 1 unsolved in 4483 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 5314ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 120 ms.
Support contains 21 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 846/846 transitions.
Graph (trivial) has 268 edges and 323 vertex of which 4 / 323 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1181 edges and 321 vertex of which 314 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.6 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 120 rules applied. Total rules applied 122 place count 314 transition count 717
Reduce places removed 118 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 1 with 144 rules applied. Total rules applied 266 place count 196 transition count 691
Reduce places removed 14 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 23 rules applied. Total rules applied 289 place count 182 transition count 682
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 11 rules applied. Total rules applied 300 place count 173 transition count 680
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 301 place count 172 transition count 680
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 301 place count 172 transition count 671
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 319 place count 163 transition count 671
Discarding 26 places :
Symmetric choice reduction at 5 with 26 rule applications. Total rules 345 place count 137 transition count 645
Iterating global reduction 5 with 26 rules applied. Total rules applied 371 place count 137 transition count 645
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 5 with 199 rules applied. Total rules applied 570 place count 137 transition count 446
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 570 place count 137 transition count 445
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 572 place count 136 transition count 445
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 576 place count 132 transition count 417
Iterating global reduction 6 with 4 rules applied. Total rules applied 580 place count 132 transition count 417
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 6 with 6 rules applied. Total rules applied 586 place count 132 transition count 411
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 589 place count 129 transition count 411
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 8 with 70 rules applied. Total rules applied 659 place count 94 transition count 376
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 664 place count 89 transition count 336
Iterating global reduction 8 with 5 rules applied. Total rules applied 669 place count 89 transition count 336
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 670 place count 89 transition count 335
Free-agglomeration rule applied 10 times.
Iterating global reduction 8 with 10 rules applied. Total rules applied 680 place count 89 transition count 325
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 690 place count 79 transition count 325
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 692 place count 79 transition count 323
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 693 place count 79 transition count 323
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 694 place count 79 transition count 323
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 695 place count 78 transition count 322
Applied a total of 695 rules in 239 ms. Remains 78 /323 variables (removed 245) and now considering 322/846 (removed 524) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 246 ms. Remains : 78/323 places, 322/846 transitions.
RANDOM walk for 8711 steps (252 resets) in 81 ms. (106 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2025-06 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 7096 ms.

BK_STOP 1748652567184

--------------------
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="AutonomousCar-PT-07b"
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 AutonomousCar-PT-07b, 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 r002-tall-174853729800710"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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