About the Execution of ITS-Tools for AutonomousCar-PT-06b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3029.571 | 1145166.00 | 1208629.00 | 4050.00 | TFFTTFTFFTTFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r294-smll-165463873000498.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is AutonomousCar-PT-06b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463873000498
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 4.9K Jun 7 15:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Jun 7 15:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Jun 7 15:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Jun 7 15:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 3 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 3 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 3 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 3 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 3 16:02 NewModel
-rw-r--r-- 1 mcc users 9.6K Jun 7 15:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 7 15:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 7 15:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 7 15:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 3 16:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 3 16:02 instance
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 iscolored
-rw-r--r-- 1 mcc users 228K Jun 3 16:02 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-06b-CTLFireability-00
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-01
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-02
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-03
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-04
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-05
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-06
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-07
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-08
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-09
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-10
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-11
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-12
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-13
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-14
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1654901484216
Running Version 202205111006
[2022-06-10 22:51:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-10 22:51:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 22:51:27] [INFO ] Load time of PNML (sax parser for PT used): 313 ms
[2022-06-10 22:51:27] [INFO ] Transformed 289 places.
[2022-06-10 22:51:27] [INFO ] Transformed 644 transitions.
[2022-06-10 22:51:27] [INFO ] Found NUPN structural information;
[2022-06-10 22:51:27] [INFO ] Parsed PT model containing 289 places and 644 transitions in 587 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
Support contains 77 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 644/644 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 259 transition count 614
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 259 transition count 614
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 204 place count 259 transition count 470
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 206 place count 257 transition count 468
Iterating global reduction 1 with 2 rules applied. Total rules applied 208 place count 257 transition count 468
Applied a total of 208 rules in 134 ms. Remains 257 /289 variables (removed 32) and now considering 468/644 (removed 176) transitions.
// Phase 1: matrix 468 rows 257 cols
[2022-06-10 22:51:27] [INFO ] Computed 11 place invariants in 39 ms
[2022-06-10 22:51:28] [INFO ] Implicit Places using invariants in 435 ms returned []
// Phase 1: matrix 468 rows 257 cols
[2022-06-10 22:51:28] [INFO ] Computed 11 place invariants in 8 ms
[2022-06-10 22:51:28] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 929 ms to find 0 implicit places.
// Phase 1: matrix 468 rows 257 cols
[2022-06-10 22:51:28] [INFO ] Computed 11 place invariants in 8 ms
[2022-06-10 22:51:29] [INFO ] Dead Transitions using invariants and state equation in 552 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 257/289 places, 468/644 transitions.
Finished structural reductions, in 1 iterations. Remains : 257/289 places, 468/644 transitions.
Support contains 77 out of 257 places after structural reductions.
[2022-06-10 22:51:29] [INFO ] Flatten gal took : 174 ms
[2022-06-10 22:51:29] [INFO ] Flatten gal took : 92 ms
[2022-06-10 22:51:29] [INFO ] Input system was already deterministic with 468 transitions.
Incomplete random walk after 10000 steps, including 25 resets, run finished after 902 ms. (steps per millisecond=11 ) properties (out of 68) seen :35
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 33) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Running SMT prover for 31 properties.
// Phase 1: matrix 468 rows 257 cols
[2022-06-10 22:51:31] [INFO ] Computed 11 place invariants in 4 ms
[2022-06-10 22:51:32] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2022-06-10 22:51:32] [INFO ] After 791ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:31
[2022-06-10 22:51:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2022-06-10 22:51:34] [INFO ] After 1450ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :27
[2022-06-10 22:51:35] [INFO ] Deduced a trap composed of 21 places in 258 ms of which 9 ms to minimize.
[2022-06-10 22:51:35] [INFO ] Deduced a trap composed of 33 places in 250 ms of which 2 ms to minimize.
[2022-06-10 22:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 574 ms
[2022-06-10 22:51:36] [INFO ] Deduced a trap composed of 33 places in 275 ms of which 3 ms to minimize.
[2022-06-10 22:51:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 302 ms
[2022-06-10 22:51:37] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 1 ms to minimize.
[2022-06-10 22:51:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2022-06-10 22:51:37] [INFO ] After 4416ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :25
Attempting to minimize the solution found.
Minimization took 899 ms.
[2022-06-10 22:51:38] [INFO ] After 5831ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :25
Fused 31 Parikh solutions to 25 different solutions.
Parikh walk visited 0 properties in 393 ms.
Support contains 36 out of 257 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 257/257 places, 468/468 transitions.
Graph (trivial) has 192 edges and 257 vertex of which 2 / 257 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 894 edges and 256 vertex of which 253 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 93 rules applied. Total rules applied 95 place count 253 transition count 371
Reduce places removed 92 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 121 rules applied. Total rules applied 216 place count 161 transition count 342
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 17 rules applied. Total rules applied 233 place count 145 transition count 341
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 234 place count 144 transition count 341
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 234 place count 144 transition count 330
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 256 place count 133 transition count 330
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 264 place count 125 transition count 322
Iterating global reduction 4 with 8 rules applied. Total rules applied 272 place count 125 transition count 322
Performed 31 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 334 place count 94 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 335 place count 94 transition count 289
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 336 place count 93 transition count 288
Iterating global reduction 5 with 1 rules applied. Total rules applied 337 place count 93 transition count 288
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 5 with 2 rules applied. Total rules applied 339 place count 92 transition count 287
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 341 place count 92 transition count 285
Free-agglomeration rule applied 15 times.
Iterating global reduction 5 with 15 rules applied. Total rules applied 356 place count 92 transition count 270
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 371 place count 77 transition count 270
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 376 place count 77 transition count 270
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 377 place count 76 transition count 263
Iterating global reduction 6 with 1 rules applied. Total rules applied 378 place count 76 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 379 place count 75 transition count 262
Applied a total of 379 rules in 155 ms. Remains 75 /257 variables (removed 182) and now considering 262/468 (removed 206) transitions.
Finished structural reductions, in 1 iterations. Remains : 75/257 places, 262/468 transitions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 518 ms. (steps per millisecond=19 ) properties (out of 25) seen :13
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :1
Running SMT prover for 4 properties.
// Phase 1: matrix 262 rows 75 cols
[2022-06-10 22:51:40] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-10 22:51:40] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-06-10 22:51:40] [INFO ] After 318ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-10 22:51:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-06-10 22:51:41] [INFO ] After 246ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-10 22:51:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:51:41] [INFO ] After 142ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-10 22:51:41] [INFO ] After 303ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 134 ms.
[2022-06-10 22:51:41] [INFO ] After 749ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 24 ms.
Support contains 10 out of 75 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 75/75 places, 262/262 transitions.
Graph (trivial) has 42 edges and 75 vertex of which 2 / 75 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 558 edges and 74 vertex of which 73 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 73 transition count 257
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 70 transition count 257
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 8 place count 70 transition count 254
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 67 transition count 254
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 65 transition count 247
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 65 transition count 247
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 25 place count 65 transition count 240
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 39 place count 58 transition count 233
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 40 place count 57 transition count 226
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 57 transition count 226
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 53 place count 51 transition count 220
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 56 place count 51 transition count 217
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 65 place count 48 transition count 211
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 47 transition count 210
Applied a total of 66 rules in 54 ms. Remains 47 /75 variables (removed 28) and now considering 210/262 (removed 52) transitions.
Finished structural reductions, in 1 iterations. Remains : 47/75 places, 210/262 transitions.
Incomplete random walk after 10000 steps, including 363 resets, run finished after 567 ms. (steps per millisecond=17 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
// Phase 1: matrix 210 rows 47 cols
[2022-06-10 22:51:42] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-10 22:51:42] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2022-06-10 22:51:42] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 22:51:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-10 22:51:42] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-10 22:51:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:51:42] [INFO ] After 47ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-10 22:51:42] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 41 ms.
[2022-06-10 22:51:42] [INFO ] After 284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 47 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 47/47 places, 210/210 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 209
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 46 transition count 209
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 45 transition count 203
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 45 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 45 transition count 202
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 45 transition count 200
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 15 place count 43 transition count 194
Applied a total of 15 rules in 25 ms. Remains 43 /47 variables (removed 4) and now considering 194/210 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 43/47 places, 194/210 transitions.
Incomplete random walk after 10000 steps, including 183 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 194 rows 43 cols
[2022-06-10 22:51:42] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-10 22:51:43] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-10 22:51:43] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 22:51:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-10 22:51:43] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 22:51:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:51:43] [INFO ] After 29ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 22:51:43] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-06-10 22:51:43] [INFO ] After 245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 43/43 places, 194/194 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 43 transition count 193
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 42 transition count 187
Applied a total of 8 rules in 15 ms. Remains 42 /43 variables (removed 1) and now considering 187/194 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 42/43 places, 187/194 transitions.
Incomplete random walk after 10000 steps, including 110 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 115794 steps, run visited all 1 properties in 525 ms. (steps per millisecond=220 )
Probabilistic random walk after 115794 steps, saw 19874 distinct states, run finished after 526 ms. (steps per millisecond=220 ) properties seen :1
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
[2022-06-10 22:51:44] [INFO ] Flatten gal took : 44 ms
[2022-06-10 22:51:44] [INFO ] Flatten gal took : 45 ms
[2022-06-10 22:51:44] [INFO ] Input system was already deterministic with 468 transitions.
Computed a total of 44 stabilizing places and 45 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 468/468 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 240 transition count 451
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 240 transition count 451
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 236 transition count 447
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 236 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 235 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 235 transition count 446
Applied a total of 44 rules in 29 ms. Remains 235 /257 variables (removed 22) and now considering 446/468 (removed 22) transitions.
// Phase 1: matrix 446 rows 235 cols
[2022-06-10 22:51:44] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-10 22:51:44] [INFO ] Implicit Places using invariants in 144 ms returned []
// Phase 1: matrix 446 rows 235 cols
[2022-06-10 22:51:44] [INFO ] Computed 11 place invariants in 5 ms
[2022-06-10 22:51:44] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
// Phase 1: matrix 446 rows 235 cols
[2022-06-10 22:51:44] [INFO ] Computed 11 place invariants in 7 ms
[2022-06-10 22:51:45] [INFO ] Dead Transitions using invariants and state equation in 449 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/257 places, 446/468 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/257 places, 446/468 transitions.
[2022-06-10 22:51:45] [INFO ] Flatten gal took : 52 ms
[2022-06-10 22:51:45] [INFO ] Flatten gal took : 55 ms
[2022-06-10 22:51:45] [INFO ] Input system was already deterministic with 446 transitions.
[2022-06-10 22:51:45] [INFO ] Flatten gal took : 49 ms
[2022-06-10 22:51:45] [INFO ] Flatten gal took : 63 ms
[2022-06-10 22:51:45] [INFO ] Time to serialize gal into /tmp/CTLFireability3300679562838109132.gal : 39 ms
[2022-06-10 22:51:45] [INFO ] Time to serialize properties into /tmp/CTLFireability14954574851023909042.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3300679562838109132.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14954574851023909042.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-06-10 22:52:15] [INFO ] Flatten gal took : 43 ms
[2022-06-10 22:52:15] [INFO ] Applying decomposition
[2022-06-10 22:52:15] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17072767686252374662.txt' '-o' '/tmp/graph17072767686252374662.bin' '-w' '/tmp/graph17072767686252374662.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17072767686252374662.bin' '-l' '-1' '-v' '-w' '/tmp/graph17072767686252374662.weights' '-q' '0' '-e' '0.001'
[2022-06-10 22:52:16] [INFO ] Decomposing Gal with order
[2022-06-10 22:52:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 22:52:16] [INFO ] Removed a total of 852 redundant transitions.
[2022-06-10 22:52:16] [INFO ] Flatten gal took : 217 ms
[2022-06-10 22:52:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 43 ms.
[2022-06-10 22:52:16] [INFO ] Time to serialize gal into /tmp/CTLFireability2864719959305411349.gal : 17 ms
[2022-06-10 22:52:16] [INFO ] Time to serialize properties into /tmp/CTLFireability1010040525342971170.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2864719959305411349.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1010040525342971170.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
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.03205e+12,0.374823,11136,662,115,12525,1800,552,16786,90,6093,0
Converting to forward existential form...Done !
original formula: AG(EF(AX(EF((i4.i0.u24.p76==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!(E(TRUE U (i4.i0.u24.p76==0))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t220, t222, t226, t250, t274, t298, t340, t364, t443, i0.u76.t33, i0.u76.t36, i0.u76.t37, i0....822
(forward)formula 0,1,0.937553,20028,1,0,34650,1800,4139,36042,443,6093,113582
FORMULA AutonomousCar-PT-06b-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 468/468 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 240 transition count 451
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 240 transition count 451
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 236 transition count 447
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 236 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 235 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 235 transition count 446
Applied a total of 44 rules in 41 ms. Remains 235 /257 variables (removed 22) and now considering 446/468 (removed 22) transitions.
// Phase 1: matrix 446 rows 235 cols
[2022-06-10 22:52:17] [INFO ] Computed 11 place invariants in 4 ms
[2022-06-10 22:52:17] [INFO ] Implicit Places using invariants in 183 ms returned []
// Phase 1: matrix 446 rows 235 cols
[2022-06-10 22:52:17] [INFO ] Computed 11 place invariants in 4 ms
[2022-06-10 22:52:18] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
// Phase 1: matrix 446 rows 235 cols
[2022-06-10 22:52:18] [INFO ] Computed 11 place invariants in 4 ms
[2022-06-10 22:52:18] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/257 places, 446/468 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/257 places, 446/468 transitions.
[2022-06-10 22:52:18] [INFO ] Flatten gal took : 35 ms
[2022-06-10 22:52:18] [INFO ] Flatten gal took : 40 ms
[2022-06-10 22:52:18] [INFO ] Input system was already deterministic with 446 transitions.
[2022-06-10 22:52:18] [INFO ] Flatten gal took : 41 ms
[2022-06-10 22:52:18] [INFO ] Flatten gal took : 33 ms
[2022-06-10 22:52:18] [INFO ] Time to serialize gal into /tmp/CTLFireability11538776201920455932.gal : 9 ms
[2022-06-10 22:52:18] [INFO ] Time to serialize properties into /tmp/CTLFireability17888412354307960305.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11538776201920455932.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17888412354307960305.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-06-10 22:52:49] [INFO ] Flatten gal took : 20 ms
[2022-06-10 22:52:49] [INFO ] Applying decomposition
[2022-06-10 22:52:49] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7838749535538830375.txt' '-o' '/tmp/graph7838749535538830375.bin' '-w' '/tmp/graph7838749535538830375.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7838749535538830375.bin' '-l' '-1' '-v' '-w' '/tmp/graph7838749535538830375.weights' '-q' '0' '-e' '0.001'
[2022-06-10 22:52:49] [INFO ] Decomposing Gal with order
[2022-06-10 22:52:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 22:52:49] [INFO ] Removed a total of 844 redundant transitions.
[2022-06-10 22:52:49] [INFO ] Flatten gal took : 54 ms
[2022-06-10 22:52:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 19 ms.
[2022-06-10 22:52:49] [INFO ] Time to serialize gal into /tmp/CTLFireability13016374629190921007.gal : 5 ms
[2022-06-10 22:52:49] [INFO ] Time to serialize properties into /tmp/CTLFireability10601164916348459078.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13016374629190921007.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10601164916348459078.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
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.03205e+12,0.482176,13648,718,115,17135,1963,588,27323,88,10615,0
Converting to forward existential form...Done !
original formula: EG(AX(AF((((u1.p6==1)&&(u1.p16==1))&&((i9.i0.u45.p148==1)&&(u1.p246==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(!(EG(!((((u1.p6==1)&&(u1.p16==1))&&((i9.i0.u45.p148==1)&&(u1.p246==1))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t220, t222, t232, t250, t274, t304, t340, t364, t443, i0.u72.t33, i0.u72.t36, i0.u72.t37, i0....825
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
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
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 1
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 468/468 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 243 transition count 454
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 243 transition count 454
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 240 transition count 451
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 240 transition count 451
Applied a total of 34 rules in 18 ms. Remains 240 /257 variables (removed 17) and now considering 451/468 (removed 17) transitions.
// Phase 1: matrix 451 rows 240 cols
[2022-06-10 22:53:19] [INFO ] Computed 11 place invariants in 3 ms
[2022-06-10 22:53:19] [INFO ] Implicit Places using invariants in 167 ms returned []
// Phase 1: matrix 451 rows 240 cols
[2022-06-10 22:53:19] [INFO ] Computed 11 place invariants in 4 ms
[2022-06-10 22:53:19] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
// Phase 1: matrix 451 rows 240 cols
[2022-06-10 22:53:20] [INFO ] Computed 11 place invariants in 9 ms
[2022-06-10 22:53:20] [INFO ] Dead Transitions using invariants and state equation in 347 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 240/257 places, 451/468 transitions.
Finished structural reductions, in 1 iterations. Remains : 240/257 places, 451/468 transitions.
[2022-06-10 22:53:20] [INFO ] Flatten gal took : 27 ms
[2022-06-10 22:53:20] [INFO ] Flatten gal took : 24 ms
[2022-06-10 22:53:20] [INFO ] Input system was already deterministic with 451 transitions.
[2022-06-10 22:53:20] [INFO ] Flatten gal took : 19 ms
[2022-06-10 22:53:20] [INFO ] Flatten gal took : 18 ms
[2022-06-10 22:53:20] [INFO ] Time to serialize gal into /tmp/CTLFireability6459226193596191624.gal : 5 ms
[2022-06-10 22:53:20] [INFO ] Time to serialize properties into /tmp/CTLFireability6450722036877765571.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6459226193596191624.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6450722036877765571.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-06-10 22:53:50] [INFO ] Flatten gal took : 19 ms
[2022-06-10 22:53:50] [INFO ] Applying decomposition
[2022-06-10 22:53:50] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10714895956456020522.txt' '-o' '/tmp/graph10714895956456020522.bin' '-w' '/tmp/graph10714895956456020522.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10714895956456020522.bin' '-l' '-1' '-v' '-w' '/tmp/graph10714895956456020522.weights' '-q' '0' '-e' '0.001'
[2022-06-10 22:53:50] [INFO ] Decomposing Gal with order
[2022-06-10 22:53:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 22:53:50] [INFO ] Removed a total of 858 redundant transitions.
[2022-06-10 22:53:50] [INFO ] Flatten gal took : 65 ms
[2022-06-10 22:53:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 7 ms.
[2022-06-10 22:53:50] [INFO ] Time to serialize gal into /tmp/CTLFireability3460576250955909161.gal : 4 ms
[2022-06-10 22:53:50] [INFO ] Time to serialize properties into /tmp/CTLFireability646249883198854015.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3460576250955909161.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability646249883198854015.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...252
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.2039e+12,1.12241,40656,1553,116,68065,1180,571,253405,91,6757,0
Converting to forward existential form...Done !
original formula: AX(((i8.u45.p141==1) + A(((EX((((u1.p6==1)&&(u1.p14==1))&&((i7.u34.p120==1)&&(u1.p246==1)))) * (i15.u83.p268!=1)) * ((i6.i1.i1.u38.p100==...299
=> equivalent forward existential formula: ([FwdG((FwdU((EY(Init) * !((i8.u45.p141==1))),!(!(EG(!(!(EX(!((((u1.p6==1)&&(u1.p15==1))&&((i7.u58.p179==1)&&(u1...584
Reverse transition relation is NOT exact ! Due to transitions t166, t224, t226, t234, t252, t276, t306, t342, t366, t448, i2.t217, i2.u12.t197, i2.u16.t201...766
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
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
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 SI_CTL mode, iteration 0 : 257/257 places, 468/468 transitions.
Graph (trivial) has 232 edges and 257 vertex of which 4 / 257 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 254 transition count 369
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 128 rules applied. Total rules applied 225 place count 158 transition count 337
Reduce places removed 19 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 22 rules applied. Total rules applied 247 place count 139 transition count 334
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 251 place count 136 transition count 333
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 251 place count 136 transition count 325
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 267 place count 128 transition count 325
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 278 place count 117 transition count 314
Iterating global reduction 4 with 11 rules applied. Total rules applied 289 place count 117 transition count 314
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 291 place count 117 transition count 312
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 292 place count 116 transition count 312
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 294 place count 114 transition count 300
Iterating global reduction 6 with 2 rules applied. Total rules applied 296 place count 114 transition count 300
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 4 rules applied. Total rules applied 300 place count 114 transition count 296
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 302 place count 112 transition count 296
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 8 with 74 rules applied. Total rules applied 376 place count 75 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 378 place count 75 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 379 place count 74 transition count 257
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 387 place count 66 transition count 209
Iterating global reduction 10 with 8 rules applied. Total rules applied 395 place count 66 transition count 209
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 3 rules applied. Total rules applied 398 place count 66 transition count 206
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 11 with 2 rules applied. Total rules applied 400 place count 65 transition count 205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 401 place count 64 transition count 205
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 402 place count 64 transition count 204
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 403 place count 63 transition count 203
Applied a total of 403 rules in 102 ms. Remains 63 /257 variables (removed 194) and now considering 203/468 (removed 265) transitions.
// Phase 1: matrix 203 rows 63 cols
[2022-06-10 22:54:20] [INFO ] Computed 10 place invariants in 1 ms
[2022-06-10 22:54:21] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 203 rows 63 cols
[2022-06-10 22:54:21] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-10 22:54:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:54:21] [INFO ] Implicit Places using invariants and state equation in 140 ms returned [56, 62]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 212 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 61/257 places, 203/468 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 202
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 60 transition count 202
Applied a total of 2 rules in 23 ms. Remains 60 /61 variables (removed 1) and now considering 202/203 (removed 1) transitions.
// Phase 1: matrix 202 rows 60 cols
[2022-06-10 22:54:21] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 22:54:21] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 202 rows 60 cols
[2022-06-10 22:54:21] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 22:54:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:54:21] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 60/257 places, 202/468 transitions.
Finished structural reductions, in 2 iterations. Remains : 60/257 places, 202/468 transitions.
[2022-06-10 22:54:21] [INFO ] Flatten gal took : 21 ms
[2022-06-10 22:54:21] [INFO ] Flatten gal took : 16 ms
[2022-06-10 22:54:21] [INFO ] Input system was already deterministic with 202 transitions.
[2022-06-10 22:54:21] [INFO ] Flatten gal took : 16 ms
[2022-06-10 22:54:21] [INFO ] Flatten gal took : 21 ms
[2022-06-10 22:54:21] [INFO ] Time to serialize gal into /tmp/CTLFireability3553082647215977822.gal : 4 ms
[2022-06-10 22:54:21] [INFO ] Time to serialize properties into /tmp/CTLFireability113097760341431538.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3553082647215977822.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability113097760341431538.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...273
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.8636e+07,14.743,311652,2,17488,5,911298,6,0,439,768539,0
Converting to forward existential form...Done !
original formula: EF(((EF(((((p6==1)&&(p17==1))&&((p70==1)&&(p246==1)))&&(p216==1))) * EG(((((p6==0)||(p9==0))||((p213==0)||(p246==0)))&&(p245==0)))) * (AG...217
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (E(TRUE U ((((p6==1)&&(p17==1))&&((p70==1)&&(p246==1)))&&(p216==1))) * EG(((((p6==0)||(p9=...456
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t4, t5, t6, t7, t8, t10, t12, t14, t16, t18, t24, t26, t31, t33, t39, t40, t41, t...430
Detected timeout of ITS tools.
[2022-06-10 22:54:51] [INFO ] Flatten gal took : 15 ms
[2022-06-10 22:54:51] [INFO ] Applying decomposition
[2022-06-10 22:54:51] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7563874675980497805.txt' '-o' '/tmp/graph7563874675980497805.bin' '-w' '/tmp/graph7563874675980497805.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7563874675980497805.bin' '-l' '-1' '-v' '-w' '/tmp/graph7563874675980497805.weights' '-q' '0' '-e' '0.001'
[2022-06-10 22:54:51] [INFO ] Decomposing Gal with order
[2022-06-10 22:54:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 22:54:51] [INFO ] Removed a total of 664 redundant transitions.
[2022-06-10 22:54:51] [INFO ] Flatten gal took : 28 ms
[2022-06-10 22:54:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 3 ms.
[2022-06-10 22:54:51] [INFO ] Time to serialize gal into /tmp/CTLFireability1224155999791715150.gal : 1 ms
[2022-06-10 22:54:51] [INFO ] Time to serialize properties into /tmp/CTLFireability3655102482806624626.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1224155999791715150.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3655102482806624626.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
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.8636e+07,0.188815,8496,351,105,7753,721,205,15518,80,3720,0
Converting to forward existential form...Done !
original formula: EF(((EF(((((i0.u0.p6==1)&&(i0.u0.p17==1))&&((i1.u4.p70==1)&&(i0.u0.p246==1)))&&(i2.u17.p216==1))) * EG(((((i0.u0.p6==0)||(i0.u1.p9==0))||...309
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (E(TRUE U ((((i0.u0.p6==1)&&(i0.u0.p17==1))&&((i1.u4.p70==1)&&(i0.u0.p246==1)))&&(i2.u17.p...610
Reverse transition relation is NOT exact ! Due to transitions t5, t88, t90, t92, t94, t192, t200, u18.t0, u18.t2, u18.t3, u18.t4, u18.t105, i0.t106, i0.u1....408
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
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 5
(forward)formula 0,1,5.87848,153612,1,0,180190,2469,1172,1.22833e+06,465,16106,168096
FORMULA AutonomousCar-PT-06b-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 257/257 places, 468/468 transitions.
Graph (trivial) has 243 edges and 257 vertex of which 4 / 257 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 105 place count 254 transition count 361
Reduce places removed 104 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 140 rules applied. Total rules applied 245 place count 150 transition count 325
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 266 place count 129 transition count 325
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 266 place count 129 transition count 317
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 282 place count 121 transition count 317
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 292 place count 111 transition count 307
Iterating global reduction 3 with 10 rules applied. Total rules applied 302 place count 111 transition count 307
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 306 place count 107 transition count 283
Iterating global reduction 3 with 4 rules applied. Total rules applied 310 place count 107 transition count 283
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 8 rules applied. Total rules applied 318 place count 107 transition count 275
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 322 place count 103 transition count 275
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 5 with 76 rules applied. Total rules applied 398 place count 65 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 399 place count 65 transition count 236
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 407 place count 57 transition count 188
Iterating global reduction 6 with 8 rules applied. Total rules applied 415 place count 57 transition count 188
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 4 rules applied. Total rules applied 419 place count 57 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 421 place count 55 transition count 184
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 8 with 2 rules applied. Total rules applied 423 place count 54 transition count 183
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 424 place count 54 transition count 182
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 426 place count 52 transition count 180
Applied a total of 426 rules in 68 ms. Remains 52 /257 variables (removed 205) and now considering 180/468 (removed 288) transitions.
// Phase 1: matrix 180 rows 52 cols
[2022-06-10 22:54:57] [INFO ] Computed 10 place invariants in 1 ms
[2022-06-10 22:54:57] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 180 rows 52 cols
[2022-06-10 22:54:57] [INFO ] Computed 10 place invariants in 6 ms
[2022-06-10 22:54:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:54:57] [INFO ] Implicit Places using invariants and state equation in 147 ms returned [45, 51]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 228 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 50/257 places, 180/468 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 50 transition count 179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 49 transition count 179
Applied a total of 2 rules in 7 ms. Remains 49 /50 variables (removed 1) and now considering 179/180 (removed 1) transitions.
// Phase 1: matrix 179 rows 49 cols
[2022-06-10 22:54:57] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 22:54:58] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 179 rows 49 cols
[2022-06-10 22:54:58] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 22:54:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:54:58] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 49/257 places, 179/468 transitions.
Finished structural reductions, in 2 iterations. Remains : 49/257 places, 179/468 transitions.
[2022-06-10 22:54:58] [INFO ] Flatten gal took : 24 ms
[2022-06-10 22:54:58] [INFO ] Flatten gal took : 20 ms
[2022-06-10 22:54:58] [INFO ] Input system was already deterministic with 179 transitions.
[2022-06-10 22:54:58] [INFO ] Flatten gal took : 19 ms
[2022-06-10 22:54:58] [INFO ] Flatten gal took : 20 ms
[2022-06-10 22:54:58] [INFO ] Time to serialize gal into /tmp/CTLFireability5122638449608954556.gal : 4 ms
[2022-06-10 22:54:58] [INFO ] Time to serialize properties into /tmp/CTLFireability3953152593873342851.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5122638449608954556.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3953152593873342851.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
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,3.61884e+06,9.1384,192176,2,9184,5,495792,6,0,373,444579,0
Converting to forward existential form...Done !
original formula: EG((((p6==0)||(p17==0))||((p55==0)||(p246==0))))
=> equivalent forward existential formula: [FwdG(Init,(((p6==0)||(p17==0))||((p55==0)||(p246==0))))] != FALSE
Hit Full ! (commute/partial/dont) 34/0/145
Detected timeout of ITS tools.
[2022-06-10 22:55:28] [INFO ] Flatten gal took : 13 ms
[2022-06-10 22:55:28] [INFO ] Applying decomposition
[2022-06-10 22:55:28] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5319868240157222735.txt' '-o' '/tmp/graph5319868240157222735.bin' '-w' '/tmp/graph5319868240157222735.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5319868240157222735.bin' '-l' '-1' '-v' '-w' '/tmp/graph5319868240157222735.weights' '-q' '0' '-e' '0.001'
[2022-06-10 22:55:28] [INFO ] Decomposing Gal with order
[2022-06-10 22:55:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 22:55:28] [INFO ] Removed a total of 650 redundant transitions.
[2022-06-10 22:55:28] [INFO ] Flatten gal took : 23 ms
[2022-06-10 22:55:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 2 ms.
[2022-06-10 22:55:28] [INFO ] Time to serialize gal into /tmp/CTLFireability12487609961606529527.gal : 1 ms
[2022-06-10 22:55:28] [INFO ] Time to serialize properties into /tmp/CTLFireability7617003435166029073.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12487609961606529527.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7617003435166029073.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
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,3.61884e+06,0.022463,4932,90,49,897,260,127,1630,61,783,0
Converting to forward existential form...Done !
original formula: EG((((i6.u0.p6==0)||(i6.u0.p17==0))||((i0.u1.p55==0)||(i6.u14.p246==0))))
=> equivalent forward existential formula: [FwdG(Init,(((i6.u0.p6==0)||(i6.u0.p17==0))||((i0.u1.p55==0)||(i6.u14.p246==0))))] != FALSE
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 an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 7
(forward)formula 0,1,0.096816,8008,1,0,6104,969,441,13052,280,5619,9281
FORMULA AutonomousCar-PT-06b-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 468/468 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 241 transition count 452
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 241 transition count 452
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 238 transition count 449
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 238 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 237 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 237 transition count 448
Applied a total of 40 rules in 23 ms. Remains 237 /257 variables (removed 20) and now considering 448/468 (removed 20) transitions.
// Phase 1: matrix 448 rows 237 cols
[2022-06-10 22:55:28] [INFO ] Computed 11 place invariants in 1 ms
[2022-06-10 22:55:28] [INFO ] Implicit Places using invariants in 157 ms returned []
// Phase 1: matrix 448 rows 237 cols
[2022-06-10 22:55:28] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-10 22:55:29] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
// Phase 1: matrix 448 rows 237 cols
[2022-06-10 22:55:29] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-10 22:55:29] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/257 places, 448/468 transitions.
Finished structural reductions, in 1 iterations. Remains : 237/257 places, 448/468 transitions.
[2022-06-10 22:55:29] [INFO ] Flatten gal took : 17 ms
[2022-06-10 22:55:29] [INFO ] Flatten gal took : 22 ms
[2022-06-10 22:55:29] [INFO ] Input system was already deterministic with 448 transitions.
[2022-06-10 22:55:29] [INFO ] Flatten gal took : 22 ms
[2022-06-10 22:55:29] [INFO ] Flatten gal took : 18 ms
[2022-06-10 22:55:29] [INFO ] Time to serialize gal into /tmp/CTLFireability4416673541188817629.gal : 2 ms
[2022-06-10 22:55:29] [INFO ] Time to serialize properties into /tmp/CTLFireability14878646296809826398.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4416673541188817629.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14878646296809826398.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-06-10 22:55:59] [INFO ] Flatten gal took : 21 ms
[2022-06-10 22:55:59] [INFO ] Applying decomposition
[2022-06-10 22:55:59] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17553126363146044965.txt' '-o' '/tmp/graph17553126363146044965.bin' '-w' '/tmp/graph17553126363146044965.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17553126363146044965.bin' '-l' '-1' '-v' '-w' '/tmp/graph17553126363146044965.weights' '-q' '0' '-e' '0.001'
[2022-06-10 22:55:59] [INFO ] Decomposing Gal with order
[2022-06-10 22:55:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 22:55:59] [INFO ] Removed a total of 847 redundant transitions.
[2022-06-10 22:55:59] [INFO ] Flatten gal took : 51 ms
[2022-06-10 22:55:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 7 ms.
[2022-06-10 22:55:59] [INFO ] Time to serialize gal into /tmp/CTLFireability16614590345503584775.gal : 4 ms
[2022-06-10 22:55:59] [INFO ] Time to serialize properties into /tmp/CTLFireability890589592008768141.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16614590345503584775.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability890589592008768141.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
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.04989e+12,1.50862,42416,1552,115,84482,1833,560,145469,90,8784,0
Converting to forward existential form...Done !
original formula: EG(AX(AF(((i13.i1.u75.p235==1)&&(((i4.i0.u56.p179==1)||((((i4.i0.u19.p62==1)&&(i5.i1.u29.p93==1))&&((i7.i1.u39.p124==1)&&(i9.i1.u49.p155=...318
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(!(EG(!(((i13.i1.u75.p235==1)&&(((i4.i0.u56.p179==1)||((((i4.i0.u19.p62==1)&&(i5.i1.u29.p93==1)...373
Reverse transition relation is NOT exact ! Due to transitions t214, t221, t223, t230, t254, t278, t344, t445, i1.u68.t33, i1.u68.t36, i1.u68.t37, i1.u68.t3...813
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 468/468 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 242 transition count 453
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 242 transition count 453
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 238 transition count 449
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 238 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 237 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 237 transition count 448
Applied a total of 40 rules in 63 ms. Remains 237 /257 variables (removed 20) and now considering 448/468 (removed 20) transitions.
// Phase 1: matrix 448 rows 237 cols
[2022-06-10 22:56:30] [INFO ] Computed 11 place invariants in 3 ms
[2022-06-10 22:56:30] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 448 rows 237 cols
[2022-06-10 22:56:30] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-10 22:56:30] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
// Phase 1: matrix 448 rows 237 cols
[2022-06-10 22:56:30] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-10 22:56:30] [INFO ] Dead Transitions using invariants and state equation in 369 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/257 places, 448/468 transitions.
Finished structural reductions, in 1 iterations. Remains : 237/257 places, 448/468 transitions.
[2022-06-10 22:56:30] [INFO ] Flatten gal took : 24 ms
[2022-06-10 22:56:31] [INFO ] Flatten gal took : 32 ms
[2022-06-10 22:56:31] [INFO ] Input system was already deterministic with 448 transitions.
[2022-06-10 22:56:31] [INFO ] Flatten gal took : 44 ms
[2022-06-10 22:56:31] [INFO ] Flatten gal took : 29 ms
[2022-06-10 22:56:31] [INFO ] Time to serialize gal into /tmp/CTLFireability15485164230552603056.gal : 16 ms
[2022-06-10 22:56:31] [INFO ] Time to serialize properties into /tmp/CTLFireability783843190236281740.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15485164230552603056.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability783843190236281740.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-06-10 22:57:01] [INFO ] Flatten gal took : 17 ms
[2022-06-10 22:57:01] [INFO ] Applying decomposition
[2022-06-10 22:57:01] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6629333961206293396.txt' '-o' '/tmp/graph6629333961206293396.bin' '-w' '/tmp/graph6629333961206293396.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6629333961206293396.bin' '-l' '-1' '-v' '-w' '/tmp/graph6629333961206293396.weights' '-q' '0' '-e' '0.001'
[2022-06-10 22:57:01] [INFO ] Decomposing Gal with order
[2022-06-10 22:57:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 22:57:01] [INFO ] Removed a total of 852 redundant transitions.
[2022-06-10 22:57:01] [INFO ] Flatten gal took : 44 ms
[2022-06-10 22:57:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 11 ms.
[2022-06-10 22:57:01] [INFO ] Time to serialize gal into /tmp/CTLFireability12260116715700020579.gal : 4 ms
[2022-06-10 22:57:01] [INFO ] Time to serialize properties into /tmp/CTLFireability6424992799542736252.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12260116715700020579.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6424992799542736252.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
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.18715e+12,1.03329,27084,1219,118,49856,1175,578,40577,92,8029,0
Converting to forward existential form...Done !
original formula: EG((EX(EF(EG((i2.u18.p61==0)))) + (((i3.i1.u27.p90==0) + EF((((u1.p6==0)||(u1.p9==0))||((i12.i0.u60.p194==0)||(u1.p246==0))))) * (((AX(((...507
=> equivalent forward existential formula: [FwdG(Init,(EX(E(TRUE U EG((i2.u18.p61==0)))) + (((i3.i1.u27.p90==0) + E(TRUE U (((u1.p6==0)||(u1.p9==0))||((i12...580
Reverse transition relation is NOT exact ! Due to transitions t222, t224, t250, t274, t280, t304, t340, t364, t445, i2.t215, i2.u10.t194, i2.u16.t198, i2.u...802
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 468/468 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 241 transition count 452
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 241 transition count 452
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 237 transition count 448
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 237 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 236 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 236 transition count 447
Applied a total of 42 rules in 13 ms. Remains 236 /257 variables (removed 21) and now considering 447/468 (removed 21) transitions.
// Phase 1: matrix 447 rows 236 cols
[2022-06-10 22:57:31] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-10 22:57:31] [INFO ] Implicit Places using invariants in 118 ms returned []
// Phase 1: matrix 447 rows 236 cols
[2022-06-10 22:57:31] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-10 22:57:31] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
// Phase 1: matrix 447 rows 236 cols
[2022-06-10 22:57:31] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-10 22:57:32] [INFO ] Dead Transitions using invariants and state equation in 750 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 236/257 places, 447/468 transitions.
Finished structural reductions, in 1 iterations. Remains : 236/257 places, 447/468 transitions.
[2022-06-10 22:57:32] [INFO ] Flatten gal took : 27 ms
[2022-06-10 22:57:32] [INFO ] Flatten gal took : 42 ms
[2022-06-10 22:57:32] [INFO ] Input system was already deterministic with 447 transitions.
[2022-06-10 22:57:32] [INFO ] Flatten gal took : 22 ms
[2022-06-10 22:57:32] [INFO ] Flatten gal took : 17 ms
[2022-06-10 22:57:32] [INFO ] Time to serialize gal into /tmp/CTLFireability5936886979775704569.gal : 3 ms
[2022-06-10 22:57:32] [INFO ] Time to serialize properties into /tmp/CTLFireability13829934370948652742.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5936886979775704569.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13829934370948652742.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-06-10 22:58:02] [INFO ] Flatten gal took : 18 ms
[2022-06-10 22:58:02] [INFO ] Applying decomposition
[2022-06-10 22:58:02] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph69234724194975695.txt' '-o' '/tmp/graph69234724194975695.bin' '-w' '/tmp/graph69234724194975695.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph69234724194975695.bin' '-l' '-1' '-v' '-w' '/tmp/graph69234724194975695.weights' '-q' '0' '-e' '0.001'
[2022-06-10 22:58:03] [INFO ] Decomposing Gal with order
[2022-06-10 22:58:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 22:58:03] [INFO ] Removed a total of 858 redundant transitions.
[2022-06-10 22:58:03] [INFO ] Flatten gal took : 44 ms
[2022-06-10 22:58:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 10 ms.
[2022-06-10 22:58:03] [INFO ] Time to serialize gal into /tmp/CTLFireability2042430131125994445.gal : 6 ms
[2022-06-10 22:58:03] [INFO ] Time to serialize properties into /tmp/CTLFireability15226985440553138690.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2042430131125994445.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15226985440553138690.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
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.03205e+12,4.29345,114764,7755,132,275002,2086,563,231672,88,10131,0
Converting to forward existential form...Done !
original formula: (E(E(((AX((((u1.p6==1)&&(u1.p15==1))&&((i8.u27.p86==1)&&(u1.p246==1)))) + (((u1.p6==1)&&(u1.p9==1))&&((i7.i1.u31.p113==1)&&(u1.p246==1)))...803
=> equivalent forward existential formula: ([(FwdU(Init,E(((!(EX(!((((u1.p6==1)&&(u1.p15==1))&&((i8.u27.p86==1)&&(u1.p246==1)))))) + (((u1.p6==1)&&(u1.p9==...900
Reverse transition relation is NOT exact ! Due to transitions t221, t223, t226, t250, t280, t298, t340, t364, t444, i0.i1.t25, i3.i1.t214, i3.i1.u11.t194, ...834
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
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 468/468 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 240 transition count 451
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 240 transition count 451
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 236 transition count 447
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 236 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 235 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 235 transition count 446
Applied a total of 44 rules in 12 ms. Remains 235 /257 variables (removed 22) and now considering 446/468 (removed 22) transitions.
// Phase 1: matrix 446 rows 235 cols
[2022-06-10 22:58:33] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-10 22:58:33] [INFO ] Implicit Places using invariants in 103 ms returned []
// Phase 1: matrix 446 rows 235 cols
[2022-06-10 22:58:33] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-10 22:58:33] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
// Phase 1: matrix 446 rows 235 cols
[2022-06-10 22:58:33] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-10 22:58:33] [INFO ] Dead Transitions using invariants and state equation in 327 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/257 places, 446/468 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/257 places, 446/468 transitions.
[2022-06-10 22:58:33] [INFO ] Flatten gal took : 25 ms
[2022-06-10 22:58:33] [INFO ] Flatten gal took : 18 ms
[2022-06-10 22:58:33] [INFO ] Input system was already deterministic with 446 transitions.
[2022-06-10 22:58:34] [INFO ] Flatten gal took : 25 ms
[2022-06-10 22:58:34] [INFO ] Flatten gal took : 18 ms
[2022-06-10 22:58:34] [INFO ] Time to serialize gal into /tmp/CTLFireability4107556210328856365.gal : 3 ms
[2022-06-10 22:58:34] [INFO ] Time to serialize properties into /tmp/CTLFireability11873532313423230127.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4107556210328856365.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11873532313423230127.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-06-10 22:59:04] [INFO ] Flatten gal took : 18 ms
[2022-06-10 22:59:04] [INFO ] Applying decomposition
[2022-06-10 22:59:04] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1093592069777450334.txt' '-o' '/tmp/graph1093592069777450334.bin' '-w' '/tmp/graph1093592069777450334.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1093592069777450334.bin' '-l' '-1' '-v' '-w' '/tmp/graph1093592069777450334.weights' '-q' '0' '-e' '0.001'
[2022-06-10 22:59:04] [INFO ] Decomposing Gal with order
[2022-06-10 22:59:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 22:59:04] [INFO ] Removed a total of 849 redundant transitions.
[2022-06-10 22:59:04] [INFO ] Flatten gal took : 49 ms
[2022-06-10 22:59:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 6 ms.
[2022-06-10 22:59:04] [INFO ] Time to serialize gal into /tmp/CTLFireability7841868934307778650.gal : 3 ms
[2022-06-10 22:59:04] [INFO ] Time to serialize properties into /tmp/CTLFireability13158032015904666346.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7841868934307778650.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13158032015904666346.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
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.03205e+12,0.197642,10768,1736,115,11191,1579,557,9312,88,6421,0
Converting to forward existential form...Done !
original formula: AF((((A(AX(FALSE) U AF(AX(((((i3.i1.u18.p62==1)&&(i6.i1.u28.p93==1))&&((i8.u35.p118==1)&&(i13.u44.p149==1)))&&(((i10.i0.u56.p186==1)&&(i1...268
=> equivalent forward existential formula: [FwdG(Init,!((((!((E(!(!(EG(!(!(EX(!(((((i3.i1.u18.p62==1)&&(i6.i1.u28.p93==1))&&((i8.u35.p118==1)&&(i13.u44.p14...698
Reverse transition relation is NOT exact ! Due to transitions t220, t222, t225, t249, t273, t303, t339, t363, t443, i1.u72.t33, i1.u72.t36, i1.u72.t37, i1....826
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
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 4
Fast SCC detection found a local SCC at level 16
Fast SCC detection found an SCC at level 17
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 4
Fast SCC detection found a local SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 257/257 places, 468/468 transitions.
Graph (trivial) has 238 edges and 257 vertex of which 4 / 257 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 102 place count 254 transition count 364
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 135 rules applied. Total rules applied 237 place count 153 transition count 330
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 257 place count 133 transition count 330
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 257 place count 133 transition count 321
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 275 place count 124 transition count 321
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 285 place count 114 transition count 311
Iterating global reduction 3 with 10 rules applied. Total rules applied 295 place count 114 transition count 311
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 299 place count 110 transition count 287
Iterating global reduction 3 with 4 rules applied. Total rules applied 303 place count 110 transition count 287
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 7 rules applied. Total rules applied 310 place count 110 transition count 280
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 313 place count 107 transition count 280
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 5 with 76 rules applied. Total rules applied 389 place count 69 transition count 242
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 390 place count 69 transition count 241
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 397 place count 62 transition count 200
Iterating global reduction 6 with 7 rules applied. Total rules applied 404 place count 62 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 4 rules applied. Total rules applied 408 place count 62 transition count 196
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 410 place count 60 transition count 196
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 412 place count 59 transition count 195
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 413 place count 59 transition count 194
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 414 place count 59 transition count 194
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 416 place count 57 transition count 192
Applied a total of 416 rules in 55 ms. Remains 57 /257 variables (removed 200) and now considering 192/468 (removed 276) transitions.
// Phase 1: matrix 192 rows 57 cols
[2022-06-10 22:59:34] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-10 22:59:34] [INFO ] Implicit Places using invariants in 112 ms returned []
// Phase 1: matrix 192 rows 57 cols
[2022-06-10 22:59:34] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-10 22:59:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:59:34] [INFO ] Implicit Places using invariants and state equation in 144 ms returned [50, 56]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 259 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 55/257 places, 192/468 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 54 transition count 191
Applied a total of 2 rules in 9 ms. Remains 54 /55 variables (removed 1) and now considering 191/192 (removed 1) transitions.
// Phase 1: matrix 191 rows 54 cols
[2022-06-10 22:59:34] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 22:59:34] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 191 rows 54 cols
[2022-06-10 22:59:34] [INFO ] Computed 8 place invariants in 3 ms
[2022-06-10 22:59:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:59:34] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 54/257 places, 191/468 transitions.
Finished structural reductions, in 2 iterations. Remains : 54/257 places, 191/468 transitions.
[2022-06-10 22:59:34] [INFO ] Flatten gal took : 16 ms
[2022-06-10 22:59:34] [INFO ] Flatten gal took : 21 ms
[2022-06-10 22:59:35] [INFO ] Input system was already deterministic with 191 transitions.
[2022-06-10 22:59:35] [INFO ] Flatten gal took : 22 ms
[2022-06-10 22:59:35] [INFO ] Flatten gal took : 21 ms
[2022-06-10 22:59:35] [INFO ] Time to serialize gal into /tmp/CTLFireability15589284089196235266.gal : 3 ms
[2022-06-10 22:59:35] [INFO ] Time to serialize properties into /tmp/CTLFireability11363459962713260650.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15589284089196235266.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11363459962713260650.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
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.16268e+06,10.3823,214924,2,10745,5,523601,6,0,405,488800,0
Converting to forward existential form...Done !
original formula: EF(EG((AG((((p6==0)||(p18==0))||((p120==0)||(p246==0)))) + ((p128==0)&&(((p6==0)||(p14==0))||((p182==0)||(p246==0)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(!(E(TRUE U !((((p6==0)||(p18==0))||((p120==0)||(p246==0)))))) + ((p128==0)&&(((p6==0)||(p...200
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t4, t5, t6, t8, t10, t12, t14, t16, t20, t22, t24, t26, t28, t30, t46, t47, t48, t53,...341
Detected timeout of ITS tools.
[2022-06-10 23:00:05] [INFO ] Flatten gal took : 13 ms
[2022-06-10 23:00:05] [INFO ] Applying decomposition
[2022-06-10 23:00:05] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12403995216199708668.txt' '-o' '/tmp/graph12403995216199708668.bin' '-w' '/tmp/graph12403995216199708668.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12403995216199708668.bin' '-l' '-1' '-v' '-w' '/tmp/graph12403995216199708668.weights' '-q' '0' '-e' '0.001'
[2022-06-10 23:00:05] [INFO ] Decomposing Gal with order
[2022-06-10 23:00:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 23:00:05] [INFO ] Removed a total of 668 redundant transitions.
[2022-06-10 23:00:05] [INFO ] Flatten gal took : 23 ms
[2022-06-10 23:00:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 2 ms.
[2022-06-10 23:00:05] [INFO ] Time to serialize gal into /tmp/CTLFireability8725926372425044816.gal : 1 ms
[2022-06-10 23:00:05] [INFO ] Time to serialize properties into /tmp/CTLFireability5943828352679597143.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8725926372425044816.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5943828352679597143.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
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.16268e+06,0.080872,7216,147,48,5508,396,157,9340,68,1341,0
Converting to forward existential form...Done !
original formula: EF(EG((AG((((i0.u0.p6==0)||(i0.u0.p18==0))||((u5.p120==0)||(i0.u15.p246==0)))) + ((i5.u7.p128==0)&&(((i0.u0.p6==0)||(i0.u0.p14==0))||((u1...189
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(!(E(TRUE U !((((i0.u0.p6==0)||(i0.u0.p18==0))||((u5.p120==0)||(i0.u15.p246==0)))))) + ((i...251
Reverse transition relation is NOT exact ! Due to transitions t5, t80, t141, t177, u5.t22, u5.t102, u6.t20, u10.t12, u10.t103, u11.t10, i1.u1.t30, i1.u2.t2...364
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local 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,1,0.984329,32676,1,0,58283,1268,851,106088,340,7199,77411
FORMULA AutonomousCar-PT-06b-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 468/468 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 240 transition count 451
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 240 transition count 451
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 236 transition count 447
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 236 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 235 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 235 transition count 446
Applied a total of 44 rules in 13 ms. Remains 235 /257 variables (removed 22) and now considering 446/468 (removed 22) transitions.
// Phase 1: matrix 446 rows 235 cols
[2022-06-10 23:00:06] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-10 23:00:06] [INFO ] Implicit Places using invariants in 142 ms returned []
// Phase 1: matrix 446 rows 235 cols
[2022-06-10 23:00:06] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-10 23:00:06] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
// Phase 1: matrix 446 rows 235 cols
[2022-06-10 23:00:06] [INFO ] Computed 11 place invariants in 5 ms
[2022-06-10 23:00:07] [INFO ] Dead Transitions using invariants and state equation in 610 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/257 places, 446/468 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/257 places, 446/468 transitions.
[2022-06-10 23:00:07] [INFO ] Flatten gal took : 26 ms
[2022-06-10 23:00:07] [INFO ] Flatten gal took : 29 ms
[2022-06-10 23:00:07] [INFO ] Input system was already deterministic with 446 transitions.
[2022-06-10 23:00:07] [INFO ] Flatten gal took : 28 ms
[2022-06-10 23:00:07] [INFO ] Flatten gal took : 28 ms
[2022-06-10 23:00:07] [INFO ] Time to serialize gal into /tmp/CTLFireability16104082659144125056.gal : 4 ms
[2022-06-10 23:00:07] [INFO ] Time to serialize properties into /tmp/CTLFireability11265007322988702720.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16104082659144125056.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11265007322988702720.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-06-10 23:00:37] [INFO ] Flatten gal took : 21 ms
[2022-06-10 23:00:37] [INFO ] Applying decomposition
[2022-06-10 23:00:37] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11855555553504448470.txt' '-o' '/tmp/graph11855555553504448470.bin' '-w' '/tmp/graph11855555553504448470.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11855555553504448470.bin' '-l' '-1' '-v' '-w' '/tmp/graph11855555553504448470.weights' '-q' '0' '-e' '0.001'
[2022-06-10 23:00:37] [INFO ] Decomposing Gal with order
[2022-06-10 23:00:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 23:00:37] [INFO ] Removed a total of 843 redundant transitions.
[2022-06-10 23:00:37] [INFO ] Flatten gal took : 37 ms
[2022-06-10 23:00:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 5 ms.
[2022-06-10 23:00:37] [INFO ] Time to serialize gal into /tmp/CTLFireability4713643796676149615.gal : 7 ms
[2022-06-10 23:00:37] [INFO ] Time to serialize properties into /tmp/CTLFireability897120643456572262.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4713643796676149615.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability897120643456572262.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...252
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.03205e+12,1.67133,47792,3226,122,90136,2416,546,156123,88,11523,0
Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,1.67735,47792,1,0,90136,2416,764,156123,112,11523,694
FORMULA AutonomousCar-PT-06b-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 468/468 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 243 transition count 454
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 243 transition count 454
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 240 transition count 451
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 240 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 239 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 239 transition count 450
Applied a total of 36 rules in 12 ms. Remains 239 /257 variables (removed 18) and now considering 450/468 (removed 18) transitions.
// Phase 1: matrix 450 rows 239 cols
[2022-06-10 23:00:39] [INFO ] Computed 11 place invariants in 1 ms
[2022-06-10 23:00:39] [INFO ] Implicit Places using invariants in 120 ms returned []
// Phase 1: matrix 450 rows 239 cols
[2022-06-10 23:00:39] [INFO ] Computed 11 place invariants in 3 ms
[2022-06-10 23:00:39] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
// Phase 1: matrix 450 rows 239 cols
[2022-06-10 23:00:39] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-10 23:00:40] [INFO ] Dead Transitions using invariants and state equation in 641 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 239/257 places, 450/468 transitions.
Finished structural reductions, in 1 iterations. Remains : 239/257 places, 450/468 transitions.
[2022-06-10 23:00:40] [INFO ] Flatten gal took : 26 ms
[2022-06-10 23:00:40] [INFO ] Flatten gal took : 29 ms
[2022-06-10 23:00:40] [INFO ] Input system was already deterministic with 450 transitions.
[2022-06-10 23:00:40] [INFO ] Flatten gal took : 28 ms
[2022-06-10 23:00:40] [INFO ] Flatten gal took : 28 ms
[2022-06-10 23:00:40] [INFO ] Time to serialize gal into /tmp/CTLFireability6568562865614616918.gal : 4 ms
[2022-06-10 23:00:40] [INFO ] Time to serialize properties into /tmp/CTLFireability110691447689141992.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6568562865614616918.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability110691447689141992.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...273
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-06-10 23:01:10] [INFO ] Flatten gal took : 33 ms
[2022-06-10 23:01:10] [INFO ] Applying decomposition
[2022-06-10 23:01:10] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15279080042199649401.txt' '-o' '/tmp/graph15279080042199649401.bin' '-w' '/tmp/graph15279080042199649401.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15279080042199649401.bin' '-l' '-1' '-v' '-w' '/tmp/graph15279080042199649401.weights' '-q' '0' '-e' '0.001'
[2022-06-10 23:01:10] [INFO ] Decomposing Gal with order
[2022-06-10 23:01:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 23:01:11] [INFO ] Removed a total of 839 redundant transitions.
[2022-06-10 23:01:11] [INFO ] Flatten gal took : 36 ms
[2022-06-10 23:01:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 5 ms.
[2022-06-10 23:01:11] [INFO ] Time to serialize gal into /tmp/CTLFireability9916884664087654652.gal : 2 ms
[2022-06-10 23:01:11] [INFO ] Time to serialize properties into /tmp/CTLFireability10150237191949208518.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9916884664087654652.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10150237191949208518.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
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.11106e+12,0.138591,8812,663,113,7201,1438,521,8590,92,7284,0
Converting to forward existential form...Done !
original formula: AF(EX(((i5.u21.p68==1) + (A(AF((i10.u57.p185==1)) U AG((((u1.p6==1)&&(u1.p9==1))&&((i10.u55.p179==1)&&(u1.p246==1))))) * A(E((i9.i0.u54.p...258
=> equivalent forward existential formula: [FwdG(Init,!(EX(((i5.u21.p68==1) + (!((E(!(!(E(TRUE U !((((u1.p6==1)&&(u1.p9==1))&&((i10.u55.p179==1)&&(u1.p246=...661
Reverse transition relation is NOT exact ! Due to transitions t224, t226, t234, t252, t276, t300, t342, t366, t447, i1.u75.t33, i1.u75.t36, i1.u75.t37, i1....792
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
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
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 468/468 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 241 transition count 452
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 241 transition count 452
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 237 transition count 448
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 237 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 236 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 236 transition count 447
Applied a total of 42 rules in 12 ms. Remains 236 /257 variables (removed 21) and now considering 447/468 (removed 21) transitions.
// Phase 1: matrix 447 rows 236 cols
[2022-06-10 23:01:41] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-10 23:01:41] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 447 rows 236 cols
[2022-06-10 23:01:41] [INFO ] Computed 11 place invariants in 3 ms
[2022-06-10 23:01:41] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
// Phase 1: matrix 447 rows 236 cols
[2022-06-10 23:01:41] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-10 23:01:41] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 236/257 places, 447/468 transitions.
Finished structural reductions, in 1 iterations. Remains : 236/257 places, 447/468 transitions.
[2022-06-10 23:01:41] [INFO ] Flatten gal took : 18 ms
[2022-06-10 23:01:41] [INFO ] Flatten gal took : 20 ms
[2022-06-10 23:01:42] [INFO ] Input system was already deterministic with 447 transitions.
[2022-06-10 23:01:42] [INFO ] Flatten gal took : 19 ms
[2022-06-10 23:01:42] [INFO ] Flatten gal took : 19 ms
[2022-06-10 23:01:42] [INFO ] Time to serialize gal into /tmp/CTLFireability3887805174119194124.gal : 4 ms
[2022-06-10 23:01:42] [INFO ] Time to serialize properties into /tmp/CTLFireability17756361587816228424.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3887805174119194124.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17756361587816228424.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-06-10 23:02:12] [INFO ] Flatten gal took : 17 ms
[2022-06-10 23:02:12] [INFO ] Applying decomposition
[2022-06-10 23:02:12] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17484513044123114637.txt' '-o' '/tmp/graph17484513044123114637.bin' '-w' '/tmp/graph17484513044123114637.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17484513044123114637.bin' '-l' '-1' '-v' '-w' '/tmp/graph17484513044123114637.weights' '-q' '0' '-e' '0.001'
[2022-06-10 23:02:12] [INFO ] Decomposing Gal with order
[2022-06-10 23:02:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 23:02:12] [INFO ] Removed a total of 832 redundant transitions.
[2022-06-10 23:02:12] [INFO ] Flatten gal took : 37 ms
[2022-06-10 23:02:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 6 ms.
[2022-06-10 23:02:12] [INFO ] Time to serialize gal into /tmp/CTLFireability10244927183794026842.gal : 3 ms
[2022-06-10 23:02:12] [INFO ] Time to serialize properties into /tmp/CTLFireability6636091115046770380.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10244927183794026842.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6636091115046770380.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
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.05504e+12,0.939969,25932,1605,115,46990,1895,580,53098,91,11511,0
Converting to forward existential form...Done !
original formula: (AF(((i0.i1.u77.p263==0) * AX(AG((((u2.p6==0)||(u2.p18==0))||((i10.u45.p151==0)||(u2.p246==0))))))) + EG(AX((i5.u26.p85==1))))
=> equivalent forward existential formula: [FwdG((Init * !(EG(!(EX(!((i5.u26.p85==1))))))),!(((i0.i1.u77.p263==0) * !(EX(!(!(E(TRUE U !((((u2.p6==0)||(u2.p...216
Reverse transition relation is NOT exact ! Due to transitions t162, t221, t223, t236, t254, t308, t368, t444, i0.i1.t25, i2.u73.t33, i2.u73.t36, i2.u73.t37...837
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
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 468/468 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 242 transition count 453
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 242 transition count 453
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 239 transition count 450
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 239 transition count 450
Applied a total of 36 rules in 10 ms. Remains 239 /257 variables (removed 18) and now considering 450/468 (removed 18) transitions.
// Phase 1: matrix 450 rows 239 cols
[2022-06-10 23:02:42] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-10 23:02:42] [INFO ] Implicit Places using invariants in 112 ms returned []
// Phase 1: matrix 450 rows 239 cols
[2022-06-10 23:02:42] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-10 23:02:42] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
// Phase 1: matrix 450 rows 239 cols
[2022-06-10 23:02:42] [INFO ] Computed 11 place invariants in 3 ms
[2022-06-10 23:02:43] [INFO ] Dead Transitions using invariants and state equation in 511 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 239/257 places, 450/468 transitions.
Finished structural reductions, in 1 iterations. Remains : 239/257 places, 450/468 transitions.
[2022-06-10 23:02:43] [INFO ] Flatten gal took : 24 ms
[2022-06-10 23:02:43] [INFO ] Flatten gal took : 27 ms
[2022-06-10 23:02:43] [INFO ] Input system was already deterministic with 450 transitions.
[2022-06-10 23:02:43] [INFO ] Flatten gal took : 30 ms
[2022-06-10 23:02:43] [INFO ] Flatten gal took : 28 ms
[2022-06-10 23:02:43] [INFO ] Time to serialize gal into /tmp/CTLFireability8194538268914274232.gal : 4 ms
[2022-06-10 23:02:43] [INFO ] Time to serialize properties into /tmp/CTLFireability368474850286558682.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8194538268914274232.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability368474850286558682.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...273
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-06-10 23:03:13] [INFO ] Flatten gal took : 23 ms
[2022-06-10 23:03:13] [INFO ] Applying decomposition
[2022-06-10 23:03:13] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15426296446172056824.txt' '-o' '/tmp/graph15426296446172056824.bin' '-w' '/tmp/graph15426296446172056824.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15426296446172056824.bin' '-l' '-1' '-v' '-w' '/tmp/graph15426296446172056824.weights' '-q' '0' '-e' '0.001'
[2022-06-10 23:03:13] [INFO ] Decomposing Gal with order
[2022-06-10 23:03:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 23:03:13] [INFO ] Removed a total of 848 redundant transitions.
[2022-06-10 23:03:13] [INFO ] Flatten gal took : 35 ms
[2022-06-10 23:03:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 5 ms.
[2022-06-10 23:03:13] [INFO ] Time to serialize gal into /tmp/CTLFireability18280826145333403501.gal : 4 ms
[2022-06-10 23:03:13] [INFO ] Time to serialize properties into /tmp/CTLFireability6470138930226486690.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18280826145333403501.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6470138930226486690.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
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.18062e+12,1.25155,33844,2354,136,65669,2173,564,71566,91,11797,0
Converting to forward existential form...Done !
original formula: A(((!((AF((i11.u66.p210==1)) + AG((((u1.p6==1)&&(u1.p15==1))&&((i4.i1.u16.p51==1)&&(u1.p246==1)))))) + A(!((((u1.p6==1)&&(u1.p18==1))&&((...713
=> equivalent forward existential formula: [((Init * !(EG(!((!(EX(!(E(TRUE U ((((i5.u18.p56==1)&&(i6.i0.u29.p93==1))&&((i9.i1.u39.p124==1)&&(i12.u47.p149==...1501
Reverse transition relation is NOT exact ! Due to transitions t223, t225, t233, t251, t281, t299, t341, t447, i2.i1.t27, i4.i1.t216, i4.i1.u11.t196, i4.i1....836
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an 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
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 257/257 places, 468/468 transitions.
Graph (trivial) has 229 edges and 257 vertex of which 4 / 257 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 254 transition count 362
Reduce places removed 103 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 139 rules applied. Total rules applied 243 place count 151 transition count 326
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 264 place count 130 transition count 326
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 264 place count 130 transition count 317
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 282 place count 121 transition count 317
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 292 place count 111 transition count 307
Iterating global reduction 3 with 10 rules applied. Total rules applied 302 place count 111 transition count 307
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 306 place count 107 transition count 283
Iterating global reduction 3 with 4 rules applied. Total rules applied 310 place count 107 transition count 283
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 8 rules applied. Total rules applied 318 place count 107 transition count 275
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 322 place count 103 transition count 275
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 386 place count 71 transition count 243
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 387 place count 71 transition count 242
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 394 place count 64 transition count 201
Iterating global reduction 6 with 7 rules applied. Total rules applied 401 place count 64 transition count 201
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 4 rules applied. Total rules applied 405 place count 64 transition count 197
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 407 place count 62 transition count 197
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 409 place count 61 transition count 196
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 410 place count 61 transition count 195
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 412 place count 59 transition count 193
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 413 place count 58 transition count 193
Applied a total of 413 rules in 45 ms. Remains 58 /257 variables (removed 199) and now considering 193/468 (removed 275) transitions.
// Phase 1: matrix 193 rows 58 cols
[2022-06-10 23:03:43] [INFO ] Computed 9 place invariants in 0 ms
[2022-06-10 23:03:43] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 193 rows 58 cols
[2022-06-10 23:03:43] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 23:03:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 23:03:44] [INFO ] Implicit Places using invariants and state equation in 141 ms returned [51, 57]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 202 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 56/257 places, 193/468 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 56 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 55 transition count 192
Applied a total of 2 rules in 9 ms. Remains 55 /56 variables (removed 1) and now considering 192/193 (removed 1) transitions.
// Phase 1: matrix 192 rows 55 cols
[2022-06-10 23:03:44] [INFO ] Computed 7 place invariants in 3 ms
[2022-06-10 23:03:44] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 192 rows 55 cols
[2022-06-10 23:03:44] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 23:03:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 23:03:44] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 55/257 places, 192/468 transitions.
Finished structural reductions, in 2 iterations. Remains : 55/257 places, 192/468 transitions.
[2022-06-10 23:03:44] [INFO ] Flatten gal took : 12 ms
[2022-06-10 23:03:44] [INFO ] Flatten gal took : 13 ms
[2022-06-10 23:03:44] [INFO ] Input system was already deterministic with 192 transitions.
[2022-06-10 23:03:44] [INFO ] Flatten gal took : 27 ms
[2022-06-10 23:03:44] [INFO ] Flatten gal took : 12 ms
[2022-06-10 23:03:44] [INFO ] Time to serialize gal into /tmp/CTLFireability7130962209742654131.gal : 2 ms
[2022-06-10 23:03:44] [INFO ] Time to serialize properties into /tmp/CTLFireability12557552987233459905.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7130962209742654131.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12557552987233459905.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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.41483e+06,2.55579,60988,2,5706,5,200358,6,0,410,233333,0
Converting to forward existential form...Done !
original formula: AF(AG(((((p62!=1)||(p87!=1))||((p118!=1)||(p155!=1)))||(((p186!=1)||(p217!=1))||(p247!=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((((p62!=1)||(p87!=1))||((p118!=1)||(p155!=1)))||(((p186!=1)||(p217!=1))||(p247!=1))))...168
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t4, t5, t7, t9, t11, t12, t14, t16, t17, t19, t21, t23, t24, t27, t29, t30, t33, ...712
(forward)formula 0,0,19.1578,403232,1,0,1010,1.65184e+06,410,491,6819,2.11565e+06,817
FORMULA AutonomousCar-PT-06b-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 468/468 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 243 transition count 454
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 243 transition count 454
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 240 transition count 451
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 240 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 239 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 239 transition count 450
Applied a total of 36 rules in 17 ms. Remains 239 /257 variables (removed 18) and now considering 450/468 (removed 18) transitions.
// Phase 1: matrix 450 rows 239 cols
[2022-06-10 23:04:03] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-10 23:04:03] [INFO ] Implicit Places using invariants in 132 ms returned []
// Phase 1: matrix 450 rows 239 cols
[2022-06-10 23:04:03] [INFO ] Computed 11 place invariants in 3 ms
[2022-06-10 23:04:04] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
// Phase 1: matrix 450 rows 239 cols
[2022-06-10 23:04:04] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-10 23:04:04] [INFO ] Dead Transitions using invariants and state equation in 596 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 239/257 places, 450/468 transitions.
Finished structural reductions, in 1 iterations. Remains : 239/257 places, 450/468 transitions.
[2022-06-10 23:04:04] [INFO ] Flatten gal took : 26 ms
[2022-06-10 23:04:04] [INFO ] Flatten gal took : 29 ms
[2022-06-10 23:04:04] [INFO ] Input system was already deterministic with 450 transitions.
[2022-06-10 23:04:04] [INFO ] Flatten gal took : 28 ms
[2022-06-10 23:04:04] [INFO ] Flatten gal took : 28 ms
[2022-06-10 23:04:04] [INFO ] Time to serialize gal into /tmp/CTLFireability3035188217624460789.gal : 4 ms
[2022-06-10 23:04:04] [INFO ] Time to serialize properties into /tmp/CTLFireability10017834285775521854.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3035188217624460789.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10017834285775521854.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-06-10 23:04:34] [INFO ] Flatten gal took : 18 ms
[2022-06-10 23:04:34] [INFO ] Applying decomposition
[2022-06-10 23:04:34] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15490731847884567868.txt' '-o' '/tmp/graph15490731847884567868.bin' '-w' '/tmp/graph15490731847884567868.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15490731847884567868.bin' '-l' '-1' '-v' '-w' '/tmp/graph15490731847884567868.weights' '-q' '0' '-e' '0.001'
[2022-06-10 23:04:35] [INFO ] Decomposing Gal with order
[2022-06-10 23:04:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 23:04:35] [INFO ] Removed a total of 850 redundant transitions.
[2022-06-10 23:04:35] [INFO ] Flatten gal took : 60 ms
[2022-06-10 23:04:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 6 ms.
[2022-06-10 23:04:35] [INFO ] Time to serialize gal into /tmp/CTLFireability9420718137187953192.gal : 4 ms
[2022-06-10 23:04:35] [INFO ] Time to serialize properties into /tmp/CTLFireability5167075523618175626.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9420718137187953192.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5167075523618175626.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-06-10 23:05:05] [INFO ] Flatten gal took : 18 ms
[2022-06-10 23:05:05] [INFO ] Flatten gal took : 18 ms
[2022-06-10 23:05:05] [INFO ] Applying decomposition
[2022-06-10 23:05:05] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6735199513694608550.txt' '-o' '/tmp/graph6735199513694608550.bin' '-w' '/tmp/graph6735199513694608550.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6735199513694608550.bin' '-l' '-1' '-v' '-w' '/tmp/graph6735199513694608550.weights' '-q' '0' '-e' '0.001'
[2022-06-10 23:05:05] [INFO ] Decomposing Gal with order
[2022-06-10 23:05:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 23:05:05] [INFO ] Removed a total of 849 redundant transitions.
[2022-06-10 23:05:05] [INFO ] Flatten gal took : 36 ms
[2022-06-10 23:05:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 9 ms.
[2022-06-10 23:05:05] [INFO ] Time to serialize gal into /tmp/CTLFireability11626066500593500946.gal : 5 ms
[2022-06-10 23:05:05] [INFO ] Time to serialize properties into /tmp/CTLFireability3269371038976209239.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11626066500593500946.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3269371038976209239.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 10 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.75392e+12,0.241123,9172,968,114,6942,1387,662,10424,93,6166,0
Converting to forward existential form...Done !
original formula: EG(AX(AF((((i16.u1.p6==1)&&(i16.u1.p16==1))&&((i2.u52.p148==1)&&(i16.u1.p246==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(!(EG(!((((i16.u1.p6==1)&&(i16.u1.p16==1))&&((i2.u52.p148==1)&&(i16.u1.p246==1))))))))))] != FA...158
Reverse transition relation is NOT exact ! Due to transitions t242, t249, t273, t321, t363, t465, i1.u77.t35, i1.u77.t39, i1.u77.t40, i1.u77.t41, i2.t147, ...930
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
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
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 0,0,42.4981,869004,1,0,1.77642e+06,6918,5103,2.22474e+06,518,68003,1842351
FORMULA AutonomousCar-PT-06b-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AX(((i9.i1.u50.p141==1) + A(((EX((((i16.u1.p6==1)&&(i16.u1.p14==1))&&((i8.u40.p120==1)&&(i16.u1.p246==1)))) * (i17.i0.u92.p268!=1)) * ((i...342
=> equivalent forward existential formula: ([FwdG((FwdU((EY(Init) * !((i9.i1.u50.p141==1))),!(!(EG(!(!(EX(!((((i16.u1.p6==1)&&(i16.u1.p15==1))&&((i11.u62.p...656
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
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 1,0,77.1673,1498708,1,0,3.14773e+06,9478,5394,3.76075e+06,548,113777,3636146
FORMULA AutonomousCar-PT-06b-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EG(AX(AF(((i14.i1.u83.p235==1)&&(((i11.u62.p179==1)||((((i4.i2.u21.p62==1)&&(i6.i1.u32.p93==1))&&((i7.i2.u42.p124==1)&&(i2.u54.p155==1)))...326
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(!(EG(!(((i14.i1.u83.p235==1)&&(((i11.u62.p179==1)||((((i4.i2.u21.p62==1)&&(i6.i1.u32.p93==1))&...381
(forward)formula 2,0,84.8382,1651692,1,0,3.45734e+06,9741,5475,4.18432e+06,548,117762,3945952
FORMULA AutonomousCar-PT-06b-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EG((EX(EF(EG((i4.i2.u21.p61==0)))) + (((i5.u31.p90==0) + EF((((i16.u1.p6==0)||(i16.u1.p9==0))||((i12.i1.u69.p194==0)||(i16.u1.p246==0))))...535
=> equivalent forward existential formula: [FwdG(Init,(EX(E(TRUE U EG((i4.i2.u21.p61==0)))) + (((i5.u31.p90==0) + E(TRUE U (((i16.u1.p6==0)||(i16.u1.p9==0)...608
(forward)formula 3,1,109.819,2181012,1,0,4.46539e+06,10301,6275,5.58885e+06,594,124491,4883007
FORMULA AutonomousCar-PT-06b-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (E(E(((AX((((i16.u1.p6==1)&&(i16.u1.p15==1))&&((i5.u29.p86==1)&&(i16.u1.p246==1)))) + (((i16.u1.p6==1)&&(i16.u1.p9==1))&&((i7.i2.u39.p113...889
=> equivalent forward existential formula: ([(FwdU(Init,E(((!(EX(!((((i16.u1.p6==1)&&(i16.u1.p15==1))&&((i5.u29.p86==1)&&(i16.u1.p246==1)))))) + (((i16.u1....986
(forward)formula 4,0,147.295,2198096,1,0,4.51102e+06,10322,1558,5.6394e+06,242,125015,726473
FORMULA AutonomousCar-PT-06b-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AF((((A(AX(FALSE) U AF(AX(((((i4.i2.u21.p62==1)&&(i6.i1.u32.p93==1))&&((i8.u40.p118==1)&&(i2.u52.p149==1)))&&(((i10.i2.u65.p186==1)&&(i13...276
=> equivalent forward existential formula: [FwdG(Init,!((((!((E(!(!(EG(!(!(EX(!(((((i4.i2.u21.p62==1)&&(i6.i1.u32.p93==1))&&((i8.u40.p118==1)&&(i2.u52.p149...704
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
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found a local SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 5,0,176.531,2198096,1,0,4.51102e+06,10322,2246,5.6394e+06,288,125015,2851746
FORMULA AutonomousCar-PT-06b-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AF(EX(((i6.i1.u25.p68==1) + (A(AF((i10.i2.u65.p185==1)) U AG((((i16.u1.p6==1)&&(i16.u1.p9==1))&&((i11.u62.p179==1)&&(i16.u1.p246==1))))) ...289
=> equivalent forward existential formula: [FwdG(Init,!(EX(((i6.i1.u25.p68==1) + (!((E(!(!(E(TRUE U !((((i16.u1.p6==1)&&(i16.u1.p9==1))&&((i11.u62.p179==1)...740
(forward)formula 6,0,203.413,2198096,1,0,4.51102e+06,10322,3007,5.6394e+06,328,125015,4229549
FORMULA AutonomousCar-PT-06b-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: (AF(((i15.i1.u89.p263==0) * AX(AG((((i16.u1.p6==0)||(i16.u1.p18==0))||((i2.u52.p151==0)||(i16.u1.p246==0))))))) + EG(AX((i5.u29.p85==1)))...156
=> equivalent forward existential formula: [FwdG((Init * !(EG(!(EX(!((i5.u29.p85==1))))))),!(((i15.i1.u89.p263==0) * !(EX(!(!(E(TRUE U !((((i16.u1.p6==0)||...228
Using saturation style SCC detection
(forward)formula 7,0,230.778,2315572,1,0,4.79077e+06,10322,3053,5.69493e+06,335,125015,5624795
FORMULA AutonomousCar-PT-06b-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: A(((!((AF((i13.i0.u73.p210==1)) + AG((((i16.u1.p6==1)&&(i16.u1.p15==1))&&((i4.i2.u17.p51==1)&&(i16.u1.p246==1)))))) + A(!((((i16.u1.p6==1...790
=> equivalent forward existential formula: [((Init * !(EG(!((!(EX(!(E(TRUE U ((((i4.i1.u19.p56==1)&&(i6.i1.u32.p93==1))&&((i7.i2.u42.p124==1)&&(i2.u52.p149...1612
Fast SCC detection found a local SCC at level 16
Fast SCC detection found an SCC at level 17
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 an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 16
Fast SCC detection found an SCC at level 17
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 16
Fast SCC detection found an SCC at level 17
(forward)formula 8,0,319.317,2661828,1,0,5.42621e+06,10322,2575,6.73769e+06,309,125015,2482480
FORMULA AutonomousCar-PT-06b-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: A(((!(((i2.u52.p148==1) * EF(EX((i4.i0.u11.p64==1))))) + (i3.u15.p36==1)) + !(AG(EX((i2.u45.p130==1))))) U (((i16.u1.p6==1)&&(i16.u1.p9==...202
=> equivalent forward existential formula: [((Init * !(EG(!((((i16.u1.p6==1)&&(i16.u1.p9==1))&&((i10.i1.u55.p175==1)&&(i16.u1.p246==1))))))) * !(E(!((((i16...449
(forward)formula 9,0,323.319,2661828,1,0,5.42621e+06,10322,2627,6.73769e+06,314,125015,2670383
FORMULA AutonomousCar-PT-06b-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Total runtime 1142624 ms.
BK_STOP 1654902629382
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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-06b"
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-4028"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-06b, 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 r294-smll-165463873000498"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-06b.tgz
mv AutonomousCar-PT-06b execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;