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-165463873100532.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-08b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463873100532
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1016K
-rw-r--r-- 1 mcc users 8.4K Jun 7 15:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Jun 7 15:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 7 15:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 7 15:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 3 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 3 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 3 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 3 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 3 16:02 NewModel
-rw-r--r-- 1 mcc users 13K Jun 7 15:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Jun 7 15:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Jun 7 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Jun 7 15:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 3 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:20 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 517K 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-08b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654914743411

Running Version 202205111006
[2022-06-11 02:32:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-11 02:32:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 02:32:25] [INFO ] Load time of PNML (sax parser for PT used): 317 ms
[2022-06-11 02:32:25] [INFO ] Transformed 357 places.
[2022-06-11 02:32:25] [INFO ] Transformed 1128 transitions.
[2022-06-11 02:32:25] [INFO ] Found NUPN structural information;
[2022-06-11 02:32:25] [INFO ] Parsed PT model containing 357 places and 1128 transitions in 507 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA AutonomousCar-PT-08b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 357 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 357/357 places, 1128/1128 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 307 transition count 1078
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 307 transition count 1078
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 0 with 256 rules applied. Total rules applied 356 place count 307 transition count 822
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 366 place count 297 transition count 812
Iterating global reduction 1 with 10 rules applied. Total rules applied 376 place count 297 transition count 812
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 377 place count 296 transition count 811
Iterating global reduction 1 with 1 rules applied. Total rules applied 378 place count 296 transition count 811
Applied a total of 378 rules in 137 ms. Remains 296 /357 variables (removed 61) and now considering 811/1128 (removed 317) transitions.
// Phase 1: matrix 811 rows 296 cols
[2022-06-11 02:32:26] [INFO ] Computed 13 place invariants in 38 ms
[2022-06-11 02:32:26] [INFO ] Implicit Places using invariants in 402 ms returned []
// Phase 1: matrix 811 rows 296 cols
[2022-06-11 02:32:26] [INFO ] Computed 13 place invariants in 11 ms
[2022-06-11 02:32:27] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 1001 ms to find 0 implicit places.
// Phase 1: matrix 811 rows 296 cols
[2022-06-11 02:32:27] [INFO ] Computed 13 place invariants in 15 ms
[2022-06-11 02:32:27] [INFO ] Dead Transitions using invariants and state equation in 703 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 296/357 places, 811/1128 transitions.
Finished structural reductions, in 1 iterations. Remains : 296/357 places, 811/1128 transitions.
Support contains 44 out of 296 places after structural reductions.
[2022-06-11 02:32:28] [INFO ] Flatten gal took : 232 ms
[2022-06-11 02:32:28] [INFO ] Flatten gal took : 141 ms
[2022-06-11 02:32:28] [INFO ] Input system was already deterministic with 811 transitions.
Support contains 43 out of 296 places (down from 44) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 89 resets, run finished after 1039 ms. (steps per millisecond=9 ) properties (out of 30) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 22) 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 22) 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 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 22) 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 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) 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 22) 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 22) 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 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 22) 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 22) seen :0
Running SMT prover for 22 properties.
// Phase 1: matrix 811 rows 296 cols
[2022-06-11 02:32:30] [INFO ] Computed 13 place invariants in 6 ms
[2022-06-11 02:32:31] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2022-06-11 02:32:32] [INFO ] After 1583ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:21
[2022-06-11 02:32:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2022-06-11 02:32:34] [INFO ] After 1727ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :20
[2022-06-11 02:32:36] [INFO ] After 3471ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :20
Attempting to minimize the solution found.
Minimization took 1307 ms.
[2022-06-11 02:32:37] [INFO ] After 5270ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :20
Fused 22 Parikh solutions to 20 different solutions.
Parikh walk visited 0 properties in 643 ms.
Support contains 34 out of 296 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 296/296 places, 811/811 transitions.
Graph (trivial) has 232 edges and 296 vertex of which 4 / 296 are part of one of the 2 SCC in 18 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1323 edges and 294 vertex of which 292 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.25 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 106 rules applied. Total rules applied 108 place count 292 transition count 701
Reduce places removed 104 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 1 with 150 rules applied. Total rules applied 258 place count 188 transition count 655
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 285 place count 161 transition count 655
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 285 place count 161 transition count 648
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 299 place count 154 transition count 648
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 300 place count 153 transition count 647
Iterating global reduction 3 with 1 rules applied. Total rules applied 301 place count 153 transition count 647
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 302 place count 152 transition count 639
Iterating global reduction 3 with 1 rules applied. Total rules applied 303 place count 152 transition count 639
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 3 with 2 rules applied. Total rules applied 305 place count 152 transition count 637
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 306 place count 151 transition count 637
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 396 place count 106 transition count 592
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 397 place count 106 transition count 591
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 402 place count 101 transition count 558
Iterating global reduction 6 with 5 rules applied. Total rules applied 407 place count 101 transition count 558
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 411 place count 101 transition count 554
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 413 place count 100 transition count 553
Free-agglomeration rule applied 20 times.
Iterating global reduction 7 with 20 rules applied. Total rules applied 433 place count 100 transition count 533
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 453 place count 80 transition count 533
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 454 place count 80 transition count 532
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 460 place count 80 transition count 532
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 461 place count 79 transition count 531
Applied a total of 461 rules in 483 ms. Remains 79 /296 variables (removed 217) and now considering 531/811 (removed 280) transitions.
Finished structural reductions, in 1 iterations. Remains : 79/296 places, 531/811 transitions.
Incomplete random walk after 10000 steps, including 138 resets, run finished after 597 ms. (steps per millisecond=16 ) properties (out of 20) seen :7
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 26 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 33 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 531 rows 79 cols
[2022-06-11 02:32:39] [INFO ] Computed 13 place invariants in 3 ms
[2022-06-11 02:32:39] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 02:32:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2022-06-11 02:32:40] [INFO ] After 318ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 02:32:40] [INFO ] After 476ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 178 ms.
[2022-06-11 02:32:40] [INFO ] After 699ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 6 out of 79 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 79/79 places, 531/531 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 79 transition count 530
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 78 transition count 530
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 78 transition count 529
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 77 transition count 529
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 76 transition count 528
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 76 transition count 528
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 76 transition count 527
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 75 transition count 527
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 28 place count 65 transition count 517
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 64 transition count 508
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 64 transition count 508
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 46 place count 56 transition count 500
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 49 place count 56 transition count 497
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 76 place count 53 transition count 473
Applied a total of 76 rules in 110 ms. Remains 53 /79 variables (removed 26) and now considering 473/531 (removed 58) transitions.
Finished structural reductions, in 1 iterations. Remains : 53/79 places, 473/531 transitions.
Incomplete random walk after 10000 steps, including 61 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Finished probabilistic random walk after 709743 steps, run visited all 2 properties in 2721 ms. (steps per millisecond=260 )
Probabilistic random walk after 709743 steps, saw 99743 distinct states, run finished after 2722 ms. (steps per millisecond=260 ) properties seen :2
FORMULA AutonomousCar-PT-08b-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA AutonomousCar-PT-08b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 46 stabilizing places and 47 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 811/811 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 292 transition count 807
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 292 transition count 807
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 291 transition count 806
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 291 transition count 806
Applied a total of 10 rules in 48 ms. Remains 291 /296 variables (removed 5) and now considering 806/811 (removed 5) transitions.
// Phase 1: matrix 806 rows 291 cols
[2022-06-11 02:32:44] [INFO ] Computed 13 place invariants in 5 ms
[2022-06-11 02:32:44] [INFO ] Implicit Places using invariants in 312 ms returned []
// Phase 1: matrix 806 rows 291 cols
[2022-06-11 02:32:44] [INFO ] Computed 13 place invariants in 5 ms
[2022-06-11 02:32:45] [INFO ] Implicit Places using invariants and state equation in 645 ms returned []
Implicit Place search using SMT with State Equation took 973 ms to find 0 implicit places.
// Phase 1: matrix 806 rows 291 cols
[2022-06-11 02:32:45] [INFO ] Computed 13 place invariants in 4 ms
[2022-06-11 02:32:45] [INFO ] Dead Transitions using invariants and state equation in 648 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 291/296 places, 806/811 transitions.
Finished structural reductions, in 1 iterations. Remains : 291/296 places, 806/811 transitions.
Stuttering acceptance computed with spot in 308 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s4 1) (EQ s14 1) (EQ s151 1) (EQ s257 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-00 finished in 2064 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(p0))||p1)))'
Support contains 13 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 811/811 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 292 transition count 807
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 292 transition count 807
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 291 transition count 806
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 291 transition count 806
Applied a total of 10 rules in 23 ms. Remains 291 /296 variables (removed 5) and now considering 806/811 (removed 5) transitions.
// Phase 1: matrix 806 rows 291 cols
[2022-06-11 02:32:46] [INFO ] Computed 13 place invariants in 6 ms
[2022-06-11 02:32:46] [INFO ] Implicit Places using invariants in 384 ms returned []
// Phase 1: matrix 806 rows 291 cols
[2022-06-11 02:32:46] [INFO ] Computed 13 place invariants in 4 ms
[2022-06-11 02:32:47] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 931 ms to find 0 implicit places.
// Phase 1: matrix 806 rows 291 cols
[2022-06-11 02:32:47] [INFO ] Computed 13 place invariants in 5 ms
[2022-06-11 02:32:47] [INFO ] Dead Transitions using invariants and state equation in 665 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 291/296 places, 806/811 transitions.
Finished structural reductions, in 1 iterations. Remains : 291/296 places, 806/811 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s56 1) (EQ s81 1) (EQ s111 1) (EQ s131 1) (EQ s161 1) (EQ s186 1) (EQ s211 1) (EQ s231 1) (EQ s258 1)), p0:(AND (EQ s4 1) (EQ s13 1) (EQ s176 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 114 steps with 0 reset in 3 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-02 finished in 1740 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0 U p1))) U p2))'
Support contains 12 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 811/811 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 293 transition count 808
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 293 transition count 808
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 292 transition count 807
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 292 transition count 807
Applied a total of 8 rules in 25 ms. Remains 292 /296 variables (removed 4) and now considering 807/811 (removed 4) transitions.
// Phase 1: matrix 807 rows 292 cols
[2022-06-11 02:32:47] [INFO ] Computed 13 place invariants in 5 ms
[2022-06-11 02:32:48] [INFO ] Implicit Places using invariants in 284 ms returned []
// Phase 1: matrix 807 rows 292 cols
[2022-06-11 02:32:48] [INFO ] Computed 13 place invariants in 4 ms
[2022-06-11 02:32:48] [INFO ] Implicit Places using invariants and state equation in 715 ms returned []
Implicit Place search using SMT with State Equation took 1001 ms to find 0 implicit places.
// Phase 1: matrix 807 rows 292 cols
[2022-06-11 02:32:48] [INFO ] Computed 13 place invariants in 5 ms
[2022-06-11 02:32:49] [INFO ] Dead Transitions using invariants and state equation in 609 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 292/296 places, 807/811 transitions.
Finished structural reductions, in 1 iterations. Remains : 292/296 places, 807/811 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (NOT p1), true]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s267 1) (EQ s286 1)), p1:(AND (EQ s61 1) (EQ s86 1) (EQ s106 1) (EQ s131 1) (EQ s156 1) (EQ s186 1) (EQ s211 1) (EQ s236 1) (EQ s258 1)), p0:(...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 125 steps with 0 reset in 3 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-03 finished in 1874 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(G(F(p0)))))'
Support contains 1 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 811/811 transitions.
Graph (trivial) has 281 edges and 296 vertex of which 4 / 296 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 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 110 place count 293 transition count 699
Reduce places removed 109 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 156 rules applied. Total rules applied 266 place count 184 transition count 652
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 294 place count 156 transition count 652
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 294 place count 156 transition count 646
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 306 place count 150 transition count 646
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 309 place count 147 transition count 643
Iterating global reduction 3 with 3 rules applied. Total rules applied 312 place count 147 transition count 643
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 312 place count 147 transition count 642
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 314 place count 146 transition count 642
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 315 place count 145 transition count 634
Iterating global reduction 3 with 1 rules applied. Total rules applied 316 place count 145 transition count 634
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 3 with 2 rules applied. Total rules applied 318 place count 145 transition count 632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 319 place count 144 transition count 632
Performed 64 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 5 with 128 rules applied. Total rules applied 447 place count 80 transition count 567
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 448 place count 80 transition count 566
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 463 place count 65 transition count 446
Iterating global reduction 6 with 15 rules applied. Total rules applied 478 place count 65 transition count 446
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 485 place count 65 transition count 439
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 489 place count 63 transition count 437
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 491 place count 61 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 492 place count 60 transition count 435
Applied a total of 492 rules in 201 ms. Remains 60 /296 variables (removed 236) and now considering 435/811 (removed 376) transitions.
// Phase 1: matrix 435 rows 60 cols
[2022-06-11 02:32:49] [INFO ] Computed 11 place invariants in 5 ms
[2022-06-11 02:32:50] [INFO ] Implicit Places using invariants in 250 ms returned []
// Phase 1: matrix 435 rows 60 cols
[2022-06-11 02:32:50] [INFO ] Computed 11 place invariants in 3 ms
[2022-06-11 02:32:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 02:32:50] [INFO ] Implicit Places using invariants and state equation in 441 ms returned [55, 59]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 700 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/296 places, 435/811 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 57 transition count 434
Applied a total of 2 rules in 42 ms. Remains 57 /58 variables (removed 1) and now considering 434/435 (removed 1) transitions.
// Phase 1: matrix 434 rows 57 cols
[2022-06-11 02:32:50] [INFO ] Computed 9 place invariants in 3 ms
[2022-06-11 02:32:50] [INFO ] Implicit Places using invariants in 254 ms returned []
// Phase 1: matrix 434 rows 57 cols
[2022-06-11 02:32:50] [INFO ] Computed 9 place invariants in 5 ms
[2022-06-11 02:32:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 02:32:51] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 729 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 57/296 places, 434/811 transitions.
Finished structural reductions, in 2 iterations. Remains : 57/296 places, 434/811 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s40 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 368 reset in 270 ms.
Product exploration explored 100000 steps with 318 reset in 165 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Finished random walk after 87 steps, including 6 resets, run visited all 1 properties in 2 ms. (steps per millisecond=43 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 434/434 transitions.
Applied a total of 0 rules in 28 ms. Remains 57 /57 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 57 cols
[2022-06-11 02:32:52] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-11 02:32:52] [INFO ] Implicit Places using invariants in 242 ms returned []
// Phase 1: matrix 434 rows 57 cols
[2022-06-11 02:32:52] [INFO ] Computed 9 place invariants in 3 ms
[2022-06-11 02:32:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 02:32:53] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 709 ms to find 0 implicit places.
[2022-06-11 02:32:53] [INFO ] Redundant transitions in 53 ms returned [295]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 433 rows 57 cols
[2022-06-11 02:32:53] [INFO ] Computed 9 place invariants in 6 ms
[2022-06-11 02:32:53] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/57 places, 433/434 transitions.
Reduce places removed 1 places and 1 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 55 transition count 431
Applied a total of 2 rules in 24 ms. Remains 55 /57 variables (removed 2) and now considering 431/433 (removed 2) transitions.
// Phase 1: matrix 431 rows 55 cols
[2022-06-11 02:32:53] [INFO ] Computed 9 place invariants in 3 ms
[2022-06-11 02:32:53] [INFO ] Implicit Places using invariants in 246 ms returned []
// Phase 1: matrix 431 rows 55 cols
[2022-06-11 02:32:54] [INFO ] Computed 9 place invariants in 4 ms
[2022-06-11 02:32:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 02:32:54] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/57 places, 431/434 transitions.
Finished structural reductions, in 2 iterations. Remains : 55/57 places, 431/434 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Finished random walk after 84 steps, including 4 resets, run visited all 1 properties in 2 ms. (steps per millisecond=42 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 165 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 994 reset in 115 ms.
Product exploration explored 100000 steps with 270 reset in 114 ms.
Built C files in :
/tmp/ltsmin89213485522411013
[2022-06-11 02:32:55] [INFO ] Computing symmetric may disable matrix : 431 transitions.
[2022-06-11 02:32:55] [INFO ] Computation of Complete disable matrix. took 37 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 02:32:55] [INFO ] Computing symmetric may enable matrix : 431 transitions.
[2022-06-11 02:32:55] [INFO ] Computation of Complete enable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 02:32:55] [INFO ] Computing Do-Not-Accords matrix : 431 transitions.
[2022-06-11 02:32:55] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 02:32:55] [INFO ] Built C files in 189ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin89213485522411013
Running compilation step : cd /tmp/ltsmin89213485522411013;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2725 ms.
Running link step : cd /tmp/ltsmin89213485522411013;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin89213485522411013;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10286908027407314369.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 431/431 transitions.
Applied a total of 0 rules in 24 ms. Remains 55 /55 variables (removed 0) and now considering 431/431 (removed 0) transitions.
// Phase 1: matrix 431 rows 55 cols
[2022-06-11 02:33:10] [INFO ] Computed 9 place invariants in 3 ms
[2022-06-11 02:33:10] [INFO ] Implicit Places using invariants in 183 ms returned []
// Phase 1: matrix 431 rows 55 cols
[2022-06-11 02:33:10] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-11 02:33:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 02:33:10] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
[2022-06-11 02:33:11] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 431 rows 55 cols
[2022-06-11 02:33:11] [INFO ] Computed 9 place invariants in 5 ms
[2022-06-11 02:33:11] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/55 places, 431/431 transitions.
Built C files in :
/tmp/ltsmin9243230141317163613
[2022-06-11 02:33:11] [INFO ] Computing symmetric may disable matrix : 431 transitions.
[2022-06-11 02:33:11] [INFO ] Computation of Complete disable matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 02:33:11] [INFO ] Computing symmetric may enable matrix : 431 transitions.
[2022-06-11 02:33:11] [INFO ] Computation of Complete enable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 02:33:11] [INFO ] Computing Do-Not-Accords matrix : 431 transitions.
[2022-06-11 02:33:11] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 02:33:11] [INFO ] Built C files in 131ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9243230141317163613
Running compilation step : cd /tmp/ltsmin9243230141317163613;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2357 ms.
Running link step : cd /tmp/ltsmin9243230141317163613;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin9243230141317163613;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2898535836374237855.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 02:33:26] [INFO ] Flatten gal took : 101 ms
[2022-06-11 02:33:26] [INFO ] Flatten gal took : 81 ms
[2022-06-11 02:33:26] [INFO ] Time to serialize gal into /tmp/LTL7890236585210632835.gal : 18 ms
[2022-06-11 02:33:26] [INFO ] Time to serialize properties into /tmp/LTL17033588332896289235.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7890236585210632835.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17033588332896289235.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7890236...267
Read 1 LTL properties
Checking formula 0 : !((F(G(G(F("(p245==0)"))))))
Formula 0 simplified : !FGF"(p245==0)"
Reverse transition relation is NOT exact ! Due to transitions t69, t73, t95, t99, t121, t125, t147, t151, t173, t177, t199, t203, t226, t230, t252, t256, t...4262
Computing Next relation with stutter on 124131 deadlock states
Detected timeout of ITS tools.
[2022-06-11 02:33:41] [INFO ] Flatten gal took : 121 ms
[2022-06-11 02:33:41] [INFO ] Applying decomposition
[2022-06-11 02:33:42] [INFO ] Flatten gal took : 118 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/graph11957743831203896198.txt' '-o' '/tmp/graph11957743831203896198.bin' '-w' '/tmp/graph11957743831203896198.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11957743831203896198.bin' '-l' '-1' '-v' '-w' '/tmp/graph11957743831203896198.weights' '-q' '0' '-e' '0.001'
[2022-06-11 02:33:42] [INFO ] Decomposing Gal with order
[2022-06-11 02:33:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 02:33:42] [INFO ] Removed a total of 2535 redundant transitions.
[2022-06-11 02:33:42] [INFO ] Flatten gal took : 274 ms
[2022-06-11 02:33:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 49 ms.
[2022-06-11 02:33:42] [INFO ] Time to serialize gal into /tmp/LTL11888572222929560347.gal : 10 ms
[2022-06-11 02:33:42] [INFO ] Time to serialize properties into /tmp/LTL2701927390171036869.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11888572222929560347.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2701927390171036869.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1188857...246
Read 1 LTL properties
Checking formula 0 : !((F(G(G(F("(i7.u12.p245==0)"))))))
Formula 0 simplified : !FGF"(i7.u12.p245==0)"
Reverse transition relation is NOT exact ! Due to transitions t282_t442_t271_t272_t41_t42_t37_t38, t282_t418_t257_t41_t42_t37_t38, t282_t410_t244_t245_t41_...820
Computing Next relation with stutter on 124131 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
293 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.97862,78108,1,0,109415,5160,7352,335532,434,30485,242471
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutonomousCar-PT-08b-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutonomousCar-PT-08b-LTLFireability-04 finished in 56592 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(G(p1)))))'
Support contains 5 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 811/811 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 293 transition count 808
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 293 transition count 808
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 292 transition count 807
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 292 transition count 807
Applied a total of 8 rules in 20 ms. Remains 292 /296 variables (removed 4) and now considering 807/811 (removed 4) transitions.
// Phase 1: matrix 807 rows 292 cols
[2022-06-11 02:33:46] [INFO ] Computed 13 place invariants in 4 ms
[2022-06-11 02:33:46] [INFO ] Implicit Places using invariants in 280 ms returned []
// Phase 1: matrix 807 rows 292 cols
[2022-06-11 02:33:46] [INFO ] Computed 13 place invariants in 7 ms
[2022-06-11 02:33:47] [INFO ] Implicit Places using invariants and state equation in 945 ms returned []
Implicit Place search using SMT with State Equation took 1228 ms to find 0 implicit places.
// Phase 1: matrix 807 rows 292 cols
[2022-06-11 02:33:47] [INFO ] Computed 13 place invariants in 11 ms
[2022-06-11 02:33:48] [INFO ] Dead Transitions using invariants and state equation in 763 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 292/296 places, 807/811 transitions.
Finished structural reductions, in 1 iterations. Remains : 292/296 places, 807/811 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s4 0) (EQ s15 0) (EQ s57 0) (EQ s258 0)), p1:(EQ s239 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 161 reset in 443 ms.
Product exploration explored 100000 steps with 35 reset in 176 ms.
Computed a total of 45 stabilizing places and 46 stable transitions
Computed a total of 45 stabilizing places and 46 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 368 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 88 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 363552 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :{}
Probabilistic random walk after 363552 steps, saw 64690 distinct states, run finished after 3003 ms. (steps per millisecond=121 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 807 rows 292 cols
[2022-06-11 02:33:53] [INFO ] Computed 13 place invariants in 13 ms
[2022-06-11 02:33:53] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-11 02:33:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2022-06-11 02:33:53] [INFO ] After 523ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-11 02:33:54] [INFO ] Deduced a trap composed of 44 places in 470 ms of which 1 ms to minimize.
[2022-06-11 02:33:54] [INFO ] Deduced a trap composed of 46 places in 473 ms of which 2 ms to minimize.
[2022-06-11 02:33:55] [INFO ] Deduced a trap composed of 31 places in 441 ms of which 2 ms to minimize.
[2022-06-11 02:33:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1553 ms
[2022-06-11 02:33:55] [INFO ] Deduced a trap composed of 31 places in 371 ms of which 0 ms to minimize.
[2022-06-11 02:33:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 447 ms
[2022-06-11 02:33:56] [INFO ] After 2749ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 199 ms.
[2022-06-11 02:33:56] [INFO ] After 3051ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 44 ms.
Support contains 5 out of 292 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 292/292 places, 807/807 transitions.
Graph (trivial) has 274 edges and 292 vertex of which 4 / 292 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1319 edges and 290 vertex of which 288 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 107 rules applied. Total rules applied 109 place count 288 transition count 696
Reduce places removed 105 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 1 with 154 rules applied. Total rules applied 263 place count 183 transition count 647
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 292 place count 154 transition count 647
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 292 place count 154 transition count 642
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 302 place count 149 transition count 642
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 138 rules applied. Total rules applied 440 place count 80 transition count 573
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 441 place count 80 transition count 572
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 457 place count 64 transition count 444
Iterating global reduction 4 with 16 rules applied. Total rules applied 473 place count 64 transition count 444
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 481 place count 64 transition count 436
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 483 place count 63 transition count 435
Free-agglomeration rule applied 9 times.
Iterating global reduction 5 with 9 rules applied. Total rules applied 492 place count 63 transition count 426
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 501 place count 54 transition count 426
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 502 place count 54 transition count 426
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 503 place count 53 transition count 425
Applied a total of 503 rules in 163 ms. Remains 53 /292 variables (removed 239) and now considering 425/807 (removed 382) transitions.
Finished structural reductions, in 1 iterations. Remains : 53/292 places, 425/807 transitions.
Finished random walk after 7376 steps, including 41 resets, run visited all 3 properties in 66 ms. (steps per millisecond=111 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 324 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 5 out of 292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 292/292 places, 807/807 transitions.
Applied a total of 0 rules in 5 ms. Remains 292 /292 variables (removed 0) and now considering 807/807 (removed 0) transitions.
// Phase 1: matrix 807 rows 292 cols
[2022-06-11 02:33:57] [INFO ] Computed 13 place invariants in 3 ms
[2022-06-11 02:33:57] [INFO ] Implicit Places using invariants in 263 ms returned []
// Phase 1: matrix 807 rows 292 cols
[2022-06-11 02:33:57] [INFO ] Computed 13 place invariants in 4 ms
[2022-06-11 02:33:58] [INFO ] Implicit Places using invariants and state equation in 816 ms returned []
Implicit Place search using SMT with State Equation took 1081 ms to find 0 implicit places.
// Phase 1: matrix 807 rows 292 cols
[2022-06-11 02:33:58] [INFO ] Computed 13 place invariants in 3 ms
[2022-06-11 02:33:58] [INFO ] Dead Transitions using invariants and state equation in 524 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 292/292 places, 807/807 transitions.
Computed a total of 45 stabilizing places and 46 stable transitions
Computed a total of 45 stabilizing places and 46 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 280 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 89 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 346361 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :{}
Probabilistic random walk after 346361 steps, saw 62478 distinct states, run finished after 3002 ms. (steps per millisecond=115 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 807 rows 292 cols
[2022-06-11 02:34:02] [INFO ] Computed 13 place invariants in 3 ms
[2022-06-11 02:34:02] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-11 02:34:02] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2022-06-11 02:34:03] [INFO ] After 703ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-11 02:34:04] [INFO ] Deduced a trap composed of 44 places in 503 ms of which 1 ms to minimize.
[2022-06-11 02:34:04] [INFO ] Deduced a trap composed of 46 places in 480 ms of which 1 ms to minimize.
[2022-06-11 02:34:05] [INFO ] Deduced a trap composed of 31 places in 449 ms of which 1 ms to minimize.
[2022-06-11 02:34:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1592 ms
[2022-06-11 02:34:05] [INFO ] Deduced a trap composed of 31 places in 284 ms of which 0 ms to minimize.
[2022-06-11 02:34:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 345 ms
[2022-06-11 02:34:05] [INFO ] After 2852ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 184 ms.
[2022-06-11 02:34:05] [INFO ] After 3185ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 23 ms.
Support contains 5 out of 292 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 292/292 places, 807/807 transitions.
Graph (trivial) has 274 edges and 292 vertex of which 4 / 292 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1319 edges and 290 vertex of which 288 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 107 rules applied. Total rules applied 109 place count 288 transition count 696
Reduce places removed 105 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 1 with 154 rules applied. Total rules applied 263 place count 183 transition count 647
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 292 place count 154 transition count 647
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 292 place count 154 transition count 642
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 302 place count 149 transition count 642
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 1 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 138 rules applied. Total rules applied 440 place count 80 transition count 573
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 441 place count 80 transition count 572
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 457 place count 64 transition count 444
Iterating global reduction 4 with 16 rules applied. Total rules applied 473 place count 64 transition count 444
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 481 place count 64 transition count 436
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 483 place count 63 transition count 435
Free-agglomeration rule applied 9 times.
Iterating global reduction 5 with 9 rules applied. Total rules applied 492 place count 63 transition count 426
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 501 place count 54 transition count 426
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 502 place count 54 transition count 426
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 503 place count 53 transition count 425
Applied a total of 503 rules in 110 ms. Remains 53 /292 variables (removed 239) and now considering 425/807 (removed 382) transitions.
Finished structural reductions, in 1 iterations. Remains : 53/292 places, 425/807 transitions.
Incomplete random walk after 10000 steps, including 58 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 425 rows 53 cols
[2022-06-11 02:34:06] [INFO ] Computed 13 place invariants in 3 ms
[2022-06-11 02:34:06] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 02:34:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2022-06-11 02:34:06] [INFO ] After 257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 02:34:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 02:34:06] [INFO ] After 79ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 02:34:06] [INFO ] After 168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 79 ms.
[2022-06-11 02:34:06] [INFO ] After 549ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 53/53 places, 425/425 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 52 transition count 424
Applied a total of 2 rules in 21 ms. Remains 52 /53 variables (removed 1) and now considering 424/425 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 52/53 places, 424/425 transitions.
Finished random walk after 5743 steps, including 36 resets, run visited all 1 properties in 40 ms. (steps per millisecond=143 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 480 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 141 ms.
Product exploration explored 100000 steps with 334 reset in 197 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 5 out of 292 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 292/292 places, 807/807 transitions.
Graph (trivial) has 274 edges and 292 vertex of which 4 / 292 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.
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 104 rules applied. Total rules applied 105 place count 290 transition count 805
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 124 place count 290 transition count 786
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 124 place count 290 transition count 786
Deduced a syphon composed of 125 places in 1 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 145 place count 290 transition count 786
Discarding 89 places :
Symmetric choice reduction at 2 with 89 rule applications. Total rules 234 place count 201 transition count 697
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 2 with 89 rules applied. Total rules applied 323 place count 201 transition count 697
Performed 82 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 119 places in 0 ms
Iterating global reduction 2 with 82 rules applied. Total rules applied 405 place count 201 transition count 708
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 407 place count 201 transition count 706
Discarding 69 places :
Symmetric choice reduction at 3 with 69 rule applications. Total rules 476 place count 132 transition count 525
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 3 with 69 rules applied. Total rules applied 545 place count 132 transition count 525
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 561 place count 132 transition count 509
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 570 place count 123 transition count 500
Deduced a syphon composed of 57 places in 1 ms
Iterating global reduction 4 with 9 rules applied. Total rules applied 579 place count 123 transition count 500
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 1 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 580 place count 123 transition count 500
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 582 place count 121 transition count 498
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 584 place count 121 transition count 498
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 585 place count 121 transition count 500
Deduced a syphon composed of 57 places in 0 ms
Applied a total of 585 rules in 129 ms. Remains 121 /292 variables (removed 171) and now considering 500/807 (removed 307) transitions.
[2022-06-11 02:34:08] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 500 rows 121 cols
[2022-06-11 02:34:08] [INFO ] Computed 12 place invariants in 8 ms
[2022-06-11 02:34:08] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/292 places, 500/807 transitions.
Finished structural reductions, in 1 iterations. Remains : 121/292 places, 500/807 transitions.
Stuttering criterion allowed to conclude after 4643 steps with 216 reset in 51 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-05 finished in 22687 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||F(p1))))'
Support contains 13 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 811/811 transitions.
Graph (trivial) has 262 edges and 296 vertex of which 4 / 296 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 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 110 place count 293 transition count 699
Reduce places removed 109 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 156 rules applied. Total rules applied 266 place count 184 transition count 652
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 294 place count 156 transition count 652
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 294 place count 156 transition count 647
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 304 place count 151 transition count 647
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 307 place count 148 transition count 644
Iterating global reduction 3 with 3 rules applied. Total rules applied 310 place count 148 transition count 644
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 311 place count 147 transition count 636
Iterating global reduction 3 with 1 rules applied. Total rules applied 312 place count 147 transition count 636
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 3 with 2 rules applied. Total rules applied 314 place count 147 transition count 634
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 315 place count 146 transition count 634
Performed 56 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 5 with 112 rules applied. Total rules applied 427 place count 90 transition count 577
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 428 place count 90 transition count 576
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 437 place count 81 transition count 509
Iterating global reduction 6 with 9 rules applied. Total rules applied 446 place count 81 transition count 509
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 452 place count 81 transition count 503
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 456 place count 79 transition count 501
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 457 place count 79 transition count 501
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 459 place count 77 transition count 499
Applied a total of 459 rules in 127 ms. Remains 77 /296 variables (removed 219) and now considering 499/811 (removed 312) transitions.
// Phase 1: matrix 499 rows 77 cols
[2022-06-11 02:34:09] [INFO ] Computed 12 place invariants in 11 ms
[2022-06-11 02:34:09] [INFO ] Implicit Places using invariants in 171 ms returned []
// Phase 1: matrix 499 rows 77 cols
[2022-06-11 02:34:09] [INFO ] Computed 12 place invariants in 5 ms
[2022-06-11 02:34:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 02:34:09] [INFO ] Implicit Places using invariants and state equation in 386 ms returned [72, 76]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 563 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/296 places, 499/811 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 74 transition count 498
Applied a total of 2 rules in 22 ms. Remains 74 /75 variables (removed 1) and now considering 498/499 (removed 1) transitions.
// Phase 1: matrix 498 rows 74 cols
[2022-06-11 02:34:09] [INFO ] Computed 10 place invariants in 4 ms
[2022-06-11 02:34:09] [INFO ] Implicit Places using invariants in 109 ms returned []
// Phase 1: matrix 498 rows 74 cols
[2022-06-11 02:34:09] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-11 02:34:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 02:34:10] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 74/296 places, 498/811 transitions.
Finished structural reductions, in 2 iterations. Remains : 74/296 places, 498/811 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s14 1) (EQ s21 1) (EQ s30 1) (EQ s34 1) (EQ s41 1) (EQ s48 1) (EQ s57 1) (EQ s66 1) (EQ s70 1)), p1:(AND (EQ s1 1) (EQ s6 1) (EQ s53 1) (EQ s6...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-06 finished in 1297 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U G(p1))||X(F(p2)))))'
Support contains 7 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 811/811 transitions.
Graph (trivial) has 275 edges and 296 vertex of which 4 / 296 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 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 107 place count 293 transition count 702
Reduce places removed 106 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 150 rules applied. Total rules applied 257 place count 187 transition count 658
Reduce places removed 26 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 27 rules applied. Total rules applied 284 place count 161 transition count 657
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 287 place count 160 transition count 655
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 288 place count 159 transition count 655
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 288 place count 159 transition count 650
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 298 place count 154 transition count 650
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 301 place count 151 transition count 647
Iterating global reduction 5 with 3 rules applied. Total rules applied 304 place count 151 transition count 647
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 304 place count 151 transition count 646
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 306 place count 150 transition count 646
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 307 place count 149 transition count 638
Iterating global reduction 5 with 1 rules applied. Total rules applied 308 place count 149 transition count 638
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 5 with 2 rules applied. Total rules applied 310 place count 149 transition count 636
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 311 place count 148 transition count 636
Performed 64 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 7 with 128 rules applied. Total rules applied 439 place count 84 transition count 571
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 440 place count 84 transition count 570
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 454 place count 70 transition count 458
Iterating global reduction 8 with 14 rules applied. Total rules applied 468 place count 70 transition count 458
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 474 place count 70 transition count 452
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 478 place count 68 transition count 450
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 479 place count 68 transition count 450
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 481 place count 66 transition count 448
Applied a total of 481 rules in 141 ms. Remains 66 /296 variables (removed 230) and now considering 448/811 (removed 363) transitions.
// Phase 1: matrix 448 rows 66 cols
[2022-06-11 02:34:10] [INFO ] Computed 12 place invariants in 3 ms
[2022-06-11 02:34:10] [INFO ] Implicit Places using invariants in 270 ms returned []
// Phase 1: matrix 448 rows 66 cols
[2022-06-11 02:34:10] [INFO ] Computed 12 place invariants in 7 ms
[2022-06-11 02:34:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 02:34:11] [INFO ] Implicit Places using invariants and state equation in 494 ms returned [61, 65]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 785 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/296 places, 448/811 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 447
Applied a total of 2 rules in 42 ms. Remains 63 /64 variables (removed 1) and now considering 447/448 (removed 1) transitions.
// Phase 1: matrix 447 rows 63 cols
[2022-06-11 02:34:11] [INFO ] Computed 10 place invariants in 4 ms
[2022-06-11 02:34:11] [INFO ] Implicit Places using invariants in 259 ms returned []
// Phase 1: matrix 447 rows 63 cols
[2022-06-11 02:34:11] [INFO ] Computed 10 place invariants in 19 ms
[2022-06-11 02:34:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 02:34:12] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 784 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 63/296 places, 447/811 transitions.
Finished structural reductions, in 2 iterations. Remains : 63/296 places, 447/811 transitions.
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s39 1), p0:(AND (EQ s1 1) (EQ s5 1) (EQ s24 1) (EQ s59 1)), p2:(AND (EQ s1 1) (EQ s10 1) (EQ s41 1) (EQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-07 finished in 2031 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U p1))&&(G(p2)||F(G(!p0)))))'
Support contains 11 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 811/811 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 293 transition count 808
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 293 transition count 808
Applied a total of 6 rules in 16 ms. Remains 293 /296 variables (removed 3) and now considering 808/811 (removed 3) transitions.
// Phase 1: matrix 808 rows 293 cols
[2022-06-11 02:34:12] [INFO ] Computed 13 place invariants in 3 ms
[2022-06-11 02:34:12] [INFO ] Implicit Places using invariants in 227 ms returned []
// Phase 1: matrix 808 rows 293 cols
[2022-06-11 02:34:12] [INFO ] Computed 13 place invariants in 5 ms
[2022-06-11 02:34:13] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
// Phase 1: matrix 808 rows 293 cols
[2022-06-11 02:34:13] [INFO ] Computed 13 place invariants in 6 ms
[2022-06-11 02:34:14] [INFO ] Dead Transitions using invariants and state equation in 892 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 293/296 places, 808/811 transitions.
Finished structural reductions, in 1 iterations. Remains : 293/296 places, 808/811 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p1) (AND p0 (NOT p2))), (NOT p1), p0, (AND p0 (NOT p2)), true]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s62 1) (EQ s83 1) (EQ s108 1) (EQ s138 1) (EQ s158 1) (EQ s183 1) (EQ s213 1) (EQ s238 1) (EQ s260 1)), p0:(NEQ s40 1), p1:(OR (EQ s40 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 97 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-08 finished in 1898 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(F(p0) U G((G(p1) U p2)))))'
Support contains 16 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 811/811 transitions.
Graph (trivial) has 254 edges and 296 vertex of which 4 / 296 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 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 108 place count 293 transition count 701
Reduce places removed 107 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 154 rules applied. Total rules applied 262 place count 186 transition count 654
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 290 place count 158 transition count 654
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 290 place count 158 transition count 648
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 302 place count 152 transition count 648
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 305 place count 149 transition count 645
Iterating global reduction 3 with 3 rules applied. Total rules applied 308 place count 149 transition count 645
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 309 place count 148 transition count 637
Iterating global reduction 3 with 1 rules applied. Total rules applied 310 place count 148 transition count 637
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 3 with 2 rules applied. Total rules applied 312 place count 148 transition count 635
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 313 place count 147 transition count 635
Performed 54 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 5 with 108 rules applied. Total rules applied 421 place count 93 transition count 580
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 422 place count 93 transition count 579
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 433 place count 82 transition count 495
Iterating global reduction 6 with 11 rules applied. Total rules applied 444 place count 82 transition count 495
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 451 place count 82 transition count 488
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 455 place count 80 transition count 486
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 457 place count 78 transition count 484
Applied a total of 457 rules in 82 ms. Remains 78 /296 variables (removed 218) and now considering 484/811 (removed 327) transitions.
// Phase 1: matrix 484 rows 78 cols
[2022-06-11 02:34:14] [INFO ] Computed 12 place invariants in 3 ms
[2022-06-11 02:34:14] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 484 rows 78 cols
[2022-06-11 02:34:14] [INFO ] Computed 12 place invariants in 2 ms
[2022-06-11 02:34:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 02:34:14] [INFO ] Implicit Places using invariants and state equation in 365 ms returned [73, 77]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 476 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/296 places, 484/811 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 75 transition count 483
Applied a total of 2 rules in 31 ms. Remains 75 /76 variables (removed 1) and now considering 483/484 (removed 1) transitions.
// Phase 1: matrix 483 rows 75 cols
[2022-06-11 02:34:14] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-11 02:34:14] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 483 rows 75 cols
[2022-06-11 02:34:14] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-11 02:34:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 02:34:15] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 75/296 places, 483/811 transitions.
Finished structural reductions, in 2 iterations. Remains : 75/296 places, 483/811 transitions.
Stuttering acceptance computed with spot in 248 ms :[p2, p2, (AND p0 p2), (AND p2 p1)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=p2, acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s15 1) (EQ s26 1) (EQ s32 1) (EQ s36 1) (EQ s45 1) (EQ s50 1) (EQ s61 1) (EQ s67 1) (EQ s71 1)), p2:(AND (EQ s18 1) (EQ s23 1) (EQ s32 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 44 reset in 91 ms.
Product exploration explored 100000 steps with 121 reset in 266 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 621 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 4 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 156 ms :[p2, p2, (AND p0 p2), (AND p2 p1)]
Incomplete random walk after 10000 steps, including 322 resets, run finished after 467 ms. (steps per millisecond=21 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 483 rows 75 cols
[2022-06-11 02:34:17] [INFO ] Computed 10 place invariants in 4 ms
[2022-06-11 02:34:17] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2022-06-11 02:34:17] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2022-06-11 02:34:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-11 02:34:17] [INFO ] After 360ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2022-06-11 02:34:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 02:34:18] [INFO ] After 213ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2022-06-11 02:34:18] [INFO ] Deduced a trap composed of 7 places in 262 ms of which 1 ms to minimize.
[2022-06-11 02:34:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 301 ms
[2022-06-11 02:34:18] [INFO ] After 745ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 224 ms.
[2022-06-11 02:34:18] [INFO ] After 1372ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 16 out of 75 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 75/75 places, 483/483 transitions.
Graph (complete) has 769 edges and 75 vertex of which 74 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 74 transition count 480
Free-agglomeration rule applied 13 times.
Iterating global reduction 1 with 13 rules applied. Total rules applied 16 place count 74 transition count 467
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 29 place count 61 transition count 467
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 61 transition count 468
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 60 transition count 468
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 35 place count 60 transition count 468
Applied a total of 35 rules in 77 ms. Remains 60 /75 variables (removed 15) and now considering 468/483 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 60/75 places, 468/483 transitions.
Incomplete random walk after 10000 steps, including 53 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 534445 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :{}
Probabilistic random walk after 534445 steps, saw 82118 distinct states, run finished after 3002 ms. (steps per millisecond=178 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 468 rows 60 cols
[2022-06-11 02:34:22] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 02:34:22] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2022-06-11 02:34:22] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 02:34:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-11 02:34:22] [INFO ] After 406ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 02:34:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 02:34:23] [INFO ] After 362ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 02:34:23] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 1 ms to minimize.
[2022-06-11 02:34:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 318 ms
[2022-06-11 02:34:24] [INFO ] Deduced a trap composed of 6 places in 281 ms of which 2 ms to minimize.
[2022-06-11 02:34:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 345 ms
[2022-06-11 02:34:24] [INFO ] After 1365ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 376 ms.
[2022-06-11 02:34:24] [INFO ] After 2191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 26 ms.
Support contains 16 out of 60 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 468/468 transitions.
Applied a total of 0 rules in 24 ms. Remains 60 /60 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 468/468 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 468/468 transitions.
Applied a total of 0 rules in 23 ms. Remains 60 /60 variables (removed 0) and now considering 468/468 (removed 0) transitions.
// Phase 1: matrix 468 rows 60 cols
[2022-06-11 02:34:24] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 02:34:24] [INFO ] Implicit Places using invariants in 120 ms returned []
// Phase 1: matrix 468 rows 60 cols
[2022-06-11 02:34:24] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-11 02:34:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 02:34:25] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
[2022-06-11 02:34:25] [INFO ] Redundant transitions in 37 ms returned []
// Phase 1: matrix 468 rows 60 cols
[2022-06-11 02:34:25] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-11 02:34:25] [INFO ] Dead Transitions using invariants and state equation in 604 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 468/468 transitions.
Applied a total of 0 rules in 23 ms. Remains 60 /60 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 468 rows 60 cols
[2022-06-11 02:34:25] [INFO ] Computed 10 place invariants in 6 ms
[2022-06-11 02:34:25] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2022-06-11 02:34:25] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 02:34:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-11 02:34:26] [INFO ] After 395ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 02:34:26] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 0 ms to minimize.
[2022-06-11 02:34:27] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 1 ms to minimize.
[2022-06-11 02:34:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 507 ms
[2022-06-11 02:34:27] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 1 ms to minimize.
[2022-06-11 02:34:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2022-06-11 02:34:27] [INFO ] After 1416ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 311 ms.
[2022-06-11 02:34:27] [INFO ] After 1776ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-11 02:34:27] [INFO ] Flatten gal took : 115 ms
[2022-06-11 02:34:28] [INFO ] Flatten gal took : 94 ms
[2022-06-11 02:34:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12570300004433871649.gal : 21 ms
[2022-06-11 02:34:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5491526977069571418.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms12050407575533621009;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12570300004433871649.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5491526977069571418.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality5491526977069571418.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 32
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :514 after 516
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :516 after 528
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :528 after 598
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :598 after 1192
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1192 after 3666
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3666 after 83418
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :83418 after 132840
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :132840 after 310400
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :310400 after 1.65188e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.65188e+06 after 2.81335e+06
Detected timeout of ITS tools.
[2022-06-11 02:34:43] [INFO ] Flatten gal took : 68 ms
[2022-06-11 02:34:43] [INFO ] Applying decomposition
[2022-06-11 02:34:43] [INFO ] Flatten gal took : 65 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/graph17200638358311721309.txt' '-o' '/tmp/graph17200638358311721309.bin' '-w' '/tmp/graph17200638358311721309.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17200638358311721309.bin' '-l' '-1' '-v' '-w' '/tmp/graph17200638358311721309.weights' '-q' '0' '-e' '0.001'
[2022-06-11 02:34:43] [INFO ] Decomposing Gal with order
[2022-06-11 02:34:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 02:34:43] [INFO ] Removed a total of 2697 redundant transitions.
[2022-06-11 02:34:43] [INFO ] Flatten gal took : 192 ms
[2022-06-11 02:34:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 75 labels/synchronizations in 23 ms.
[2022-06-11 02:34:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16191408056114647528.gal : 3 ms
[2022-06-11 02:34:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1093646513174771243.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms12050407575533621009;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16191408056114647528.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1093646513174771243.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality1093646513174771243.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :131584 after 131585
Reachability property apf3 is true.
Reachability property apf2 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 9 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4.9905e+06,1.2871,25512,883,282,35733,1224,182,171257,142,4178,0
Total reachable state count : 4990505

Verifying 2 reachability properties.
Reachability property apf2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf2,120,1.51475,25776,44,26,35733,1224,276,171257,161,4178,0
Reachability property apf3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf3,120,1.62299,25776,44,26,35733,1224,281,171257,161,4178,0
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (G (NOT (AND p2 p0))), (G (NOT (AND p2 p1)))]
False Knowledge obtained : [(F p0), (F p2)]
Knowledge based reduction with 15 factoid took 931 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 148 ms :[p2, p2, (AND p0 p2)]
Stuttering acceptance computed with spot in 120 ms :[p2, p2, (AND p0 p2)]
Support contains 12 out of 75 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 483/483 transitions.
Applied a total of 0 rules in 26 ms. Remains 75 /75 variables (removed 0) and now considering 483/483 (removed 0) transitions.
// Phase 1: matrix 483 rows 75 cols
[2022-06-11 02:34:46] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 02:34:46] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 483 rows 75 cols
[2022-06-11 02:34:46] [INFO ] Computed 10 place invariants in 4 ms
[2022-06-11 02:34:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 02:34:47] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
[2022-06-11 02:34:47] [INFO ] Redundant transitions in 27 ms returned [312]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 482 rows 75 cols
[2022-06-11 02:34:47] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-11 02:34:47] [INFO ] Dead Transitions using invariants and state equation in 576 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/75 places, 482/483 transitions.
Reduce places removed 1 places and 1 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 73 transition count 480
Applied a total of 2 rules in 32 ms. Remains 73 /75 variables (removed 2) and now considering 480/482 (removed 2) transitions.
// Phase 1: matrix 480 rows 73 cols
[2022-06-11 02:34:47] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-11 02:34:47] [INFO ] Implicit Places using invariants in 141 ms returned []
// Phase 1: matrix 480 rows 73 cols
[2022-06-11 02:34:47] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-11 02:34:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 02:34:48] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 73/75 places, 480/483 transitions.
Finished structural reductions, in 2 iterations. Remains : 73/75 places, 480/483 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 262 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 155 ms :[p2, p2, (AND p0 p2)]
Incomplete random walk after 10000 steps, including 333 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :1
Finished Best-First random walk after 4029 steps, including 11 resets, run visited all 1 properties in 8 ms. (steps per millisecond=503 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p2)]
Knowledge based reduction with 5 factoid took 337 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 157 ms :[p2, p2, (AND p0 p2)]
Stuttering acceptance computed with spot in 155 ms :[p2, p2, (AND p0 p2)]
Stuttering acceptance computed with spot in 155 ms :[p2, p2, (AND p0 p2)]
Product exploration explored 100000 steps with 377 reset in 211 ms.
Product exploration explored 100000 steps with 51 reset in 159 ms.
Built C files in :
/tmp/ltsmin14823396891007529137
[2022-06-11 02:34:50] [INFO ] Computing symmetric may disable matrix : 480 transitions.
[2022-06-11 02:34:50] [INFO ] Computation of Complete disable matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 02:34:50] [INFO ] Computing symmetric may enable matrix : 480 transitions.
[2022-06-11 02:34:50] [INFO ] Computation of Complete enable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 02:34:50] [INFO ] Computing Do-Not-Accords matrix : 480 transitions.
[2022-06-11 02:34:50] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 02:34:50] [INFO ] Built C files in 171ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14823396891007529137
Running compilation step : cd /tmp/ltsmin14823396891007529137;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2816 ms.
Running link step : cd /tmp/ltsmin14823396891007529137;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin14823396891007529137;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7471302359009312769.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 12 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 480/480 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 73 transition count 479
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 72 transition count 479
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 72 transition count 478
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 70 transition count 478
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 69 transition count 469
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 69 transition count 469
Applied a total of 7 rules in 30 ms. Remains 69 /73 variables (removed 4) and now considering 469/480 (removed 11) transitions.
// Phase 1: matrix 469 rows 69 cols
[2022-06-11 02:35:05] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-11 02:35:05] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 469 rows 69 cols
[2022-06-11 02:35:05] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-11 02:35:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 02:35:05] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
[2022-06-11 02:35:05] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 469 rows 69 cols
[2022-06-11 02:35:05] [INFO ] Computed 9 place invariants in 3 ms
[2022-06-11 02:35:06] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/73 places, 469/480 transitions.
Finished structural reductions, in 1 iterations. Remains : 69/73 places, 469/480 transitions.
Built C files in :
/tmp/ltsmin7413430599108197878
[2022-06-11 02:35:06] [INFO ] Computing symmetric may disable matrix : 469 transitions.
[2022-06-11 02:35:06] [INFO ] Computation of Complete disable matrix. took 48 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 02:35:06] [INFO ] Computing symmetric may enable matrix : 469 transitions.
[2022-06-11 02:35:06] [INFO ] Computation of Complete enable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 02:35:06] [INFO ] Computing Do-Not-Accords matrix : 469 transitions.
[2022-06-11 02:35:06] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 02:35:06] [INFO ] Built C files in 175ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7413430599108197878
Running compilation step : cd /tmp/ltsmin7413430599108197878;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2988 ms.
Running link step : cd /tmp/ltsmin7413430599108197878;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin7413430599108197878;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17284415383717799720.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 02:35:21] [INFO ] Flatten gal took : 57 ms
[2022-06-11 02:35:21] [INFO ] Flatten gal took : 56 ms
[2022-06-11 02:35:21] [INFO ] Time to serialize gal into /tmp/LTL1504821453220892142.gal : 8 ms
[2022-06-11 02:35:21] [INFO ] Time to serialize properties into /tmp/LTL14343163448433559315.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1504821453220892142.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14343163448433559315.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1504821...267
Read 1 LTL properties
Checking formula 0 : !((F(!((F("(((((p62==1)&&(p99==1))&&((p130==1)&&(p155==1)))&&(((p192==1)&&(p217==1))&&((p254==1)&&(p285==1))))&&(p315==1))"))U(G((G("(...324
Formula 0 simplified : !F!(F"(((((p62==1)&&(p99==1))&&((p130==1)&&(p155==1)))&&(((p192==1)&&(p217==1))&&((p254==1)&&(p285==1))))&&(p315==1))" U G(G"(((p6==...312
Detected timeout of ITS tools.
[2022-06-11 02:35:36] [INFO ] Flatten gal took : 50 ms
[2022-06-11 02:35:36] [INFO ] Applying decomposition
[2022-06-11 02:35:36] [INFO ] Flatten gal took : 55 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/graph5839828117542632628.txt' '-o' '/tmp/graph5839828117542632628.bin' '-w' '/tmp/graph5839828117542632628.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5839828117542632628.bin' '-l' '-1' '-v' '-w' '/tmp/graph5839828117542632628.weights' '-q' '0' '-e' '0.001'
[2022-06-11 02:35:36] [INFO ] Decomposing Gal with order
[2022-06-11 02:35:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 02:35:37] [INFO ] Removed a total of 2749 redundant transitions.
[2022-06-11 02:35:37] [INFO ] Flatten gal took : 104 ms
[2022-06-11 02:35:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 11 ms.
[2022-06-11 02:35:37] [INFO ] Time to serialize gal into /tmp/LTL13312215071249492287.gal : 2 ms
[2022-06-11 02:35:37] [INFO ] Time to serialize properties into /tmp/LTL13357293196070736714.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13312215071249492287.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13357293196070736714.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1331221...247
Read 1 LTL properties
Checking formula 0 : !((F(!((F("(((((i2.u2.p62==1)&&(u6.p99==1))&&((i2.u8.p130==1)&&(i2.u10.p155==1)))&&(((i2.u13.p192==1)&&(i2.u14.p217==1))&&((i2.u18.p25...458
Formula 0 simplified : !F!(F"(((((i2.u2.p62==1)&&(u6.p99==1))&&((i2.u8.p130==1)&&(i2.u10.p155==1)))&&(((i2.u13.p192==1)&&(i2.u14.p217==1))&&((i2.u18.p254==...446
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16993443532126005528
[2022-06-11 02:35:52] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16993443532126005528
Running compilation step : cd /tmp/ltsmin16993443532126005528;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1947 ms.
Running link step : cd /tmp/ltsmin16993443532126005528;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin16993443532126005528;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(!(<>((LTLAPp0==true)) U [](([]((LTLAPp1==true)) U (LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutonomousCar-PT-08b-LTLFireability-09 finished in 112989 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(!p0) U X(p1))) U G(!(F(p1)&&p2))))'
Support contains 13 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 811/811 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 292 transition count 807
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 292 transition count 807
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 291 transition count 806
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 291 transition count 806
Applied a total of 10 rules in 18 ms. Remains 291 /296 variables (removed 5) and now considering 806/811 (removed 5) transitions.
// Phase 1: matrix 806 rows 291 cols
[2022-06-11 02:36:07] [INFO ] Computed 13 place invariants in 4 ms
[2022-06-11 02:36:07] [INFO ] Implicit Places using invariants in 201 ms returned []
// Phase 1: matrix 806 rows 291 cols
[2022-06-11 02:36:07] [INFO ] Computed 13 place invariants in 3 ms
[2022-06-11 02:36:07] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
// Phase 1: matrix 806 rows 291 cols
[2022-06-11 02:36:07] [INFO ] Computed 13 place invariants in 5 ms
[2022-06-11 02:36:08] [INFO ] Dead Transitions using invariants and state equation in 670 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 291/296 places, 806/811 transitions.
Finished structural reductions, in 1 iterations. Remains : 291/296 places, 806/811 transitions.
Stuttering acceptance computed with spot in 476 ms :[(AND p1 p2), (NOT p1), false, false, (AND p1 p2), (NOT p1), true, false, false, p1, (AND p1 p2)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p1), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p2 p1), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={1} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=(AND p2 p1), acceptance={} source=2 dest: 5}, { cond=(NOT p2), acceptance={} source=2 dest: 7}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 8}], [{ cond=p1, acceptance={} source=3 dest: 5}, { cond=(NOT p1), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 0}, { cond=(AND p2 p1), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p2 p1), acceptance={} source=4 dest: 1}, { cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=5 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0, 1} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 7}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=7 dest: 8}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 9}], [{ cond=p1, acceptance={} source=9 dest: 6}, { cond=(NOT p1), acceptance={} source=9 dest: 9}], [{ cond=(AND p2 p1), acceptance={} source=10 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=10 dest: 9}, { cond=(NOT p2), acceptance={} source=10 dest: 10}]], initial=0, aps=[p2:(AND (EQ s4 1) (EQ s6 1) (EQ s201 1) (EQ s257 1)), p1:(AND (EQ s4 1) (EQ s6 1) (EQ s201 1) (EQ s257 1)), p0:(AND (EQ s61 1) (EQ s86 1) (EQ s111 1) (EQ ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 465 reset in 276 ms.
Product exploration explored 100000 steps with 63 reset in 233 ms.
Computed a total of 45 stabilizing places and 46 stable transitions
Computed a total of 45 stabilizing places and 46 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 p1))), (X (NOT (AND p2 (NOT p1)))), (X (OR (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT p2))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (OR (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 1557 ms. Reduced automaton from 11 states, 33 edges and 3 AP to 11 states, 33 edges and 3 AP.
Stuttering acceptance computed with spot in 447 ms :[(AND p1 p2), (NOT p1), false, false, (AND p1 p2), (NOT p1), true, false, false, p1, (AND p1 p2)]
Incomplete random walk after 10000 steps, including 56 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 13) seen :7
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 806 rows 291 cols
[2022-06-11 02:36:12] [INFO ] Computed 13 place invariants in 3 ms
[2022-06-11 02:36:12] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 p1))), (X (NOT (AND p2 (NOT p1)))), (X (OR (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT p2))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (OR (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (G (NOT (AND p2 (NOT p1)))), (G (NOT (AND (NOT p2) p1))), (G (NOT (AND p2 p0 (NOT p1)))), (G (NOT (AND p2 (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p2) p0 (NOT p1))), (F (NOT (OR (NOT p2) (NOT p1)))), (F p2), (F (AND p2 p1))]
Knowledge based reduction with 26 factoid took 2094 ms. Reduced automaton from 11 states, 33 edges and 3 AP to 7 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 289 ms :[p2, (NOT p1), (AND (NOT p1) p2), (NOT p1), true, (AND p0 (NOT p1) p2), p2]
Stuttering acceptance computed with spot in 291 ms :[p2, (NOT p1), (AND (NOT p1) p2), (NOT p1), true, (AND p0 (NOT p1) p2), p2]
Support contains 13 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 806/806 transitions.
Applied a total of 0 rules in 8 ms. Remains 291 /291 variables (removed 0) and now considering 806/806 (removed 0) transitions.
// Phase 1: matrix 806 rows 291 cols
[2022-06-11 02:36:15] [INFO ] Computed 13 place invariants in 4 ms
[2022-06-11 02:36:15] [INFO ] Implicit Places using invariants in 254 ms returned []
// Phase 1: matrix 806 rows 291 cols
[2022-06-11 02:36:15] [INFO ] Computed 13 place invariants in 5 ms
[2022-06-11 02:36:15] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 791 ms to find 0 implicit places.
// Phase 1: matrix 806 rows 291 cols
[2022-06-11 02:36:15] [INFO ] Computed 13 place invariants in 3 ms
[2022-06-11 02:36:16] [INFO ] Dead Transitions using invariants and state equation in 835 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 291/291 places, 806/806 transitions.
Computed a total of 45 stabilizing places and 46 stable transitions
Computed a total of 45 stabilizing places and 46 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 279 ms. Reduced automaton from 7 states, 13 edges and 3 AP to 7 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 296 ms :[p2, (NOT p1), (AND (NOT p1) p2), (NOT p1), true, (AND p0 (NOT p1) p2), p2]
Incomplete random walk after 10000 steps, including 89 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :3
Finished Best-First random walk after 2667 steps, including 4 resets, run visited all 1 properties in 8 ms. (steps per millisecond=333 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p0)))), (F p2), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 383 ms. Reduced automaton from 7 states, 13 edges and 3 AP to 7 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 316 ms :[p2, (NOT p1), (AND (NOT p1) p2), (NOT p1), true, (AND p0 (NOT p1) p2), p2]
Stuttering acceptance computed with spot in 314 ms :[p2, (NOT p1), (AND (NOT p1) p2), (NOT p1), true, (AND p0 (NOT p1) p2), p2]
Stuttering acceptance computed with spot in 263 ms :[p2, (NOT p1), (AND (NOT p1) p2), (NOT p1), true, (AND p0 (NOT p1) p2), p2]
Product exploration explored 100000 steps with 24962 reset in 250 ms.
Product exploration explored 100000 steps with 25054 reset in 255 ms.
Applying partial POR strategy [false, false, false, true, true, false, true]
Stuttering acceptance computed with spot in 300 ms :[p2, (NOT p1), (AND (NOT p1) p2), (NOT p1), true, (AND p0 (NOT p1) p2), p2]
Support contains 13 out of 291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 291/291 places, 806/806 transitions.
Graph (trivial) has 257 edges and 291 vertex of which 4 / 291 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.
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 104 rules applied. Total rules applied 105 place count 289 transition count 804
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 124 place count 289 transition count 785
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 124 place count 289 transition count 785
Deduced a syphon composed of 126 places in 1 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 146 place count 289 transition count 785
Discarding 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 236 place count 199 transition count 695
Deduced a syphon composed of 37 places in 1 ms
Iterating global reduction 2 with 90 rules applied. Total rules applied 326 place count 199 transition count 695
Performed 70 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 107 places in 0 ms
Iterating global reduction 2 with 70 rules applied. Total rules applied 396 place count 199 transition count 705
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 398 place count 199 transition count 703
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 455 place count 142 transition count 549
Deduced a syphon composed of 64 places in 1 ms
Iterating global reduction 3 with 57 rules applied. Total rules applied 512 place count 142 transition count 549
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 526 place count 142 transition count 535
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 534 place count 134 transition count 527
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 4 with 8 rules applied. Total rules applied 542 place count 134 transition count 527
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 57 places in 1 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 543 place count 134 transition count 527
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 545 place count 132 transition count 525
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 547 place count 132 transition count 525
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 548 place count 132 transition count 527
Deduced a syphon composed of 56 places in 0 ms
Applied a total of 548 rules in 80 ms. Remains 132 /291 variables (removed 159) and now considering 527/806 (removed 279) transitions.
[2022-06-11 02:36:19] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 527 rows 132 cols
[2022-06-11 02:36:19] [INFO ] Computed 12 place invariants in 4 ms
[2022-06-11 02:36:20] [INFO ] Dead Transitions using invariants and state equation in 478 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/291 places, 527/806 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/291 places, 527/806 transitions.
Product exploration explored 100000 steps with 24993 reset in 239 ms.
Product exploration explored 100000 steps with 25015 reset in 244 ms.
Built C files in :
/tmp/ltsmin2012210825597288008
[2022-06-11 02:36:20] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2012210825597288008
Running compilation step : cd /tmp/ltsmin2012210825597288008;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2914 ms.
Running link step : cd /tmp/ltsmin2012210825597288008;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2012210825597288008;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12082866112540897088.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 13 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 806/806 transitions.
Applied a total of 0 rules in 5 ms. Remains 291 /291 variables (removed 0) and now considering 806/806 (removed 0) transitions.
// Phase 1: matrix 806 rows 291 cols
[2022-06-11 02:36:35] [INFO ] Computed 13 place invariants in 4 ms
[2022-06-11 02:36:35] [INFO ] Implicit Places using invariants in 180 ms returned []
// Phase 1: matrix 806 rows 291 cols
[2022-06-11 02:36:35] [INFO ] Computed 13 place invariants in 3 ms
[2022-06-11 02:36:36] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
// Phase 1: matrix 806 rows 291 cols
[2022-06-11 02:36:36] [INFO ] Computed 13 place invariants in 5 ms
[2022-06-11 02:36:37] [INFO ] Dead Transitions using invariants and state equation in 892 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 291/291 places, 806/806 transitions.
Built C files in :
/tmp/ltsmin7709545736352587159
[2022-06-11 02:36:37] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7709545736352587159
Running compilation step : cd /tmp/ltsmin7709545736352587159;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7709545736352587159;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7709545736352587159;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-11 02:36:40] [INFO ] Flatten gal took : 47 ms
[2022-06-11 02:36:40] [INFO ] Flatten gal took : 53 ms
[2022-06-11 02:36:40] [INFO ] Time to serialize gal into /tmp/LTL13584421212030379692.gal : 7 ms
[2022-06-11 02:36:40] [INFO ] Time to serialize properties into /tmp/LTL12139701469766912677.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13584421212030379692.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12139701469766912677.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1358442...268
Read 1 LTL properties
Checking formula 0 : !(((X((X(!("(((((p68==1)&&(p99==1))&&((p130==1)&&(p155==1)))&&(((p192==1)&&(p223==1))&&((p248==1)&&(p285==1))))&&(p315==1))")))U(X("((...322
Formula 0 simplified : !(X(X!"(((((p68==1)&&(p99==1))&&((p130==1)&&(p155==1)))&&(((p192==1)&&(p223==1))&&((p248==1)&&(p285==1))))&&(p315==1))" U X"(((p6==1...299
Detected timeout of ITS tools.
[2022-06-11 02:36:55] [INFO ] Flatten gal took : 48 ms
[2022-06-11 02:36:55] [INFO ] Applying decomposition
[2022-06-11 02:36:55] [INFO ] Flatten gal took : 46 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/graph6793403396487341196.txt' '-o' '/tmp/graph6793403396487341196.bin' '-w' '/tmp/graph6793403396487341196.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6793403396487341196.bin' '-l' '-1' '-v' '-w' '/tmp/graph6793403396487341196.weights' '-q' '0' '-e' '0.001'
[2022-06-11 02:36:55] [INFO ] Decomposing Gal with order
[2022-06-11 02:36:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 02:36:56] [INFO ] Removed a total of 3046 redundant transitions.
[2022-06-11 02:36:56] [INFO ] Flatten gal took : 119 ms
[2022-06-11 02:36:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 20 ms.
[2022-06-11 02:36:56] [INFO ] Time to serialize gal into /tmp/LTL1625968420442332798.gal : 9 ms
[2022-06-11 02:36:56] [INFO ] Time to serialize properties into /tmp/LTL3364143145473315411.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1625968420442332798.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3364143145473315411.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1625968...245
Read 1 LTL properties
Checking formula 0 : !(((X((X(!("(((((i5.u20.p68==1)&&(i5.u29.p99==1))&&((i5.u39.p130==1)&&(i5.u46.p155==1)))&&(((i5.u58.p192==1)&&(i5.u67.p223==1))&&((i5....463
Formula 0 simplified : !(X(X!"(((((i5.u20.p68==1)&&(i5.u29.p99==1))&&((i5.u39.p130==1)&&(i5.u46.p155==1)))&&(((i5.u58.p192==1)&&(i5.u67.p223==1))&&((i5.u75...440
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15026157486541061097
[2022-06-11 02:37:11] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15026157486541061097
Running compilation step : cd /tmp/ltsmin15026157486541061097;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2763 ms.
Running link step : cd /tmp/ltsmin15026157486541061097;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15026157486541061097;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X((X(!(LTLAPp0==true)) U X((LTLAPp1==true)))) U [](!(<>((LTLAPp1==true))&&(LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutonomousCar-PT-08b-LTLFireability-12 finished in 79093 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 811/811 transitions.
Graph (trivial) has 278 edges and 296 vertex of which 4 / 296 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 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 109 place count 293 transition count 700
Reduce places removed 108 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 1 with 153 rules applied. Total rules applied 262 place count 185 transition count 655
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 28 rules applied. Total rules applied 290 place count 158 transition count 654
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 293 place count 157 transition count 652
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 294 place count 156 transition count 652
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 294 place count 156 transition count 646
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 306 place count 150 transition count 646
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 309 place count 147 transition count 643
Iterating global reduction 5 with 3 rules applied. Total rules applied 312 place count 147 transition count 643
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 312 place count 147 transition count 642
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 314 place count 146 transition count 642
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 315 place count 145 transition count 634
Iterating global reduction 5 with 1 rules applied. Total rules applied 316 place count 145 transition count 634
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 5 with 2 rules applied. Total rules applied 318 place count 145 transition count 632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 319 place count 144 transition count 632
Performed 64 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 7 with 128 rules applied. Total rules applied 447 place count 80 transition count 567
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 448 place count 80 transition count 566
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 464 place count 64 transition count 437
Iterating global reduction 8 with 16 rules applied. Total rules applied 480 place count 64 transition count 437
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 487 place count 64 transition count 430
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 491 place count 62 transition count 428
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 493 place count 60 transition count 426
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 494 place count 59 transition count 426
Applied a total of 494 rules in 106 ms. Remains 59 /296 variables (removed 237) and now considering 426/811 (removed 385) transitions.
// Phase 1: matrix 426 rows 59 cols
[2022-06-11 02:37:26] [INFO ] Computed 11 place invariants in 1 ms
[2022-06-11 02:37:26] [INFO ] Implicit Places using invariants in 174 ms returned []
// Phase 1: matrix 426 rows 59 cols
[2022-06-11 02:37:26] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-11 02:37:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 02:37:27] [INFO ] Implicit Places using invariants and state equation in 430 ms returned [54, 58]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 608 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/296 places, 426/811 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 56 transition count 425
Applied a total of 2 rules in 19 ms. Remains 56 /57 variables (removed 1) and now considering 425/426 (removed 1) transitions.
// Phase 1: matrix 425 rows 56 cols
[2022-06-11 02:37:27] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-11 02:37:27] [INFO ] Implicit Places using invariants in 166 ms returned []
// Phase 1: matrix 425 rows 56 cols
[2022-06-11 02:37:27] [INFO ] Computed 9 place invariants in 3 ms
[2022-06-11 02:37:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 02:37:27] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/296 places, 425/811 transitions.
Finished structural reductions, in 2 iterations. Remains : 56/296 places, 425/811 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 17 steps with 1 reset in 0 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-15 finished in 1268 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(F(p0) U G((G(p1) U p2)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(!p0) U X(p1))) U G(!(F(p1)&&p2))))'
[2022-06-11 02:37:27] [INFO ] Flatten gal took : 48 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3954191576515889661
[2022-06-11 02:37:28] [INFO ] Computing symmetric may disable matrix : 811 transitions.
[2022-06-11 02:37:28] [INFO ] Applying decomposition
[2022-06-11 02:37:28] [INFO ] Computation of Complete disable matrix. took 45 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 02:37:28] [INFO ] Computing symmetric may enable matrix : 811 transitions.
[2022-06-11 02:37:28] [INFO ] Flatten gal took : 47 ms
[2022-06-11 02:37:28] [INFO ] Computation of Complete enable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 02:37:28] [INFO ] Computing Do-Not-Accords matrix : 811 transitions.
[2022-06-11 02:37:28] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph13338099624664708958.txt' '-o' '/tmp/graph13338099624664708958.bin' '-w' '/tmp/graph13338099624664708958.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13338099624664708958.bin' '-l' '-1' '-v' '-w' '/tmp/graph13338099624664708958.weights' '-q' '0' '-e' '0.001'
[2022-06-11 02:37:28] [INFO ] Decomposing Gal with order
[2022-06-11 02:37:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 02:37:28] [INFO ] Built C files in 297ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3954191576515889661
Running compilation step : cd /tmp/ltsmin3954191576515889661;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-11 02:37:28] [INFO ] Removed a total of 3179 redundant transitions.
[2022-06-11 02:37:28] [INFO ] Flatten gal took : 177 ms
[2022-06-11 02:37:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 21 ms.
[2022-06-11 02:37:28] [INFO ] Time to serialize gal into /tmp/LTLFireability9578305586279279077.gal : 21 ms
[2022-06-11 02:37:28] [INFO ] Time to serialize properties into /tmp/LTLFireability8617222132729071019.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9578305586279279077.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8617222132729071019.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 2 LTL properties
Checking formula 0 : !((F(!((F("(((((i2.u17.p62==1)&&(i2.u31.p99==1))&&((i2.u41.p130==1)&&(i2.u48.p155==1)))&&(((i2.u60.p192==1)&&(i2.u67.p217==1))&&((i2.u...481
Formula 0 simplified : !F!(F"(((((i2.u17.p62==1)&&(i2.u31.p99==1))&&((i2.u41.p130==1)&&(i2.u48.p155==1)))&&(((i2.u60.p192==1)&&(i2.u67.p217==1))&&((i2.u78....469
Compilation finished in 4778 ms.
Running link step : cd /tmp/ltsmin3954191576515889661;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin3954191576515889661;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(!(<>((LTLAPp0==true)) U [](([]((LTLAPp1==true)) U (LTLAPp2==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-06-11 02:59:10] [INFO ] Applying decomposition
[2022-06-11 02:59:10] [INFO ] Flatten gal took : 162 ms
[2022-06-11 02:59:10] [INFO ] Decomposing Gal with order
[2022-06-11 02:59:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 02:59:10] [INFO ] Removed a total of 3274 redundant transitions.
[2022-06-11 02:59:11] [INFO ] Flatten gal took : 420 ms
[2022-06-11 02:59:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 346 labels/synchronizations in 47 ms.
[2022-06-11 02:59:11] [INFO ] Time to serialize gal into /tmp/LTLFireability14725013768804423601.gal : 18 ms
[2022-06-11 02:59:11] [INFO ] Time to serialize properties into /tmp/LTLFireability15110702094533571231.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14725013768804423601.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15110702094533571231.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 2 LTL properties
Checking formula 0 : !((F(!((F("(((((i1.i0.i0.i0.i0.i0.i0.i0.i0.u13.p62==1)&&(i1.i0.i0.i0.i0.i0.i0.i0.i0.u14.p99==1))&&((i1.i0.i0.i0.i0.i0.i0.i0.u15.p130==...752
Formula 0 simplified : !F!(F"(((((i1.i0.i0.i0.i0.i0.i0.i0.i0.u13.p62==1)&&(i1.i0.i0.i0.i0.i0.i0.i0.i0.u14.p99==1))&&((i1.i0.i0.i0.i0.i0.i0.i0.u15.p130==1)&...740
Reverse transition relation is NOT exact ! Due to transitions t305, t425, i0.u2.t281, i0.u3.t279, i1.i0.u21.t34, i1.i0.u21.t37, i1.i0.u21.t39, i1.i0.u21.t4...1758
Computing Next relation with stutter on 1.76282e+06 deadlock states
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin3954191576515889661;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(!(<>((LTLAPp0==true)) U [](([]((LTLAPp1==true)) U (LTLAPp2==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin3954191576515889661;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X((X(!(LTLAPp3==true)) U X((LTLAPp4==true)))) U [](!(<>((LTLAPp4==true))&&(LTLAPp5==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-06-11 03:20:52] [INFO ] Flatten gal took : 154 ms
[2022-06-11 03:20:52] [INFO ] Input system was already deterministic with 811 transitions.
[2022-06-11 03:20:52] [INFO ] Transformed 296 places.
[2022-06-11 03:20:52] [INFO ] Transformed 811 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-11 03:20:52] [INFO ] Time to serialize gal into /tmp/LTLFireability4538449277346750366.gal : 12 ms
[2022-06-11 03:20:52] [INFO ] Time to serialize properties into /tmp/LTLFireability5755684207282503297.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4538449277346750366.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5755684207282503297.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...333
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(!((F("(((((p62==1)&&(p99==1))&&((p130==1)&&(p155==1)))&&(((p192==1)&&(p217==1))&&((p254==1)&&(p285==1))))&&(p315==1))"))U(G((G("(...324
Formula 0 simplified : !F!(F"(((((p62==1)&&(p99==1))&&((p130==1)&&(p155==1)))&&(((p192==1)&&(p217==1))&&((p254==1)&&(p285==1))))&&(p315==1))" U G(G"(((p6==...312

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-08b"
export BK_EXAMINATION="LTLFireability"
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-08b, examination is LTLFireability"
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-165463873100532"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-08b.tgz
mv AutonomousCar-PT-08b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;