fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r468-smll-171620167400314
Last Updated
July 7, 2024

About the Execution of LTSMin+red for AutonomousCar-PT-07a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
793.468 25613.00 55848.00 251.50 ???????????F???? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r468-smll-171620167400314.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is AutonomousCar-PT-07a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167400314
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 18:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 45K Apr 12 18:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 12 18:11 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 276K 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-07a-CTLFireability-2024-00
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-2024-01
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-2024-02
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-2024-03
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-2024-04
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-2024-05
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-2024-06
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-2024-07
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-2024-08
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-2024-09
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-2024-10
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-2024-11
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-2023-12
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-2023-13
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-2023-14
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717214646885

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-07a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:04:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 04:04:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:04:09] [INFO ] Load time of PNML (sax parser for PT used): 264 ms
[2024-06-01 04:04:09] [INFO ] Transformed 73 places.
[2024-06-01 04:04:09] [INFO ] Transformed 593 transitions.
[2024-06-01 04:04:09] [INFO ] Found NUPN structural information;
[2024-06-01 04:04:09] [INFO ] Parsed PT model containing 73 places and 593 transitions and 5357 arcs in 518 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 29 ms.
Ensure Unique test removed 213 transitions
Reduce redundant transitions removed 213 transitions.
Support contains 58 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 380/380 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 72 transition count 379
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 72 transition count 379
Applied a total of 2 rules in 53 ms. Remains 72 /73 variables (removed 1) and now considering 379/380 (removed 1) transitions.
// Phase 1: matrix 379 rows 72 cols
[2024-06-01 04:04:10] [INFO ] Computed 11 invariants in 41 ms
[2024-06-01 04:04:10] [INFO ] Implicit Places using invariants in 458 ms returned []
[2024-06-01 04:04:10] [INFO ] Invariant cache hit.
[2024-06-01 04:04:10] [INFO ] State equation strengthened by 199 read => feed constraints.
[2024-06-01 04:04:11] [INFO ] Implicit Places using invariants and state equation in 420 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 948 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 71/73 places, 379/380 transitions.
Applied a total of 0 rules in 7 ms. Remains 71 /71 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1055 ms. Remains : 71/73 places, 379/380 transitions.
Support contains 58 out of 71 places after structural reductions.
[2024-06-01 04:04:11] [INFO ] Flatten gal took : 213 ms
[2024-06-01 04:04:11] [INFO ] Flatten gal took : 114 ms
[2024-06-01 04:04:12] [INFO ] Input system was already deterministic with 379 transitions.
RANDOM walk for 40000 steps (2200 resets) in 3316 ms. (12 steps per ms) remains 25/81 properties
BEST_FIRST walk for 4004 steps (21 resets) in 101 ms. (39 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (18 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (17 resets) in 17 ms. (222 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4004 steps (18 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (17 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (14 resets) in 44 ms. (88 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (17 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (15 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (14 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (14 resets) in 18 ms. (210 steps per ms) remains 21/24 properties
BEST_FIRST walk for 4003 steps (17 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (18 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (17 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (16 resets) in 58 ms. (67 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (16 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (22 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (26 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (14 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (17 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (15 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
// Phase 1: matrix 379 rows 71 cols
[2024-06-01 04:04:13] [INFO ] Computed 10 invariants in 8 ms
[2024-06-01 04:04:13] [INFO ] State equation strengthened by 199 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp60 is UNSAT
At refinement iteration 1 (OVERLAPS) 30/70 variables, 10/10 constraints. Problems are: Problem set: 5 solved, 16 unsolved
[2024-06-01 04:04:14] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/11 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/11 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 378/448 variables, 70/81 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 198/279 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 0/279 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 1/449 variables, 1/280 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 0/280 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 1/450 variables, 1/281 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/450 variables, 0/281 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 0/450 variables, 0/281 constraints. Problems are: Problem set: 5 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 281 constraints, problems are : Problem set: 5 solved, 16 unsolved in 2805 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 71/71 constraints, ReadFeed: 199/199 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 5 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 47/70 variables, 10/10 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/11 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/11 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 378/448 variables, 70/81 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 198/279 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 15/294 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 0/294 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 1/449 variables, 1/295 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 1/296 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 0/296 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 1/450 variables, 1/297 constraints. Problems are: Problem set: 5 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 297 constraints, problems are : Problem set: 5 solved, 16 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 71/71 constraints, ReadFeed: 199/199 constraints, PredecessorRefiner: 16/21 constraints, Known Traps: 1/1 constraints]
After SMT, in 8398ms problems are : Problem set: 5 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 379/379 transitions.
Graph (complete) has 676 edges and 71 vertex of which 70 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 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 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 70 transition count 375
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 69 transition count 375
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 5 place count 69 transition count 372
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 11 place count 66 transition count 372
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 16 place count 61 transition count 332
Iterating global reduction 2 with 5 rules applied. Total rules applied 21 place count 61 transition count 332
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 2 with 2 rules applied. Total rules applied 23 place count 60 transition count 331
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 29 place count 60 transition count 325
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 42 place count 54 transition count 318
Applied a total of 42 rules in 133 ms. Remains 54 /71 variables (removed 17) and now considering 318/379 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 54/71 places, 318/379 transitions.
RANDOM walk for 40000 steps (2366 resets) in 1088 ms. (36 steps per ms) remains 9/16 properties
BEST_FIRST walk for 40004 steps (206 resets) in 356 ms. (112 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (201 resets) in 244 ms. (163 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (189 resets) in 95 ms. (416 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (215 resets) in 98 ms. (404 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (182 resets) in 90 ms. (439 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40003 steps (217 resets) in 77 ms. (512 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (186 resets) in 57 ms. (689 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (209 resets) in 78 ms. (506 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (219 resets) in 77 ms. (512 steps per ms) remains 8/8 properties
// Phase 1: matrix 318 rows 54 cols
[2024-06-01 04:04:22] [INFO ] Computed 11 invariants in 4 ms
[2024-06-01 04:04:22] [INFO ] State equation strengthened by 157 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, 8 unsolved
At refinement iteration 1 (OVERLAPS) 33/46 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 7/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 317/370 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 156/220 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 2/372 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/372 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 222 constraints, problems are : Problem set: 0 solved, 8 unsolved in 674 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 54/54 constraints, ReadFeed: 157/157 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 33/46 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 7/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 317/370 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 156/220 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 2/372 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/372 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 230 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2310 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 54/54 constraints, ReadFeed: 157/157 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 3100ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1315 ms.
Support contains 13 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 318/318 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 52 transition count 316
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 52 transition count 314
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 15 place count 50 transition count 307
Applied a total of 15 rules in 51 ms. Remains 50 /54 variables (removed 4) and now considering 307/318 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 50/54 places, 307/318 transitions.
RANDOM walk for 40000 steps (2184 resets) in 498 ms. (80 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (192 resets) in 122 ms. (325 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (196 resets) in 70 ms. (563 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (199 resets) in 92 ms. (430 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (207 resets) in 77 ms. (512 steps per ms) remains 3/3 properties
// Phase 1: matrix 307 rows 50 cols
[2024-06-01 04:04:27] [INFO ] Computed 11 invariants in 2 ms
[2024-06-01 04:04:27] [INFO ] State equation strengthened by 150 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 18/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/49 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 306/355 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 149/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/357 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/357 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 357/357 variables, and 211 constraints, problems are : Problem set: 0 solved, 3 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 50/50 constraints, ReadFeed: 150/150 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 18/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/49 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 306/355 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 149/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/357 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 3/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/357 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 357/357 variables, and 214 constraints, problems are : Problem set: 0 solved, 3 unsolved in 554 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 50/50 constraints, ReadFeed: 150/150 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 907ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 687 ms.
Support contains 10 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 307/307 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 49 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 49 transition count 299
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 49 transition count 297
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 20 place count 47 transition count 283
Applied a total of 20 rules in 32 ms. Remains 47 /50 variables (removed 3) and now considering 283/307 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 47/50 places, 283/307 transitions.
RANDOM walk for 40000 steps (1255 resets) in 327 ms. (121 steps per ms) remains 1/3 properties
BEST_FIRST walk for 37576 steps (148 resets) in 38 ms. (963 steps per ms) remains 0/1 properties
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-07a-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 04:04:29] [INFO ] Flatten gal took : 56 ms
[2024-06-01 04:04:29] [INFO ] Flatten gal took : 46 ms
[2024-06-01 04:04:29] [INFO ] Input system was already deterministic with 379 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 379/379 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 68 transition count 355
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 68 transition count 355
Applied a total of 6 rules in 5 ms. Remains 68 /71 variables (removed 3) and now considering 355/379 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 68/71 places, 355/379 transitions.
[2024-06-01 04:04:29] [INFO ] Flatten gal took : 34 ms
[2024-06-01 04:04:29] [INFO ] Flatten gal took : 37 ms
[2024-06-01 04:04:29] [INFO ] Input system was already deterministic with 355 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 379/379 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 331
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 331
Applied a total of 12 rules in 8 ms. Remains 65 /71 variables (removed 6) and now considering 331/379 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 65/71 places, 331/379 transitions.
[2024-06-01 04:04:29] [INFO ] Flatten gal took : 33 ms
[2024-06-01 04:04:29] [INFO ] Flatten gal took : 34 ms
[2024-06-01 04:04:29] [INFO ] Input system was already deterministic with 331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 379/379 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 66 transition count 339
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 66 transition count 339
Applied a total of 10 rules in 4 ms. Remains 66 /71 variables (removed 5) and now considering 339/379 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 66/71 places, 339/379 transitions.
[2024-06-01 04:04:30] [INFO ] Flatten gal took : 29 ms
[2024-06-01 04:04:30] [INFO ] Flatten gal took : 32 ms
[2024-06-01 04:04:30] [INFO ] Input system was already deterministic with 339 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 379/379 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 71 transition count 371
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 63 transition count 371
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 63 transition count 370
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 62 transition count 370
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 24 place count 56 transition count 322
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 56 transition count 322
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 34 place count 54 transition count 320
Applied a total of 34 rules in 52 ms. Remains 54 /71 variables (removed 17) and now considering 320/379 (removed 59) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52 ms. Remains : 54/71 places, 320/379 transitions.
[2024-06-01 04:04:30] [INFO ] Flatten gal took : 31 ms
[2024-06-01 04:04:30] [INFO ] Flatten gal took : 32 ms
[2024-06-01 04:04:30] [INFO ] Input system was already deterministic with 320 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 379/379 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 66 transition count 339
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 66 transition count 339
Applied a total of 10 rules in 6 ms. Remains 66 /71 variables (removed 5) and now considering 339/379 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 66/71 places, 339/379 transitions.
[2024-06-01 04:04:30] [INFO ] Flatten gal took : 28 ms
[2024-06-01 04:04:30] [INFO ] Flatten gal took : 29 ms
[2024-06-01 04:04:30] [INFO ] Input system was already deterministic with 339 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 379/379 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 64 transition count 323
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 64 transition count 323
Applied a total of 14 rules in 4 ms. Remains 64 /71 variables (removed 7) and now considering 323/379 (removed 56) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 64/71 places, 323/379 transitions.
[2024-06-01 04:04:30] [INFO ] Flatten gal took : 25 ms
[2024-06-01 04:04:30] [INFO ] Flatten gal took : 26 ms
[2024-06-01 04:04:30] [INFO ] Input system was already deterministic with 323 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 379/379 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 66 transition count 339
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 66 transition count 339
Applied a total of 10 rules in 3 ms. Remains 66 /71 variables (removed 5) and now considering 339/379 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 66/71 places, 339/379 transitions.
[2024-06-01 04:04:30] [INFO ] Flatten gal took : 27 ms
[2024-06-01 04:04:30] [INFO ] Flatten gal took : 29 ms
[2024-06-01 04:04:30] [INFO ] Input system was already deterministic with 339 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 379/379 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 64 transition count 323
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 64 transition count 323
Applied a total of 14 rules in 4 ms. Remains 64 /71 variables (removed 7) and now considering 323/379 (removed 56) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 64/71 places, 323/379 transitions.
[2024-06-01 04:04:30] [INFO ] Flatten gal took : 26 ms
[2024-06-01 04:04:30] [INFO ] Flatten gal took : 27 ms
[2024-06-01 04:04:30] [INFO ] Input system was already deterministic with 323 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 379/379 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 66 transition count 339
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 66 transition count 339
Applied a total of 10 rules in 4 ms. Remains 66 /71 variables (removed 5) and now considering 339/379 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 66/71 places, 339/379 transitions.
[2024-06-01 04:04:31] [INFO ] Flatten gal took : 27 ms
[2024-06-01 04:04:31] [INFO ] Flatten gal took : 30 ms
[2024-06-01 04:04:31] [INFO ] Input system was already deterministic with 339 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 379/379 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 71 transition count 374
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 66 transition count 373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 65 transition count 373
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 65 transition count 372
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 64 transition count 372
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 21 place count 57 transition count 316
Iterating global reduction 3 with 7 rules applied. Total rules applied 28 place count 57 transition count 316
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 30 place count 56 transition count 315
Applied a total of 30 rules in 42 ms. Remains 56 /71 variables (removed 15) and now considering 315/379 (removed 64) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 56/71 places, 315/379 transitions.
[2024-06-01 04:04:31] [INFO ] Flatten gal took : 28 ms
[2024-06-01 04:04:31] [INFO ] Flatten gal took : 30 ms
[2024-06-01 04:04:31] [INFO ] Input system was already deterministic with 315 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 379/379 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 2 rules applied. Total rules applied 2 place count 71 transition count 377
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 69 transition count 376
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 68 transition count 376
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 6 place count 68 transition count 375
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 8 place count 67 transition count 375
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 14 place count 61 transition count 327
Iterating global reduction 3 with 6 rules applied. Total rules applied 20 place count 61 transition count 327
Applied a total of 20 rules in 56 ms. Remains 61 /71 variables (removed 10) and now considering 327/379 (removed 52) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 61/71 places, 327/379 transitions.
[2024-06-01 04:04:31] [INFO ] Flatten gal took : 22 ms
[2024-06-01 04:04:31] [INFO ] Flatten gal took : 23 ms
[2024-06-01 04:04:31] [INFO ] Input system was already deterministic with 327 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 379/379 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 66 transition count 339
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 66 transition count 339
Applied a total of 10 rules in 3 ms. Remains 66 /71 variables (removed 5) and now considering 339/379 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 66/71 places, 339/379 transitions.
[2024-06-01 04:04:31] [INFO ] Flatten gal took : 23 ms
[2024-06-01 04:04:31] [INFO ] Flatten gal took : 24 ms
[2024-06-01 04:04:31] [INFO ] Input system was already deterministic with 339 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 379/379 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 331
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 331
Applied a total of 12 rules in 4 ms. Remains 65 /71 variables (removed 6) and now considering 331/379 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 65/71 places, 331/379 transitions.
[2024-06-01 04:04:31] [INFO ] Flatten gal took : 21 ms
[2024-06-01 04:04:31] [INFO ] Flatten gal took : 23 ms
[2024-06-01 04:04:31] [INFO ] Input system was already deterministic with 331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 379/379 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 66 transition count 339
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 66 transition count 339
Applied a total of 10 rules in 3 ms. Remains 66 /71 variables (removed 5) and now considering 339/379 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 66/71 places, 339/379 transitions.
[2024-06-01 04:04:31] [INFO ] Flatten gal took : 21 ms
[2024-06-01 04:04:31] [INFO ] Flatten gal took : 22 ms
[2024-06-01 04:04:31] [INFO ] Input system was already deterministic with 339 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 379/379 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 68 transition count 355
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 68 transition count 355
Applied a total of 6 rules in 3 ms. Remains 68 /71 variables (removed 3) and now considering 355/379 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 68/71 places, 355/379 transitions.
[2024-06-01 04:04:31] [INFO ] Flatten gal took : 21 ms
[2024-06-01 04:04:31] [INFO ] Flatten gal took : 23 ms
[2024-06-01 04:04:31] [INFO ] Input system was already deterministic with 355 transitions.
[2024-06-01 04:04:31] [INFO ] Flatten gal took : 26 ms
[2024-06-01 04:04:32] [INFO ] Flatten gal took : 25 ms
[2024-06-01 04:04:32] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 9 ms.
[2024-06-01 04:04:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 71 places, 379 transitions and 3750 arcs took 12 ms.
Total runtime 22750 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : AutonomousCar-PT-07a-CTLFireability-2024-00
Could not compute solution for formula : AutonomousCar-PT-07a-CTLFireability-2024-01
Could not compute solution for formula : AutonomousCar-PT-07a-CTLFireability-2024-02
Could not compute solution for formula : AutonomousCar-PT-07a-CTLFireability-2024-03
Could not compute solution for formula : AutonomousCar-PT-07a-CTLFireability-2024-04
Could not compute solution for formula : AutonomousCar-PT-07a-CTLFireability-2024-05
Could not compute solution for formula : AutonomousCar-PT-07a-CTLFireability-2024-06
Could not compute solution for formula : AutonomousCar-PT-07a-CTLFireability-2024-07
Could not compute solution for formula : AutonomousCar-PT-07a-CTLFireability-2024-08
Could not compute solution for formula : AutonomousCar-PT-07a-CTLFireability-2024-09
Could not compute solution for formula : AutonomousCar-PT-07a-CTLFireability-2024-10
Could not compute solution for formula : AutonomousCar-PT-07a-CTLFireability-2023-12
Could not compute solution for formula : AutonomousCar-PT-07a-CTLFireability-2023-13
Could not compute solution for formula : AutonomousCar-PT-07a-CTLFireability-2023-14
Could not compute solution for formula : AutonomousCar-PT-07a-CTLFireability-2023-15

BK_STOP 1717214672498

--------------------
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
mcc2024
ctl formula name AutonomousCar-PT-07a-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/533/ctl_0_
ctl formula name AutonomousCar-PT-07a-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/533/ctl_1_
ctl formula name AutonomousCar-PT-07a-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/533/ctl_2_
ctl formula name AutonomousCar-PT-07a-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/533/ctl_3_
ctl formula name AutonomousCar-PT-07a-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/533/ctl_4_
ctl formula name AutonomousCar-PT-07a-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/533/ctl_5_
ctl formula name AutonomousCar-PT-07a-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/533/ctl_6_
ctl formula name AutonomousCar-PT-07a-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/533/ctl_7_
ctl formula name AutonomousCar-PT-07a-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/533/ctl_8_
ctl formula name AutonomousCar-PT-07a-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/533/ctl_9_
ctl formula name AutonomousCar-PT-07a-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/533/ctl_10_
ctl formula name AutonomousCar-PT-07a-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/533/ctl_11_
ctl formula name AutonomousCar-PT-07a-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/533/ctl_12_
ctl formula name AutonomousCar-PT-07a-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/533/ctl_13_
ctl formula name AutonomousCar-PT-07a-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/533/ctl_14_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-07a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is AutonomousCar-PT-07a, 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 r468-smll-171620167400314"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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