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.r468-smll-171620167500335.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 ltsminxred
Input is AutonomousCar-PT-08a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167500335
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 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 448K 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-08a-ReachabilityFireability-2024-00
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityFireability-2024-01
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityFireability-2024-02
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityFireability-2024-03
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityFireability-2024-04
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityFireability-2024-05
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityFireability-2024-06
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityFireability-2024-07
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityFireability-2024-08
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityFireability-2024-09
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityFireability-2024-10
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityFireability-2024-11
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityFireability-2024-12
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityFireability-2024-13
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityFireability-2024-14
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717217988277

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-08a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:59:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 04:59:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:59:50] [INFO ] Load time of PNML (sax parser for PT used): 214 ms
[2024-06-01 04:59:50] [INFO ] Transformed 81 places.
[2024-06-01 04:59:50] [INFO ] Transformed 849 transitions.
[2024-06-01 04:59:50] [INFO ] Found NUPN structural information;
[2024-06-01 04:59:50] [INFO ] Parsed PT model containing 81 places and 849 transitions and 8894 arcs in 399 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 34 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 275 transitions
Reduce redundant transitions removed 275 transitions.
RANDOM walk for 40000 steps (2078 resets) in 3682 ms. (10 steps per ms) remains 11/16 properties
FORMULA AutonomousCar-PT-08a-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (137 resets) in 1159 ms. (34 steps per ms) remains 10/11 properties
FORMULA AutonomousCar-PT-08a-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (144 resets) in 1615 ms. (24 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (180 resets) in 424 ms. (94 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (141 resets) in 205 ms. (194 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (179 resets) in 236 ms. (168 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (143 resets) in 96 ms. (412 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (128 resets) in 74 ms. (533 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (129 resets) in 133 ms. (298 steps per ms) remains 9/10 properties
FORMULA AutonomousCar-PT-08a-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (136 resets) in 82 ms. (481 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (137 resets) in 73 ms. (540 steps per ms) remains 9/9 properties
[2024-06-01 04:59:52] [INFO ] Flow matrix only has 573 transitions (discarded 1 similar events)
// Phase 1: matrix 573 rows 81 cols
[2024-06-01 04:59:52] [INFO ] Computed 13 invariants in 26 ms
[2024-06-01 04:59:53] [INFO ] State equation strengthened by 259 read => feed constraints.
Problem AutonomousCar-PT-08a-ReachabilityFireability-2024-04 is UNSAT
FORMULA AutonomousCar-PT-08a-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 63/63 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem AutonomousCar-PT-08a-ReachabilityFireability-2024-00 is UNSAT
FORMULA AutonomousCar-PT-08a-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-08a-ReachabilityFireability-2024-06 is UNSAT
FORMULA AutonomousCar-PT-08a-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 16/79 variables, 12/75 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 16/91 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/91 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/81 variables, 1/92 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 2/94 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/94 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 572/653 variables, 81/175 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/653 variables, 258/433 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/653 variables, 0/433 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/654 variables, 1/434 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/654 variables, 0/434 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/654 variables, 0/434 constraints. Problems are: Problem set: 3 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 654/654 variables, and 434 constraints, problems are : Problem set: 3 solved, 6 unsolved in 1180 ms.
Refiners :[Domain max(s): 81/81 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 81/81 constraints, ReadFeed: 259/259 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/47 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 32/79 variables, 12/59 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 32/91 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/91 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/81 variables, 1/92 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 2/94 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/94 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 572/653 variables, 81/175 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/653 variables, 258/433 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/653 variables, 6/439 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/653 variables, 0/439 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1/654 variables, 1/440 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/654 variables, 0/440 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/654 variables, 0/440 constraints. Problems are: Problem set: 3 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 654/654 variables, and 440 constraints, problems are : Problem set: 3 solved, 6 unsolved in 4067 ms.
Refiners :[Domain max(s): 81/81 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 81/81 constraints, ReadFeed: 259/259 constraints, PredecessorRefiner: 6/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 6208ms problems are : Problem set: 3 solved, 6 unsolved
FORMULA AutonomousCar-PT-08a-ReachabilityFireability-2024-03 FALSE TECHNIQUES PARIKH_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityFireability-2024-05 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 3210 ms.
Support contains 8 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 574/574 transitions.
Graph (complete) has 853 edges and 81 vertex of which 79 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 79 transition count 562
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 19 place count 71 transition count 562
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 19 place count 71 transition count 561
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 70 transition count 561
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 27 place count 64 transition count 507
Iterating global reduction 2 with 6 rules applied. Total rules applied 33 place count 64 transition count 507
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 37 place count 62 transition count 505
Free-agglomeration rule applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 45 place count 62 transition count 497
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 109 place count 54 transition count 441
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 110 place count 54 transition count 441
Applied a total of 110 rules in 270 ms. Remains 54 /81 variables (removed 27) and now considering 441/574 (removed 133) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 293 ms. Remains : 54/81 places, 441/574 transitions.
RANDOM walk for 40000 steps (23 resets) in 688 ms. (58 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (67 resets) in 78 ms. (506 steps per ms) remains 2/4 properties
FORMULA AutonomousCar-PT-08a-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (146 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (152 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
// Phase 1: matrix 441 rows 54 cols
[2024-06-01 05:00:03] [INFO ] Computed 13 invariants in 6 ms
[2024-06-01 05:00:03] [INFO ] State equation strengthened by 155 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 14/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 35/54 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 441/495 variables, 54/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 155/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/495 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/495 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 495/495 variables, and 222 constraints, problems are : Problem set: 0 solved, 2 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 54/54 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 14/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 35/54 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 441/495 variables, 54/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 155/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/495 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/495 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/495 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 495/495 variables, and 224 constraints, problems are : Problem set: 0 solved, 2 unsolved in 605 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 54/54 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 932ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 668 ms.
Support contains 5 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 441/441 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 53 transition count 432
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 53 transition count 432
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 53 transition count 431
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 12 place count 52 transition count 423
Applied a total of 12 rules in 70 ms. Remains 52 /54 variables (removed 2) and now considering 423/441 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 52/54 places, 423/441 transitions.
RANDOM walk for 40000 steps (15 resets) in 536 ms. (74 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (213 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (216 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1010816 steps, run timeout after 3001 ms. (steps per millisecond=336 ) properties seen :0 out of 2
Probabilistic random walk after 1010816 steps, saw 128905 distinct states, run finished after 3012 ms. (steps per millisecond=335 ) properties seen :0
// Phase 1: matrix 423 rows 52 cols
[2024-06-01 05:00:07] [INFO ] Computed 13 invariants in 5 ms
[2024-06-01 05:00:07] [INFO ] State equation strengthened by 139 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 14/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/52 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 423/475 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 139/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/475 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 475/475 variables, and 204 constraints, problems are : Problem set: 0 solved, 2 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 52/52 constraints, ReadFeed: 139/139 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 14/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/52 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 423/475 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 139/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/475 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 475/475 variables, and 206 constraints, problems are : Problem set: 0 solved, 2 unsolved in 525 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 52/52 constraints, ReadFeed: 139/139 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 806ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA AutonomousCar-PT-08a-ReachabilityFireability-2024-09 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 480 ms.
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 423/423 transitions.
Applied a total of 0 rules in 42 ms. Remains 52 /52 variables (removed 0) and now considering 423/423 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 52/52 places, 423/423 transitions.
RANDOM walk for 40000 steps (19 resets) in 434 ms. (91 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (212 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1557752 steps, run timeout after 3001 ms. (steps per millisecond=519 ) properties seen :0 out of 1
Probabilistic random walk after 1557752 steps, saw 197407 distinct states, run finished after 3001 ms. (steps per millisecond=519 ) properties seen :0
[2024-06-01 05:00:12] [INFO ] Invariant cache hit.
[2024-06-01 05:00:12] [INFO ] State equation strengthened by 139 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/52 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 423/475 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 139/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/475 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 475/475 variables, and 204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 52/52 constraints, ReadFeed: 139/139 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/52 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 423/475 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 139/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/475 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 475/475 variables, and 205 constraints, problems are : Problem set: 0 solved, 1 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 52/52 constraints, ReadFeed: 139/139 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 555ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 152 ms.
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 423/423 transitions.
Applied a total of 0 rules in 21 ms. Remains 52 /52 variables (removed 0) and now considering 423/423 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 52/52 places, 423/423 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 423/423 transitions.
Applied a total of 0 rules in 20 ms. Remains 52 /52 variables (removed 0) and now considering 423/423 (removed 0) transitions.
[2024-06-01 05:00:13] [INFO ] Invariant cache hit.
[2024-06-01 05:00:13] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-06-01 05:00:13] [INFO ] Invariant cache hit.
[2024-06-01 05:00:13] [INFO ] State equation strengthened by 139 read => feed constraints.
[2024-06-01 05:00:13] [INFO ] Implicit Places using invariants and state equation in 351 ms returned [48, 50]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 621 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 50/52 places, 423/423 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 49 transition count 422
Applied a total of 2 rules in 27 ms. Remains 49 /50 variables (removed 1) and now considering 422/423 (removed 1) transitions.
// Phase 1: matrix 422 rows 49 cols
[2024-06-01 05:00:13] [INFO ] Computed 11 invariants in 4 ms
[2024-06-01 05:00:14] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-06-01 05:00:14] [INFO ] Invariant cache hit.
[2024-06-01 05:00:14] [INFO ] State equation strengthened by 139 read => feed constraints.
[2024-06-01 05:00:14] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 49/52 places, 422/423 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1272 ms. Remains : 49/52 places, 422/423 transitions.
RANDOM walk for 40000 steps (22 resets) in 1807 ms. (22 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (214 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1466069 steps, run timeout after 3001 ms. (steps per millisecond=488 ) properties seen :0 out of 1
Probabilistic random walk after 1466069 steps, saw 184491 distinct states, run finished after 3014 ms. (steps per millisecond=486 ) properties seen :0
[2024-06-01 05:00:17] [INFO ] Invariant cache hit.
[2024-06-01 05:00:17] [INFO ] State equation strengthened by 139 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/46 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 420/466 variables, 46/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 138/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/471 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/471 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/471 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 471/471 variables, and 199 constraints, problems are : Problem set: 0 solved, 1 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 49/49 constraints, ReadFeed: 139/139 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/46 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 420/466 variables, 46/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 138/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/471 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/471 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/471 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/471 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 471/471 variables, and 200 constraints, problems are : Problem set: 0 solved, 1 unsolved in 361 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 49/49 constraints, ReadFeed: 139/139 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 586ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 143 ms.
Support contains 4 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 422/422 transitions.
Applied a total of 0 rules in 24 ms. Remains 49 /49 variables (removed 0) and now considering 422/422 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 49/49 places, 422/422 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 422/422 transitions.
Applied a total of 0 rules in 21 ms. Remains 49 /49 variables (removed 0) and now considering 422/422 (removed 0) transitions.
[2024-06-01 05:00:18] [INFO ] Invariant cache hit.
[2024-06-01 05:00:18] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-06-01 05:00:18] [INFO ] Invariant cache hit.
[2024-06-01 05:00:19] [INFO ] State equation strengthened by 139 read => feed constraints.
[2024-06-01 05:00:19] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2024-06-01 05:00:19] [INFO ] Redundant transitions in 28 ms returned []
Running 421 sub problems to find dead transitions.
[2024-06-01 05:00:19] [INFO ] Invariant cache hit.
[2024-06-01 05:00:19] [INFO ] State equation strengthened by 139 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-06-01 05:00:27] [INFO ] Deduced a trap composed of 19 places in 284 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Problem TDEAD411 is UNSAT
At refinement iteration 4 (OVERLAPS) 422/471 variables, 49/61 constraints. Problems are: Problem set: 1 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 139/200 constraints. Problems are: Problem set: 1 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/200 constraints. Problems are: Problem set: 1 solved, 420 unsolved
At refinement iteration 7 (OVERLAPS) 0/471 variables, 0/200 constraints. Problems are: Problem set: 1 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Real declared 471/471 variables, and 200 constraints, problems are : Problem set: 1 solved, 420 unsolved in 16801 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 49/49 constraints, ReadFeed: 139/139 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 420 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 420 unsolved
At refinement iteration 4 (OVERLAPS) 422/471 variables, 49/61 constraints. Problems are: Problem set: 1 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 139/200 constraints. Problems are: Problem set: 1 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 420/620 constraints. Problems are: Problem set: 1 solved, 420 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 471/471 variables, and 620 constraints, problems are : Problem set: 1 solved, 420 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 49/49 constraints, ReadFeed: 139/139 constraints, PredecessorRefiner: 420/421 constraints, Known Traps: 1/1 constraints]
After SMT, in 51614ms problems are : Problem set: 1 solved, 420 unsolved
Search for dead transitions found 1 dead transitions in 51624ms
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 : 49/49 places, 421/422 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 49 transition count 420
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 48 transition count 420
Applied a total of 2 rules in 31 ms. Remains 48 /49 variables (removed 1) and now considering 420/421 (removed 1) transitions.
// Phase 1: matrix 420 rows 48 cols
[2024-06-01 05:01:10] [INFO ] Computed 12 invariants in 4 ms
[2024-06-01 05:01:11] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-06-01 05:01:11] [INFO ] Invariant cache hit.
[2024-06-01 05:01:11] [INFO ] State equation strengthened by 138 read => feed constraints.
[2024-06-01 05:01:11] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 48/49 places, 420/422 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 52878 ms. Remains : 48/49 places, 420/422 transitions.
RANDOM walk for 40000 steps (17 resets) in 307 ms. (129 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (216 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1550100 steps, run timeout after 3001 ms. (steps per millisecond=516 ) properties seen :0 out of 1
Probabilistic random walk after 1550100 steps, saw 198026 distinct states, run finished after 3001 ms. (steps per millisecond=516 ) properties seen :0
[2024-06-01 05:01:14] [INFO ] Invariant cache hit.
[2024-06-01 05:01:14] [INFO ] State equation strengthened by 138 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/48 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 420/468 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 138/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/468 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 198 constraints, problems are : Problem set: 0 solved, 1 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 48/48 constraints, ReadFeed: 138/138 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/48 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 420/468 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 138/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/468 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 468/468 variables, and 199 constraints, problems are : Problem set: 0 solved, 1 unsolved in 374 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 48/48 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 626ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 85 ms.
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 420/420 transitions.
Applied a total of 0 rules in 21 ms. Remains 48 /48 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 48/48 places, 420/420 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 420/420 transitions.
Applied a total of 0 rules in 20 ms. Remains 48 /48 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2024-06-01 05:01:15] [INFO ] Invariant cache hit.
[2024-06-01 05:01:15] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-06-01 05:01:15] [INFO ] Invariant cache hit.
[2024-06-01 05:01:15] [INFO ] State equation strengthened by 138 read => feed constraints.
[2024-06-01 05:01:15] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2024-06-01 05:01:15] [INFO ] Redundant transitions in 9 ms returned []
Running 419 sub problems to find dead transitions.
[2024-06-01 05:01:16] [INFO ] Invariant cache hit.
[2024-06-01 05:01:16] [INFO ] State equation strengthened by 138 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-06-01 05:01:23] [INFO ] Deduced a trap composed of 19 places in 256 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (OVERLAPS) 420/468 variables, 48/61 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 138/199 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 7 (OVERLAPS) 0/468 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 419 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 199 constraints, problems are : Problem set: 0 solved, 419 unsolved in 16159 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 48/48 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 419 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (OVERLAPS) 420/468 variables, 48/61 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 138/199 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 419/618 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/468 variables, and 618 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 48/48 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 1/1 constraints]
After SMT, in 50822ms problems are : Problem set: 0 solved, 419 unsolved
Search for dead transitions found 0 dead transitions in 50828ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51389 ms. Remains : 48/48 places, 420/420 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 640 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 18 ms. Remains 47 /48 variables (removed 1) and now considering 420/420 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 420 rows 47 cols
[2024-06-01 05:02:06] [INFO ] Computed 11 invariants in 5 ms
[2024-06-01 05:02:06] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 05:02:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 05:02:07] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 05:02:07] [INFO ] After 236ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 05:02:07] [INFO ] After 335ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 416 ms.
[2024-06-01 05:02:07] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-06-01 05:02:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 48 places, 420 transitions and 5775 arcs took 21 ms.
[2024-06-01 05:02:07] [INFO ] Flatten gal took : 263 ms
Total runtime 137851 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : AutonomousCar-PT-08a-ReachabilityFireability-2024-14

BK_STOP 1717218128143

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name AutonomousCar-PT-08a-ReachabilityFireability-2024-14
rfs formula type AG
rfs formula formula --invariant=/tmp/627/inv_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-08a"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is AutonomousCar-PT-08a, 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 r468-smll-171620167500335"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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