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-171620167300258.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-03b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167300258
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Apr 12 18:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 12 18:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 12 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 75K 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-03b-CTLFireability-2024-00
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-01
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-02
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-03
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-04
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-05
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-06
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-07
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-08
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-09
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-10
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-11
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2023-12
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2023-13
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2023-14
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717210447407

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-03b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 02:54:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 02:54:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 02:54:10] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2024-06-01 02:54:10] [INFO ] Transformed 190 places.
[2024-06-01 02:54:10] [INFO ] Transformed 273 transitions.
[2024-06-01 02:54:10] [INFO ] Found NUPN structural information;
[2024-06-01 02:54:10] [INFO ] Parsed PT model containing 190 places and 273 transitions and 1051 arcs in 437 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 36 ms.
Support contains 97 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 273/273 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 179 transition count 262
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 179 transition count 262
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 58 place count 179 transition count 226
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 61 place count 176 transition count 223
Iterating global reduction 1 with 3 rules applied. Total rules applied 64 place count 176 transition count 223
Applied a total of 64 rules in 96 ms. Remains 176 /190 variables (removed 14) and now considering 223/273 (removed 50) transitions.
// Phase 1: matrix 223 rows 176 cols
[2024-06-01 02:54:10] [INFO ] Computed 8 invariants in 33 ms
[2024-06-01 02:54:11] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-06-01 02:54:11] [INFO ] Invariant cache hit.
[2024-06-01 02:54:11] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 715 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2024-06-01 02:54:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-06-01 02:54:15] [INFO ] Deduced a trap composed of 19 places in 254 ms of which 44 ms to minimize.
[2024-06-01 02:54:15] [INFO ] Deduced a trap composed of 45 places in 242 ms of which 4 ms to minimize.
[2024-06-01 02:54:15] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 3 ms to minimize.
[2024-06-01 02:54:16] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 3 ms to minimize.
[2024-06-01 02:54:16] [INFO ] Deduced a trap composed of 53 places in 155 ms of which 3 ms to minimize.
[2024-06-01 02:54:16] [INFO ] Deduced a trap composed of 48 places in 139 ms of which 3 ms to minimize.
[2024-06-01 02:54:16] [INFO ] Deduced a trap composed of 44 places in 185 ms of which 3 ms to minimize.
[2024-06-01 02:54:16] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 4 ms to minimize.
[2024-06-01 02:54:16] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 3 ms to minimize.
[2024-06-01 02:54:17] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 3 ms to minimize.
[2024-06-01 02:54:17] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 3 ms to minimize.
[2024-06-01 02:54:17] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 2 ms to minimize.
[2024-06-01 02:54:17] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 2 ms to minimize.
[2024-06-01 02:54:17] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2024-06-01 02:54:17] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 2 ms to minimize.
[2024-06-01 02:54:17] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
[2024-06-01 02:54:17] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 2 ms to minimize.
[2024-06-01 02:54:18] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-06-01 02:54:18] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 4 ms to minimize.
[2024-06-01 02:54:18] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-06-01 02:54:18] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 2 ms to minimize.
[2024-06-01 02:54:18] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 3 ms to minimize.
[2024-06-01 02:54:18] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 2 ms to minimize.
[2024-06-01 02:54:19] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-06-01 02:54:19] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 3 ms to minimize.
[2024-06-01 02:54:19] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 3 ms to minimize.
[2024-06-01 02:54:19] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 14 ms to minimize.
[2024-06-01 02:54:19] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 2 ms to minimize.
[2024-06-01 02:54:19] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 2 ms to minimize.
[2024-06-01 02:54:20] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 2 ms to minimize.
[2024-06-01 02:54:20] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 2 ms to minimize.
[2024-06-01 02:54:20] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 2 ms to minimize.
[2024-06-01 02:54:20] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 2 ms to minimize.
[2024-06-01 02:54:20] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 3 ms to minimize.
[2024-06-01 02:54:21] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 4 ms to minimize.
[2024-06-01 02:54:21] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 4 ms to minimize.
[2024-06-01 02:54:21] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 3 ms to minimize.
[2024-06-01 02:54:21] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 2 ms to minimize.
[2024-06-01 02:54:21] [INFO ] Deduced a trap composed of 58 places in 137 ms of which 3 ms to minimize.
[2024-06-01 02:54:21] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-06-01 02:54:23] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 2 ms to minimize.
[2024-06-01 02:54:24] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 4 ms to minimize.
[2024-06-01 02:54:24] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2024-06-01 02:54:25] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 3 ms to minimize.
[2024-06-01 02:54:25] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 2 ms to minimize.
[2024-06-01 02:54:25] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 2 ms to minimize.
[2024-06-01 02:54:25] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 2 ms to minimize.
[2024-06-01 02:54:25] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-06-01 02:54:27] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-06-01 02:54:29] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 2 ms to minimize.
[2024-06-01 02:54:29] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD207 is UNSAT
At refinement iteration 8 (OVERLAPS) 223/399 variables, 176/235 constraints. Problems are: Problem set: 2 solved, 220 unsolved
[2024-06-01 02:54:33] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 2 ms to minimize.
[2024-06-01 02:54:33] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 3 ms to minimize.
[2024-06-01 02:54:33] [INFO ] Deduced a trap composed of 56 places in 88 ms of which 2 ms to minimize.
[2024-06-01 02:54:34] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 4/239 constraints. Problems are: Problem set: 2 solved, 220 unsolved
[2024-06-01 02:54:39] [INFO ] Deduced a trap composed of 47 places in 98 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 1/240 constraints. Problems are: Problem set: 2 solved, 220 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 399/399 variables, and 240 constraints, problems are : Problem set: 2 solved, 220 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 2 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 2/176 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 56/64 constraints. Problems are: Problem set: 2 solved, 220 unsolved
[2024-06-01 02:54:43] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 13 ms to minimize.
[2024-06-01 02:54:43] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 2 ms to minimize.
[2024-06-01 02:54:44] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 3/67 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/67 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 223/399 variables, 176/243 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 220/463 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 0/463 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 0/399 variables, 0/463 constraints. Problems are: Problem set: 2 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 399/399 variables, and 463 constraints, problems are : Problem set: 2 solved, 220 unsolved in 19292 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 220/222 constraints, Known Traps: 59/59 constraints]
After SMT, in 49623ms problems are : Problem set: 2 solved, 220 unsolved
Search for dead transitions found 2 dead transitions in 49679ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 176/190 places, 221/273 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 175 transition count 221
Applied a total of 1 rules in 16 ms. Remains 175 /176 variables (removed 1) and now considering 221/221 (removed 0) transitions.
// Phase 1: matrix 221 rows 175 cols
[2024-06-01 02:55:01] [INFO ] Computed 8 invariants in 5 ms
[2024-06-01 02:55:01] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-01 02:55:01] [INFO ] Invariant cache hit.
[2024-06-01 02:55:01] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 175/190 places, 221/273 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50812 ms. Remains : 175/190 places, 221/273 transitions.
Support contains 97 out of 175 places after structural reductions.
[2024-06-01 02:55:01] [INFO ] Flatten gal took : 69 ms
[2024-06-01 02:55:01] [INFO ] Flatten gal took : 45 ms
[2024-06-01 02:55:01] [INFO ] Input system was already deterministic with 221 transitions.
RANDOM walk for 40000 steps (34 resets) in 3867 ms. (10 steps per ms) remains 23/98 properties
BEST_FIRST walk for 4003 steps (11 resets) in 84 ms. (47 steps per ms) remains 20/23 properties
BEST_FIRST walk for 4003 steps (12 resets) in 39 ms. (100 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (15 resets) in 43 ms. (91 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (9 resets) in 57 ms. (69 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (12 resets) in 44 ms. (88 steps per ms) remains 18/20 properties
BEST_FIRST walk for 4003 steps (12 resets) in 45 ms. (87 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4003 steps (11 resets) in 33 ms. (117 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (12 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (11 resets) in 13 ms. (286 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4002 steps (9 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (13 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (14 resets) in 19 ms. (200 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4002 steps (11 resets) in 30 ms. (129 steps per ms) remains 13/15 properties
BEST_FIRST walk for 4003 steps (12 resets) in 26 ms. (148 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (15 resets) in 18 ms. (210 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (11 resets) in 15 ms. (250 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (10 resets) in 17 ms. (222 steps per ms) remains 13/13 properties
[2024-06-01 02:55:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp64 is UNSAT
At refinement iteration 1 (OVERLAPS) 137/175 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 11 unsolved
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp83 is UNSAT
At refinement iteration 3 (OVERLAPS) 221/396 variables, 175/183 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/183 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/396 variables, 0/183 constraints. Problems are: Problem set: 4 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 183 constraints, problems are : Problem set: 4 solved, 9 unsolved in 499 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 9 unsolved
Problem AtomicPropp59 is UNSAT
At refinement iteration 1 (OVERLAPS) 144/175 variables, 8/8 constraints. Problems are: Problem set: 5 solved, 8 unsolved
[2024-06-01 02:55:04] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 2 ms to minimize.
[2024-06-01 02:55:04] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 2/10 constraints. Problems are: Problem set: 5 solved, 8 unsolved
[2024-06-01 02:55:04] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 2 ms to minimize.
[2024-06-01 02:55:04] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-06-01 02:55:04] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 3 ms to minimize.
[2024-06-01 02:55:04] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-06-01 02:55:04] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 5/15 constraints. Problems are: Problem set: 5 solved, 8 unsolved
[2024-06-01 02:55:04] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 1/16 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/16 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 221/396 variables, 175/191 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 8/199 constraints. Problems are: Problem set: 5 solved, 8 unsolved
[2024-06-01 02:55:05] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 1/200 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 0/200 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/396 variables, 0/200 constraints. Problems are: Problem set: 5 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 200 constraints, problems are : Problem set: 5 solved, 8 unsolved in 2031 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 8/13 constraints, Known Traps: 9/9 constraints]
After SMT, in 2556ms problems are : Problem set: 5 solved, 8 unsolved
Parikh walk visited 2 properties in 3685 ms.
Support contains 22 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 221/221 transitions.
Graph (trivial) has 132 edges and 175 vertex of which 4 / 175 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 399 edges and 173 vertex of which 169 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 58 rules applied. Total rules applied 60 place count 169 transition count 157
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 66 rules applied. Total rules applied 126 place count 112 transition count 148
Reduce places removed 4 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 11 rules applied. Total rules applied 137 place count 108 transition count 141
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 145 place count 101 transition count 140
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 145 place count 101 transition count 131
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 163 place count 92 transition count 131
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 170 place count 85 transition count 124
Iterating global reduction 4 with 7 rules applied. Total rules applied 177 place count 85 transition count 124
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 177 place count 85 transition count 123
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 179 place count 84 transition count 123
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 180 place count 83 transition count 120
Iterating global reduction 4 with 1 rules applied. Total rules applied 181 place count 83 transition count 120
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 225 place count 61 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 226 place count 61 transition count 96
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 227 place count 60 transition count 95
Iterating global reduction 5 with 1 rules applied. Total rules applied 228 place count 60 transition count 95
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 5 with 2 rules applied. Total rules applied 230 place count 59 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 234 place count 57 transition count 119
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 238 place count 57 transition count 115
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 242 place count 53 transition count 115
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 243 place count 53 transition count 114
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 244 place count 52 transition count 113
Applied a total of 244 rules in 106 ms. Remains 52 /175 variables (removed 123) and now considering 113/221 (removed 108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 52/175 places, 113/221 transitions.
RANDOM walk for 40000 steps (2176 resets) in 418 ms. (95 steps per ms) remains 0/6 properties
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2024-06-01 02:55:09] [INFO ] Flatten gal took : 19 ms
[2024-06-01 02:55:09] [INFO ] Flatten gal took : 20 ms
[2024-06-01 02:55:10] [INFO ] Input system was already deterministic with 221 transitions.
Computed a total of 38 stabilizing places and 38 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 221/221 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 157 transition count 203
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 157 transition count 203
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 154 transition count 200
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 154 transition count 200
Applied a total of 42 rules in 23 ms. Remains 154 /175 variables (removed 21) and now considering 200/221 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 154/175 places, 200/221 transitions.
[2024-06-01 02:55:10] [INFO ] Flatten gal took : 15 ms
[2024-06-01 02:55:10] [INFO ] Flatten gal took : 15 ms
[2024-06-01 02:55:10] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 221/221 transitions.
Graph (trivial) has 152 edges and 175 vertex of which 4 / 175 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 173 transition count 146
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 90 rules applied. Total rules applied 164 place count 100 transition count 129
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 11 rules applied. Total rules applied 175 place count 91 transition count 127
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 177 place count 89 transition count 127
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 177 place count 89 transition count 119
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 193 place count 81 transition count 119
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 200 place count 74 transition count 112
Iterating global reduction 4 with 7 rules applied. Total rules applied 207 place count 74 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 207 place count 74 transition count 111
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 209 place count 73 transition count 111
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 241 place count 57 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 242 place count 57 transition count 94
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 245 place count 54 transition count 85
Iterating global reduction 5 with 3 rules applied. Total rules applied 248 place count 54 transition count 85
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 5 with 2 rules applied. Total rules applied 250 place count 53 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 251 place count 53 transition count 83
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 253 place count 53 transition count 83
Applied a total of 253 rules in 38 ms. Remains 53 /175 variables (removed 122) and now considering 83/221 (removed 138) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 53/175 places, 83/221 transitions.
[2024-06-01 02:55:10] [INFO ] Flatten gal took : 9 ms
[2024-06-01 02:55:10] [INFO ] Flatten gal took : 10 ms
[2024-06-01 02:55:10] [INFO ] Input system was already deterministic with 83 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 221/221 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 156 transition count 202
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 156 transition count 202
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 153 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 153 transition count 199
Applied a total of 44 rules in 10 ms. Remains 153 /175 variables (removed 22) and now considering 199/221 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 153/175 places, 199/221 transitions.
[2024-06-01 02:55:10] [INFO ] Flatten gal took : 13 ms
[2024-06-01 02:55:10] [INFO ] Flatten gal took : 18 ms
[2024-06-01 02:55:10] [INFO ] Input system was already deterministic with 199 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 221/221 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 156 transition count 202
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 156 transition count 202
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 153 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 153 transition count 199
Applied a total of 44 rules in 10 ms. Remains 153 /175 variables (removed 22) and now considering 199/221 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 153/175 places, 199/221 transitions.
[2024-06-01 02:55:10] [INFO ] Flatten gal took : 14 ms
[2024-06-01 02:55:10] [INFO ] Flatten gal took : 15 ms
[2024-06-01 02:55:10] [INFO ] Input system was already deterministic with 199 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 221/221 transitions.
Graph (trivial) has 164 edges and 175 vertex of which 4 / 175 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 172 transition count 140
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 97 rules applied. Total rules applied 176 place count 94 transition count 121
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 187 place count 83 transition count 121
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 187 place count 83 transition count 116
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 197 place count 78 transition count 116
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 207 place count 68 transition count 106
Iterating global reduction 3 with 10 rules applied. Total rules applied 217 place count 68 transition count 106
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 217 place count 68 transition count 104
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 221 place count 66 transition count 104
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 224 place count 63 transition count 95
Iterating global reduction 3 with 3 rules applied. Total rules applied 227 place count 63 transition count 95
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 3 with 6 rules applied. Total rules applied 233 place count 63 transition count 89
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 236 place count 60 transition count 89
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 274 place count 41 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 275 place count 41 transition count 69
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 279 place count 37 transition count 56
Iterating global reduction 6 with 4 rules applied. Total rules applied 283 place count 37 transition count 56
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 6 with 2 rules applied. Total rules applied 285 place count 36 transition count 55
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 286 place count 36 transition count 54
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 288 place count 34 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 289 place count 33 transition count 52
Applied a total of 289 rules in 32 ms. Remains 33 /175 variables (removed 142) and now considering 52/221 (removed 169) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 33/175 places, 52/221 transitions.
[2024-06-01 02:55:10] [INFO ] Flatten gal took : 5 ms
[2024-06-01 02:55:10] [INFO ] Flatten gal took : 5 ms
[2024-06-01 02:55:10] [INFO ] Input system was already deterministic with 52 transitions.
RANDOM walk for 69 steps (4 resets) in 4 ms. (13 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-03b-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 221/221 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 159 transition count 205
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 159 transition count 205
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 156 transition count 202
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 156 transition count 202
Applied a total of 38 rules in 9 ms. Remains 156 /175 variables (removed 19) and now considering 202/221 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 156/175 places, 202/221 transitions.
[2024-06-01 02:55:10] [INFO ] Flatten gal took : 13 ms
[2024-06-01 02:55:10] [INFO ] Flatten gal took : 15 ms
[2024-06-01 02:55:10] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 221/221 transitions.
Graph (trivial) has 155 edges and 175 vertex of which 4 / 175 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 75 place count 172 transition count 144
Reduce places removed 74 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 92 rules applied. Total rules applied 167 place count 98 transition count 126
Reduce places removed 10 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 12 rules applied. Total rules applied 179 place count 88 transition count 124
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 183 place count 86 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 184 place count 85 transition count 122
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 184 place count 85 transition count 114
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 200 place count 77 transition count 114
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 209 place count 68 transition count 105
Iterating global reduction 5 with 9 rules applied. Total rules applied 218 place count 68 transition count 105
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 218 place count 68 transition count 104
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 220 place count 67 transition count 104
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 223 place count 64 transition count 95
Iterating global reduction 5 with 3 rules applied. Total rules applied 226 place count 64 transition count 95
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 5 with 5 rules applied. Total rules applied 231 place count 64 transition count 90
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 233 place count 62 transition count 90
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 271 place count 43 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 272 place count 43 transition count 70
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 274 place count 41 transition count 65
Iterating global reduction 8 with 2 rules applied. Total rules applied 276 place count 41 transition count 65
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 8 with 2 rules applied. Total rules applied 278 place count 40 transition count 64
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 279 place count 40 transition count 63
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 281 place count 38 transition count 61
Applied a total of 281 rules in 32 ms. Remains 38 /175 variables (removed 137) and now considering 61/221 (removed 160) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 38/175 places, 61/221 transitions.
[2024-06-01 02:55:10] [INFO ] Flatten gal took : 6 ms
[2024-06-01 02:55:10] [INFO ] Flatten gal took : 6 ms
[2024-06-01 02:55:10] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 221/221 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 158 transition count 204
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 158 transition count 204
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 155 transition count 201
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 155 transition count 201
Applied a total of 40 rules in 9 ms. Remains 155 /175 variables (removed 20) and now considering 201/221 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 155/175 places, 201/221 transitions.
[2024-06-01 02:55:10] [INFO ] Flatten gal took : 12 ms
[2024-06-01 02:55:10] [INFO ] Flatten gal took : 13 ms
[2024-06-01 02:55:10] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 221/221 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 157 transition count 203
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 157 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 156 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 156 transition count 202
Applied a total of 38 rules in 8 ms. Remains 156 /175 variables (removed 19) and now considering 202/221 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 156/175 places, 202/221 transitions.
[2024-06-01 02:55:10] [INFO ] Flatten gal took : 11 ms
[2024-06-01 02:55:10] [INFO ] Flatten gal took : 11 ms
[2024-06-01 02:55:10] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 221/221 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 161 transition count 207
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 161 transition count 207
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 159 transition count 205
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 159 transition count 205
Applied a total of 32 rules in 8 ms. Remains 159 /175 variables (removed 16) and now considering 205/221 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 159/175 places, 205/221 transitions.
[2024-06-01 02:55:10] [INFO ] Flatten gal took : 16 ms
[2024-06-01 02:55:10] [INFO ] Flatten gal took : 12 ms
[2024-06-01 02:55:10] [INFO ] Input system was already deterministic with 205 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 221/221 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 158 transition count 204
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 158 transition count 204
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 155 transition count 201
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 155 transition count 201
Applied a total of 40 rules in 8 ms. Remains 155 /175 variables (removed 20) and now considering 201/221 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 155/175 places, 201/221 transitions.
[2024-06-01 02:55:10] [INFO ] Flatten gal took : 12 ms
[2024-06-01 02:55:10] [INFO ] Flatten gal took : 11 ms
[2024-06-01 02:55:10] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 221/221 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 156 transition count 202
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 156 transition count 202
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 153 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 153 transition count 199
Applied a total of 44 rules in 9 ms. Remains 153 /175 variables (removed 22) and now considering 199/221 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 153/175 places, 199/221 transitions.
[2024-06-01 02:55:10] [INFO ] Flatten gal took : 9 ms
[2024-06-01 02:55:10] [INFO ] Flatten gal took : 10 ms
[2024-06-01 02:55:10] [INFO ] Input system was already deterministic with 199 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 221/221 transitions.
Graph (trivial) has 144 edges and 175 vertex of which 4 / 175 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 172 transition count 150
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 82 rules applied. Total rules applied 151 place count 104 transition count 136
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 159 place count 97 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 160 place count 96 transition count 135
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 160 place count 96 transition count 122
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 186 place count 83 transition count 122
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 195 place count 74 transition count 113
Iterating global reduction 4 with 9 rules applied. Total rules applied 204 place count 74 transition count 113
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 206 place count 72 transition count 107
Iterating global reduction 4 with 2 rules applied. Total rules applied 208 place count 72 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 210 place count 72 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 211 place count 71 transition count 105
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 243 place count 55 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 244 place count 55 transition count 88
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 247 place count 52 transition count 79
Iterating global reduction 7 with 3 rules applied. Total rules applied 250 place count 52 transition count 79
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 7 with 2 rules applied. Total rules applied 252 place count 51 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 254 place count 51 transition count 76
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 7 with 1 rules applied. Total rules applied 255 place count 51 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 256 place count 50 transition count 75
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 258 place count 48 transition count 73
Applied a total of 258 rules in 31 ms. Remains 48 /175 variables (removed 127) and now considering 73/221 (removed 148) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 48/175 places, 73/221 transitions.
[2024-06-01 02:55:10] [INFO ] Flatten gal took : 5 ms
[2024-06-01 02:55:10] [INFO ] Flatten gal took : 5 ms
[2024-06-01 02:55:10] [INFO ] Input system was already deterministic with 73 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 221/221 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 156 transition count 202
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 156 transition count 202
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 153 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 153 transition count 199
Applied a total of 44 rules in 9 ms. Remains 153 /175 variables (removed 22) and now considering 199/221 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 153/175 places, 199/221 transitions.
[2024-06-01 02:55:10] [INFO ] Flatten gal took : 9 ms
[2024-06-01 02:55:10] [INFO ] Flatten gal took : 11 ms
[2024-06-01 02:55:10] [INFO ] Input system was already deterministic with 199 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 221/221 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 158 transition count 204
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 158 transition count 204
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 155 transition count 201
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 155 transition count 201
Applied a total of 40 rules in 9 ms. Remains 155 /175 variables (removed 20) and now considering 201/221 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 155/175 places, 201/221 transitions.
[2024-06-01 02:55:10] [INFO ] Flatten gal took : 10 ms
[2024-06-01 02:55:10] [INFO ] Flatten gal took : 9 ms
[2024-06-01 02:55:11] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 221/221 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 158 transition count 204
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 158 transition count 204
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 156 transition count 202
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 156 transition count 202
Applied a total of 38 rules in 7 ms. Remains 156 /175 variables (removed 19) and now considering 202/221 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 156/175 places, 202/221 transitions.
[2024-06-01 02:55:11] [INFO ] Flatten gal took : 8 ms
[2024-06-01 02:55:11] [INFO ] Flatten gal took : 10 ms
[2024-06-01 02:55:11] [INFO ] Input system was already deterministic with 202 transitions.
[2024-06-01 02:55:11] [INFO ] Flatten gal took : 12 ms
[2024-06-01 02:55:11] [INFO ] Flatten gal took : 11 ms
[2024-06-01 02:55:11] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2024-06-01 02:55:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 175 places, 221 transitions and 729 arcs took 6 ms.
Total runtime 61265 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-03b-CTLFireability-2024-00
Could not compute solution for formula : AutonomousCar-PT-03b-CTLFireability-2024-01
Could not compute solution for formula : AutonomousCar-PT-03b-CTLFireability-2024-02
Could not compute solution for formula : AutonomousCar-PT-03b-CTLFireability-2024-03
Could not compute solution for formula : AutonomousCar-PT-03b-CTLFireability-2024-05
Could not compute solution for formula : AutonomousCar-PT-03b-CTLFireability-2024-06
Could not compute solution for formula : AutonomousCar-PT-03b-CTLFireability-2024-07
Could not compute solution for formula : AutonomousCar-PT-03b-CTLFireability-2024-08
Could not compute solution for formula : AutonomousCar-PT-03b-CTLFireability-2024-09
Could not compute solution for formula : AutonomousCar-PT-03b-CTLFireability-2024-10
Could not compute solution for formula : AutonomousCar-PT-03b-CTLFireability-2024-11
Could not compute solution for formula : AutonomousCar-PT-03b-CTLFireability-2023-12
Could not compute solution for formula : AutonomousCar-PT-03b-CTLFireability-2023-13
Could not compute solution for formula : AutonomousCar-PT-03b-CTLFireability-2023-14
Could not compute solution for formula : AutonomousCar-PT-03b-CTLFireability-2023-15

BK_STOP 1717210511642

--------------------
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-03b-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/738/ctl_0_
ctl formula name AutonomousCar-PT-03b-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/738/ctl_1_
ctl formula name AutonomousCar-PT-03b-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/738/ctl_2_
ctl formula name AutonomousCar-PT-03b-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/738/ctl_3_
ctl formula name AutonomousCar-PT-03b-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/738/ctl_4_
ctl formula name AutonomousCar-PT-03b-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/738/ctl_5_
ctl formula name AutonomousCar-PT-03b-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/738/ctl_6_
ctl formula name AutonomousCar-PT-03b-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/738/ctl_7_
ctl formula name AutonomousCar-PT-03b-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/738/ctl_8_
ctl formula name AutonomousCar-PT-03b-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/738/ctl_9_
ctl formula name AutonomousCar-PT-03b-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/738/ctl_10_
ctl formula name AutonomousCar-PT-03b-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/738/ctl_11_
ctl formula name AutonomousCar-PT-03b-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/738/ctl_12_
ctl formula name AutonomousCar-PT-03b-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/738/ctl_13_
ctl formula name AutonomousCar-PT-03b-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/738/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-03b"
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-03b, 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-171620167300258"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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