fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r002-tall-174853729800679
Last Updated
June 24, 2025

About the Execution of ITS-Tools for AutonomousCar-PT-05b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 103366.00 0.00 0.00 TTFTFFFTTTFTTTFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K 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 159K 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-05b-ReachabilityFireability-2025-00
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-2025-01
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-2025-02
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-2025-03
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-2025-04
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-2025-05
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-2025-06
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-2025-07
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-2025-08
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-2025-09
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-2025-10
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-2025-11
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-2025-12
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-2025-13
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-2025-14
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748649886266

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-05-31 00:04:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 00:04:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 00:04:47] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2025-05-31 00:04:47] [INFO ] Transformed 255 places.
[2025-05-31 00:04:47] [INFO ] Transformed 490 transitions.
[2025-05-31 00:04:47] [INFO ] Found NUPN structural information;
[2025-05-31 00:04:47] [INFO ] Parsed PT model containing 255 places and 490 transitions and 2527 arcs in 175 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (62 resets) in 1228 ms. (32 steps per ms) remains 8/16 properties
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-2025-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-05-31 00:04:48] [INFO ] Flatten gal took : 133 ms
BEST_FIRST walk for 40002 steps (81 resets) in 375 ms. (106 steps per ms) remains 7/8 properties
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2025-05-31 00:04:48] [INFO ] Flatten gal took : 102 ms
BEST_FIRST walk for 40004 steps (78 resets) in 546 ms. (73 steps per ms) remains 7/7 properties
[2025-05-31 00:04:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8691748315372303714.gal : 48 ms
[2025-05-31 00:04:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11423761223514468849.prop : 7 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/ReachabilityCardinality8691748315372303714.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11423761223514468849.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
Loading property file /tmp/ReachabilityCardinality11423761223514468849.prop.
BEST_FIRST walk for 40004 steps (89 resets) in 751 ms. (53 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (84 resets) in 111 ms. (357 steps per ms) remains 7/7 properties
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :5 after 6
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :6 after 21
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :21 after 30
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :30 after 51
BEST_FIRST walk for 40003 steps (78 resets) in 125 ms. (317 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (89 resets) in 114 ms. (347 steps per ms) remains 7/7 properties
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :51 after 11171
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :11171 after 24061
BEST_FIRST walk for 40004 steps (76 resets) in 125 ms. (317 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (62 resets) in 205 ms. (194 steps per ms) remains 7/7 properties
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :24061 after 127471
// Phase 1: matrix 490 rows 255 cols
[2025-05-31 00:04:48] [INFO ] Computed 10 invariants in 20 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :127471 after 625167
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 109/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AutonomousCar-PT-05b-ReachabilityFireability-2025-04 is UNSAT
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-2025-04 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 146/255 variables, 10/119 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 146/265 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/265 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 490/745 variables, 255/520 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/745 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/745 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 745/745 variables, and 520 constraints, problems are : Problem set: 1 solved, 6 unsolved in 848 ms.
Refiners :[Domain max(s): 255/255 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 92/92 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/92 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Problem AutonomousCar-PT-05b-ReachabilityFireability-2025-07 is UNSAT
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-2025-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-05b-ReachabilityFireability-2025-11 is UNSAT
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-2025-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 163/255 variables, 10/102 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 163/265 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :625167 after 3.15128e+06
[2025-05-31 00:04:50] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 19 ms to minimize.
Problem AutonomousCar-PT-05b-ReachabilityFireability-2025-08 is UNSAT
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-2025-08 TRUE TECHNIQUES SMT_REFINEMENT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:04:50] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 14 ms to minimize.
Problem AutonomousCar-PT-05b-ReachabilityFireability-2025-14 is UNSAT
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-2025-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 2/267 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/267 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 490/745 variables, 255/522 constraints. Problems are: Problem set: 5 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:04:50] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/745 variables, 1/523 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 0/523 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/745 variables, 0/523 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 745/745 variables, and 523 constraints, problems are : Problem set: 5 solved, 2 unsolved in 1101 ms.
Refiners :[Domain max(s): 255/255 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2060ms problems are : Problem set: 5 solved, 2 unsolved
Parikh walk visited 0 properties in 370 ms.
Support contains 51 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 490/490 transitions.
Graph (trivial) has 152 edges and 255 vertex of which 4 / 255 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 759 edges and 253 vertex of which 246 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 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 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 246 transition count 411
Reduce places removed 69 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 83 rules applied. Total rules applied 155 place count 177 transition count 397
Reduce places removed 7 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 15 rules applied. Total rules applied 170 place count 170 transition count 389
Reduce places removed 8 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 10 rules applied. Total rules applied 180 place count 162 transition count 387
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 181 place count 161 transition count 387
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 19 Pre rules applied. Total rules applied 181 place count 161 transition count 368
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 219 place count 142 transition count 368
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 240 place count 121 transition count 347
Iterating global reduction 5 with 21 rules applied. Total rules applied 261 place count 121 transition count 347
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 5 with 102 rules applied. Total rules applied 363 place count 121 transition count 245
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 363 place count 121 transition count 244
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 365 place count 120 transition count 244
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 366 place count 119 transition count 243
Iterating global reduction 6 with 1 rules applied. Total rules applied 367 place count 119 transition count 243
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 399 place count 103 transition count 227
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 400 place count 103 transition count 226
Free-agglomeration rule applied 12 times.
Iterating global reduction 6 with 12 rules applied. Total rules applied 412 place count 103 transition count 214
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 424 place count 91 transition count 214
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 426 place count 91 transition count 212
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 428 place count 91 transition count 212
Applied a total of 428 rules in 109 ms. Remains 91 /255 variables (removed 164) and now considering 212/490 (removed 278) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 91/255 places, 212/490 transitions.
RANDOM walk for 40000 steps (1175 resets) in 311 ms. (128 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (196 resets) in 220 ms. (181 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (198 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1522853 steps, run timeout after 3001 ms. (steps per millisecond=507 ) properties seen :0 out of 2
Probabilistic random walk after 1522853 steps, saw 250377 distinct states, run finished after 3005 ms. (steps per millisecond=506 ) properties seen :0
// Phase 1: matrix 212 rows 91 cols
[2025-05-31 00:04:54] [INFO ] Computed 9 invariants in 2 ms
[2025-05-31 00:04:54] [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/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 37/88 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 212/300 variables, 88/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/303 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/303 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 101 constraints, problems are : Problem set: 0 solved, 2 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 91/91 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/0 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/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 37/88 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 212/300 variables, 88/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 1/98 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 00:04:54] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/303 variables, 3/102 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 00:04:55] [INFO ] Deduced a trap along path composed of 3 places in 16 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:04:55] [INFO ] Deduced a trap along path composed of 3 places in 15 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:04:55] [INFO ] Deduced a trap along path composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/303 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 105 constraints, problems are : Problem set: 0 solved, 2 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 91/91 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 502ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 240 ms.
Support contains 51 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 212/212 transitions.
Applied a total of 0 rules in 10 ms. Remains 91 /91 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 91/91 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 212/212 transitions.
Applied a total of 0 rules in 4 ms. Remains 91 /91 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2025-05-31 00:04:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:04:55] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-05-31 00:04:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:04:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:04:55] [INFO ] Implicit Places using invariants and state equation in 97 ms returned [88]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 165 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 90/91 places, 212/212 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 175 ms. Remains : 90/91 places, 212/212 transitions.
RANDOM walk for 40000 steps (1174 resets) in 303 ms. (131 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (190 resets) in 174 ms. (228 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (205 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1613562 steps, run timeout after 3001 ms. (steps per millisecond=537 ) properties seen :0 out of 2
Probabilistic random walk after 1613562 steps, saw 265751 distinct states, run finished after 3001 ms. (steps per millisecond=537 ) properties seen :0
// Phase 1: matrix 212 rows 90 cols
[2025-05-31 00:04:58] [INFO ] Computed 8 invariants in 10 ms
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/84 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 212/296 variables, 84/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/302 variables, 6/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/302 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 98 constraints, problems are : Problem set: 0 solved, 2 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 2/0 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 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/84 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 212/296 variables, 84/92 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 00:04:59] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6/302 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/302 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 99 constraints, problems are : Problem set: 0 solved, 2 unsolved in 244 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 401ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 220 ms.
Support contains 51 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 212/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 90/90 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 212/212 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2025-05-31 00:04:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:04:59] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-05-31 00:04:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:04:59] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 00:04:59] [INFO ] Redundant transitions in 20 ms returned []
Running 211 sub problems to find dead transitions.
[2025-05-31 00:04:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:01] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Problem TDEAD193 is UNSAT
At refinement iteration 4 (OVERLAPS) 212/302 variables, 90/99 constraints. Problems are: Problem set: 1 solved, 210 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:02] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:02] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:03] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:03] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:03] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:03] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 6/105 constraints. Problems are: Problem set: 1 solved, 210 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:05] [INFO ] Deduced a trap along path composed of 3 places in 45 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:05] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:05] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:06] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 4/109 constraints. Problems are: Problem set: 1 solved, 210 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:07] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:07] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 2/111 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 0/111 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 9 (OVERLAPS) 0/302 variables, 0/111 constraints. Problems are: Problem set: 1 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 111 constraints, problems are : Problem set: 1 solved, 210 unsolved in 13772 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 6/6 constraints]
Escalating to Integer solving :Problem set: 1 solved, 210 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 7/15 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 212/302 variables, 90/105 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 210/315 constraints. Problems are: Problem set: 1 solved, 210 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:16] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:21] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:21] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 4 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :3.15128e+06 after 1.52413e+07
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 3/318 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 6/324 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 0/324 constraints. Problems are: Problem set: 1 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/302 variables, and 324 constraints, problems are : Problem set: 1 solved, 210 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 210/211 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 44058ms problems are : Problem set: 1 solved, 210 unsolved
Search for dead transitions found 1 dead transitions in 44060ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 90/90 places, 211/212 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 89 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 89 transition count 210
Applied a total of 2 rules in 11 ms. Remains 89 /90 variables (removed 1) and now considering 210/211 (removed 1) transitions.
// Phase 1: matrix 210 rows 89 cols
[2025-05-31 00:05:43] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:05:43] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-05-31 00:05:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:05:43] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 89/90 places, 210/212 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 44352 ms. Remains : 89/90 places, 210/212 transitions.
RANDOM walk for 40000 steps (1214 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (197 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (205 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1603454 steps, run timeout after 3001 ms. (steps per millisecond=534 ) properties seen :0 out of 2
Probabilistic random walk after 1603454 steps, saw 259923 distinct states, run finished after 3001 ms. (steps per millisecond=534 ) properties seen :0
[2025-05-31 00:05:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/84 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 210/294 variables, 84/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/299 variables, 5/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/299 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 299/299 variables, and 97 constraints, problems are : Problem set: 0 solved, 2 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 2/0 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 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/84 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 210/294 variables, 84/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/299 variables, 5/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/299 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 299/299 variables, and 97 constraints, problems are : Problem set: 0 solved, 2 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 334ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 240 ms.
Support contains 51 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 210/210 transitions.
Applied a total of 0 rules in 4 ms. Remains 89 /89 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 89/89 places, 210/210 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 210/210 transitions.
Applied a total of 0 rules in 4 ms. Remains 89 /89 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2025-05-31 00:05:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:05:47] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-05-31 00:05:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:05:47] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 00:05:47] [INFO ] Redundant transitions in 10 ms returned []
Running 209 sub problems to find dead transitions.
[2025-05-31 00:05:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:49] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/299 variables, 89/98 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:50] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:50] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:50] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:50] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:51] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:51] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 6/104 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:52] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:52] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:52] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:53] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:53] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:05:53] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 6/110 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 8 (OVERLAPS) 0/299 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 299/299 variables, and 110 constraints, problems are : Problem set: 0 solved, 209 unsolved in 10656 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/299 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 209/313 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:06:00] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:06:02] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 209 unsolved
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :1.52413e+07 after 2.07102e+07
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 6/321 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 299/299 variables, and 321 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 40872ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 40873ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41006 ms. Remains : 89/89 places, 210/210 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-31 00:06:28] [INFO ] Flatten gal took : 36 ms
[2025-05-31 00:06:28] [INFO ] Applying decomposition
[2025-05-31 00:06:28] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3168056787086336107.txt' '-o' '/tmp/graph3168056787086336107.bin' '-w' '/tmp/graph3168056787086336107.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3168056787086336107.bin' '-l' '-1' '-v' '-w' '/tmp/graph3168056787086336107.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:06:28] [INFO ] Decomposing Gal with order
[2025-05-31 00:06:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:06:28] [INFO ] Removed a total of 703 redundant transitions.
[2025-05-31 00:06:28] [INFO ] Flatten gal took : 99 ms
[2025-05-31 00:06:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 9 ms.
[2025-05-31 00:06:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1908668057856206278.gal : 7 ms
[2025-05-31 00:06:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3029864573893740039.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/ReachabilityCardinality1908668057856206278.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3029864573893740039.prop' '--nowitness'

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 ...307
Loading property file /tmp/ReachabilityCardinality3029864573893740039.prop.
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 2
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :2 after 773916
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :773916 after 2.43771e+09
Invariant property AutonomousCar-PT-05b-ReachabilityFireability-2025-06 does not hold.
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property AutonomousCar-PT-05b-ReachabilityFireability-2025-05 does not hold.
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.3609e+11,0.425695,9744,937,138,12877,1248,583,13143,91,4913,0
Total reachable state count : 136089553764

Verifying 2 reachability properties.
Invariant property AutonomousCar-PT-05b-ReachabilityFireability-2025-05 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutonomousCar-PT-05b-ReachabilityFireability-2025-05,1.0626e+06,0.580127,10000,207,29,12877,1248,864,13143,151,4913,0
Invariant property AutonomousCar-PT-05b-ReachabilityFireability-2025-06 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutonomousCar-PT-05b-ReachabilityFireability-2025-06,365010,0.664362,10000,182,27,12877,1248,922,13143,151,4913,0
All properties solved without resorting to model-checking.
Total runtime 102083 ms.

BK_STOP 1748649989632

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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-05b"
export BK_EXAMINATION="ReachabilityFireability"
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-05b, examination is ReachabilityFireability"
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-174853729800679"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-05b.tgz
mv AutonomousCar-PT-05b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;