Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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 25K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K 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 50K 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 517K 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-08b-ReachabilityCardinality-2025-00
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2025-01
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2025-02
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2025-03
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2025-04
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2025-05
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2025-06
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2025-07
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2025-08
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2025-09
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2025-10
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2025-11
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2025-12
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2025-13
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2025-14
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748654944058

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-08b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-05-31 01:29: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]
[2025-05-31 01:29:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 01:29:05] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2025-05-31 01:29:05] [INFO ] Transformed 357 places.
[2025-05-31 01:29:05] [INFO ] Transformed 1128 transitions.
[2025-05-31 01:29:05] [INFO ] Found NUPN structural information;
[2025-05-31 01:29:05] [INFO ] Parsed PT model containing 357 places and 1128 transitions and 9454 arcs in 224 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (320 resets) in 2986 ms. (13 steps per ms) remains 4/16 properties
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-05-31 01:29:06] [INFO ] Flatten gal took : 428 ms
BEST_FIRST walk for 40004 steps (57 resets) in 416 ms. (95 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (49 resets) in 136 ms. (291 steps per ms) remains 3/4 properties
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2025-05-31 01:29:06] [INFO ] Flatten gal took : 218 ms
BEST_FIRST walk for 40003 steps (56 resets) in 615 ms. (64 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (51 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
[2025-05-31 01:29:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3489857773593612720.gal : 68 ms
[2025-05-31 01:29:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16857018285646337758.prop : 1 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/ReachabilityCardinality3489857773593612720.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16857018285646337758.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
// Phase 1: matrix 1128 rows 357 cols
[2025-05-31 01:29:06] [INFO ] Computed 13 invariants in 31 ms
Excessive predecessor constraint size, skipping predecessor.
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
Loading property file /tmp/ReachabilityCardinality16857018285646337758.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AutonomousCar-PT-08b-ReachabilityCardinality-2025-08 is UNSAT
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2025-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 319/357 variables, 13/51 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 319/370 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/370 constraints. Problems are: Problem set: 1 solved, 2 unsolved
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :4 after 5
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :5 after 6
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :6 after 25
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :25 after 53
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :53 after 88
At refinement iteration 5 (OVERLAPS) 1128/1485 variables, 357/727 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1485 variables, 0/727 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/1485 variables, 0/727 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1485/1485 variables, and 727 constraints, problems are : Problem set: 1 solved, 2 unsolved in 567 ms.
Refiners :[Domain max(s): 357/357 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 212/223 variables, 8/19 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 212/231 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:29:07] [INFO ] Deduced a trap composed of 46 places in 166 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:29:07] [INFO ] Deduced a trap composed of 47 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:29:08] [INFO ] Deduced a trap composed of 48 places in 157 ms of which 12 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :88 after 177556
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:29:08] [INFO ] Deduced a trap composed of 52 places in 174 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:29:08] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:29:08] [INFO ] Deduced a trap composed of 52 places in 116 ms of which 7 ms to minimize.
Problem AutonomousCar-PT-08b-ReachabilityCardinality-2025-12 is UNSAT
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2025-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 6/237 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/237 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 134/357 variables, 5/242 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 134/376 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:29:09] [INFO ] Deduced a trap composed of 15 places in 389 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:29:09] [INFO ] Deduced a trap composed of 50 places in 378 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:29:09] [INFO ] Deduced a trap composed of 51 places in 373 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :177556 after 1.42152e+06
[2025-05-31 01:29:10] [INFO ] Deduced a trap composed of 46 places in 324 ms of which 38 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 4/380 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 0/380 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1128/1485 variables, 357/737 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:29:10] [INFO ] Deduced a trap composed of 15 places in 368 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:29:11] [INFO ] Deduced a trap composed of 17 places in 273 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:29:11] [INFO ] Deduced a trap composed of 40 places in 234 ms of which 20 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1485 variables, 3/740 constraints. Problems are: Problem set: 2 solved, 1 unsolved
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1.42152e+06 after 1.47697e+06
At refinement iteration 12 (INCLUDED_ONLY) 0/1485 variables, 0/740 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1485 variables, 0/740 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1485/1485 variables, and 740 constraints, problems are : Problem set: 2 solved, 1 unsolved in 4034 ms.
Refiners :[Domain max(s): 357/357 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4722ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 100 ms.
Support contains 7 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 1128/1128 transitions.
Graph (trivial) has 327 edges and 357 vertex of which 2 / 357 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1430 edges and 356 vertex of which 353 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.9 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 152 rules applied. Total rules applied 154 place count 353 transition count 972
Reduce places removed 151 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 195 rules applied. Total rules applied 349 place count 202 transition count 928
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 26 rules applied. Total rules applied 375 place count 177 transition count 927
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 376 place count 176 transition count 927
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 376 place count 176 transition count 918
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 394 place count 167 transition count 918
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 425 place count 136 transition count 887
Iterating global reduction 4 with 31 rules applied. Total rules applied 456 place count 136 transition count 887
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 457 place count 136 transition count 886
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 457 place count 136 transition count 885
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 459 place count 135 transition count 885
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 467 place count 127 transition count 772
Iterating global reduction 5 with 8 rules applied. Total rules applied 475 place count 127 transition count 772
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 5 with 12 rules applied. Total rules applied 487 place count 127 transition count 760
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 493 place count 121 transition count 760
Performed 42 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 7 with 84 rules applied. Total rules applied 577 place count 79 transition count 717
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 585 place count 71 transition count 581
Iterating global reduction 7 with 8 rules applied. Total rules applied 593 place count 71 transition count 581
Drop transitions (Redundant composition of simpler transitions.) removed 136 transitions
Redundant transition composition rules discarded 136 transitions
Iterating global reduction 7 with 136 rules applied. Total rules applied 729 place count 71 transition count 445
Free-agglomeration rule applied 10 times.
Iterating global reduction 7 with 10 rules applied. Total rules applied 739 place count 71 transition count 435
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 749 place count 61 transition count 435
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 750 place count 61 transition count 434
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 751 place count 61 transition count 434
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 752 place count 60 transition count 433
Applied a total of 752 rules in 373 ms. Remains 60 /357 variables (removed 297) and now considering 433/1128 (removed 695) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 379 ms. Remains : 60/357 places, 433/1128 transitions.
RANDOM walk for 40000 steps (32 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
BEST_FIRST walk for 32693 steps (21 resets) in 119 ms. (272 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_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 6890 ms.

BK_STOP 1748654952234

--------------------
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-08b"
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-08b, 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-174853729900726"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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