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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 193K Apr 12 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 17:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 12 17:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 177K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-00
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-01
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-02
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-03
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-04
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-05
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-06
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-07
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-08
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-09
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-10
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-11
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2023-12
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2023-13
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2023-14
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716326812758

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-06a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 21:26:54] [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 21:26:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:26:55] [INFO ] Load time of PNML (sax parser for PT used): 273 ms
[2024-05-21 21:26:55] [INFO ] Transformed 65 places.
[2024-05-21 21:26:55] [INFO ] Transformed 417 transitions.
[2024-05-21 21:26:55] [INFO ] Found NUPN structural information;
[2024-05-21 21:26:55] [INFO ] Parsed PT model containing 65 places and 417 transitions and 3356 arcs in 513 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 33 ms.
Ensure Unique test removed 159 transitions
Reduce redundant transitions removed 159 transitions.
Support contains 51 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 258/258 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 257
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 257
Applied a total of 2 rules in 49 ms. Remains 64 /65 variables (removed 1) and now considering 257/258 (removed 1) transitions.
// Phase 1: matrix 257 rows 64 cols
[2024-05-21 21:26:55] [INFO ] Computed 10 invariants in 26 ms
[2024-05-21 21:26:55] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-21 21:26:55] [INFO ] Invariant cache hit.
[2024-05-21 21:26:56] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-21 21:26:56] [INFO ] Implicit Places using invariants and state equation in 385 ms returned [60, 62]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 811 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/65 places, 257/258 transitions.
Applied a total of 0 rules in 8 ms. Remains 62 /62 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 903 ms. Remains : 62/65 places, 257/258 transitions.
Support contains 51 out of 62 places after structural reductions.
[2024-05-21 21:26:56] [INFO ] Flatten gal took : 158 ms
[2024-05-21 21:26:56] [INFO ] Flatten gal took : 81 ms
[2024-05-21 21:26:57] [INFO ] Input system was already deterministic with 257 transitions.
Reduction of identical properties reduced properties to check from 85 to 84
RANDOM walk for 40000 steps (2236 resets) in 3384 ms. (11 steps per ms) remains 17/84 properties
BEST_FIRST walk for 4004 steps (19 resets) in 28 ms. (138 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (19 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (20 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (19 resets) in 45 ms. (87 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (20 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (28 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (20 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (21 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (17 resets) in 14 ms. (266 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (18 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (20 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (20 resets) in 29 ms. (133 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (20 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (20 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (19 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
// Phase 1: matrix 257 rows 62 cols
[2024-05-21 21:26:58] [INFO ] Computed 8 invariants in 8 ms
[2024-05-21 21:26:58] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp82 is UNSAT
At refinement iteration 1 (OVERLAPS) 23/56 variables, 8/8 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 254/310 variables, 56/64 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 146/210 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/210 constraints. Problems are: Problem set: 3 solved, 12 unsolved
Problem AtomicPropp27 is UNSAT
At refinement iteration 6 (OVERLAPS) 8/318 variables, 6/216 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 0/216 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/319 variables, 1/217 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 0/217 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/319 variables, 0/217 constraints. Problems are: Problem set: 4 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 217 constraints, problems are : Problem set: 4 solved, 11 unsolved in 880 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 62/62 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 35/54 variables, 8/8 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 251/305 variables, 54/62 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 146/208 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/208 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 11/316 variables, 6/214 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 11/225 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 0/225 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 2/318 variables, 2/227 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 0/227 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 1/319 variables, 1/228 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/319 variables, 0/228 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 0/319 variables, 0/228 constraints. Problems are: Problem set: 4 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 228 constraints, problems are : Problem set: 4 solved, 11 unsolved in 2888 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 62/62 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 11/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 4059ms problems are : Problem set: 4 solved, 11 unsolved
Parikh walk visited 6 properties in 23787 ms.
Support contains 15 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 257/257 transitions.
Graph (complete) has 518 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 61 transition count 251
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 58 transition count 250
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 57 transition count 250
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 16 place count 52 transition count 215
Iterating global reduction 3 with 5 rules applied. Total rules applied 21 place count 52 transition count 215
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 27 place count 49 transition count 212
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 31 place count 49 transition count 208
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 41 place count 45 transition count 202
Applied a total of 41 rules in 101 ms. Remains 45 /62 variables (removed 17) and now considering 202/257 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 45/62 places, 202/257 transitions.
RANDOM walk for 40000 steps (2344 resets) in 343 ms. (116 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (238 resets) in 143 ms. (277 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (231 resets) in 130 ms. (305 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (237 resets) in 118 ms. (336 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (262 resets) in 124 ms. (320 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (266 resets) in 109 ms. (363 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 1861127 steps, run timeout after 3001 ms. (steps per millisecond=620 ) properties seen :4 out of 5
Probabilistic random walk after 1861127 steps, saw 257568 distinct states, run finished after 3007 ms. (steps per millisecond=618 ) properties seen :4
// Phase 1: matrix 202 rows 45 cols
[2024-05-21 21:27:29] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 21:27:29] [INFO ] State equation strengthened by 110 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/22 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/42 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 200/242 variables, 42/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 110/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/247 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/247 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 45/45 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/22 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/42 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 200/242 variables, 42/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 110/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/247 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/247 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 45/45 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 462ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 35 ms.
Support contains 7 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 202/202 transitions.
Drop transitions (Empty/Sink Transition effects.) 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 0 with 2 rules applied. Total rules applied 2 place count 45 transition count 200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 44 transition count 200
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 44 transition count 199
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 43 transition count 199
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 43 transition count 196
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 29 place count 40 transition count 178
Applied a total of 29 rules in 52 ms. Remains 40 /45 variables (removed 5) and now considering 178/202 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 40/45 places, 178/202 transitions.
RANDOM walk for 40000 steps (295 resets) in 314 ms. (126 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (108 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 793352 steps, run visited all 1 properties in 939 ms. (steps per millisecond=844 )
Probabilistic random walk after 793352 steps, saw 117372 distinct states, run finished after 944 ms. (steps per millisecond=840 ) properties seen :1
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
FORMULA AutonomousCar-PT-06a-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 21:27:31] [INFO ] Flatten gal took : 38 ms
[2024-05-21 21:27:31] [INFO ] Flatten gal took : 49 ms
[2024-05-21 21:27:31] [INFO ] Input system was already deterministic with 257 transitions.
Support contains 49 out of 62 places (down from 51) after GAL structural reductions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 60 transition count 243
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 60 transition count 243
Applied a total of 4 rules in 6 ms. Remains 60 /62 variables (removed 2) and now considering 243/257 (removed 14) transitions.
// Phase 1: matrix 243 rows 60 cols
[2024-05-21 21:27:31] [INFO ] Computed 8 invariants in 3 ms
[2024-05-21 21:27:31] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 21:27:31] [INFO ] Invariant cache hit.
[2024-05-21 21:27:31] [INFO ] State equation strengthened by 135 read => feed constraints.
[2024-05-21 21:27:32] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-21 21:27:32] [INFO ] Invariant cache hit.
[2024-05-21 21:27:32] [INFO ] State equation strengthened by 135 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 242/302 variables, 60/68 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 134/202 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-21 21:27:37] [INFO ] Deduced a trap composed of 18 places in 210 ms of which 14 ms to minimize.
[2024-05-21 21:27:37] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 3 ms to minimize.
[2024-05-21 21:27:37] [INFO ] Deduced a trap composed of 16 places in 200 ms of which 3 ms to minimize.
[2024-05-21 21:27:37] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 4/206 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 1/303 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 0/303 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 207 constraints, problems are : Problem set: 0 solved, 242 unsolved in 18743 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 60/60 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (OVERLAPS) 242/302 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 134/206 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 242/448 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (OVERLAPS) 1/303 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (OVERLAPS) 0/303 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 449 constraints, problems are : Problem set: 0 solved, 242 unsolved in 27262 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 60/60 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 4/4 constraints]
After SMT, in 47180ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 47189ms
Starting structural reductions in LTL mode, iteration 1 : 60/62 places, 243/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47493 ms. Remains : 60/62 places, 243/257 transitions.
[2024-05-21 21:28:19] [INFO ] Flatten gal took : 30 ms
[2024-05-21 21:28:19] [INFO ] Flatten gal took : 29 ms
[2024-05-21 21:28:19] [INFO ] Input system was already deterministic with 243 transitions.
[2024-05-21 21:28:19] [INFO ] Flatten gal took : 23 ms
[2024-05-21 21:28:19] [INFO ] Flatten gal took : 20 ms
[2024-05-21 21:28:19] [INFO ] Time to serialize gal into /tmp/CTLFireability630654777365878313.gal : 14 ms
[2024-05-21 21:28:19] [INFO ] Time to serialize properties into /tmp/CTLFireability9545637115522512388.ctl : 4 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/CTLFireability630654777365878313.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9545637115522512388.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 -...282
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,1.13189e+07,11.0459,257732,2,22118,5,754503,6,0,479,593059,0


Converting to forward existential form...Done !
original formula: (A((((!(((p1==1)&&(p6==1))&&((p19==1)&&(p57==1))))&&(!(((((p16==1)&&(p20==1))&&((p30==1)&&(p37==1)))&&(((p41==1)&&(p48==1))&&((p58==1)&&(...603
=> equivalent forward existential formula: [(((Init * !((E(!(!(!((E(!(E(TRUE U (p28==1))) U (!(EG(((((p13==1)&&(p23==1))&&((p27==1)&&(p34==1)))&&(((p41==1)...1168
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t9, t10, t11, t14, t15, t18, t19, t20, t23, t24, t25, t28, t29, t30, t69, t93...311
Detected timeout of ITS tools.
[2024-05-21 21:28:49] [INFO ] Flatten gal took : 19 ms
[2024-05-21 21:28:49] [INFO ] Applying decomposition
[2024-05-21 21:28:49] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17102225826914950687.txt' '-o' '/tmp/graph17102225826914950687.bin' '-w' '/tmp/graph17102225826914950687.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17102225826914950687.bin' '-l' '-1' '-v' '-w' '/tmp/graph17102225826914950687.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:28:49] [INFO ] Decomposing Gal with order
[2024-05-21 21:28:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:28:49] [INFO ] Removed a total of 778 redundant transitions.
[2024-05-21 21:28:49] [INFO ] Flatten gal took : 104 ms
[2024-05-21 21:28:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 16 ms.
[2024-05-21 21:28:49] [INFO ] Time to serialize gal into /tmp/CTLFireability1642314680764644555.gal : 14 ms
[2024-05-21 21:28:49] [INFO ] Time to serialize properties into /tmp/CTLFireability9503806837703658155.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/CTLFireability1642314680764644555.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9503806837703658155.ctl'

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 -...262
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,1.13189e+07,0.040383,4664,138,120,1308,741,188,2171,64,4573,0


Converting to forward existential form...Done !
original formula: (A((((!(((u19.p1==1)&&(u19.p6==1))&&((u4.p19==1)&&(u19.p57==1))))&&(!(((((i0.u2.p16==1)&&(u4.p20==1))&&((i3.u8.p30==1)&&(i4.u11.p37==1)))...836
=> equivalent forward existential formula: [(((Init * !((E(!(!(!((E(!(E(TRUE U (i3.u7.p28==1))) U (!(EG(((((i0.u1.p13==1)&&(i2.u5.p23==1))&&((i3.u7.p27==1)...1535
Reverse transition relation is NOT exact ! Due to transitions t69, t99, t129, t159, t186, t218, u4.t24, u4.t25, u19.t167, u13.t10, u13.t11, i0.u1.t29, i0.u...425
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,1.40354,54560,1,0,103905,1621,1520,120975,373,7780,128455
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 58 transition count 229
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 229
Applied a total of 8 rules in 4 ms. Remains 58 /62 variables (removed 4) and now considering 229/257 (removed 28) transitions.
// Phase 1: matrix 229 rows 58 cols
[2024-05-21 21:28:51] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 21:28:51] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 21:28:51] [INFO ] Invariant cache hit.
[2024-05-21 21:28:51] [INFO ] State equation strengthened by 123 read => feed constraints.
[2024-05-21 21:28:51] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2024-05-21 21:28:51] [INFO ] Invariant cache hit.
[2024-05-21 21:28:51] [INFO ] State equation strengthened by 123 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (OVERLAPS) 228/286 variables, 58/66 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 122/188 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-21 21:28:56] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 3 ms to minimize.
[2024-05-21 21:28:57] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 5 ms to minimize.
[2024-05-21 21:28:57] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 3/191 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 1/287 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 192 constraints, problems are : Problem set: 0 solved, 228 unsolved in 18167 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 228/286 variables, 58/69 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 122/191 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 228/419 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 1/287 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 420 constraints, problems are : Problem set: 0 solved, 228 unsolved in 27987 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 3/3 constraints]
After SMT, in 46962ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 46966ms
Starting structural reductions in LTL mode, iteration 1 : 58/62 places, 229/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47184 ms. Remains : 58/62 places, 229/257 transitions.
[2024-05-21 21:29:38] [INFO ] Flatten gal took : 17 ms
[2024-05-21 21:29:38] [INFO ] Flatten gal took : 18 ms
[2024-05-21 21:29:38] [INFO ] Input system was already deterministic with 229 transitions.
[2024-05-21 21:29:38] [INFO ] Flatten gal took : 16 ms
[2024-05-21 21:29:38] [INFO ] Flatten gal took : 16 ms
[2024-05-21 21:29:38] [INFO ] Time to serialize gal into /tmp/CTLFireability3487798711955224812.gal : 4 ms
[2024-05-21 21:29:38] [INFO ] Time to serialize properties into /tmp/CTLFireability11503014894831742111.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/CTLFireability3487798711955224812.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11503014894831742111.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,8.44459e+06,3.34948,85604,2,7195,5,208279,6,0,457,215481,0


Converting to forward existential form...Done !
original formula: EF((AG((((EG((((p1==0)||(p7==0))||((p26==0)||(p57==0)))) * (p13==1)) * ((p20==1)&&(p27==1))) * (((p34==1)&&(p44==1))&&((p51==1)&&(p58==1)...309
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !((((EG((((p1==0)||(p7==0))||((p26==0)||(p57==0)))) * (p13==1)) * ((p20==1)&&(p2...649
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t9, t10, t13, t14, t15, t18, t19, t20, t23, t24, t27, t28, t49, t127, t153, t...362
Detected timeout of ITS tools.
[2024-05-21 21:30:08] [INFO ] Flatten gal took : 16 ms
[2024-05-21 21:30:08] [INFO ] Applying decomposition
[2024-05-21 21:30:08] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11648288096052829177.txt' '-o' '/tmp/graph11648288096052829177.bin' '-w' '/tmp/graph11648288096052829177.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11648288096052829177.bin' '-l' '-1' '-v' '-w' '/tmp/graph11648288096052829177.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:30:08] [INFO ] Decomposing Gal with order
[2024-05-21 21:30:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:30:08] [INFO ] Removed a total of 776 redundant transitions.
[2024-05-21 21:30:08] [INFO ] Flatten gal took : 41 ms
[2024-05-21 21:30:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 8 ms.
[2024-05-21 21:30:08] [INFO ] Time to serialize gal into /tmp/CTLFireability2122701503601566575.gal : 3 ms
[2024-05-21 21:30:08] [INFO ] Time to serialize properties into /tmp/CTLFireability12974568564325155337.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/CTLFireability2122701503601566575.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12974568564325155337.ctl'

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 -...263
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,8.44459e+06,0.577634,17520,752,70,24493,575,273,64945,57,2421,0


Converting to forward existential form...Done !
original formula: EF((AG((((EG((((i7.u20.p1==0)||(i7.u20.p7==0))||((i2.u8.p26==0)||(i7.u20.p57==0)))) * (i8.u2.p13==1)) * ((i8.u5.p20==1)&&(i2.u8.p27==1)))...447
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !((((EG((((i7.u20.p1==0)||(i7.u20.p7==0))||((i2.u8.p26==0)||(i7.u20.p57==0)))) *...873
Reverse transition relation is NOT exact ! Due to transitions t55, t127, t160, t161, t162, t163, t177, t178, t179, t192, t193, t194, t195, t208, t209, t210...476
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 9
(forward)formula 0,0,13.0324,278352,1,0,548990,1718,1942,633820,302,11767,620312
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 56 transition count 215
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 56 transition count 215
Applied a total of 12 rules in 4 ms. Remains 56 /62 variables (removed 6) and now considering 215/257 (removed 42) transitions.
// Phase 1: matrix 215 rows 56 cols
[2024-05-21 21:30:22] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 21:30:22] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 21:30:22] [INFO ] Invariant cache hit.
[2024-05-21 21:30:22] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 21:30:22] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-05-21 21:30:22] [INFO ] Invariant cache hit.
[2024-05-21 21:30:22] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 214/270 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 110/174 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-21 21:30:27] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 2 ms to minimize.
[2024-05-21 21:30:27] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 2 ms to minimize.
[2024-05-21 21:30:27] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 1/271 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/271 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 178 constraints, problems are : Problem set: 0 solved, 214 unsolved in 15423 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 214/270 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 110/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 214/391 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 1/271 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 10 (OVERLAPS) 0/271 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 392 constraints, problems are : Problem set: 0 solved, 214 unsolved in 21904 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 3/3 constraints]
After SMT, in 38202ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 38207ms
Starting structural reductions in LTL mode, iteration 1 : 56/62 places, 215/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38501 ms. Remains : 56/62 places, 215/257 transitions.
[2024-05-21 21:31:00] [INFO ] Flatten gal took : 13 ms
[2024-05-21 21:31:00] [INFO ] Flatten gal took : 13 ms
[2024-05-21 21:31:00] [INFO ] Input system was already deterministic with 215 transitions.
[2024-05-21 21:31:00] [INFO ] Flatten gal took : 13 ms
[2024-05-21 21:31:00] [INFO ] Flatten gal took : 15 ms
[2024-05-21 21:31:00] [INFO ] Time to serialize gal into /tmp/CTLFireability2813394359116017947.gal : 3 ms
[2024-05-21 21:31:00] [INFO ] Time to serialize properties into /tmp/CTLFireability15595227063110151495.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/CTLFireability2813394359116017947.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15595227063110151495.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,6.30317e+06,4.43648,105796,2,16290,5,354261,6,0,435,285367,0


Converting to forward existential form...Done !
original formula: EG((AG(AX(!(A((((p1==1)&&(p5==1))&&((p10==1)&&(p57==1))) U (((p1==1)&&(p5==1))&&((p29==1)&&(p57==1))))))) * ((((p13==0)||(p20==0))||((p27...208
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !(!(EX(!(!(!((E(!((((p1==1)&&(p5==1))&&((p29==1)&&(p57==1)))) U (!((((p1==1)&&(p5==1))&&(...382
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t9, t10, t13, t14, t17, t18, t21, t22, t25, t26, t139, t141, t142, t143, t144...629
Detected timeout of ITS tools.
[2024-05-21 21:31:30] [INFO ] Flatten gal took : 14 ms
[2024-05-21 21:31:30] [INFO ] Applying decomposition
[2024-05-21 21:31:30] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2422843100308892369.txt' '-o' '/tmp/graph2422843100308892369.bin' '-w' '/tmp/graph2422843100308892369.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2422843100308892369.bin' '-l' '-1' '-v' '-w' '/tmp/graph2422843100308892369.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:31:30] [INFO ] Decomposing Gal with order
[2024-05-21 21:31:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:31:30] [INFO ] Removed a total of 734 redundant transitions.
[2024-05-21 21:31:30] [INFO ] Flatten gal took : 36 ms
[2024-05-21 21:31:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 5 ms.
[2024-05-21 21:31:30] [INFO ] Time to serialize gal into /tmp/CTLFireability10166638813632038037.gal : 2 ms
[2024-05-21 21:31:30] [INFO ] Time to serialize properties into /tmp/CTLFireability16295754267008115159.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/CTLFireability10166638813632038037.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16295754267008115159.ctl'

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 -...264
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,6.30317e+06,0.035949,4580,102,116,1288,874,146,2324,62,4334,0


Converting to forward existential form...Done !
original formula: EG((AG(AX(!(A((((u19.p1==1)&&(u19.p5==1))&&((i0.u0.p10==1)&&(u19.p57==1))) U (((u19.p1==1)&&(u19.p5==1))&&((i2.u8.p29==1)&&(u19.p57==1)))...290
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !(!(EX(!(!(!((E(!((((u19.p1==1)&&(u19.p5==1))&&((i2.u8.p29==1)&&(u19.p57==1)))) U (!((((u...500
Reverse transition relation is NOT exact ! Due to transitions t158, t159, t190, t191, u19.t139, i0.u1.t26, i0.u2.t25, i1.u4.t22, i1.u5.t21, i2.u7.t18, i2.u...382
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 7
(forward)formula 0,0,0.473057,18044,1,0,30374,1985,912,39638,334,10631,46125
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 59 transition count 236
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 59 transition count 236
Applied a total of 6 rules in 4 ms. Remains 59 /62 variables (removed 3) and now considering 236/257 (removed 21) transitions.
// Phase 1: matrix 236 rows 59 cols
[2024-05-21 21:31:31] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 21:31:31] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 21:31:31] [INFO ] Invariant cache hit.
[2024-05-21 21:31:31] [INFO ] State equation strengthened by 129 read => feed constraints.
[2024-05-21 21:31:31] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Running 235 sub problems to find dead transitions.
[2024-05-21 21:31:31] [INFO ] Invariant cache hit.
[2024-05-21 21:31:31] [INFO ] State equation strengthened by 129 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (OVERLAPS) 235/294 variables, 59/67 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 128/195 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 21:31:37] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 1 ms to minimize.
[2024-05-21 21:31:37] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 1 ms to minimize.
[2024-05-21 21:31:37] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 1 ms to minimize.
[2024-05-21 21:31:39] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 7 (OVERLAPS) 1/295 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 9 (OVERLAPS) 0/295 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 235 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 200 constraints, problems are : Problem set: 0 solved, 235 unsolved in 18420 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 59/59 constraints, ReadFeed: 129/129 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 235 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (OVERLAPS) 235/294 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 128/199 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 235/434 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 8 (OVERLAPS) 1/295 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/295 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 10 (OVERLAPS) 0/295 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 235 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 435 constraints, problems are : Problem set: 0 solved, 235 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 59/59 constraints, ReadFeed: 129/129 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 4/4 constraints]
After SMT, in 49430ms problems are : Problem set: 0 solved, 235 unsolved
Search for dead transitions found 0 dead transitions in 49436ms
Starting structural reductions in LTL mode, iteration 1 : 59/62 places, 236/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49717 ms. Remains : 59/62 places, 236/257 transitions.
[2024-05-21 21:32:21] [INFO ] Flatten gal took : 14 ms
[2024-05-21 21:32:21] [INFO ] Flatten gal took : 14 ms
[2024-05-21 21:32:21] [INFO ] Input system was already deterministic with 236 transitions.
[2024-05-21 21:32:21] [INFO ] Flatten gal took : 14 ms
[2024-05-21 21:32:21] [INFO ] Flatten gal took : 13 ms
[2024-05-21 21:32:21] [INFO ] Time to serialize gal into /tmp/CTLFireability5346338366397038005.gal : 3 ms
[2024-05-21 21:32:21] [INFO ] Time to serialize properties into /tmp/CTLFireability13850447304298877918.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/CTLFireability5346338366397038005.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13850447304298877918.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,9.77657e+06,3.42135,82440,2,7512,5,197604,6,0,468,216789,0


Converting to forward existential form...Done !
original formula: ((EG(((EX(((((p16==0)||(p20==0))||((p30==0)||(p34==0)))||(((p41==0)||(p48==0))||(p58==0)))) * (((((((p1==1)&&(p8==1))&&((p43==1)&&(p57==1...565
=> equivalent forward existential formula: (([FwdG(Init,((EX(((((p16==0)||(p20==0))||((p30==0)||(p34==0)))||(((p41==0)||(p48==0))||(p58==0)))) * (((((((p1=...710
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t7, t10, t11, t12, t15, t16, t19, t20, t21, t24, t25, t28, t29, t32, t128, t1...325
Detected timeout of ITS tools.
[2024-05-21 21:32:51] [INFO ] Flatten gal took : 12 ms
[2024-05-21 21:32:51] [INFO ] Applying decomposition
[2024-05-21 21:32:51] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4784092608820287298.txt' '-o' '/tmp/graph4784092608820287298.bin' '-w' '/tmp/graph4784092608820287298.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4784092608820287298.bin' '-l' '-1' '-v' '-w' '/tmp/graph4784092608820287298.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:32:51] [INFO ] Decomposing Gal with order
[2024-05-21 21:32:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:32:51] [INFO ] Removed a total of 767 redundant transitions.
[2024-05-21 21:32:51] [INFO ] Flatten gal took : 30 ms
[2024-05-21 21:32:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 5 ms.
[2024-05-21 21:32:51] [INFO ] Time to serialize gal into /tmp/CTLFireability14711947155377736499.gal : 2 ms
[2024-05-21 21:32:51] [INFO ] Time to serialize properties into /tmp/CTLFireability17071475748702796078.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/CTLFireability14711947155377736499.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17071475748702796078.ctl'

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 -...264
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,9.77657e+06,0.048196,5032,222,120,2139,702,201,2691,64,4892,0


Converting to forward existential form...Done !
original formula: ((EG(((EX(((((i0.u2.p16==0)||(i1.u4.p20==0))||((i2.u8.p30==0)||(i3.u10.p34==0)))||(((u13.p41==0)||(u16.p48==0))||(i10.u20.p58==0)))) * ((...776
=> equivalent forward existential formula: (([FwdG(Init,((EX(((((i0.u2.p16==0)||(i1.u4.p20==0))||((i2.u8.p30==0)||(i3.u10.p34==0)))||(((u13.p41==0)||(u16.p...921
Reverse transition relation is NOT exact ! Due to transitions t38, t122, t146, t183, t184, t185, t186, u13.t11, u13.t12, u16.t6, u16.t7, u19.t160, u7.t20, ...421
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,1,1.05301,40936,1,0,85923,1649,1594,101072,366,9355,113611
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 62 transition count 252
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 57 transition count 251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 56 transition count 251
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 56 transition count 250
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 55 transition count 250
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 18 place count 51 transition count 222
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 51 transition count 222
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 50 transition count 221
Applied a total of 24 rules in 39 ms. Remains 50 /62 variables (removed 12) and now considering 221/257 (removed 36) transitions.
// Phase 1: matrix 221 rows 50 cols
[2024-05-21 21:32:52] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 21:32:52] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 21:32:52] [INFO ] Invariant cache hit.
[2024-05-21 21:32:52] [INFO ] State equation strengthened by 123 read => feed constraints.
[2024-05-21 21:32:52] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2024-05-21 21:32:52] [INFO ] Redundant transitions in 19 ms returned []
Running 220 sub problems to find dead transitions.
[2024-05-21 21:32:52] [INFO ] Invariant cache hit.
[2024-05-21 21:32:52] [INFO ] State equation strengthened by 123 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 220/270 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 122/180 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 21:32:57] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 2 ms to minimize.
[2024-05-21 21:32:59] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 1/271 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (OVERLAPS) 0/271 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 183 constraints, problems are : Problem set: 0 solved, 220 unsolved in 15483 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 50/50 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 220/270 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 122/182 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 220/402 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 1/271 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 10 (OVERLAPS) 0/271 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 403 constraints, problems are : Problem set: 0 solved, 220 unsolved in 29169 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 50/50 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 2/2 constraints]
After SMT, in 45341ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 45346ms
Starting structural reductions in SI_CTL mode, iteration 1 : 50/62 places, 221/257 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45670 ms. Remains : 50/62 places, 221/257 transitions.
[2024-05-21 21:33:38] [INFO ] Flatten gal took : 18 ms
[2024-05-21 21:33:38] [INFO ] Flatten gal took : 19 ms
[2024-05-21 21:33:38] [INFO ] Input system was already deterministic with 221 transitions.
[2024-05-21 21:33:38] [INFO ] Flatten gal took : 19 ms
[2024-05-21 21:33:38] [INFO ] Flatten gal took : 19 ms
[2024-05-21 21:33:38] [INFO ] Time to serialize gal into /tmp/CTLFireability1048676074861619768.gal : 5 ms
[2024-05-21 21:33:38] [INFO ] Time to serialize properties into /tmp/CTLFireability3058713591418450559.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/CTLFireability1048676074861619768.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3058713591418450559.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,2.19775e+06,2.566,63952,2,4703,5,142483,6,0,417,167702,0


Converting to forward existential form...Done !
original formula: A(!((((AG((((p1==1)&&(p6==1))&&((p22==1)&&(p57==1)))) * (AG((((p1==1)&&(p7==1))&&((p22==1)&&(p57==1)))) + (((p1==1)&&(p5==1))&&((p35==1)&...311
=> equivalent forward existential formula: [((Init * !(EG(!(((((p13==1)&&(p20==1))&&((p27==1)&&(p34==1)))&&(((p41==1)&&(p48==1))&&(p58==1))))))) * !(E(!(((...572
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t8, t10, t11, t12, t14, t15, t17, t18, t19, t20, t40, t136, t143, t160, t...356
(forward)formula 0,0,25.383,534124,1,0,983,2.16176e+06,476,429,7547,2.13559e+06,1094
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 59 transition count 236
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 59 transition count 236
Applied a total of 6 rules in 3 ms. Remains 59 /62 variables (removed 3) and now considering 236/257 (removed 21) transitions.
// Phase 1: matrix 236 rows 59 cols
[2024-05-21 21:34:03] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 21:34:03] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 21:34:03] [INFO ] Invariant cache hit.
[2024-05-21 21:34:03] [INFO ] State equation strengthened by 129 read => feed constraints.
[2024-05-21 21:34:04] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 235 sub problems to find dead transitions.
[2024-05-21 21:34:04] [INFO ] Invariant cache hit.
[2024-05-21 21:34:04] [INFO ] State equation strengthened by 129 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (OVERLAPS) 235/294 variables, 59/67 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 128/195 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 21:34:09] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 2 ms to minimize.
[2024-05-21 21:34:09] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 2 ms to minimize.
[2024-05-21 21:34:09] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 1 ms to minimize.
[2024-05-21 21:34:11] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 7 (OVERLAPS) 1/295 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 9 (OVERLAPS) 0/295 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 235 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 200 constraints, problems are : Problem set: 0 solved, 235 unsolved in 19445 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 59/59 constraints, ReadFeed: 129/129 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 235 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (OVERLAPS) 235/294 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 128/199 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 235/434 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 8 (OVERLAPS) 1/295 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/295 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 10 (OVERLAPS) 0/295 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 235 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 435 constraints, problems are : Problem set: 0 solved, 235 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 59/59 constraints, ReadFeed: 129/129 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 4/4 constraints]
After SMT, in 50321ms problems are : Problem set: 0 solved, 235 unsolved
Search for dead transitions found 0 dead transitions in 50324ms
Starting structural reductions in LTL mode, iteration 1 : 59/62 places, 236/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50555 ms. Remains : 59/62 places, 236/257 transitions.
[2024-05-21 21:34:54] [INFO ] Flatten gal took : 12 ms
[2024-05-21 21:34:54] [INFO ] Flatten gal took : 14 ms
[2024-05-21 21:34:54] [INFO ] Input system was already deterministic with 236 transitions.
[2024-05-21 21:34:54] [INFO ] Flatten gal took : 13 ms
[2024-05-21 21:34:54] [INFO ] Flatten gal took : 14 ms
[2024-05-21 21:34:54] [INFO ] Time to serialize gal into /tmp/CTLFireability15992147547483076748.gal : 4 ms
[2024-05-21 21:34:54] [INFO ] Time to serialize properties into /tmp/CTLFireability8776906185773402230.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/CTLFireability15992147547483076748.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8776906185773402230.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,9.77657e+06,3.7946,90116,2,7798,5,226281,6,0,468,237982,0


Converting to forward existential form...Done !
original formula: (AF((((p1==1)&&(p6==1))&&((p14==1)&&(p57==1)))) * AG((((((p1==0)||(p2==0))||((p40==0)||(p57==0))) * AG((((((p16==0)||(p23==0))||((p27==0)...456
=> equivalent forward existential formula: ([FwdG(Init,!((((p1==1)&&(p6==1))&&((p14==1)&&(p57==1)))))] = FALSE * (([(FwdU(Init,TRUE) * !((((p1==0)||(p2==0)...606
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t9, t10, t11, t14, t15, t18, t19, t22, t23, t24, t27, t28, t29, t68, t92, t15...324
(forward)formula 0,0,7.50064,125080,1,0,466,483599,494,245,8007,500656,495
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 222
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 222
Applied a total of 10 rules in 4 ms. Remains 57 /62 variables (removed 5) and now considering 222/257 (removed 35) transitions.
// Phase 1: matrix 222 rows 57 cols
[2024-05-21 21:35:01] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 21:35:02] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-21 21:35:02] [INFO ] Invariant cache hit.
[2024-05-21 21:35:02] [INFO ] State equation strengthened by 117 read => feed constraints.
[2024-05-21 21:35:02] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-05-21 21:35:02] [INFO ] Invariant cache hit.
[2024-05-21 21:35:02] [INFO ] State equation strengthened by 117 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 221/278 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 116/181 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 21:35:07] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 2 ms to minimize.
[2024-05-21 21:35:07] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 2 ms to minimize.
[2024-05-21 21:35:08] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 1 ms to minimize.
[2024-05-21 21:35:09] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 1/279 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 0/279 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 186 constraints, problems are : Problem set: 0 solved, 221 unsolved in 17418 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 221/278 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 116/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 221/406 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 1/279 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 0/279 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 407 constraints, problems are : Problem set: 0 solved, 221 unsolved in 25991 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 4/4 constraints]
After SMT, in 44435ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 44440ms
Starting structural reductions in LTL mode, iteration 1 : 57/62 places, 222/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44763 ms. Remains : 57/62 places, 222/257 transitions.
[2024-05-21 21:35:46] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:35:46] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:35:46] [INFO ] Input system was already deterministic with 222 transitions.
[2024-05-21 21:35:46] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:35:46] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:35:46] [INFO ] Time to serialize gal into /tmp/CTLFireability16252508576783448543.gal : 2 ms
[2024-05-21 21:35:46] [INFO ] Time to serialize properties into /tmp/CTLFireability18240075631929265651.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/CTLFireability16252508576783448543.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18240075631929265651.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 -...285
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,7.29495e+06,14.5449,318356,2,23680,5,981842,6,0,446,910595,0


Converting to forward existential form...Done !
original formula: AX(A((((p1==1)&&(p5==1))&&((p31==1)&&(p57==1))) U !(EF((((p1==1)&&(p5==1))&&((p40==1)&&(p57==1)))))))
=> equivalent forward existential formula: ([(FwdU((FwdU(EY(Init),!(!(E(TRUE U (((p1==1)&&(p5==1))&&((p40==1)&&(p57==1))))))) * !((((p1==1)&&(p5==1))&&((p3...322
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t9, t10, t11, t14, t15, t18, t19, t22, t23, t26, t27, t138, t146, t148, t165,...448
Detected timeout of ITS tools.
[2024-05-21 21:36:16] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:36:16] [INFO ] Applying decomposition
[2024-05-21 21:36:16] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph621766402175191180.txt' '-o' '/tmp/graph621766402175191180.bin' '-w' '/tmp/graph621766402175191180.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph621766402175191180.bin' '-l' '-1' '-v' '-w' '/tmp/graph621766402175191180.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:36:16] [INFO ] Decomposing Gal with order
[2024-05-21 21:36:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:36:16] [INFO ] Removed a total of 763 redundant transitions.
[2024-05-21 21:36:16] [INFO ] Flatten gal took : 27 ms
[2024-05-21 21:36:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 8 ms.
[2024-05-21 21:36:16] [INFO ] Time to serialize gal into /tmp/CTLFireability12881772473894784309.gal : 2 ms
[2024-05-21 21:36:16] [INFO ] Time to serialize properties into /tmp/CTLFireability5271258311926997005.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/CTLFireability12881772473894784309.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5271258311926997005.ctl'

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 -...263
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,7.29495e+06,2.54361,47252,1077,77,92668,898,328,169207,62,3706,0


Converting to forward existential form...Done !
original formula: AX(A((((i0.u20.p1==1)&&(i0.u20.p5==1))&&((i4.u10.p31==1)&&(i0.u20.p57==1))) U !(EF((((i0.u20.p1==1)&&(i0.u20.p5==1))&&((u14.p40==1)&&(i0....172
=> equivalent forward existential formula: ([(FwdU((FwdU(EY(Init),!(!(E(TRUE U (((i0.u20.p1==1)&&(i0.u20.p5==1))&&((u14.p40==1)&&(i0.u20.p57==1))))))) * !(...425
Reverse transition relation is NOT exact ! Due to transitions t132, t165, t166, t167, t168, t170, t171, t172, t173, t174, t175, t176, t177, t178, t179, t18...551
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 222
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 222
Applied a total of 10 rules in 3 ms. Remains 57 /62 variables (removed 5) and now considering 222/257 (removed 35) transitions.
// Phase 1: matrix 222 rows 57 cols
[2024-05-21 21:36:47] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 21:36:47] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 21:36:47] [INFO ] Invariant cache hit.
[2024-05-21 21:36:47] [INFO ] State equation strengthened by 117 read => feed constraints.
[2024-05-21 21:36:47] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-05-21 21:36:47] [INFO ] Invariant cache hit.
[2024-05-21 21:36:47] [INFO ] State equation strengthened by 117 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 221/278 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 116/181 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 21:36:52] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 4 ms to minimize.
[2024-05-21 21:36:52] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 1 ms to minimize.
[2024-05-21 21:36:52] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 2 ms to minimize.
[2024-05-21 21:36:54] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 1/279 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 0/279 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 186 constraints, problems are : Problem set: 0 solved, 221 unsolved in 15912 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 221/278 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 116/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 221/406 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 1/279 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 0/279 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 407 constraints, problems are : Problem set: 0 solved, 221 unsolved in 27212 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 4/4 constraints]
After SMT, in 43982ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 43987ms
Starting structural reductions in LTL mode, iteration 1 : 57/62 places, 222/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44245 ms. Remains : 57/62 places, 222/257 transitions.
[2024-05-21 21:37:31] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:37:31] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:37:31] [INFO ] Input system was already deterministic with 222 transitions.
[2024-05-21 21:37:31] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:37:31] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:37:31] [INFO ] Time to serialize gal into /tmp/CTLFireability10139162308906355078.gal : 2 ms
[2024-05-21 21:37:31] [INFO ] Time to serialize properties into /tmp/CTLFireability1471732488133455206.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/CTLFireability10139162308906355078.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1471732488133455206.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,7.29495e+06,2.8708,75132,2,7312,5,168133,6,0,446,193380,0


Converting to forward existential form...Done !
original formula: (E((!(EF(AG((p15==1)))) + (p22==1)) U !((AX(!((((p1==1)&&(p7==1))&&((p47==1)&&(p57==1))))) * EG(!((((p1==1)&&(p2==1))&&((p45==1)&&(p57==1...534
=> equivalent forward existential formula: (([(EY(FwdU(Init,(!(E(TRUE U !(E(TRUE U !((p15==1)))))) + (p22==1)))) * (((p1==1)&&(p7==1))&&((p47==1)&&(p57==1)...809
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t7, t10, t11, t14, t15, t18, t19, t22, t23, t26, t27, t30, t146, t148, t149, ...447
(forward)formula 0,1,8.7516,163640,1,0,452,479230,468,221,7513,546443,458
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 61 transition count 250
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 250
Applied a total of 2 rules in 4 ms. Remains 61 /62 variables (removed 1) and now considering 250/257 (removed 7) transitions.
// Phase 1: matrix 250 rows 61 cols
[2024-05-21 21:37:40] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 21:37:40] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 21:37:40] [INFO ] Invariant cache hit.
[2024-05-21 21:37:40] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-21 21:37:40] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Running 249 sub problems to find dead transitions.
[2024-05-21 21:37:40] [INFO ] Invariant cache hit.
[2024-05-21 21:37:40] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (OVERLAPS) 249/310 variables, 61/69 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 140/209 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-05-21 21:37:46] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 2 ms to minimize.
[2024-05-21 21:37:47] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 2 ms to minimize.
[2024-05-21 21:37:47] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 1 ms to minimize.
[2024-05-21 21:37:49] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 4/213 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (OVERLAPS) 1/311 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 9 (OVERLAPS) 0/311 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 214 constraints, problems are : Problem set: 0 solved, 249 unsolved in 20658 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 61/61 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 249 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 249/310 variables, 61/73 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 140/213 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 249/462 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 8 (OVERLAPS) 1/311 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 249 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 311/311 variables, and 463 constraints, problems are : Problem set: 0 solved, 249 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 61/61 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 4/4 constraints]
After SMT, in 51812ms problems are : Problem set: 0 solved, 249 unsolved
Search for dead transitions found 0 dead transitions in 51815ms
Starting structural reductions in LTL mode, iteration 1 : 61/62 places, 250/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52070 ms. Remains : 61/62 places, 250/257 transitions.
[2024-05-21 21:38:32] [INFO ] Flatten gal took : 17 ms
[2024-05-21 21:38:32] [INFO ] Flatten gal took : 19 ms
[2024-05-21 21:38:32] [INFO ] Input system was already deterministic with 250 transitions.
[2024-05-21 21:38:32] [INFO ] Flatten gal took : 19 ms
[2024-05-21 21:38:32] [INFO ] Flatten gal took : 18 ms
[2024-05-21 21:38:32] [INFO ] Time to serialize gal into /tmp/CTLFireability1318248338330146619.gal : 3 ms
[2024-05-21 21:38:32] [INFO ] Time to serialize properties into /tmp/CTLFireability3757134728634661718.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/CTLFireability1318248338330146619.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3757134728634661718.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,1.31039e+07,4.72867,112968,2,8227,5,274665,6,0,490,280296,0


Converting to forward existential form...Done !
original formula: (EG(((AX((((p1==0)||(p6==0))||((p26==0)||(p57==0)))) + AX((((p1==0)||(p6==0))||((p45==0)||(p57==0))))) * ((AF(AX((((p1==1)&&(p9==1))&&((p...604
=> equivalent forward existential formula: ([(Init * !(EG(((!(EX(!((((p1==0)||(p6==0))||((p26==0)||(p57==0)))))) + !(EX(!((((p1==0)||(p6==0))||((p45==0)||(...820
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t7, t10, t11, t12, t15, t16, t17, t20, t21, t22, t25, t26, t27, t30, t31, t34...309
Detected timeout of ITS tools.
[2024-05-21 21:39:02] [INFO ] Flatten gal took : 12 ms
[2024-05-21 21:39:02] [INFO ] Applying decomposition
[2024-05-21 21:39:02] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13714618094484214723.txt' '-o' '/tmp/graph13714618094484214723.bin' '-w' '/tmp/graph13714618094484214723.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13714618094484214723.bin' '-l' '-1' '-v' '-w' '/tmp/graph13714618094484214723.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:39:02] [INFO ] Decomposing Gal with order
[2024-05-21 21:39:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:39:02] [INFO ] Removed a total of 811 redundant transitions.
[2024-05-21 21:39:02] [INFO ] Flatten gal took : 28 ms
[2024-05-21 21:39:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 5 ms.
[2024-05-21 21:39:02] [INFO ] Time to serialize gal into /tmp/CTLFireability1109761097236731659.gal : 1 ms
[2024-05-21 21:39:02] [INFO ] Time to serialize properties into /tmp/CTLFireability9973140139427654985.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/CTLFireability1109761097236731659.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9973140139427654985.ctl'

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 -...262
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,1.31039e+07,0.036281,4436,151,64,1606,620,182,2936,62,2822,0


Converting to forward existential form...Done !
original formula: (EG(((AX((((i7.u20.p1==0)||(i7.u20.p6==0))||((i2.u8.p26==0)||(i7.u20.p57==0)))) + AX((((i7.u20.p1==0)||(i7.u20.p6==0))||((i5.u16.p45==0)|...918
=> equivalent forward existential formula: ([(Init * !(EG(((!(EX(!((((i7.u20.p1==0)||(i7.u20.p6==0))||((i2.u8.p26==0)||(i7.u20.p57==0)))))) + !(EX(!((((i7....1190
Reverse transition relation is NOT exact ! Due to transitions t46, t64, t82, t130, t160, t206, t248, u21.t1, u21.t176, u21.t247, i0.u2.t31, i0.u3.t30, i0.u...443
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 7
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 7
Fast SCC detection found a local SCC at level 7
(forward)formula 0,1,1.28584,42716,1,0,77308,1595,1313,118263,365,11026,104526
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 62 transition count 252
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 57 transition count 252
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 57 transition count 251
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 56 transition count 251
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 17 place count 51 transition count 216
Iterating global reduction 2 with 5 rules applied. Total rules applied 22 place count 51 transition count 216
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 50 transition count 215
Applied a total of 24 rules in 25 ms. Remains 50 /62 variables (removed 12) and now considering 215/257 (removed 42) transitions.
// Phase 1: matrix 215 rows 50 cols
[2024-05-21 21:39:03] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 21:39:03] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-21 21:39:03] [INFO ] Invariant cache hit.
[2024-05-21 21:39:03] [INFO ] State equation strengthened by 117 read => feed constraints.
[2024-05-21 21:39:04] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2024-05-21 21:39:04] [INFO ] Redundant transitions in 10 ms returned []
Running 214 sub problems to find dead transitions.
[2024-05-21 21:39:04] [INFO ] Invariant cache hit.
[2024-05-21 21:39:04] [INFO ] State equation strengthened by 117 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 214/264 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 116/174 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-21 21:39:08] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 1 ms to minimize.
[2024-05-21 21:39:08] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 1/265 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/265 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 177 constraints, problems are : Problem set: 0 solved, 214 unsolved in 15418 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 50/50 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 214/264 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 116/176 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 214/390 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 1/265 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 10 (OVERLAPS) 0/265 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 391 constraints, problems are : Problem set: 0 solved, 214 unsolved in 23715 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 50/50 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 2/2 constraints]
After SMT, in 39642ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 39645ms
Starting structural reductions in SI_CTL mode, iteration 1 : 50/62 places, 215/257 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39912 ms. Remains : 50/62 places, 215/257 transitions.
[2024-05-21 21:39:43] [INFO ] Flatten gal took : 12 ms
[2024-05-21 21:39:43] [INFO ] Flatten gal took : 12 ms
[2024-05-21 21:39:43] [INFO ] Input system was already deterministic with 215 transitions.
[2024-05-21 21:39:43] [INFO ] Flatten gal took : 12 ms
[2024-05-21 21:39:43] [INFO ] Flatten gal took : 12 ms
[2024-05-21 21:39:43] [INFO ] Time to serialize gal into /tmp/CTLFireability4398010569198162761.gal : 3 ms
[2024-05-21 21:39:43] [INFO ] Time to serialize properties into /tmp/CTLFireability3369507513874944001.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/CTLFireability4398010569198162761.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3369507513874944001.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,2.27766e+06,3.62552,82148,2,5278,5,175341,6,0,411,212936,0


Converting to forward existential form...Done !
original formula: AG(AF((EG(AG((((p1==1)&&(p8==1))&&((p12==1)&&(p57==1))))) + AF((((((p13==0)||(p23==0))||((p27==0)||(p34==0)))||(((p41==0)||(p48==0))||(p5...189
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((EG(!(E(TRUE U !((((p1==1)&&(p8==1))&&((p12==1)&&(p57==1))))))) + !(EG(!((((((p13==0)||(...259
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t8, t9, t11, t12, t14, t15, t17, t18, t20, t21, t22, t78, t138, t140, t142, t144,...442
(forward)formula 0,0,13.803,268316,1,0,776,813514,468,339,7746,1.01644e+06,805
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 222
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 222
Applied a total of 10 rules in 4 ms. Remains 57 /62 variables (removed 5) and now considering 222/257 (removed 35) transitions.
// Phase 1: matrix 222 rows 57 cols
[2024-05-21 21:39:57] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 21:39:57] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 21:39:57] [INFO ] Invariant cache hit.
[2024-05-21 21:39:57] [INFO ] State equation strengthened by 117 read => feed constraints.
[2024-05-21 21:39:57] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-05-21 21:39:57] [INFO ] Invariant cache hit.
[2024-05-21 21:39:57] [INFO ] State equation strengthened by 117 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 221/278 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 116/181 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 21:40:03] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 1 ms to minimize.
[2024-05-21 21:40:03] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 1 ms to minimize.
[2024-05-21 21:40:03] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 2 ms to minimize.
[2024-05-21 21:40:05] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 1/279 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 0/279 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 186 constraints, problems are : Problem set: 0 solved, 221 unsolved in 16722 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 221/278 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 116/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 221/406 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 1/279 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 0/279 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 407 constraints, problems are : Problem set: 0 solved, 221 unsolved in 27986 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 4/4 constraints]
After SMT, in 45473ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 45475ms
Starting structural reductions in LTL mode, iteration 1 : 57/62 places, 222/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45701 ms. Remains : 57/62 places, 222/257 transitions.
[2024-05-21 21:40:43] [INFO ] Flatten gal took : 9 ms
[2024-05-21 21:40:43] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:40:43] [INFO ] Input system was already deterministic with 222 transitions.
[2024-05-21 21:40:43] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:40:43] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:40:43] [INFO ] Time to serialize gal into /tmp/CTLFireability10383777012781230895.gal : 2 ms
[2024-05-21 21:40:43] [INFO ] Time to serialize properties into /tmp/CTLFireability11955051993005921227.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/CTLFireability10383777012781230895.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11955051993005921227.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 -...285
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,7.29495e+06,7.94847,169364,2,18985,5,535742,6,0,446,458945,0


Converting to forward existential form...Done !
original formula: ((AX((((EF((p15==1)) * (p1==1)) * ((p5==1)&&(p29==1))) * (p57==1))) + AG(((((p13==0)||(p23==0))||((p30==0)||(p37==0)))||(((p41==0)||(p48=...244
=> equivalent forward existential formula: [(FwdU(((Init * !((E(TRUE U (p36==0)) * E(TRUE U EX((((p1==1)&&(p2==1))&&((p19==1)&&(p57==1)))))))) * !(!(EX(!((...328
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t9, t10, t13, t14, t17, t18, t21, t22, t23, t26, t27, t66, t146, t148, t149, ...447
Detected timeout of ITS tools.
[2024-05-21 21:41:13] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:41:13] [INFO ] Applying decomposition
[2024-05-21 21:41:13] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5850001961404317395.txt' '-o' '/tmp/graph5850001961404317395.bin' '-w' '/tmp/graph5850001961404317395.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5850001961404317395.bin' '-l' '-1' '-v' '-w' '/tmp/graph5850001961404317395.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:41:13] [INFO ] Decomposing Gal with order
[2024-05-21 21:41:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:41:13] [INFO ] Removed a total of 745 redundant transitions.
[2024-05-21 21:41:13] [INFO ] Flatten gal took : 27 ms
[2024-05-21 21:41:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 4 ms.
[2024-05-21 21:41:13] [INFO ] Time to serialize gal into /tmp/CTLFireability8707151537924030781.gal : 1 ms
[2024-05-21 21:41:13] [INFO ] Time to serialize properties into /tmp/CTLFireability11992467300472830001.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/CTLFireability8707151537924030781.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11992467300472830001.ctl'

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 -...263
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,7.29495e+06,0.033814,4344,112,94,888,641,164,1809,64,4586,0


Converting to forward existential form...Done !
original formula: ((AX((((EF((i0.u2.p15==1)) * (u19.p1==1)) * ((u19.p5==1)&&(i3.u8.p29==1))) * (u19.p57==1))) + AG(((((i0.u1.p13==0)||(i1.u5.p23==0))||((i3...336
=> equivalent forward existential formula: [(FwdU(((Init * !((E(TRUE U (i4.u11.p36==0)) * E(TRUE U EX((((u19.p1==1)&&(u19.p2==1))&&((u4.p19==1)&&(u19.p57==...420
Reverse transition relation is NOT exact ! Due to transitions t72, t165, t166, t197, t198, u4.t22, u4.t23, u19.t146, i0.u1.t27, i0.u2.t26, i1.u5.t21, i3.u7...392
(forward)formula 0,1,0.131494,7776,1,0,7793,1184,966,10973,335,4586,14365
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 58 transition count 229
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 229
Applied a total of 8 rules in 3 ms. Remains 58 /62 variables (removed 4) and now considering 229/257 (removed 28) transitions.
// Phase 1: matrix 229 rows 58 cols
[2024-05-21 21:41:13] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 21:41:13] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 21:41:13] [INFO ] Invariant cache hit.
[2024-05-21 21:41:13] [INFO ] State equation strengthened by 123 read => feed constraints.
[2024-05-21 21:41:13] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2024-05-21 21:41:13] [INFO ] Invariant cache hit.
[2024-05-21 21:41:13] [INFO ] State equation strengthened by 123 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (OVERLAPS) 228/286 variables, 58/66 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 122/188 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-21 21:41:18] [INFO ] Deduced a trap composed of 18 places in 227 ms of which 3 ms to minimize.
[2024-05-21 21:41:18] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 2 ms to minimize.
[2024-05-21 21:41:18] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 3/191 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 1/287 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 192 constraints, problems are : Problem set: 0 solved, 228 unsolved in 17225 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 228/286 variables, 58/69 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 122/191 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 228/419 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 1/287 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 420 constraints, problems are : Problem set: 0 solved, 228 unsolved in 27452 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 3/3 constraints]
After SMT, in 45254ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 45257ms
Starting structural reductions in LTL mode, iteration 1 : 58/62 places, 229/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45481 ms. Remains : 58/62 places, 229/257 transitions.
[2024-05-21 21:41:59] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:41:59] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:41:59] [INFO ] Input system was already deterministic with 229 transitions.
[2024-05-21 21:41:59] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:41:59] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:41:59] [INFO ] Time to serialize gal into /tmp/CTLFireability7465033181186165797.gal : 3 ms
[2024-05-21 21:41:59] [INFO ] Time to serialize properties into /tmp/CTLFireability7884627199829873675.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/CTLFireability7465033181186165797.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7884627199829873675.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,8.44459e+06,3.50672,79176,2,7203,5,191633,6,0,457,183827,0


Converting to forward existential form...Done !
original formula: AG(((EF((((p1==1)&&(p7==1))&&((p22==1)&&(p57==1)))) * EX(AF((((p1==1)&&(p8==1))&&((p28==1)&&(p57==1)))))) * (AX(((((p1==1)&&(p9==1))&&((p...310
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(E(TRUE U (((p1==1)&&(p7==1))&&((p22==1)&&(p57==1))))))] = FALSE * [(FwdU(Init,TRUE) * !(...448
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t9, t10, t13, t14, t17, t18, t19, t22, t23, t24, t27, t28, t67, t127, t153, t...362
(forward)formula 0,0,6.5062,100544,1,0,450,379979,475,231,7910,425475,466
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 62 transition count 249
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 54 transition count 249
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 54 transition count 248
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 53 transition count 248
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 23 place count 48 transition count 213
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 48 transition count 213
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 46 transition count 211
Applied a total of 32 rules in 23 ms. Remains 46 /62 variables (removed 16) and now considering 211/257 (removed 46) transitions.
// Phase 1: matrix 211 rows 46 cols
[2024-05-21 21:42:05] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 21:42:05] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-21 21:42:05] [INFO ] Invariant cache hit.
[2024-05-21 21:42:06] [INFO ] State equation strengthened by 117 read => feed constraints.
[2024-05-21 21:42:06] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2024-05-21 21:42:06] [INFO ] Redundant transitions in 3 ms returned []
Running 210 sub problems to find dead transitions.
[2024-05-21 21:42:06] [INFO ] Invariant cache hit.
[2024-05-21 21:42:06] [INFO ] State equation strengthened by 117 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 210/256 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 116/170 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-21 21:42:10] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 1/257 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (OVERLAPS) 0/257 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 172 constraints, problems are : Problem set: 0 solved, 210 unsolved in 14409 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 46/46 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 210/256 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 116/171 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 210/381 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (OVERLAPS) 1/257 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 10 (OVERLAPS) 0/257 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 382 constraints, problems are : Problem set: 0 solved, 210 unsolved in 19817 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 46/46 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 1/1 constraints]
After SMT, in 34878ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 34881ms
Starting structural reductions in SI_CTL mode, iteration 1 : 46/62 places, 211/257 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35178 ms. Remains : 46/62 places, 211/257 transitions.
[2024-05-21 21:42:41] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:42:41] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:42:41] [INFO ] Input system was already deterministic with 211 transitions.
[2024-05-21 21:42:41] [INFO ] Flatten gal took : 18 ms
[2024-05-21 21:42:41] [INFO ] Flatten gal took : 18 ms
[2024-05-21 21:42:41] [INFO ] Time to serialize gal into /tmp/CTLFireability3716004782869550843.gal : 3 ms
[2024-05-21 21:42:41] [INFO ] Time to serialize properties into /tmp/CTLFireability12659717699920600966.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/CTLFireability3716004782869550843.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12659717699920600966.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,1.03942e+06,3.62902,77812,2,10146,5,214395,6,0,391,160804,0


Converting to forward existential form...Done !
original formula: EG((((p1==0)||(p9==0))||((p12==0)||(p57==0))))
=> equivalent forward existential formula: [FwdG(Init,(((p1==0)||(p9==0))||((p12==0)||(p57==0))))] != FALSE
Hit Full ! (commute/partial/dont) 29/0/182
(forward)formula 0,1,27.5587,573552,1,0,74,1.73089e+06,19,4,5262,1.50664e+06,71
FORMULA AutonomousCar-PT-06a-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 62 transition count 251
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 56 transition count 251
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 56 transition count 249
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 54 transition count 249
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 22 place count 48 transition count 207
Iterating global reduction 2 with 6 rules applied. Total rules applied 28 place count 48 transition count 207
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 47 transition count 206
Applied a total of 30 rules in 25 ms. Remains 47 /62 variables (removed 15) and now considering 206/257 (removed 51) transitions.
// Phase 1: matrix 206 rows 47 cols
[2024-05-21 21:43:08] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 21:43:09] [INFO ] Implicit Places using invariants in 147 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 149 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 46/62 places, 206/257 transitions.
Applied a total of 0 rules in 10 ms. Remains 46 /46 variables (removed 0) and now considering 206/206 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 184 ms. Remains : 46/62 places, 206/257 transitions.
[2024-05-21 21:43:09] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:43:09] [INFO ] Flatten gal took : 12 ms
[2024-05-21 21:43:09] [INFO ] Input system was already deterministic with 206 transitions.
[2024-05-21 21:43:09] [INFO ] Flatten gal took : 18 ms
RANDOM walk for 4188 steps (291 resets) in 40 ms. (102 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-06a-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-21 21:43:09] [INFO ] Flatten gal took : 20 ms
[2024-05-21 21:43:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6495094007785325405.gal : 3 ms
[2024-05-21 21:43:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1468032783290324873.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/ReachabilityCardinality6495094007785325405.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1468032783290324873.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 SI_CTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 62 transition count 253
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 58 transition count 251
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 56 transition count 251
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 56 transition count 249
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 54 transition count 249
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 19 place count 51 transition count 228
Iterating global reduction 3 with 3 rules applied. Total rules applied 22 place count 51 transition count 228
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 50 transition count 227
Applied a total of 24 rules in 35 ms. Remains 50 /62 variables (removed 12) and now considering 227/257 (removed 30) transitions.
// Phase 1: matrix 227 rows 50 cols
[2024-05-21 21:43:09] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 21:43:09] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 21:43:09] [INFO ] Invariant cache hit.
[2024-05-21 21:43:09] [INFO ] State equation strengthened by 129 read => feed constraints.
[2024-05-21 21:43:09] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2024-05-21 21:43:09] [INFO ] Redundant transitions in 4 ms returned []
Running 226 sub problems to find dead transitions.
[2024-05-21 21:43:09] [INFO ] Invariant cache hit.
[2024-05-21 21:43:09] [INFO ] State equation strengthened by 129 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 226/276 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 128/186 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-21 21:43:14] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 1 ms to minimize.
[2024-05-21 21:43:16] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (OVERLAPS) 1/277 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (OVERLAPS) 0/277 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 189 constraints, problems are : Problem set: 0 solved, 226 unsolved in 14712 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 50/50 constraints, ReadFeed: 129/129 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (OVERLAPS) 226/276 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 128/188 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 226/414 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 1/277 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (OVERLAPS) 0/277 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 415 constraints, problems are : Problem set: 0 solved, 226 unsolved in 22319 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 50/50 constraints, ReadFeed: 129/129 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 2/2 constraints]
After SMT, in 37875ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 37879ms
Starting structural reductions in SI_CTL mode, iteration 1 : 50/62 places, 227/257 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38209 ms. Remains : 50/62 places, 227/257 transitions.
[2024-05-21 21:43:47] [INFO ] Flatten gal took : 12 ms
[2024-05-21 21:43:47] [INFO ] Flatten gal took : 13 ms
[2024-05-21 21:43:47] [INFO ] Input system was already deterministic with 227 transitions.
[2024-05-21 21:43:47] [INFO ] Flatten gal took : 13 ms
[2024-05-21 21:43:47] [INFO ] Flatten gal took : 13 ms
[2024-05-21 21:43:47] [INFO ] Time to serialize gal into /tmp/CTLFireability10103567460743340479.gal : 2 ms
[2024-05-21 21:43:47] [INFO ] Time to serialize properties into /tmp/CTLFireability16935859882671582205.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/CTLFireability10103567460743340479.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16935859882671582205.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 -...285
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,2.09893e+06,2.85529,76260,2,5136,5,175467,6,0,423,194524,0


Converting to forward existential form...Done !
original formula: AF((((EG((EF((((p1==1)&&(p7==1))&&((p50==1)&&(p57==1)))) + ((((p13==1)&&(p20==1))&&((p27==1)&&(p37==1)))&&(((p44==1)&&(p51==1))&&(p58==1)...412
=> equivalent forward existential formula: [FwdG(Init,!((((EG((E(TRUE U (((p1==1)&&(p7==1))&&((p50==1)&&(p57==1)))) + ((((p13==1)&&(p20==1))&&((p27==1)&&(p...576
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t8, t9, t10, t11, t12, t14, t15, t17, t18, t19, t75, t117, t141, t169, t1...319
Detected timeout of ITS tools.
[2024-05-21 21:44:17] [INFO ] Flatten gal took : 13 ms
[2024-05-21 21:44:17] [INFO ] Applying decomposition
[2024-05-21 21:44:17] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11976342560005700439.txt' '-o' '/tmp/graph11976342560005700439.bin' '-w' '/tmp/graph11976342560005700439.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11976342560005700439.bin' '-l' '-1' '-v' '-w' '/tmp/graph11976342560005700439.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:44:17] [INFO ] Decomposing Gal with order
[2024-05-21 21:44:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:44:17] [INFO ] Removed a total of 724 redundant transitions.
[2024-05-21 21:44:17] [INFO ] Flatten gal took : 23 ms
[2024-05-21 21:44:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 3 ms.
[2024-05-21 21:44:17] [INFO ] Time to serialize gal into /tmp/CTLFireability9507699895747230171.gal : 1 ms
[2024-05-21 21:44:17] [INFO ] Time to serialize properties into /tmp/CTLFireability12742311979496114503.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/CTLFireability9507699895747230171.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12742311979496114503.ctl'

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 -...263
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,2.09893e+06,0.070972,5020,147,138,2618,765,104,4137,71,4525,0


Converting to forward existential form...Done !
original formula: AF((((EG((EF((((u0.p1==1)&&(u0.p7==1))&&((i6.u12.p50==1)&&(u0.p57==1)))) + ((((i1.u1.p13==1)&&(i2.u3.p20==1))&&((i3.u5.p27==1)&&(i4.u8.p3...565
=> equivalent forward existential formula: [FwdG(Init,!((((EG((E(TRUE U (((u0.p1==1)&&(u0.p7==1))&&((i6.u12.p50==1)&&(u0.p57==1)))) + ((((i1.u1.p13==1)&&(i...759
Reverse transition relation is NOT exact ! Due to transitions t95, t119, t125, t181, t222, u13.t217, u13.t218, u13.t223, u13.t224, i1.u1.t18, i1.u1.t19, i1...390
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 7
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 7
(forward)formula 0,0,1.40291,50164,1,0,108793,2476,702,139103,399,17533,136543
FORMULA AutonomousCar-PT-06a-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

[2024-05-21 21:44:19] [INFO ] Flatten gal took : 12 ms
[2024-05-21 21:44:19] [INFO ] Flatten gal took : 12 ms
[2024-05-21 21:44:19] [INFO ] Applying decomposition
[2024-05-21 21:44:19] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11681344076893867295.txt' '-o' '/tmp/graph11681344076893867295.bin' '-w' '/tmp/graph11681344076893867295.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11681344076893867295.bin' '-l' '-1' '-v' '-w' '/tmp/graph11681344076893867295.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:44:19] [INFO ] Decomposing Gal with order
[2024-05-21 21:44:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:44:19] [INFO ] Removed a total of 800 redundant transitions.
[2024-05-21 21:44:19] [INFO ] Flatten gal took : 42 ms
[2024-05-21 21:44:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 5 ms.
[2024-05-21 21:44:19] [INFO ] Time to serialize gal into /tmp/CTLFireability240061041400833429.gal : 2 ms
[2024-05-21 21:44:19] [INFO ] Time to serialize properties into /tmp/CTLFireability12857700650889731424.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/CTLFireability240061041400833429.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12857700650889731424.ctl'

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 -...262
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,1.51682e+07,0.100739,5428,171,135,3362,979,146,5980,64,5747,0


Converting to forward existential form...Done !
original formula: AX(A((((u0.p1==1)&&(u0.p5==1))&&((i4.u10.p31==1)&&(u0.p57==1))) U !(EF((((u0.p1==1)&&(u0.p5==1))&&((i5.u14.p40==1)&&(u0.p57==1)))))))
=> equivalent forward existential formula: ([(FwdU((FwdU(EY(Init),!(!(E(TRUE U (((u0.p1==1)&&(u0.p5==1))&&((i5.u14.p40==1)&&(u0.p57==1))))))) * !((((u0.p1=...386
Reverse transition relation is NOT exact ! Due to transitions t47, t59, t83, t119, t149, t173, u0.t181, i1.u2.t31, i1.u2.t32, i1.u3.t30, i2.u5.t26, i2.u5.t...459
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 7
(forward)formula 0,0,1.63209,53212,1,0,107021,1714,906,162410,342,11710,133098
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Total runtime 1046153 ms.

BK_STOP 1716327860844

--------------------
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-06a"
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-06a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026-smll-171620167400298"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-06a.tgz
mv AutonomousCar-PT-06a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;