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-171620166300298.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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166300298
=====================================================================

--------------------
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-CTLFireability-2024-00
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-01
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-02
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-03
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-04
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-05
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-06
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-07
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-08
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-09
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-10
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-11
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2023-12
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2023-13
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2023-14
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716347756411

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
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:15:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 03:15:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 03:15:59] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2024-05-22 03:15:59] [INFO ] Transformed 65 places.
[2024-05-22 03:15:59] [INFO ] Transformed 417 transitions.
[2024-05-22 03:15:59] [INFO ] Found NUPN structural information;
[2024-05-22 03:15:59] [INFO ] Parsed PT model containing 65 places and 417 transitions and 3356 arcs in 579 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 33 ms.
Ensure Unique test removed 159 transitions
Reduce redundant transitions removed 159 transitions.
Support contains 51 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 258/258 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 257
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 257
Applied a total of 2 rules in 60 ms. Remains 64 /65 variables (removed 1) and now considering 257/258 (removed 1) transitions.
// Phase 1: matrix 257 rows 64 cols
[2024-05-22 03:16:00] [INFO ] Computed 10 invariants in 32 ms
[2024-05-22 03:16:00] [INFO ] Implicit Places using invariants in 567 ms returned []
[2024-05-22 03:16:00] [INFO ] Invariant cache hit.
[2024-05-22 03:16:00] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-22 03:16:00] [INFO ] Implicit Places using invariants and state equation in 390 ms returned [60, 62]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1060 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/65 places, 257/258 transitions.
Applied a total of 0 rules in 6 ms. Remains 62 /62 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1189 ms. Remains : 62/65 places, 257/258 transitions.
Support contains 51 out of 62 places after structural reductions.
[2024-05-22 03:16:01] [INFO ] Flatten gal took : 155 ms
[2024-05-22 03:16:01] [INFO ] Flatten gal took : 90 ms
[2024-05-22 03:16:01] [INFO ] Input system was already deterministic with 257 transitions.
Reduction of identical properties reduced properties to check from 85 to 84
RANDOM walk for 40000 steps (2277 resets) in 4782 ms. (8 steps per ms) remains 17/84 properties
BEST_FIRST walk for 4004 steps (23 resets) in 40 ms. (97 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (18 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (20 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (19 resets) in 49 ms. (80 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (20 resets) in 49 ms. (80 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (20 resets) in 48 ms. (81 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (25 resets) in 54 ms. (72 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (21 resets) in 54 ms. (72 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (22 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (19 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (21 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (22 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (22 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (18 resets) in 15 ms. (250 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4003 steps (14 resets) in 23 ms. (166 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (19 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (23 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
// Phase 1: matrix 257 rows 62 cols
[2024-05-22 03:16:03] [INFO ] Computed 8 invariants in 16 ms
[2024-05-22 03:16:03] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp82 is UNSAT
At refinement iteration 1 (OVERLAPS) 23/56 variables, 8/8 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 254/310 variables, 56/64 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 146/210 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/210 constraints. Problems are: Problem set: 3 solved, 12 unsolved
Problem AtomicPropp27 is UNSAT
At refinement iteration 6 (OVERLAPS) 8/318 variables, 6/216 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 0/216 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/319 variables, 1/217 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 0/217 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/319 variables, 0/217 constraints. Problems are: Problem set: 4 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 217 constraints, problems are : Problem set: 4 solved, 11 unsolved in 1321 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 62/62 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 36/54 variables, 8/8 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 251/305 variables, 54/62 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 146/208 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/208 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 11/316 variables, 6/214 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 11/225 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 0/225 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 2/318 variables, 2/227 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 0/227 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 1/319 variables, 1/228 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/319 variables, 0/228 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 0/319 variables, 0/228 constraints. Problems are: Problem set: 4 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 228 constraints, problems are : Problem set: 4 solved, 11 unsolved in 3190 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 62/62 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 11/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 4912ms problems are : Problem set: 4 solved, 11 unsolved
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 1 properties in 3993 ms.
Support contains 17 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 257/257 transitions.
Graph (complete) has 518 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 61 transition count 251
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 58 transition count 250
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 57 transition count 250
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 14 place count 54 transition count 229
Iterating global reduction 3 with 3 rules applied. Total rules applied 17 place count 54 transition count 229
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 51 transition count 226
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 27 place count 51 transition count 222
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 37 place count 47 transition count 216
Applied a total of 37 rules in 99 ms. Remains 47 /62 variables (removed 15) and now considering 216/257 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 47/62 places, 216/257 transitions.
RANDOM walk for 40000 steps (2355 resets) in 435 ms. (91 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (212 resets) in 97 ms. (408 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (235 resets) in 78 ms. (506 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (216 resets) in 207 ms. (192 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (235 resets) in 88 ms. (449 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (247 resets) in 104 ms. (380 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (222 resets) in 145 ms. (274 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (269 resets) in 96 ms. (412 steps per ms) remains 6/6 properties
// Phase 1: matrix 216 rows 47 cols
[2024-05-22 03:16:13] [INFO ] Computed 9 invariants in 5 ms
[2024-05-22 03:16:13] [INFO ] State equation strengthened by 122 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 26/41 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 4/45 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 216/261 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 122/176 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 2/263 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/263 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 178 constraints, problems are : Problem set: 0 solved, 6 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 26/41 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 4/45 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 216/261 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 122/176 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 2/263 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 6/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/263 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 184 constraints, problems are : Problem set: 0 solved, 6 unsolved in 945 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1396ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 1 properties in 1672 ms.
Support contains 14 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 45 transition count 202
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 45 transition count 202
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 45 transition count 201
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 12 place count 44 transition count 195
Applied a total of 12 rules in 29 ms. Remains 44 /47 variables (removed 3) and now considering 195/216 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 44/47 places, 195/216 transitions.
RANDOM walk for 40000 steps (1994 resets) in 286 ms. (139 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (193 resets) in 63 ms. (625 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (218 resets) in 57 ms. (689 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (235 resets) in 49 ms. (800 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (228 resets) in 74 ms. (533 steps per ms) remains 3/3 properties
// Phase 1: matrix 195 rows 44 cols
[2024-05-22 03:16:16] [INFO ] Computed 9 invariants in 5 ms
[2024-05-22 03:16:16] [INFO ] State equation strengthened by 104 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 21/34 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/42 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 195/237 variables, 42/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 104/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/239 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/239 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 157 constraints, problems are : Problem set: 0 solved, 3 unsolved in 261 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 21/34 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/42 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 195/237 variables, 42/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 104/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/239 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/239 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/239 variables, and 160 constraints, problems are : Problem set: 0 solved, 3 unsolved in 548 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 853ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1025 ms.
Support contains 13 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 195/195 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 44 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 43 transition count 194
Applied a total of 2 rules in 33 ms. Remains 43 /44 variables (removed 1) and now considering 194/195 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 43/44 places, 194/195 transitions.
RANDOM walk for 40000 steps (1895 resets) in 374 ms. (106 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (188 resets) in 72 ms. (548 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (237 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (242 resets) in 51 ms. (769 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1938351 steps, run timeout after 3001 ms. (steps per millisecond=645 ) properties seen :2 out of 3
Probabilistic random walk after 1938351 steps, saw 267329 distinct states, run finished after 3006 ms. (steps per millisecond=644 ) properties seen :2
// Phase 1: matrix 194 rows 43 cols
[2024-05-22 03:16:21] [INFO ] Computed 9 invariants in 2 ms
[2024-05-22 03:16:21] [INFO ] State equation strengthened by 104 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/22 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/40 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 192/232 variables, 40/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 104/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/237 variables, 3/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/237 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 156 constraints, problems are : Problem set: 0 solved, 1 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, ReadFeed: 104/104 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/22 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/40 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 192/232 variables, 40/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 104/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/237 variables, 3/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/237 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 157 constraints, problems are : Problem set: 0 solved, 1 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 399ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 7 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 194/194 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 43 transition count 193
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 43 transition count 192
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 42 transition count 192
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 42 transition count 190
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 19 place count 40 transition count 178
Applied a total of 19 rules in 46 ms. Remains 40 /43 variables (removed 3) and now considering 178/194 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 40/43 places, 178/194 transitions.
RANDOM walk for 40000 steps (207 resets) in 285 ms. (139 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (108 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 793352 steps, run visited all 1 properties in 1443 ms. (steps per millisecond=549 )
Probabilistic random walk after 793352 steps, saw 117372 distinct states, run finished after 1448 ms. (steps per millisecond=547 ) properties seen :1
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
FORMULA AutonomousCar-PT-06a-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 03:16:23] [INFO ] Flatten gal took : 37 ms
[2024-05-22 03:16:23] [INFO ] Flatten gal took : 39 ms
[2024-05-22 03:16:24] [INFO ] Input system was already deterministic with 257 transitions.
Support contains 49 out of 62 places (down from 51) after GAL structural reductions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 60 transition count 243
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 60 transition count 243
Applied a total of 4 rules in 4 ms. Remains 60 /62 variables (removed 2) and now considering 243/257 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 60/62 places, 243/257 transitions.
[2024-05-22 03:16:24] [INFO ] Flatten gal took : 28 ms
[2024-05-22 03:16:24] [INFO ] Flatten gal took : 30 ms
[2024-05-22 03:16:24] [INFO ] Input system was already deterministic with 243 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 58 transition count 229
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 229
Applied a total of 8 rules in 4 ms. Remains 58 /62 variables (removed 4) and now considering 229/257 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 58/62 places, 229/257 transitions.
[2024-05-22 03:16:24] [INFO ] Flatten gal took : 20 ms
[2024-05-22 03:16:24] [INFO ] Flatten gal took : 19 ms
[2024-05-22 03:16:24] [INFO ] Input system was already deterministic with 229 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 56 transition count 215
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 56 transition count 215
Applied a total of 12 rules in 4 ms. Remains 56 /62 variables (removed 6) and now considering 215/257 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 56/62 places, 215/257 transitions.
[2024-05-22 03:16:24] [INFO ] Flatten gal took : 16 ms
[2024-05-22 03:16:24] [INFO ] Flatten gal took : 17 ms
[2024-05-22 03:16:24] [INFO ] Input system was already deterministic with 215 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 59 transition count 236
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 59 transition count 236
Applied a total of 6 rules in 3 ms. Remains 59 /62 variables (removed 3) and now considering 236/257 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 59/62 places, 236/257 transitions.
[2024-05-22 03:16:24] [INFO ] Flatten gal took : 16 ms
[2024-05-22 03:16:24] [INFO ] Flatten gal took : 17 ms
[2024-05-22 03:16:24] [INFO ] Input system was already deterministic with 236 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 62 transition count 252
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 57 transition count 251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 56 transition count 251
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 56 transition count 250
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 55 transition count 250
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 18 place count 51 transition count 222
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 51 transition count 222
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 3 with 2 rules applied. Total rules applied 24 place count 50 transition count 221
Applied a total of 24 rules in 40 ms. Remains 50 /62 variables (removed 12) and now considering 221/257 (removed 36) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40 ms. Remains : 50/62 places, 221/257 transitions.
[2024-05-22 03:16:24] [INFO ] Flatten gal took : 16 ms
[2024-05-22 03:16:24] [INFO ] Flatten gal took : 17 ms
[2024-05-22 03:16:24] [INFO ] Input system was already deterministic with 221 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 59 transition count 236
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 59 transition count 236
Applied a total of 6 rules in 3 ms. Remains 59 /62 variables (removed 3) and now considering 236/257 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 59/62 places, 236/257 transitions.
[2024-05-22 03:16:24] [INFO ] Flatten gal took : 15 ms
[2024-05-22 03:16:24] [INFO ] Flatten gal took : 17 ms
[2024-05-22 03:16:24] [INFO ] Input system was already deterministic with 236 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 222
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 222
Applied a total of 10 rules in 4 ms. Remains 57 /62 variables (removed 5) and now considering 222/257 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 57/62 places, 222/257 transitions.
[2024-05-22 03:16:24] [INFO ] Flatten gal took : 14 ms
[2024-05-22 03:16:24] [INFO ] Flatten gal took : 16 ms
[2024-05-22 03:16:24] [INFO ] Input system was already deterministic with 222 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 222
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 222
Applied a total of 10 rules in 3 ms. Remains 57 /62 variables (removed 5) and now considering 222/257 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 57/62 places, 222/257 transitions.
[2024-05-22 03:16:24] [INFO ] Flatten gal took : 14 ms
[2024-05-22 03:16:24] [INFO ] Flatten gal took : 15 ms
[2024-05-22 03:16:24] [INFO ] Input system was already deterministic with 222 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 61 transition count 250
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 250
Applied a total of 2 rules in 4 ms. Remains 61 /62 variables (removed 1) and now considering 250/257 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 61/62 places, 250/257 transitions.
[2024-05-22 03:16:24] [INFO ] Flatten gal took : 17 ms
[2024-05-22 03:16:24] [INFO ] Flatten gal took : 18 ms
[2024-05-22 03:16:24] [INFO ] Input system was already deterministic with 250 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 62 transition count 252
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 57 transition count 252
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 57 transition count 251
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 56 transition count 251
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 17 place count 51 transition count 216
Iterating global reduction 2 with 5 rules applied. Total rules applied 22 place count 51 transition count 216
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 50 transition count 215
Applied a total of 24 rules in 35 ms. Remains 50 /62 variables (removed 12) and now considering 215/257 (removed 42) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 50/62 places, 215/257 transitions.
[2024-05-22 03:16:24] [INFO ] Flatten gal took : 16 ms
[2024-05-22 03:16:24] [INFO ] Flatten gal took : 18 ms
[2024-05-22 03:16:25] [INFO ] Input system was already deterministic with 215 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 222
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 222
Applied a total of 10 rules in 3 ms. Remains 57 /62 variables (removed 5) and now considering 222/257 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 57/62 places, 222/257 transitions.
[2024-05-22 03:16:25] [INFO ] Flatten gal took : 15 ms
[2024-05-22 03:16:25] [INFO ] Flatten gal took : 16 ms
[2024-05-22 03:16:25] [INFO ] Input system was already deterministic with 222 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 58 transition count 229
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 229
Applied a total of 8 rules in 3 ms. Remains 58 /62 variables (removed 4) and now considering 229/257 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 58/62 places, 229/257 transitions.
[2024-05-22 03:16:25] [INFO ] Flatten gal took : 15 ms
[2024-05-22 03:16:25] [INFO ] Flatten gal took : 16 ms
[2024-05-22 03:16:25] [INFO ] Input system was already deterministic with 229 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 257/257 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 8 rules applied. Total rules applied 8 place count 62 transition count 249
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 54 transition count 249
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 54 transition count 248
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 53 transition count 248
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 23 place count 48 transition count 213
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 48 transition count 213
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 46 transition count 211
Applied a total of 32 rules in 26 ms. Remains 46 /62 variables (removed 16) and now considering 211/257 (removed 46) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 46/62 places, 211/257 transitions.
[2024-05-22 03:16:25] [INFO ] Flatten gal took : 15 ms
[2024-05-22 03:16:25] [INFO ] Flatten gal took : 16 ms
[2024-05-22 03:16:25] [INFO ] Input system was already deterministic with 211 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 62 transition count 251
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 56 transition count 251
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 56 transition count 249
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 54 transition count 249
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 22 place count 48 transition count 207
Iterating global reduction 2 with 6 rules applied. Total rules applied 28 place count 48 transition count 207
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 47 transition count 206
Applied a total of 30 rules in 24 ms. Remains 47 /62 variables (removed 15) and now considering 206/257 (removed 51) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 47/62 places, 206/257 transitions.
[2024-05-22 03:16:25] [INFO ] Flatten gal took : 15 ms
[2024-05-22 03:16:25] [INFO ] Flatten gal took : 25 ms
[2024-05-22 03:16:25] [INFO ] Input system was already deterministic with 206 transitions.
RANDOM walk for 3610 steps (238 resets) in 47 ms. (75 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-06a-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 62 transition count 253
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 58 transition count 251
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 56 transition count 251
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 56 transition count 249
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 54 transition count 249
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 19 place count 51 transition count 228
Iterating global reduction 3 with 3 rules applied. Total rules applied 22 place count 51 transition count 228
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 50 transition count 227
Applied a total of 24 rules in 22 ms. Remains 50 /62 variables (removed 12) and now considering 227/257 (removed 30) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 50/62 places, 227/257 transitions.
[2024-05-22 03:16:25] [INFO ] Flatten gal took : 16 ms
[2024-05-22 03:16:25] [INFO ] Flatten gal took : 17 ms
[2024-05-22 03:16:25] [INFO ] Input system was already deterministic with 227 transitions.
[2024-05-22 03:16:25] [INFO ] Flatten gal took : 19 ms
[2024-05-22 03:16:25] [INFO ] Flatten gal took : 18 ms
[2024-05-22 03:16:25] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 8 ms.
[2024-05-22 03:16:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 62 places, 257 transitions and 2165 arcs took 5 ms.
Total runtime 26624 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/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 62
TRANSITIONS: 257
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.010s, Sys 0.004s]


SAVING FILE /home/mcc/execution/415/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: 583
MODEL NAME: /home/mcc/execution/415/model
62 places, 257 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-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-06a-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-06a-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716347789751

--------------------
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 CTLFireability -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="CTLFireability"
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 CTLFireability"
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-171620166300298"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;