Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r025-smll-171620166300278.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is AutonomousCar-PT-04b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166300278
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 18:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 12 18:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 12 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 110K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-2024-00
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-2024-01
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-2024-02
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-2024-03
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-2024-04
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-2024-05
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-2024-06
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-2024-07
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-2024-08
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-2024-09
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-2024-10
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-2024-11
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-2024-12
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-2024-13
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-2024-14
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716346190271

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-04b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 02:49:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 02:49:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 02:49:53] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2024-05-22 02:49:53] [INFO ] Transformed 221 places.
[2024-05-22 02:49:53] [INFO ] Transformed 368 transitions.
[2024-05-22 02:49:53] [INFO ] Found NUPN structural information;
[2024-05-22 02:49:53] [INFO ] Parsed PT model containing 221 places and 368 transitions and 1658 arcs in 446 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 39 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (58 resets) in 2607 ms. (15 steps per ms) remains 6/15 properties
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (29 resets) in 866 ms. (46 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (24 resets) in 282 ms. (141 steps per ms) remains 4/6 properties
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (25 resets) in 461 ms. (86 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (39 resets) in 259 ms. (153 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (28 resets) in 173 ms. (229 steps per ms) remains 4/4 properties
// Phase 1: matrix 368 rows 221 cols
[2024-05-22 02:49:55] [INFO ] Computed 9 invariants in 19 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 169/221 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 169/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 368/589 variables, 221/451 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/589 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/589 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 589/589 variables, and 451 constraints, problems are : Problem set: 0 solved, 4 unsolved in 987 ms.
Refiners :[Domain max(s): 221/221 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AutonomousCar-PT-04b-ReachabilityCardinality-2024-00 is UNSAT
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 169/221 variables, 9/61 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 169/230 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-22 02:49:56] [INFO ] Deduced a trap composed of 35 places in 311 ms of which 46 ms to minimize.
[2024-05-22 02:49:57] [INFO ] Deduced a trap composed of 35 places in 392 ms of which 5 ms to minimize.
[2024-05-22 02:49:57] [INFO ] Deduced a trap composed of 16 places in 270 ms of which 4 ms to minimize.
[2024-05-22 02:49:57] [INFO ] Deduced a trap composed of 9 places in 247 ms of which 4 ms to minimize.
[2024-05-22 02:49:58] [INFO ] Deduced a trap composed of 12 places in 244 ms of which 4 ms to minimize.
[2024-05-22 02:49:58] [INFO ] Deduced a trap composed of 20 places in 229 ms of which 4 ms to minimize.
[2024-05-22 02:49:58] [INFO ] Deduced a trap composed of 36 places in 217 ms of which 5 ms to minimize.
[2024-05-22 02:49:58] [INFO ] Deduced a trap composed of 29 places in 199 ms of which 4 ms to minimize.
[2024-05-22 02:49:59] [INFO ] Deduced a trap composed of 20 places in 244 ms of which 3 ms to minimize.
[2024-05-22 02:49:59] [INFO ] Deduced a trap composed of 19 places in 244 ms of which 4 ms to minimize.
[2024-05-22 02:49:59] [INFO ] Deduced a trap composed of 24 places in 220 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 11/241 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-22 02:49:59] [INFO ] Deduced a trap composed of 52 places in 235 ms of which 3 ms to minimize.
[2024-05-22 02:50:00] [INFO ] Deduced a trap composed of 41 places in 252 ms of which 3 ms to minimize.
[2024-05-22 02:50:00] [INFO ] Deduced a trap composed of 44 places in 233 ms of which 3 ms to minimize.
[2024-05-22 02:50:00] [INFO ] Deduced a trap composed of 44 places in 248 ms of which 4 ms to minimize.
[2024-05-22 02:50:00] [INFO ] Deduced a trap composed of 44 places in 211 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 5/246 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-22 02:50:01] [INFO ] Deduced a trap composed of 26 places in 222 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 1/247 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-22 02:50:01] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 1/248 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 221/589 variables, and 248 constraints, problems are : Problem set: 1 solved, 3 unsolved in 5014 ms.
Refiners :[Domain max(s): 221/221 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 0/221 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 18/18 constraints]
After SMT, in 6192ms problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 21 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 368/368 transitions.
Graph (trivial) has 170 edges and 221 vertex of which 2 / 221 are part of one of the 1 SCC in 12 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 586 edges and 220 vertex of which 216 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 73 rules applied. Total rules applied 75 place count 216 transition count 290
Reduce places removed 72 places and 0 transitions.
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 1 with 84 rules applied. Total rules applied 159 place count 144 transition count 278
Reduce places removed 6 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 13 rules applied. Total rules applied 172 place count 138 transition count 271
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 179 place count 131 transition count 271
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 179 place count 131 transition count 261
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 199 place count 121 transition count 261
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 214 place count 106 transition count 246
Iterating global reduction 4 with 15 rules applied. Total rules applied 229 place count 106 transition count 246
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 66 rules applied. Total rules applied 295 place count 106 transition count 180
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 296 place count 105 transition count 180
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 296 place count 105 transition count 179
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 298 place count 104 transition count 179
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 302 place count 100 transition count 166
Iterating global reduction 6 with 4 rules applied. Total rules applied 306 place count 100 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 307 place count 100 transition count 165
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 349 place count 79 transition count 144
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 351 place count 77 transition count 134
Iterating global reduction 7 with 2 rules applied. Total rules applied 353 place count 77 transition count 134
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 357 place count 75 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 358 place count 75 transition count 146
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 361 place count 75 transition count 143
Free-agglomeration rule applied 5 times.
Iterating global reduction 8 with 5 rules applied. Total rules applied 366 place count 75 transition count 138
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 371 place count 70 transition count 138
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 373 place count 70 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 374 place count 69 transition count 135
Applied a total of 374 rules in 278 ms. Remains 69 /221 variables (removed 152) and now considering 135/368 (removed 233) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 304 ms. Remains : 69/221 places, 135/368 transitions.
RANDOM walk for 40000 steps (281 resets) in 467 ms. (85 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (186 resets) in 269 ms. (148 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (347 resets) in 98 ms. (404 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (88 resets) in 166 ms. (239 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1768045 steps, run timeout after 3001 ms. (steps per millisecond=589 ) properties seen :2 out of 3
Probabilistic random walk after 1768045 steps, saw 311988 distinct states, run finished after 3011 ms. (steps per millisecond=587 ) properties seen :2
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 135 rows 69 cols
[2024-05-22 02:50:05] [INFO ] Computed 9 invariants in 1 ms
[2024-05-22 02:50:05] [INFO ] State equation strengthened by 47 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/19 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 94/113 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 64/177 variables, 31/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/193 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/196 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/196 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/204 variables, 12/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/204 variables, 46/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/204 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/204 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 125 constraints, problems are : Problem set: 0 solved, 1 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 02:50:05] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2/19 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AutonomousCar-PT-04b-ReachabilityCardinality-2024-11 is UNSAT
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 113/204 variables, and 23 constraints, problems are : Problem set: 1 solved, 0 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 3/9 constraints, State Equation: 19/69 constraints, ReadFeed: 0/47 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 327ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 12460 ms.
ITS solved all properties within timeout

BK_STOP 1716346205517

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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-04b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is AutonomousCar-PT-04b, 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 r025-smll-171620166300278"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-04b.tgz
mv AutonomousCar-PT-04b 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;