Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K 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 49K 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 865K 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-09b-ReachabilityCardinality-2025-00
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2025-01
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2025-02
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2025-03
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2025-04
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2025-05
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2025-06
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2025-07
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2025-08
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2025-09
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2025-10
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2025-11
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2025-12
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2025-13
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2025-14
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748659250082

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-09b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-05-31 02:40:51] [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 02:40:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 02:40:51] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2025-05-31 02:40:51] [INFO ] Transformed 391 places.
[2025-05-31 02:40:51] [INFO ] Transformed 1554 transitions.
[2025-05-31 02:40:51] [INFO ] Found NUPN structural information;
[2025-05-31 02:40:51] [INFO ] Parsed PT model containing 391 places and 1554 transitions and 16243 arcs in 266 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (328 resets) in 2420 ms. (16 steps per ms) remains 3/12 properties
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (39 resets) in 193 ms. (206 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (48 resets) in 193 ms. (206 steps per ms) remains 3/3 properties
[2025-05-31 02:40:52] [INFO ] Flatten gal took : 499 ms
BEST_FIRST walk for 40004 steps (43 resets) in 314 ms. (126 steps per ms) remains 3/3 properties
// Phase 1: matrix 1554 rows 391 cols
[2025-05-31 02:40:52] [INFO ] Computed 14 invariants in 31 ms
Excessive predecessor constraint size, skipping predecessor.
[2025-05-31 02:40:52] [INFO ] Flatten gal took : 191 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 02:40:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4979103224659345240.gal : 125 ms
[2025-05-31 02:40:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15706318579902294038.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/ReachabilityCardinality4979103224659345240.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15706318579902294038.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
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 335/391 variables, 14/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 335/405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Loading property file /tmp/ReachabilityCardinality15706318579902294038.prop.
At refinement iteration 5 (OVERLAPS) 1554/1945 variables, 391/796 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1945 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/1945 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1945/1945 variables, and 796 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1028 ms.
Refiners :[Domain max(s): 391/391 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 391/391 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
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 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 26
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :26 after 57
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :57 after 71
At refinement iteration 2 (OVERLAPS) 335/391 variables, 14/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 335/405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :71 after 5631
[2025-05-31 02:40:54] [INFO ] Deduced a trap composed of 15 places in 686 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:40:55] [INFO ] Deduced a trap composed of 35 places in 525 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:40:55] [INFO ] Deduced a trap composed of 16 places in 576 ms of which 51 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 :5631 after 5.68099e+06
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :5.68099e+06 after 5.71048e+06
[2025-05-31 02:40:56] [INFO ] Deduced a trap composed of 30 places in 643 ms of which 61 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 4096
SDD size :5.71048e+06 after 7.26849e+06
[2025-05-31 02:40:57] [INFO ] Deduced a trap composed of 17 places in 652 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:40:57] [INFO ] Deduced a trap composed of 16 places in 654 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:40:58] [INFO ] Deduced a trap composed of 39 places in 580 ms of which 64 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 8192
SDD size :7.26849e+06 after 4.23982e+07
[2025-05-31 02:40:59] [INFO ] Deduced a trap composed of 22 places in 570 ms of which 50 ms to minimize.
SMT process timed out in 6326ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 56 out of 391 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 391/391 places, 1554/1554 transitions.
Graph (trivial) has 279 edges and 391 vertex of which 2 / 391 are part of one of the 1 SCC in 8 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 1701 edges and 390 vertex of which 389 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.21 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 107 place count 389 transition count 1447
Reduce places removed 105 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 127 rules applied. Total rules applied 234 place count 284 transition count 1425
Reduce places removed 12 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 2 with 33 rules applied. Total rules applied 267 place count 272 transition count 1404
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 25 rules applied. Total rules applied 292 place count 251 transition count 1400
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 294 place count 249 transition count 1400
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 15 Pre rules applied. Total rules applied 294 place count 249 transition count 1385
Deduced a syphon composed of 15 places in 9 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 324 place count 234 transition count 1385
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 345 place count 213 transition count 1364
Iterating global reduction 5 with 21 rules applied. Total rules applied 366 place count 213 transition count 1364
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 367 place count 213 transition count 1363
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 372 place count 208 transition count 1273
Iterating global reduction 6 with 5 rules applied. Total rules applied 377 place count 208 transition count 1273
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 6 with 2 rules applied. Total rules applied 379 place count 208 transition count 1271
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 380 place count 207 transition count 1271
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 8 with 82 rules applied. Total rules applied 462 place count 166 transition count 1230
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 468 place count 160 transition count 1116
Iterating global reduction 8 with 6 rules applied. Total rules applied 474 place count 160 transition count 1116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 476 place count 159 transition count 1116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 477 place count 159 transition count 1115
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 481 place count 159 transition count 1111
Free-agglomeration rule applied 14 times.
Iterating global reduction 9 with 14 rules applied. Total rules applied 495 place count 159 transition count 1097
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 9 with 14 rules applied. Total rules applied 509 place count 145 transition count 1097
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 10 with 21 rules applied. Total rules applied 530 place count 145 transition count 1076
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 534 place count 145 transition count 1076
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 535 place count 144 transition count 1057
Iterating global reduction 10 with 1 rules applied. Total rules applied 536 place count 144 transition count 1057
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 538 place count 144 transition count 1057
Applied a total of 538 rules in 830 ms. Remains 144 /391 variables (removed 247) and now considering 1057/1554 (removed 497) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 840 ms. Remains : 144/391 places, 1057/1554 transitions.
RANDOM walk for 40000 steps (799 resets) in 460 ms. (86 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (98 resets) in 94 ms. (421 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (100 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (83 resets) in 187 ms. (212 steps per ms) remains 2/3 properties
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 1057 rows 144 cols
[2025-05-31 02:41:00] [INFO ] Computed 13 invariants in 11 ms
[2025-05-31 02:41:00] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 81/136 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1055/1191 variables, 136/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1191 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1191 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 9/1200 variables, 7/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1200 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1201 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1201 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1201 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1201/1201 variables, and 158 constraints, problems are : Problem set: 0 solved, 2 unsolved in 384 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 144/144 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 81/136 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:01] [INFO ] Deduced a trap composed of 8 places in 487 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:01] [INFO ] Deduced a trap composed of 8 places in 408 ms of which 38 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 16384
SDD size :4.23982e+07 after 1.66076e+09
[2025-05-31 02:41:01] [INFO ] Deduced a trap composed of 10 places in 385 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:02] [INFO ] Deduced a trap composed of 12 places in 357 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:02] [INFO ] Deduced a trap composed of 12 places in 325 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:02] [INFO ] Deduced a trap composed of 15 places in 286 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:03] [INFO ] Deduced a trap composed of 15 places in 290 ms of which 18 ms to minimize.
Problem AutonomousCar-PT-09b-ReachabilityCardinality-2025-13 is UNSAT
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2025-13 FALSE TECHNIQUES SMT_REFINEMENT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:03] [INFO ] Deduced a trap composed of 9 places in 383 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:04] [INFO ] Deduced a trap composed of 12 places in 404 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:04] [INFO ] Deduced a trap composed of 7 places in 397 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:04] [INFO ] Deduced a trap composed of 12 places in 316 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:05] [INFO ] Deduced a trap composed of 14 places in 313 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:05] [INFO ] Deduced a trap composed of 12 places in 415 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:05] [INFO ] Deduced a trap composed of 11 places in 410 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:06] [INFO ] Deduced a trap composed of 11 places in 429 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:06] [INFO ] Deduced a trap composed of 13 places in 429 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:07] [INFO ] Deduced a trap composed of 17 places in 333 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:07] [INFO ] Deduced a trap composed of 17 places in 321 ms of which 32 ms to minimize.
Problem AutonomousCar-PT-09b-ReachabilityCardinality-2025-14 is UNSAT
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2025-14 FALSE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 136/1201 variables, and 31 constraints, problems are : Problem set: 2 solved, 0 unsolved in 6928 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/144 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7359ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
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 16265 ms.

BK_STOP 1748659267624

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

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