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-171620166300302.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-06a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166300302
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 193K Apr 12 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 17:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 12 17:58 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 177K 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-06a-ReachabilityCardinality-2024-00
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-2024-01
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-2024-02
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-2024-03
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-2024-04
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-2024-05
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-2024-06
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-2024-07
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-2024-08
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-2024-09
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-2024-10
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-2024-11
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-2024-12
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-2024-13
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-2024-14
FORMULA_NAME AutonomousCar-PT-06a-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716348020874

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-06a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 03:20:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 03:20:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 03:20:24] [INFO ] Load time of PNML (sax parser for PT used): 223 ms
[2024-05-22 03:20:24] [INFO ] Transformed 65 places.
[2024-05-22 03:20:24] [INFO ] Transformed 417 transitions.
[2024-05-22 03:20:24] [INFO ] Found NUPN structural information;
[2024-05-22 03:20:24] [INFO ] Parsed PT model containing 65 places and 417 transitions and 3356 arcs in 616 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 61 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 159 transitions
Reduce redundant transitions removed 159 transitions.
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (2249 resets) in 3555 ms. (11 steps per ms) remains 7/10 properties
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (245 resets) in 338 ms. (118 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (303 resets) in 222 ms. (179 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (242 resets) in 103 ms. (384 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (206 resets) in 889 ms. (44 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (235 resets) in 102 ms. (388 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (232 resets) in 492 ms. (81 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (280 resets) in 939 ms. (42 steps per ms) remains 7/7 properties
[2024-05-22 03:20:26] [INFO ] Flow matrix only has 257 transitions (discarded 1 similar events)
// Phase 1: matrix 257 rows 65 cols
[2024-05-22 03:20:26] [INFO ] Computed 11 invariants in 21 ms
[2024-05-22 03:20:26] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 7/65 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 7/76 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 256/321 variables, 65/141 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 146/287 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1/322 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/322 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 288 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1010 ms.
Refiners :[Domain max(s): 65/65 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 65/65 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Problem AutonomousCar-PT-06a-ReachabilityCardinality-2024-00 is UNSAT
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 5/63 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Problem AutonomousCar-PT-06a-ReachabilityCardinality-2024-12 is UNSAT
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-06a-ReachabilityCardinality-2024-14 is UNSAT
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 7/65 variables, 6/69 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 7/76 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-05-22 03:20:28] [INFO ] Deduced a trap composed of 7 places in 269 ms of which 32 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 1/77 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/77 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 256/321 variables, 65/142 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 146/288 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 4/292 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/321 variables, 0/292 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/322 variables, 1/293 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 0/293 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/322 variables, 0/293 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 293 constraints, problems are : Problem set: 3 solved, 4 unsolved in 1548 ms.
Refiners :[Domain max(s): 65/65 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 65/65 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 2846ms problems are : Problem set: 3 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2055 ms.
Support contains 39 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 258/258 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 65 transition count 254
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 63 transition count 254
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 9 place count 63 transition count 251
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 24 place count 60 transition count 239
Applied a total of 24 rules in 124 ms. Remains 60 /65 variables (removed 5) and now considering 239/258 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 60/65 places, 239/258 transitions.
RANDOM walk for 40000 steps (1676 resets) in 564 ms. (70 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (333 resets) in 173 ms. (229 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (228 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (184 resets) in 296 ms. (134 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (259 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 655929 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :1 out of 4
Probabilistic random walk after 655929 steps, saw 104296 distinct states, run finished after 3006 ms. (steps per millisecond=218 ) properties seen :1
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 239 rows 60 cols
[2024-05-22 03:20:34] [INFO ] Computed 11 invariants in 4 ms
[2024-05-22 03:20:34] [INFO ] State equation strengthened by 134 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/60 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 21/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 239/299 variables, 60/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 134/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 03:20:35] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/299 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 299/299 variables, and 266 constraints, problems are : Problem set: 0 solved, 3 unsolved in 468 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 60/60 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/60 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 21/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 239/299 variables, 60/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 134/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/299 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/299 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 299/299 variables, and 269 constraints, problems are : Problem set: 0 solved, 3 unsolved in 790 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 60/60 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 1305ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 273 ms.
Support contains 39 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 239/239 transitions.
Applied a total of 0 rules in 26 ms. Remains 60 /60 variables (removed 0) and now considering 239/239 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 60/60 places, 239/239 transitions.
RANDOM walk for 40000 steps (1717 resets) in 363 ms. (109 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (337 resets) in 94 ms. (421 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (182 resets) in 247 ms. (161 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (255 resets) in 69 ms. (571 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 920718 steps, run timeout after 3001 ms. (steps per millisecond=306 ) properties seen :0 out of 3
Probabilistic random walk after 920718 steps, saw 143281 distinct states, run finished after 3001 ms. (steps per millisecond=306 ) properties seen :0
[2024-05-22 03:20:39] [INFO ] Invariant cache hit.
[2024-05-22 03:20:39] [INFO ] State equation strengthened by 134 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/60 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 21/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 239/299 variables, 60/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 134/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 03:20:40] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/299 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 299/299 variables, and 266 constraints, problems are : Problem set: 0 solved, 3 unsolved in 435 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 60/60 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/60 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 21/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 03:20:40] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 2 ms to minimize.
[2024-05-22 03:20:40] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 239/299 variables, 60/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 134/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/299 variables, 3/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/299 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/299 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 299/299 variables, and 271 constraints, problems are : Problem set: 0 solved, 3 unsolved in 881 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 60/60 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 1350ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1559 ms.
Support contains 39 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 239/239 transitions.
Applied a total of 0 rules in 12 ms. Remains 60 /60 variables (removed 0) and now considering 239/239 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 60/60 places, 239/239 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 239/239 transitions.
Applied a total of 0 rules in 10 ms. Remains 60 /60 variables (removed 0) and now considering 239/239 (removed 0) transitions.
[2024-05-22 03:20:42] [INFO ] Invariant cache hit.
[2024-05-22 03:20:42] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-22 03:20:42] [INFO ] Invariant cache hit.
[2024-05-22 03:20:42] [INFO ] State equation strengthened by 134 read => feed constraints.
[2024-05-22 03:20:42] [INFO ] Implicit Places using invariants and state equation in 185 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 277 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/60 places, 239/239 transitions.
Applied a total of 0 rules in 10 ms. Remains 59 /59 variables (removed 0) and now considering 239/239 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 298 ms. Remains : 59/60 places, 239/239 transitions.
RANDOM walk for 40000 steps (1775 resets) in 203 ms. (196 steps per ms) remains 2/3 properties
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (335 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (160 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
// Phase 1: matrix 239 rows 59 cols
[2024-05-22 03:20:43] [INFO ] Computed 10 invariants in 4 ms
[2024-05-22 03:20:43] [INFO ] State equation strengthened by 134 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/59 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 239/298 variables, 59/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 134/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/298 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 262 constraints, problems are : Problem set: 0 solved, 2 unsolved in 258 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 59/59 constraints, ReadFeed: 134/134 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/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/59 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 03:20:43] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 2 ms to minimize.
[2024-05-22 03:20:43] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 239/298 variables, 59/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 134/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/298 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/298 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 266 constraints, problems are : Problem set: 0 solved, 2 unsolved in 967 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 59/59 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1256ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1371 ms.
Support contains 39 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 239/239 transitions.
Applied a total of 0 rules in 9 ms. Remains 59 /59 variables (removed 0) and now considering 239/239 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 59/59 places, 239/239 transitions.
RANDOM walk for 40000 steps (1688 resets) in 229 ms. (173 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (333 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (173 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 987397 steps, run timeout after 3001 ms. (steps per millisecond=329 ) properties seen :0 out of 2
Probabilistic random walk after 987397 steps, saw 153395 distinct states, run finished after 3001 ms. (steps per millisecond=329 ) properties seen :0
[2024-05-22 03:20:48] [INFO ] Invariant cache hit.
[2024-05-22 03:20:48] [INFO ] State equation strengthened by 134 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/59 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 239/298 variables, 59/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 134/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 03:20:49] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/298 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 263 constraints, problems are : Problem set: 0 solved, 2 unsolved in 302 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 59/59 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/59 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 239/298 variables, 59/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 134/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/298 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/298 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 265 constraints, problems are : Problem set: 0 solved, 2 unsolved in 406 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 59/59 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 734ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 645 ms.
Support contains 39 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 239/239 transitions.
Applied a total of 0 rules in 14 ms. Remains 59 /59 variables (removed 0) and now considering 239/239 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 59/59 places, 239/239 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 239/239 transitions.
Applied a total of 0 rules in 18 ms. Remains 59 /59 variables (removed 0) and now considering 239/239 (removed 0) transitions.
[2024-05-22 03:20:50] [INFO ] Invariant cache hit.
[2024-05-22 03:20:50] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-22 03:20:50] [INFO ] Invariant cache hit.
[2024-05-22 03:20:50] [INFO ] State equation strengthened by 134 read => feed constraints.
[2024-05-22 03:20:50] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2024-05-22 03:20:50] [INFO ] Redundant transitions in 14 ms returned []
Running 238 sub problems to find dead transitions.
[2024-05-22 03:20:50] [INFO ] Invariant cache hit.
[2024-05-22 03:20:50] [INFO ] State equation strengthened by 134 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (OVERLAPS) 2/58 variables, 10/66 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-22 03:20:54] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 1 ms to minimize.
[2024-05-22 03:20:54] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 239/297 variables, 58/128 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 134/262 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (OVERLAPS) 1/298 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/298 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/298 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 12 (OVERLAPS) 0/298 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 264 constraints, problems are : Problem set: 0 solved, 238 unsolved in 19441 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 59/59 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (OVERLAPS) 2/58 variables, 10/66 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 239/297 variables, 58/128 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 134/262 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 235/497 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (OVERLAPS) 1/298 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/298 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/298 variables, 3/502 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-22 03:21:29] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/298 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/298 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 298/298 variables, and 503 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30039 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 59/59 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 3/3 constraints]
After SMT, in 50814ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 50819ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51114 ms. Remains : 59/59 places, 239/239 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 9 ms. Remains 59 /59 variables (removed 0) and now considering 239/239 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-22 03:21:41] [INFO ] Invariant cache hit.
[2024-05-22 03:21:41] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-22 03:21:41] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 03:21:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-22 03:21:41] [INFO ] After 248ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 03:21:41] [INFO ] After 408ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 03:21:42] [INFO ] After 601ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 738 ms.
[2024-05-22 03:21:42] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2024-05-22 03:21:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 59 places, 239 transitions and 2060 arcs took 11 ms.
[2024-05-22 03:21:42] [INFO ] Flatten gal took : 165 ms
Total runtime 79190 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running AutonomousCar-PT-06a

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 59
TRANSITIONS: 239
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.022s, Sys 0.000s]


SAVING FILE /home/mcc/execution/416/model (.net / .def) ...
EXPORT TIME: [User 0.002s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 643
MODEL NAME: /home/mcc/execution/416/model
59 places, 239 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-06a-ReachabilityCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716348104068

--------------------
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-06a"
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-06a, 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-171620166300302"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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