About the Execution of ITS-Tools for AutonomousCar-PT-01b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 675.512 | 148428.00 | 192806.00 | 651.20 | FFTTFTTFFFTTTTTF | 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.r026-smll-171620167300226.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 itstools
Input is AutonomousCar-PT-01b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167300226
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.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 15K Apr 12 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 12 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 12 18:03 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 31K 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-01b-CTLFireability-2024-00
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2024-01
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2024-02
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2024-03
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2024-04
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2024-05
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2024-06
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2024-07
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2024-08
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2024-09
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2024-10
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2024-11
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2023-12
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2023-13
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2023-14
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716319736326
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-01b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 19:28:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 19:28:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:28:58] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-05-21 19:28:58] [INFO ] Transformed 119 places.
[2024-05-21 19:28:58] [INFO ] Transformed 132 transitions.
[2024-05-21 19:28:58] [INFO ] Found NUPN structural information;
[2024-05-21 19:28:58] [INFO ] Parsed PT model containing 119 places and 132 transitions and 339 arcs in 253 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 23 ms.
Support contains 80 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 132/132 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 117 transition count 130
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 117 transition count 130
Applied a total of 4 rules in 36 ms. Remains 117 /119 variables (removed 2) and now considering 130/132 (removed 2) transitions.
// Phase 1: matrix 130 rows 117 cols
[2024-05-21 19:28:59] [INFO ] Computed 6 invariants in 15 ms
[2024-05-21 19:28:59] [INFO ] Implicit Places using invariants in 462 ms returned []
[2024-05-21 19:28:59] [INFO ] Invariant cache hit.
[2024-05-21 19:28:59] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 808 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2024-05-21 19:29:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-21 19:29:01] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 22 ms to minimize.
[2024-05-21 19:29:01] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-21 19:29:02] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 2 ms to minimize.
[2024-05-21 19:29:02] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 2 ms to minimize.
[2024-05-21 19:29:02] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-05-21 19:29:02] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-21 19:29:02] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 2 ms to minimize.
[2024-05-21 19:29:02] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
[2024-05-21 19:29:02] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 2 ms to minimize.
[2024-05-21 19:29:02] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:29:02] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 2 ms to minimize.
[2024-05-21 19:29:02] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 2 ms to minimize.
[2024-05-21 19:29:03] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 2 ms to minimize.
[2024-05-21 19:29:03] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-21 19:29:03] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 2 ms to minimize.
[2024-05-21 19:29:03] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 2 ms to minimize.
[2024-05-21 19:29:03] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 2 ms to minimize.
[2024-05-21 19:29:03] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-21 19:29:04] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 2 ms to minimize.
[2024-05-21 19:29:04] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD121 is UNSAT
At refinement iteration 6 (OVERLAPS) 130/247 variables, 117/143 constraints. Problems are: Problem set: 2 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/143 constraints. Problems are: Problem set: 2 solved, 127 unsolved
At refinement iteration 8 (OVERLAPS) 0/247 variables, 0/143 constraints. Problems are: Problem set: 2 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 143 constraints, problems are : Problem set: 2 solved, 127 unsolved in 8314 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 2 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 2/117 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 20/26 constraints. Problems are: Problem set: 2 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/26 constraints. Problems are: Problem set: 2 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 130/247 variables, 117/143 constraints. Problems are: Problem set: 2 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 127/270 constraints. Problems are: Problem set: 2 solved, 127 unsolved
[2024-05-21 19:29:10] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2024-05-21 19:29:10] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 2/272 constraints. Problems are: Problem set: 2 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/272 constraints. Problems are: Problem set: 2 solved, 127 unsolved
[2024-05-21 19:29:13] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/247 variables, 1/273 constraints. Problems are: Problem set: 2 solved, 127 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 0/273 constraints. Problems are: Problem set: 2 solved, 127 unsolved
At refinement iteration 10 (OVERLAPS) 0/247 variables, 0/273 constraints. Problems are: Problem set: 2 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 273 constraints, problems are : Problem set: 2 solved, 127 unsolved in 8642 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 127/129 constraints, Known Traps: 23/23 constraints]
After SMT, in 17184ms problems are : Problem set: 2 solved, 127 unsolved
Search for dead transitions found 2 dead transitions in 17244ms
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 : 117/119 places, 128/132 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 116 transition count 128
Applied a total of 1 rules in 8 ms. Remains 116 /117 variables (removed 1) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 116 cols
[2024-05-21 19:29:17] [INFO ] Computed 6 invariants in 4 ms
[2024-05-21 19:29:17] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 19:29:17] [INFO ] Invariant cache hit.
[2024-05-21 19:29:17] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 116/119 places, 128/132 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 18462 ms. Remains : 116/119 places, 128/132 transitions.
Support contains 80 out of 116 places after structural reductions.
[2024-05-21 19:29:18] [INFO ] Flatten gal took : 48 ms
[2024-05-21 19:29:18] [INFO ] Flatten gal took : 19 ms
[2024-05-21 19:29:18] [INFO ] Input system was already deterministic with 128 transitions.
Reduction of identical properties reduced properties to check from 79 to 78
RANDOM walk for 40000 steps (12 resets) in 2076 ms. (19 steps per ms) remains 10/78 properties
BEST_FIRST walk for 40000 steps (32 resets) in 1231 ms. (32 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (22 resets) in 288 ms. (138 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (10 resets) in 112 ms. (354 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (28 resets) in 114 ms. (347 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40000 steps (15 resets) in 236 ms. (168 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (14 resets) in 273 ms. (145 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40000 steps (14 resets) in 208 ms. (191 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (15 resets) in 322 ms. (123 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (41 resets) in 367 ms. (108 steps per ms) remains 7/7 properties
[2024-05-21 19:29:20] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp61 is UNSAT
At refinement iteration 1 (OVERLAPS) 95/116 variables, 6/6 constraints. Problems are: Problem set: 5 solved, 2 unsolved
[2024-05-21 19:29:20] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 2 ms to minimize.
Problem AtomicPropp62 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 1/7 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/7 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 128/244 variables, 116/123 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 0/123 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/244 variables, 0/123 constraints. Problems are: Problem set: 6 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/244 variables, and 123 constraints, problems are : Problem set: 6 solved, 1 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 6 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 1 unsolved
Problem AtomicPropp10 is UNSAT
After SMT solving in domain Int declared 37/244 variables, and 1 constraints, problems are : Problem set: 7 solved, 0 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/6 constraints, State Equation: 0/116 constraints, PredecessorRefiner: 0/7 constraints, Known Traps: 0/1 constraints]
After SMT, in 416ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
[2024-05-21 19:29:20] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-21 19:29:20] [INFO ] Flatten gal took : 13 ms
FORMULA AutonomousCar-PT-01b-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 19:29:20] [INFO ] Flatten gal took : 12 ms
[2024-05-21 19:29:20] [INFO ] Input system was already deterministic with 128 transitions.
Support contains 71 out of 116 places (down from 74) after GAL structural reductions.
Computed a total of 28 stabilizing places and 28 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 128/128 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 98 transition count 110
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 98 transition count 110
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 98 transition count 106
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 95 transition count 103
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 95 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 94 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 94 transition count 102
Applied a total of 48 rules in 30 ms. Remains 94 /116 variables (removed 22) and now considering 102/128 (removed 26) transitions.
// Phase 1: matrix 102 rows 94 cols
[2024-05-21 19:29:20] [INFO ] Computed 6 invariants in 3 ms
[2024-05-21 19:29:20] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 19:29:20] [INFO ] Invariant cache hit.
[2024-05-21 19:29:20] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-05-21 19:29:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-21 19:29:23] [INFO ] Deduced a trap composed of 14 places in 1686 ms of which 2 ms to minimize.
[2024-05-21 19:29:23] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-05-21 19:29:23] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-05-21 19:29:23] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 2 ms to minimize.
[2024-05-21 19:29:23] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-05-21 19:29:23] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 2 ms to minimize.
[2024-05-21 19:29:24] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 2 ms to minimize.
[2024-05-21 19:29:24] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
[2024-05-21 19:29:24] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 2 ms to minimize.
[2024-05-21 19:29:24] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 2 ms to minimize.
[2024-05-21 19:29:24] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 5 ms to minimize.
[2024-05-21 19:29:24] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-05-21 19:29:24] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-21 19:29:24] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-21 19:29:24] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 19:29:24] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-21 19:29:24] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-21 19:29:24] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-21 19:29:25] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 119 constraints, problems are : Problem set: 0 solved, 101 unsolved in 5958 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-21 19:29:27] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/120 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 101/221 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-21 19:29:28] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 222 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3599 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 21/21 constraints]
After SMT, in 9591ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 9594ms
Starting structural reductions in LTL mode, iteration 1 : 94/116 places, 102/128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9867 ms. Remains : 94/116 places, 102/128 transitions.
[2024-05-21 19:29:30] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:29:30] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:29:30] [INFO ] Input system was already deterministic with 102 transitions.
[2024-05-21 19:29:30] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:29:30] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:29:30] [INFO ] Time to serialize gal into /tmp/CTLFireability9758778999927517847.gal : 5 ms
[2024-05-21 19:29:30] [INFO ] Time to serialize properties into /tmp/CTLFireability10970822548384410113.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9758778999927517847.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10970822548384410113.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,65988,0.058963,4676,2,1074,5,4446,6,0,480,3733,0
Converting to forward existential form...Done !
original formula: !(A(!(EG(!((((p6==1)&&(p9==1))&&((p37==1)&&(p76==1)))))) U ((!(AG((p56!=1))) + AX((p91==1))) + AX(A((p109==1) U (p106==1))))))
=> equivalent forward existential formula: (([(FwdU(EY(((FwdU(Init,!(((!(!(E(TRUE U !((p56!=1))))) + !(EX(!((p91==1))))) + !(EX(!(!((E(!((p106==1)) U (!((p...852
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t57, t58, t61, t62, t64, t77, t84, t86, t91, t99, In...251
(forward)formula 0,0,6.11392,143336,1,0,1420,970031,264,654,2847,879147,1592
FORMULA AutonomousCar-PT-01b-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 128/128 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 101 transition count 113
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 101 transition count 113
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 99 transition count 111
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 99 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 98 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 98 transition count 110
Applied a total of 36 rules in 22 ms. Remains 98 /116 variables (removed 18) and now considering 110/128 (removed 18) transitions.
// Phase 1: matrix 110 rows 98 cols
[2024-05-21 19:29:36] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 19:29:36] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 19:29:36] [INFO ] Invariant cache hit.
[2024-05-21 19:29:36] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2024-05-21 19:29:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-21 19:29:37] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 4 ms to minimize.
[2024-05-21 19:29:37] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2024-05-21 19:29:38] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-21 19:29:38] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 4 ms to minimize.
[2024-05-21 19:29:38] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-21 19:29:38] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 2 ms to minimize.
[2024-05-21 19:29:38] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-21 19:29:38] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 2 ms to minimize.
[2024-05-21 19:29:38] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 2 ms to minimize.
[2024-05-21 19:29:38] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
[2024-05-21 19:29:38] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-21 19:29:38] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 4 ms to minimize.
[2024-05-21 19:29:38] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-21 19:29:39] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-21 19:29:39] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 2 ms to minimize.
[2024-05-21 19:29:39] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 2 ms to minimize.
[2024-05-21 19:29:39] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-21 19:29:39] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-21 19:29:39] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-21 19:29:40] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 2 ms to minimize.
[2024-05-21 19:29:40] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/208 variables, 98/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/208 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 125 constraints, problems are : Problem set: 0 solved, 109 unsolved in 5963 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/208 variables, 98/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 109/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 234 constraints, problems are : Problem set: 0 solved, 109 unsolved in 2863 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 21/21 constraints]
After SMT, in 8847ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 8849ms
Starting structural reductions in LTL mode, iteration 1 : 98/116 places, 110/128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9024 ms. Remains : 98/116 places, 110/128 transitions.
[2024-05-21 19:29:45] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:29:45] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:29:45] [INFO ] Input system was already deterministic with 110 transitions.
[2024-05-21 19:29:45] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:29:45] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:29:45] [INFO ] Time to serialize gal into /tmp/CTLFireability9112631231951899285.gal : 4 ms
[2024-05-21 19:29:45] [INFO ] Time to serialize properties into /tmp/CTLFireability14666572155274140675.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9112631231951899285.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14666572155274140675.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,74787,0.070826,4560,2,1107,5,4708,6,0,504,3794,0
Converting to forward existential form...Done !
original formula: AG((((EX(((AX((p66==0)) + (p86==1)) + ((p52==0)&&(p4==0)))) + (p6==0)) + ((p9==0)||(p40==0))) + (p76==0)))
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * !((p76==0))) * !(((p9==0)||(p40==0)))) * !((p6==0))) * !(EX(((!(EX(!((p66==0)))) + (p86==...193
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t33, t36, t38, t39, t53, t59, t60, t63, t64, t66, t79, t86, t88, t89, t97...261
(forward)formula 0,1,0.68343,17556,1,0,189,68381,245,111,2882,61305,236
FORMULA AutonomousCar-PT-01b-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 128/128 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 100 transition count 112
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 100 transition count 112
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 100 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 98 transition count 106
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 98 transition count 106
Applied a total of 40 rules in 8 ms. Remains 98 /116 variables (removed 18) and now considering 106/128 (removed 22) transitions.
// Phase 1: matrix 106 rows 98 cols
[2024-05-21 19:29:46] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 19:29:46] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 19:29:46] [INFO ] Invariant cache hit.
[2024-05-21 19:29:46] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-05-21 19:29:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-21 19:29:47] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 2 ms to minimize.
[2024-05-21 19:29:47] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 3 ms to minimize.
[2024-05-21 19:29:47] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 2 ms to minimize.
[2024-05-21 19:29:47] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 2 ms to minimize.
[2024-05-21 19:29:47] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2024-05-21 19:29:48] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2024-05-21 19:29:48] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
[2024-05-21 19:29:48] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-05-21 19:29:48] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-21 19:29:48] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 2 ms to minimize.
[2024-05-21 19:29:48] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-21 19:29:48] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-21 19:29:48] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 2 ms to minimize.
[2024-05-21 19:29:48] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-21 19:29:48] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-21 19:29:48] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-21 19:29:48] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-05-21 19:29:48] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 2 ms to minimize.
[2024-05-21 19:29:48] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 2 ms to minimize.
[2024-05-21 19:29:48] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-21 19:29:49] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-21 19:29:49] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 2 ms to minimize.
[2024-05-21 19:29:49] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-21 19:29:49] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-21 19:29:50] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-21 19:29:50] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-21 19:29:50] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-21 19:29:51] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 106/204 variables, 98/132 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (OVERLAPS) 0/204 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 132 constraints, problems are : Problem set: 0 solved, 105 unsolved in 7002 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/204 variables, 98/132 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 105/237 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/204 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 237 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3511 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 28/28 constraints]
After SMT, in 10545ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 10548ms
Starting structural reductions in LTL mode, iteration 1 : 98/116 places, 106/128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10737 ms. Remains : 98/116 places, 106/128 transitions.
[2024-05-21 19:29:57] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:29:57] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:29:57] [INFO ] Input system was already deterministic with 106 transitions.
[2024-05-21 19:29:57] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:29:57] [INFO ] Flatten gal took : 23 ms
[2024-05-21 19:29:57] [INFO ] Time to serialize gal into /tmp/CTLFireability4452476909799160824.gal : 3 ms
[2024-05-21 19:29:57] [INFO ] Time to serialize properties into /tmp/CTLFireability3921649640997401119.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4452476909799160824.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3921649640997401119.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,69768,0.044895,4756,2,1164,5,4779,6,0,500,4057,0
Converting to forward existential form...Done !
original formula: AX(((EX((EX((p104==1)) * ((p5==1)||(p91==1)))) + AX(AF((p99==1)))) + AG(E((p62==1) U (p79==1)))))
=> equivalent forward existential formula: [(FwdU((EY(Init) * !((EX((EX((p104==1)) * ((p5==1)||(p91==1)))) + !(EX(!(!(EG(!((p99==1)))))))))),TRUE) * !(E((p...184
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t25, t34, t38, t39, t59, t60, t63, t64, t66, t79, t86, t88, t89, t90, t94, t10...257
(forward)formula 0,0,4.25646,114416,1,0,786,747818,243,379,2939,674572,952
FORMULA AutonomousCar-PT-01b-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 128/128 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 102 transition count 114
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 102 transition count 114
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 102 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 101 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 101 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 100 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 100 transition count 108
Applied a total of 36 rules in 17 ms. Remains 100 /116 variables (removed 16) and now considering 108/128 (removed 20) transitions.
// Phase 1: matrix 108 rows 100 cols
[2024-05-21 19:30:01] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 19:30:01] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-21 19:30:01] [INFO ] Invariant cache hit.
[2024-05-21 19:30:01] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2024-05-21 19:30:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-21 19:30:03] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 4 ms to minimize.
[2024-05-21 19:30:03] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-05-21 19:30:03] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 2 ms to minimize.
[2024-05-21 19:30:03] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-05-21 19:30:03] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 2 ms to minimize.
[2024-05-21 19:30:03] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 2 ms to minimize.
[2024-05-21 19:30:03] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-21 19:30:03] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-05-21 19:30:03] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 3 ms to minimize.
[2024-05-21 19:30:04] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-21 19:30:04] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 2 ms to minimize.
[2024-05-21 19:30:04] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 2 ms to minimize.
[2024-05-21 19:30:04] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/208 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-21 19:30:05] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-21 19:30:05] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-21 19:30:06] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/208 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 122 constraints, problems are : Problem set: 0 solved, 107 unsolved in 6092 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/208 variables, 100/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 107/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-21 19:30:09] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-21 19:30:09] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-21 19:30:09] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 2 ms to minimize.
[2024-05-21 19:30:09] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-21 19:30:09] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 5/234 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/208 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 234 constraints, problems are : Problem set: 0 solved, 107 unsolved in 3846 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 21/21 constraints]
After SMT, in 9966ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 9968ms
Starting structural reductions in LTL mode, iteration 1 : 100/116 places, 108/128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10197 ms. Remains : 100/116 places, 108/128 transitions.
[2024-05-21 19:30:11] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:30:11] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:30:11] [INFO ] Input system was already deterministic with 108 transitions.
[2024-05-21 19:30:11] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:30:11] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:30:11] [INFO ] Time to serialize gal into /tmp/CTLFireability5975588424469186118.gal : 2 ms
[2024-05-21 19:30:11] [INFO ] Time to serialize properties into /tmp/CTLFireability18352759585814571921.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5975588424469186118.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18352759585814571921.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,75396,0.07465,4772,2,1256,5,4959,6,0,510,4070,0
Converting to forward existential form...Done !
original formula: E((AG((((p87==1) * E((p45==1) U (p50==1))) * (E((p41==1) U ((p44==1)&&(p77==1))) * !((((((p6==1)&&(p13==1))&&((p76==1)&&(p114==1)))||(p97...435
=> equivalent forward existential formula: [(FwdU(Init,(!(E(TRUE U !((((p87==1) * E((p45==1) U (p50==1))) * (E((p41==1) U ((p44==1)&&(p77==1))) * !((((((p6...529
Reverse transition relation is NOT exact ! Due to transitions t10, t17, t18, t26, t30, t34, t37, t38, t39, t61, t62, t65, t67, t68, t69, t82, t89, t91, t98...262
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,9.49544,257784,1,0,2044,1.80108e+06,293,1064,3150,1.60455e+06,2215
FORMULA AutonomousCar-PT-01b-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 116/116 places, 128/128 transitions.
Graph (trivial) has 105 edges and 116 vertex of which 4 / 116 are part of one of the 2 SCC in 6 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 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 113 transition count 71
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 62 rules applied. Total rules applied 117 place count 59 transition count 63
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 123 place count 55 transition count 61
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 127 place count 53 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 128 place count 52 transition count 59
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 128 place count 52 transition count 53
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 140 place count 46 transition count 53
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 149 place count 37 transition count 44
Iterating global reduction 5 with 9 rules applied. Total rules applied 158 place count 37 transition count 44
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 162 place count 37 transition count 40
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 162 place count 37 transition count 39
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 164 place count 36 transition count 39
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 165 place count 35 transition count 38
Iterating global reduction 6 with 1 rules applied. Total rules applied 166 place count 35 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 167 place count 35 transition count 37
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 187 place count 25 transition count 27
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 188 place count 25 transition count 26
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 190 place count 23 transition count 23
Iterating global reduction 8 with 2 rules applied. Total rules applied 192 place count 23 transition count 23
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 194 place count 22 transition count 22
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 195 place count 22 transition count 21
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 197 place count 22 transition count 21
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 199 place count 20 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 200 place count 19 transition count 19
Applied a total of 200 rules in 46 ms. Remains 19 /116 variables (removed 97) and now considering 19/128 (removed 109) transitions.
// Phase 1: matrix 19 rows 19 cols
[2024-05-21 19:30:21] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 19:30:21] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-21 19:30:21] [INFO ] Invariant cache hit.
[2024-05-21 19:30:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:30:21] [INFO ] Implicit Places using invariants and state equation in 44 ms returned [13, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 78 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 17/116 places, 19/128 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 1 rules applied. Total rules applied 1 place count 17 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 16 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 16 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 15 transition count 17
Applied a total of 4 rules in 2 ms. Remains 15 /17 variables (removed 2) and now considering 17/19 (removed 2) transitions.
// Phase 1: matrix 17 rows 15 cols
[2024-05-21 19:30:21] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 19:30:21] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-21 19:30:21] [INFO ] Invariant cache hit.
[2024-05-21 19:30:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:30:21] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 15/116 places, 17/128 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 187 ms. Remains : 15/116 places, 17/128 transitions.
[2024-05-21 19:30:21] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:30:21] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:30:21] [INFO ] Input system was already deterministic with 17 transitions.
[2024-05-21 19:30:21] [INFO ] Flatten gal took : 1 ms
[2024-05-21 19:30:21] [INFO ] Flatten gal took : 1 ms
[2024-05-21 19:30:21] [INFO ] Time to serialize gal into /tmp/CTLFireability12245800136099789122.gal : 2 ms
[2024-05-21 19:30:21] [INFO ] Time to serialize properties into /tmp/CTLFireability1863155133555449443.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12245800136099789122.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1863155133555449443.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,112,0.007154,3416,2,53,5,256,6,0,76,246,0
Converting to forward existential form...Done !
original formula: EG((p34==0))
=> equivalent forward existential formula: [FwdG(Init,(p34==0))] != FALSE
Hit Full ! (commute/partial/dont) 15/0/2
(forward)formula 0,1,0.014043,3732,1,0,12,1045,19,4,380,866,8
FORMULA AutonomousCar-PT-01b-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 128/128 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 100 transition count 112
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 100 transition count 112
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 100 transition count 108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 99 transition count 107
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 99 transition count 107
Applied a total of 38 rules in 7 ms. Remains 99 /116 variables (removed 17) and now considering 107/128 (removed 21) transitions.
// Phase 1: matrix 107 rows 99 cols
[2024-05-21 19:30:21] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 19:30:21] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 19:30:21] [INFO ] Invariant cache hit.
[2024-05-21 19:30:21] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2024-05-21 19:30:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-21 19:30:22] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2024-05-21 19:30:22] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 2 ms to minimize.
[2024-05-21 19:30:22] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-21 19:30:23] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-21 19:30:23] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 2 ms to minimize.
[2024-05-21 19:30:23] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 2 ms to minimize.
[2024-05-21 19:30:23] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-21 19:30:23] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 2 ms to minimize.
[2024-05-21 19:30:23] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 2 ms to minimize.
[2024-05-21 19:30:23] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 2 ms to minimize.
[2024-05-21 19:30:23] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 2 ms to minimize.
[2024-05-21 19:30:23] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-21 19:30:23] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-21 19:30:23] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-21 19:30:23] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-21 19:30:23] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-05-21 19:30:24] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
[2024-05-21 19:30:24] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-21 19:30:24] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-21 19:30:24] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/206 variables, 99/125 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/206 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 125 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4594 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/206 variables, 99/125 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 106/231 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-21 19:30:27] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/206 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 232 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4444 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 21/21 constraints]
After SMT, in 9059ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 9062ms
Starting structural reductions in LTL mode, iteration 1 : 99/116 places, 107/128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9247 ms. Remains : 99/116 places, 107/128 transitions.
[2024-05-21 19:30:31] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:30:31] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:30:31] [INFO ] Input system was already deterministic with 107 transitions.
[2024-05-21 19:30:31] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:30:31] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:30:31] [INFO ] Time to serialize gal into /tmp/CTLFireability4546389967065000322.gal : 2 ms
[2024-05-21 19:30:31] [INFO ] Time to serialize properties into /tmp/CTLFireability9261041084240123546.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4546389967065000322.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9261041084240123546.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,72792,0.043533,4768,2,1149,5,4707,6,0,505,4070,0
Converting to forward existential form...Done !
original formula: (A(E((p98==1) U AX(AF(((p44==1)&&(p77==1))))) U AX((p19==1))) + EX(EG(((p96==1) * AF((p0==0))))))
=> equivalent forward existential formula: ([((Init * !(EG(!(!(EX(!((p19==1)))))))) * !(E(!(!(EX(!((p19==1))))) U (!(E((p98==1) U !(EX(!(!(EG(!(((p44==1)&&...270
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t26, t34, t37, t38, t39, t60, t61, t64, t65, t67, t70, t81, t88, t90, t95, t10...257
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,6.32492,166960,1,0,1051,1.155e+06,260,536,2973,987163,1152
FORMULA AutonomousCar-PT-01b-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 128/128 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 106 transition count 118
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 106 transition count 118
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 104 transition count 116
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 104 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 103 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 103 transition count 115
Applied a total of 26 rules in 8 ms. Remains 103 /116 variables (removed 13) and now considering 115/128 (removed 13) transitions.
// Phase 1: matrix 115 rows 103 cols
[2024-05-21 19:30:37] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 19:30:37] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 19:30:37] [INFO ] Invariant cache hit.
[2024-05-21 19:30:37] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2024-05-21 19:30:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-21 19:30:38] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-05-21 19:30:38] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-21 19:30:38] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-21 19:30:38] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-05-21 19:30:38] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2024-05-21 19:30:38] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-05-21 19:30:38] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 2 ms to minimize.
[2024-05-21 19:30:39] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-21 19:30:39] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 2 ms to minimize.
[2024-05-21 19:30:39] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 2 ms to minimize.
[2024-05-21 19:30:39] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-21 19:30:39] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-05-21 19:30:39] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 2 ms to minimize.
[2024-05-21 19:30:39] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 2 ms to minimize.
[2024-05-21 19:30:39] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-21 19:30:39] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 2 ms to minimize.
[2024-05-21 19:30:40] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-21 19:30:40] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-21 19:30:40] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 2 ms to minimize.
[2024-05-21 19:30:40] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 115/218 variables, 103/129 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-21 19:30:41] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 0/218 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 130 constraints, problems are : Problem set: 0 solved, 114 unsolved in 5864 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-21 19:30:44] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 115/218 variables, 103/131 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 114/245 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-21 19:30:46] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (OVERLAPS) 0/218 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 246 constraints, problems are : Problem set: 0 solved, 114 unsolved in 6135 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 23/23 constraints]
After SMT, in 12016ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 12018ms
Starting structural reductions in LTL mode, iteration 1 : 103/116 places, 115/128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12169 ms. Remains : 103/116 places, 115/128 transitions.
[2024-05-21 19:30:49] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:30:49] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:30:49] [INFO ] Input system was already deterministic with 115 transitions.
[2024-05-21 19:30:49] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:30:49] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:30:49] [INFO ] Time to serialize gal into /tmp/CTLFireability8906317948772202249.gal : 2 ms
[2024-05-21 19:30:49] [INFO ] Time to serialize properties into /tmp/CTLFireability4648011105579683335.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8906317948772202249.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4648011105579683335.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,81392,0.063621,4848,2,1219,5,5322,6,0,529,4430,0
Converting to forward existential form...Done !
original formula: AG((((E(A(((p17==1)||(p22==1)) U EF((p16==1))) U AX((p35==1))) + A(AG((p51==1)) U ((p7==1)||(p4==1)))) + (AX(((p69==1)||(p19==1))) + (p23...301
=> equivalent forward existential formula: ([(EY(((FwdU(Init,TRUE) * !((E(!((E(!(E(TRUE U (p16==1))) U (!(((p17==1)||(p22==1))) * !(E(TRUE U (p16==1))))) +...641
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t37, t39, t54, t61, t62, t65, t66, t68, t71, t84, t91, t94, t95...273
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 110/0/5
Hit Full ! (commute/partial/dont) 97/34/18
(forward)formula 0,0,3.95812,122944,1,0,797,801439,278,435,3550,702691,865
FORMULA AutonomousCar-PT-01b-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 116/116 places, 128/128 transitions.
Graph (trivial) has 105 edges and 116 vertex of which 4 / 116 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 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 113 transition count 73
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 61 rules applied. Total rules applied 114 place count 61 transition count 64
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 121 place count 56 transition count 62
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 123 place count 54 transition count 62
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 123 place count 54 transition count 57
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 133 place count 49 transition count 57
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 143 place count 39 transition count 47
Iterating global reduction 4 with 10 rules applied. Total rules applied 153 place count 39 transition count 47
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 158 place count 39 transition count 42
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 158 place count 39 transition count 40
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 162 place count 37 transition count 40
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 163 place count 36 transition count 39
Iterating global reduction 5 with 1 rules applied. Total rules applied 164 place count 36 transition count 39
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 5 with 2 rules applied. Total rules applied 166 place count 36 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 167 place count 35 transition count 37
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 187 place count 25 transition count 27
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 188 place count 25 transition count 26
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 190 place count 23 transition count 23
Iterating global reduction 8 with 2 rules applied. Total rules applied 192 place count 23 transition count 23
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 193 place count 23 transition count 22
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 195 place count 21 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 196 place count 20 transition count 20
Applied a total of 196 rules in 23 ms. Remains 20 /116 variables (removed 96) and now considering 20/128 (removed 108) transitions.
// Phase 1: matrix 20 rows 20 cols
[2024-05-21 19:30:53] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 19:30:53] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-21 19:30:53] [INFO ] Invariant cache hit.
[2024-05-21 19:30:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:30:53] [INFO ] Implicit Places using invariants and state equation in 47 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 85 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 18/116 places, 20/128 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 1 rules applied. Total rules applied 1 place count 18 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 17 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 17 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 16 transition count 18
Applied a total of 4 rules in 5 ms. Remains 16 /18 variables (removed 2) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 16 cols
[2024-05-21 19:30:53] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 19:30:53] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-21 19:30:53] [INFO ] Invariant cache hit.
[2024-05-21 19:30:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:30:53] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 16/116 places, 18/128 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 192 ms. Remains : 16/116 places, 18/128 transitions.
[2024-05-21 19:30:53] [INFO ] Flatten gal took : 1 ms
[2024-05-21 19:30:53] [INFO ] Flatten gal took : 1 ms
[2024-05-21 19:30:53] [INFO ] Input system was already deterministic with 18 transitions.
RANDOM walk for 22 steps (2 resets) in 6 ms. (3 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-01b-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-21 19:30:53] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:30:53] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:30:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4771078455111646249.gal : 0 ms
[2024-05-21 19:30:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14841715926531317918.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4771078455111646249.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14841715926531317918.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 128/128 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 99 transition count 111
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 99 transition count 111
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 99 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 96 transition count 104
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 96 transition count 104
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 95 transition count 103
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 95 transition count 103
Applied a total of 46 rules in 5 ms. Remains 95 /116 variables (removed 21) and now considering 103/128 (removed 25) transitions.
// Phase 1: matrix 103 rows 95 cols
[2024-05-21 19:30:53] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 19:30:53] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 19:30:53] [INFO ] Invariant cache hit.
[2024-05-21 19:30:54] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-21 19:30:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-21 19:30:55] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-21 19:30:55] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 2 ms to minimize.
[2024-05-21 19:30:55] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 2 ms to minimize.
[2024-05-21 19:30:55] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-21 19:30:55] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 19:30:55] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 2 ms to minimize.
[2024-05-21 19:30:55] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-21 19:30:55] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 2 ms to minimize.
[2024-05-21 19:30:55] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-21 19:30:55] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-21 19:30:55] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:30:55] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:30:55] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:30:56] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-21 19:30:56] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-21 19:30:56] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-21 19:30:56] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-21 19:30:56] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-21 19:30:56] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-21 19:30:56] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 4 ms to minimize.
[2024-05-21 19:30:56] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 4 ms to minimize.
[2024-05-21 19:30:57] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 103/198 variables, 95/123 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 123 constraints, problems are : Problem set: 0 solved, 102 unsolved in 5345 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-21 19:31:00] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 103/198 variables, 95/124 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 102/226 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 226 constraints, problems are : Problem set: 0 solved, 102 unsolved in 5978 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 23/23 constraints]
After SMT, in 11354ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 11356ms
Starting structural reductions in LTL mode, iteration 1 : 95/116 places, 103/128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11545 ms. Remains : 95/116 places, 103/128 transitions.
[2024-05-21 19:31:05] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:31:05] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:31:05] [INFO ] Input system was already deterministic with 103 transitions.
[2024-05-21 19:31:05] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:31:05] [INFO ] Flatten gal took : 15 ms
[2024-05-21 19:31:05] [INFO ] Time to serialize gal into /tmp/CTLFireability8101354599199584748.gal : 4 ms
[2024-05-21 19:31:05] [INFO ] Time to serialize properties into /tmp/CTLFireability4167999890775702686.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8101354599199584748.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4167999890775702686.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,65988,0.095664,4480,2,1067,5,4599,6,0,485,3629,0
Converting to forward existential form...Done !
original formula: EG((((p26==0) * AX((((p55==0)||(p90==0))&&(p28==0)))) * (EX((p52==1)) + EF(((AG((p50==1)) + (p95==1)) + (p25==1))))))
=> equivalent forward existential formula: [FwdG(Init,(((p26==0) * !(EX(!((((p55==0)||(p90==0))&&(p28==0)))))) * (EX((p52==1)) + E(TRUE U ((!(E(TRUE U !((p...202
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t37, t38, t52, t58, t59, t62, t63, t65, t78, t85, t87, t92, In...251
(forward)formula 0,1,2.1716,67988,1,0,586,334971,240,333,2855,389483,555
FORMULA AutonomousCar-PT-01b-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 116/116 places, 128/128 transitions.
Graph (trivial) has 102 edges and 116 vertex of which 4 / 116 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 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 113 transition count 72
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 63 rules applied. Total rules applied 117 place count 60 transition count 62
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 122 place count 55 transition count 62
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 122 place count 55 transition count 54
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 138 place count 47 transition count 54
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 148 place count 37 transition count 44
Iterating global reduction 3 with 10 rules applied. Total rules applied 158 place count 37 transition count 44
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 163 place count 37 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 163 place count 37 transition count 38
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 165 place count 36 transition count 38
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 167 place count 34 transition count 36
Iterating global reduction 4 with 2 rules applied. Total rules applied 169 place count 34 transition count 36
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 171 place count 34 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 172 place count 33 transition count 34
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 188 place count 25 transition count 26
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 190 place count 23 transition count 23
Iterating global reduction 6 with 2 rules applied. Total rules applied 192 place count 23 transition count 23
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 193 place count 23 transition count 22
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 195 place count 23 transition count 22
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 196 place count 22 transition count 21
Iterating global reduction 6 with 1 rules applied. Total rules applied 197 place count 22 transition count 21
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 199 place count 20 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 200 place count 19 transition count 19
Applied a total of 200 rules in 23 ms. Remains 19 /116 variables (removed 97) and now considering 19/128 (removed 109) transitions.
// Phase 1: matrix 19 rows 19 cols
[2024-05-21 19:31:07] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 19:31:07] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-21 19:31:07] [INFO ] Invariant cache hit.
[2024-05-21 19:31:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:31:07] [INFO ] Implicit Places using invariants and state equation in 36 ms returned [13, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 69 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 17/116 places, 19/128 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 1 rules applied. Total rules applied 1 place count 17 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 16 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 16 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 15 transition count 17
Applied a total of 4 rules in 3 ms. Remains 15 /17 variables (removed 2) and now considering 17/19 (removed 2) transitions.
// Phase 1: matrix 17 rows 15 cols
[2024-05-21 19:31:07] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:31:07] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 19:31:07] [INFO ] Invariant cache hit.
[2024-05-21 19:31:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:31:07] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 15/116 places, 17/128 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 151 ms. Remains : 15/116 places, 17/128 transitions.
[2024-05-21 19:31:07] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:31:07] [INFO ] Flatten gal took : 1 ms
[2024-05-21 19:31:07] [INFO ] Input system was already deterministic with 17 transitions.
[2024-05-21 19:31:07] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:31:07] [INFO ] Flatten gal took : 1 ms
[2024-05-21 19:31:07] [INFO ] Time to serialize gal into /tmp/CTLFireability5628673795159998208.gal : 0 ms
[2024-05-21 19:31:07] [INFO ] Time to serialize properties into /tmp/CTLFireability5959187437330991887.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5628673795159998208.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5959187437330991887.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,140,0.00854,3416,2,52,5,300,6,0,76,297,0
Converting to forward existential form...Done !
original formula: AF(EG(EF(((p44==1)&&(p77==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(E(TRUE U ((p44==1)&&(p77==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t15, Intersection with reachable at each step enabled. (destroyed/reverse/in...180
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.019613,3732,1,0,78,1846,66,46,496,1816,87
FORMULA AutonomousCar-PT-01b-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 116/116 places, 128/128 transitions.
Graph (trivial) has 100 edges and 116 vertex of which 4 / 116 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 113 transition count 74
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 58 rules applied. Total rules applied 110 place count 62 transition count 67
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 7 rules applied. Total rules applied 117 place count 58 transition count 64
Reduce places removed 3 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 5 rules applied. Total rules applied 122 place count 55 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 123 place count 54 transition count 62
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 123 place count 54 transition count 57
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 133 place count 49 transition count 57
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 142 place count 40 transition count 48
Iterating global reduction 5 with 9 rules applied. Total rules applied 151 place count 40 transition count 48
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 156 place count 40 transition count 43
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 156 place count 40 transition count 41
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 160 place count 38 transition count 41
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 178 place count 29 transition count 32
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 179 place count 29 transition count 31
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 181 place count 27 transition count 28
Iterating global reduction 7 with 2 rules applied. Total rules applied 183 place count 27 transition count 28
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 7 with 2 rules applied. Total rules applied 185 place count 26 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 186 place count 26 transition count 26
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 189 place count 26 transition count 26
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 190 place count 25 transition count 25
Iterating global reduction 7 with 1 rules applied. Total rules applied 191 place count 25 transition count 25
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 193 place count 23 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 194 place count 22 transition count 23
Applied a total of 194 rules in 21 ms. Remains 22 /116 variables (removed 94) and now considering 23/128 (removed 105) transitions.
// Phase 1: matrix 23 rows 22 cols
[2024-05-21 19:31:07] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 19:31:07] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-21 19:31:07] [INFO ] Invariant cache hit.
[2024-05-21 19:31:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:31:08] [INFO ] Implicit Places using invariants and state equation in 70 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 100 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 21/116 places, 23/128 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 1 rules applied. Total rules applied 1 place count 21 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 20 transition count 22
Applied a total of 2 rules in 3 ms. Remains 20 /21 variables (removed 1) and now considering 22/23 (removed 1) transitions.
// Phase 1: matrix 22 rows 20 cols
[2024-05-21 19:31:08] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 19:31:08] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-21 19:31:08] [INFO ] Invariant cache hit.
[2024-05-21 19:31:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:31:08] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 20/116 places, 22/128 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 189 ms. Remains : 20/116 places, 22/128 transitions.
[2024-05-21 19:31:08] [INFO ] Flatten gal took : 1 ms
[2024-05-21 19:31:08] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:31:08] [INFO ] Input system was already deterministic with 22 transitions.
[2024-05-21 19:31:08] [INFO ] Flatten gal took : 1 ms
[2024-05-21 19:31:08] [INFO ] Flatten gal took : 1 ms
[2024-05-21 19:31:08] [INFO ] Time to serialize gal into /tmp/CTLFireability10717849270458558543.gal : 1 ms
[2024-05-21 19:31:08] [INFO ] Time to serialize properties into /tmp/CTLFireability4263360046211676526.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10717849270458558543.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4263360046211676526.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,244,0.00542,3460,2,70,5,348,6,0,102,297,0
Converting to forward existential form...Done !
original formula: EF(((p20==1) + (AG(((p88==1)&&(p112==1))) * AF((p34==1)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (p20==1))] != FALSE + [((FwdU(Init,TRUE) * !(E(TRUE U !(((p88==1)&&(p112==1)))))) * !(EG(!(...178
(forward)formula 0,1,0.005978,3776,1,0,7,348,8,1,105,297,1
FORMULA AutonomousCar-PT-01b-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 116/116 places, 128/128 transitions.
Graph (trivial) has 103 edges and 116 vertex of which 4 / 116 are part of one of the 2 SCC in 0 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 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 113 transition count 72
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 62 rules applied. Total rules applied 116 place count 60 transition count 63
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 121 place count 55 transition count 63
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 121 place count 55 transition count 58
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 131 place count 50 transition count 58
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 141 place count 40 transition count 48
Iterating global reduction 3 with 10 rules applied. Total rules applied 151 place count 40 transition count 48
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 156 place count 40 transition count 43
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 156 place count 40 transition count 41
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 160 place count 38 transition count 41
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 161 place count 37 transition count 40
Iterating global reduction 4 with 1 rules applied. Total rules applied 162 place count 37 transition count 40
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 164 place count 37 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 165 place count 36 transition count 38
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 183 place count 27 transition count 29
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 185 place count 25 transition count 26
Iterating global reduction 6 with 2 rules applied. Total rules applied 187 place count 25 transition count 26
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 188 place count 25 transition count 25
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 189 place count 25 transition count 25
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 190 place count 24 transition count 24
Iterating global reduction 6 with 1 rules applied. Total rules applied 191 place count 24 transition count 24
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 193 place count 22 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 194 place count 21 transition count 22
Applied a total of 194 rules in 24 ms. Remains 21 /116 variables (removed 95) and now considering 22/128 (removed 106) transitions.
// Phase 1: matrix 22 rows 21 cols
[2024-05-21 19:31:08] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 19:31:08] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-21 19:31:08] [INFO ] Invariant cache hit.
[2024-05-21 19:31:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:31:08] [INFO ] Implicit Places using invariants and state equation in 51 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 80 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 20/116 places, 22/128 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 1 rules applied. Total rules applied 1 place count 20 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 19 transition count 21
Applied a total of 2 rules in 2 ms. Remains 19 /20 variables (removed 1) and now considering 21/22 (removed 1) transitions.
// Phase 1: matrix 21 rows 19 cols
[2024-05-21 19:31:08] [INFO ] Computed 3 invariants in 0 ms
[2024-05-21 19:31:08] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 19:31:08] [INFO ] Invariant cache hit.
[2024-05-21 19:31:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:31:08] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 19/116 places, 21/128 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 214 ms. Remains : 19/116 places, 21/128 transitions.
[2024-05-21 19:31:08] [INFO ] Flatten gal took : 1 ms
[2024-05-21 19:31:08] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:31:08] [INFO ] Input system was already deterministic with 21 transitions.
RANDOM walk for 67 steps (9 resets) in 5 ms. (11 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-01b-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-21 19:31:08] [INFO ] Flatten gal took : 1 ms
[2024-05-21 19:31:08] [INFO ] Flatten gal took : 1 ms
[2024-05-21 19:31:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14387978985187324007.gal : 1 ms
[2024-05-21 19:31:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3567630944063043141.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14387978985187324007.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3567630944063043141.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 128/128 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 102 transition count 114
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 102 transition count 114
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 102 transition count 110
Applied a total of 32 rules in 3 ms. Remains 102 /116 variables (removed 14) and now considering 110/128 (removed 18) transitions.
// Phase 1: matrix 110 rows 102 cols
[2024-05-21 19:31:08] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 19:31:08] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-21 19:31:08] [INFO ] Invariant cache hit.
[2024-05-21 19:31:08] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2024-05-21 19:31:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-21 19:31:09] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 1 ms to minimize.
[2024-05-21 19:31:09] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-21 19:31:09] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 3 ms to minimize.
[2024-05-21 19:31:10] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 1 ms to minimize.
[2024-05-21 19:31:10] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 2 ms to minimize.
[2024-05-21 19:31:10] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 2 ms to minimize.
[2024-05-21 19:31:10] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 2 ms to minimize.
[2024-05-21 19:31:10] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
[2024-05-21 19:31:10] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-21 19:31:10] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 2 ms to minimize.
[2024-05-21 19:31:10] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-21 19:31:10] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
[2024-05-21 19:31:10] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 2 ms to minimize.
[2024-05-21 19:31:10] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 2 ms to minimize.
[2024-05-21 19:31:10] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 3 ms to minimize.
[2024-05-21 19:31:11] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
[2024-05-21 19:31:11] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/212 variables, 102/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-21 19:31:12] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 126 constraints, problems are : Problem set: 0 solved, 109 unsolved in 5619 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/212 variables, 102/126 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 109/235 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-21 19:31:15] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-21 19:31:16] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/212 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 237 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4156 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 20/20 constraints]
After SMT, in 9803ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 9805ms
Starting structural reductions in LTL mode, iteration 1 : 102/116 places, 110/128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10033 ms. Remains : 102/116 places, 110/128 transitions.
[2024-05-21 19:31:18] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:31:18] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:31:18] [INFO ] Input system was already deterministic with 110 transitions.
[2024-05-21 19:31:18] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:31:18] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:31:18] [INFO ] Time to serialize gal into /tmp/CTLFireability5790762794863472700.gal : 1 ms
[2024-05-21 19:31:18] [INFO ] Time to serialize properties into /tmp/CTLFireability11272173505255838305.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5790762794863472700.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11272173505255838305.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,77154,0.070659,4780,2,1136,5,4869,6,0,520,4016,0
Converting to forward existential form...Done !
original formula: ((EX((((p6==1)&&(p9==1))&&((p40==1)&&(p76==1)))) + EG((((EX((p95==1)) + E((p101==1) U (p30==1))) + (AX((p109==1)) + EX(!(E((p45==1) U (p7...308
=> equivalent forward existential formula: [FwdG(EY((EY(FwdU((Init * !((EX((((p6==1)&&(p9==1))&&((p40==1)&&(p76==1)))) + EG((((EX((p95==1)) + E((p101==1) U...372
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t25, t33, t36, t37, t38, t61, t62, t65, t66, t68, t82, t89, t92, t93, t97, t10...257
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,5.50904,151088,1,0,1088,1.02779e+06,275,615,3039,874472,1116
FORMULA AutonomousCar-PT-01b-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 116/116 places, 128/128 transitions.
Graph (trivial) has 90 edges and 116 vertex of which 4 / 116 are part of one of the 2 SCC in 0 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 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 114 transition count 85
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 48 rules applied. Total rules applied 90 place count 73 transition count 78
Reduce places removed 4 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 8 rules applied. Total rules applied 98 place count 69 transition count 74
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 102 place count 65 transition count 74
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 102 place count 65 transition count 69
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 112 place count 60 transition count 69
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 120 place count 52 transition count 61
Iterating global reduction 4 with 8 rules applied. Total rules applied 128 place count 52 transition count 61
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 133 place count 52 transition count 56
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 134 place count 51 transition count 55
Iterating global reduction 5 with 1 rules applied. Total rules applied 135 place count 51 transition count 55
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 161 place count 38 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 162 place count 38 transition count 41
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 163 place count 37 transition count 40
Iterating global reduction 6 with 1 rules applied. Total rules applied 164 place count 37 transition count 40
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 166 place count 36 transition count 39
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 170 place count 36 transition count 39
Applied a total of 170 rules in 9 ms. Remains 36 /116 variables (removed 80) and now considering 39/128 (removed 89) transitions.
// Phase 1: matrix 39 rows 36 cols
[2024-05-21 19:31:24] [INFO ] Computed 5 invariants in 0 ms
[2024-05-21 19:31:24] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-21 19:31:24] [INFO ] Invariant cache hit.
[2024-05-21 19:31:24] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 19:31:24] [INFO ] Implicit Places using invariants and state equation in 60 ms returned [27, 35]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 98 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 34/116 places, 39/128 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 34 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 33 transition count 38
Applied a total of 2 rules in 1 ms. Remains 33 /34 variables (removed 1) and now considering 38/39 (removed 1) transitions.
// Phase 1: matrix 38 rows 33 cols
[2024-05-21 19:31:24] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 19:31:24] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 19:31:24] [INFO ] Invariant cache hit.
[2024-05-21 19:31:24] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 19:31:24] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 33/116 places, 38/128 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 226 ms. Remains : 33/116 places, 38/128 transitions.
[2024-05-21 19:31:24] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:31:24] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:31:24] [INFO ] Input system was already deterministic with 38 transitions.
[2024-05-21 19:31:24] [INFO ] Flatten gal took : 1 ms
[2024-05-21 19:31:24] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:31:24] [INFO ] Time to serialize gal into /tmp/CTLFireability5449580372076682476.gal : 1 ms
[2024-05-21 19:31:24] [INFO ] Time to serialize properties into /tmp/CTLFireability3013126158620654270.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5449580372076682476.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3013126158620654270.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,605,0.011614,3560,2,190,5,961,6,0,168,1041,0
Converting to forward existential form...Done !
original formula: AF(((EG(((((p0==0)&&(((p29==1)||(p5==1))||((p67==1)||(p66==1))))&&((p73==0)&&(p65==1)))&&(p37==1))) * (p49==0)) * (EF((p100==1)) + A((p42...174
=> equivalent forward existential formula: [FwdG(Init,!(((EG(((((p0==0)&&(((p29==1)||(p5==1))||((p67==1)||(p66==1))))&&((p73==0)&&(p65==1)))&&(p37==1))) * ...270
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t4, t8, t11, t15, t23, t26, t31, t32, t33, t37, Intersection with reachable at each ...216
(forward)formula 0,0,0.151292,8628,1,0,257,29289,116,129,1107,31593,302
FORMULA AutonomousCar-PT-01b-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2024-05-21 19:31:24] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:31:24] [INFO ] Flatten gal took : 4 ms
Total runtime 145750 ms.
BK_STOP 1716319884754
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-01b"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is AutonomousCar-PT-01b, 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 r026-smll-171620167300226"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-01b.tgz
mv AutonomousCar-PT-01b 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 '
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 ;