Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r007-oct2-167813595800628.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is AutonomousCar-PT-07a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-oct2-167813595800628
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 6.0K Feb 25 12:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 12:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 12:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 12:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Feb 25 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 12:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 276K Mar 5 18:22 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-07a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678352011846

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-07a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 08:53:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 08:53:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:53:35] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2023-03-09 08:53:35] [INFO ] Transformed 73 places.
[2023-03-09 08:53:35] [INFO ] Transformed 593 transitions.
[2023-03-09 08:53:35] [INFO ] Found NUPN structural information;
[2023-03-09 08:53:35] [INFO ] Parsed PT model containing 73 places and 593 transitions and 5357 arcs in 298 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 213 transitions
Reduce redundant transitions removed 213 transitions.
FORMULA AutonomousCar-PT-07a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 380/380 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 69 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 69 transition count 355
Applied a total of 8 rules in 43 ms. Remains 69 /73 variables (removed 4) and now considering 355/380 (removed 25) transitions.
// Phase 1: matrix 355 rows 69 cols
[2023-03-09 08:53:35] [INFO ] Computed 11 place invariants in 14 ms
[2023-03-09 08:53:36] [INFO ] Implicit Places using invariants in 609 ms returned []
[2023-03-09 08:53:36] [INFO ] Invariant cache hit.
[2023-03-09 08:53:36] [INFO ] State equation strengthened by 178 read => feed constraints.
[2023-03-09 08:53:36] [INFO ] Implicit Places using invariants and state equation in 347 ms returned [65, 67]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1011 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/73 places, 355/380 transitions.
Applied a total of 0 rules in 3 ms. Remains 67 /67 variables (removed 0) and now considering 355/355 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1058 ms. Remains : 67/73 places, 355/380 transitions.
Support contains 33 out of 67 places after structural reductions.
[2023-03-09 08:53:36] [INFO ] Flatten gal took : 140 ms
[2023-03-09 08:53:37] [INFO ] Flatten gal took : 46 ms
[2023-03-09 08:53:37] [INFO ] Input system was already deterministic with 355 transitions.
Support contains 32 out of 67 places (down from 33) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 544 resets, run finished after 516 ms. (steps per millisecond=19 ) properties (out of 20) seen :14
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 355 rows 67 cols
[2023-03-09 08:53:37] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-09 08:53:37] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-09 08:53:38] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 08:53:38] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-09 08:53:38] [INFO ] After 467ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 08:53:38] [INFO ] State equation strengthened by 178 read => feed constraints.
[2023-03-09 08:53:39] [INFO ] After 383ms SMT Verify possible using 178 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 08:53:39] [INFO ] After 996ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 460 ms.
[2023-03-09 08:53:40] [INFO ] After 2103ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 82 ms.
Support contains 8 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 355/355 transitions.
Graph (complete) has 643 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 66 transition count 345
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 60 transition count 345
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 60 transition count 344
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 18 place count 59 transition count 344
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 22 place count 55 transition count 319
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 55 transition count 319
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 32 place count 52 transition count 316
Free-agglomeration rule applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 39 place count 52 transition count 309
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 74 place count 45 transition count 281
Applied a total of 74 rules in 92 ms. Remains 45 /67 variables (removed 22) and now considering 281/355 (removed 74) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 45/67 places, 281/355 transitions.
Incomplete random walk after 10000 steps, including 69 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :3
Running SMT prover for 3 properties.
// Phase 1: matrix 281 rows 45 cols
[2023-03-09 08:53:40] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-09 08:53:40] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-09 08:53:41] [INFO ] After 337ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 08:53:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-09 08:53:41] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 08:53:41] [INFO ] State equation strengthened by 127 read => feed constraints.
[2023-03-09 08:53:41] [INFO ] After 111ms SMT Verify possible using 127 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 08:53:41] [INFO ] After 312ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 163 ms.
[2023-03-09 08:53:41] [INFO ] After 774ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 36 ms.
Support contains 6 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 281/281 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 45 transition count 279
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 18 place count 43 transition count 265
Applied a total of 18 rules in 56 ms. Remains 43 /45 variables (removed 2) and now considering 265/281 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 43/45 places, 265/281 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 265 rows 43 cols
[2023-03-09 08:53:42] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-09 08:53:42] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-09 08:53:42] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 08:53:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-09 08:53:42] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 08:53:42] [INFO ] State equation strengthened by 113 read => feed constraints.
[2023-03-09 08:53:42] [INFO ] After 99ms SMT Verify possible using 113 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 08:53:42] [INFO ] After 246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 105 ms.
[2023-03-09 08:53:42] [INFO ] After 557ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 22 ms.
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 265/265 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 43 transition count 264
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 42 transition count 257
Applied a total of 9 rules in 37 ms. Remains 42 /43 variables (removed 1) and now considering 257/265 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 42/43 places, 257/265 transitions.
Incomplete random walk after 10000 steps, including 10 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Finished probabilistic random walk after 350 steps, run visited all 2 properties in 16 ms. (steps per millisecond=21 )
Probabilistic random walk after 350 steps, saw 296 distinct states, run finished after 16 ms. (steps per millisecond=21 ) properties seen :2
FORMULA AutonomousCar-PT-07a-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 3 stabilizing places and 2 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0||X(F(p1))) U (G((!p0||X(F(p1))))||(p1&&(!p0||X(F(p1))))))))'
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 355/355 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 64 transition count 331
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 64 transition count 331
Applied a total of 6 rules in 12 ms. Remains 64 /67 variables (removed 3) and now considering 331/355 (removed 24) transitions.
// Phase 1: matrix 331 rows 64 cols
[2023-03-09 08:53:43] [INFO ] Computed 9 place invariants in 5 ms
[2023-03-09 08:53:43] [INFO ] Implicit Places using invariants in 196 ms returned []
[2023-03-09 08:53:44] [INFO ] Invariant cache hit.
[2023-03-09 08:53:44] [INFO ] State equation strengthened by 157 read => feed constraints.
[2023-03-09 08:53:44] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
[2023-03-09 08:53:44] [INFO ] Invariant cache hit.
[2023-03-09 08:53:44] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/67 places, 331/355 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 901 ms. Remains : 64/67 places, 331/355 transitions.
Stuttering acceptance computed with spot in 358 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s31 1), p0:(AND (EQ s1 1) (EQ s7 1) (EQ s29 1) (EQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1129 ms.
Product exploration explored 100000 steps with 50000 reset in 977 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 5 factoid took 184 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-07a-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-07a-LTLFireability-00 finished in 3683 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(G(p0))||G(p1)) U p2))'
Support contains 7 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 355/355 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 67 transition count 348
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 16 place count 60 transition count 346
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 58 transition count 346
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 18 place count 58 transition count 345
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 57 transition count 345
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 23 place count 54 transition count 321
Iterating global reduction 3 with 3 rules applied. Total rules applied 26 place count 54 transition count 321
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 3 with 4 rules applied. Total rules applied 30 place count 52 transition count 319
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 51 transition count 319
Applied a total of 32 rules in 93 ms. Remains 51 /67 variables (removed 16) and now considering 319/355 (removed 36) transitions.
// Phase 1: matrix 319 rows 51 cols
[2023-03-09 08:53:47] [INFO ] Computed 9 place invariants in 5 ms
[2023-03-09 08:53:47] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-09 08:53:47] [INFO ] Invariant cache hit.
[2023-03-09 08:53:47] [INFO ] State equation strengthened by 159 read => feed constraints.
[2023-03-09 08:53:47] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2023-03-09 08:53:47] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-09 08:53:47] [INFO ] Invariant cache hit.
[2023-03-09 08:53:48] [INFO ] Dead Transitions using invariants and state equation in 518 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/67 places, 319/355 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 994 ms. Remains : 51/67 places, 319/355 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p2), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s1 1) (EQ s4 1) (EQ s28 1) (EQ s47 1)), p1:(AND (EQ s1 1) (EQ s7 1) (EQ s29 1) (EQ s47 1)), p0:(AND (EQ s1 1) (EQ s7 1) (EQ s23 1) (EQ s47 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-01 finished in 1195 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 12 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 355/355 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 67 transition count 349
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 61 transition count 349
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 61 transition count 347
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 59 transition count 347
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 55 transition count 315
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 55 transition count 315
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 54 transition count 315
Applied a total of 26 rules in 44 ms. Remains 54 /67 variables (removed 13) and now considering 315/355 (removed 40) transitions.
// Phase 1: matrix 315 rows 54 cols
[2023-03-09 08:53:48] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-09 08:53:48] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-09 08:53:48] [INFO ] Invariant cache hit.
[2023-03-09 08:53:48] [INFO ] State equation strengthened by 152 read => feed constraints.
[2023-03-09 08:53:48] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2023-03-09 08:53:48] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-09 08:53:48] [INFO ] Invariant cache hit.
[2023-03-09 08:53:49] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/67 places, 315/355 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 529 ms. Remains : 54/67 places, 315/355 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s1 0) (EQ s2 0) (EQ s41 0) (EQ s50 0)), p0:(OR (EQ s13 0) (EQ s20 0) (EQ s25 0) (EQ s30 0) (EQ s35 0) (EQ s40 0) (EQ s46 0) (EQ s51 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 141 reset in 123 ms.
Product exploration explored 100000 steps with 35 reset in 87 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 218 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 643 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-09 08:53:49] [INFO ] Invariant cache hit.
[2023-03-09 08:53:50] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:53:50] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-09 08:53:50] [INFO ] After 22ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 150 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-07a-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-07a-LTLFireability-02 finished in 1674 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(X(F(p1)) U G(p2))))))'
Support contains 12 out of 67 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 : 67/67 places, 355/355 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 67 transition count 349
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 61 transition count 349
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 61 transition count 347
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 59 transition count 347
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 56 transition count 323
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 56 transition count 323
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 55 transition count 322
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 54 transition count 322
Applied a total of 26 rules in 32 ms. Remains 54 /67 variables (removed 13) and now considering 322/355 (removed 33) transitions.
// Phase 1: matrix 322 rows 54 cols
[2023-03-09 08:53:50] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-09 08:53:50] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-09 08:53:50] [INFO ] Invariant cache hit.
[2023-03-09 08:53:50] [INFO ] State equation strengthened by 159 read => feed constraints.
[2023-03-09 08:53:50] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2023-03-09 08:53:50] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-09 08:53:50] [INFO ] Invariant cache hit.
[2023-03-09 08:53:50] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/67 places, 322/355 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 463 ms. Remains : 54/67 places, 322/355 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s1 1) (EQ s6 1) (EQ s36 1) (EQ s50 1)), p0:(AND (EQ s12 1) (EQ s19 1) (EQ s24 1) (EQ s29 1) (EQ s35 1) (EQ s41 1) (EQ s46 1) (EQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-03 finished in 591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 355/355 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 63 transition count 323
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 63 transition count 323
Applied a total of 8 rules in 3 ms. Remains 63 /67 variables (removed 4) and now considering 323/355 (removed 32) transitions.
// Phase 1: matrix 323 rows 63 cols
[2023-03-09 08:53:50] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-09 08:53:51] [INFO ] Implicit Places using invariants in 200 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 224 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/67 places, 323/355 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 323/323 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 229 ms. Remains : 62/67 places, 323/355 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-05 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:(EQ s60 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 0 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-05 finished in 363 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 6 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 355/355 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 67 transition count 347
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 59 transition count 346
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 58 transition count 346
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 18 place count 58 transition count 345
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 57 transition count 345
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 23 place count 54 transition count 321
Iterating global reduction 3 with 3 rules applied. Total rules applied 26 place count 54 transition count 321
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 3 with 2 rules applied. Total rules applied 28 place count 53 transition count 320
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 52 transition count 320
Applied a total of 30 rules in 55 ms. Remains 52 /67 variables (removed 15) and now considering 320/355 (removed 35) transitions.
// Phase 1: matrix 320 rows 52 cols
[2023-03-09 08:53:51] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-09 08:53:51] [INFO ] Implicit Places using invariants in 221 ms returned []
[2023-03-09 08:53:51] [INFO ] Invariant cache hit.
[2023-03-09 08:53:51] [INFO ] State equation strengthened by 159 read => feed constraints.
[2023-03-09 08:53:51] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
[2023-03-09 08:53:51] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-09 08:53:52] [INFO ] Invariant cache hit.
[2023-03-09 08:53:52] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/67 places, 320/355 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1022 ms. Remains : 52/67 places, 320/355 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-07 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:(OR (AND (EQ s1 1) (EQ s6 1) (EQ s30 1) (EQ s48 1)) (AND (EQ s1 1) (EQ s6 1) (EQ s30 1) (EQ s48 1) (EQ s2 1) (EQ s24 1)))], 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 10 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-07 finished in 1089 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 355/355 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 67 transition count 347
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 59 transition count 346
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 58 transition count 346
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 18 place count 58 transition count 345
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 57 transition count 345
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 23 place count 54 transition count 321
Iterating global reduction 3 with 3 rules applied. Total rules applied 26 place count 54 transition count 321
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 3 with 4 rules applied. Total rules applied 30 place count 52 transition count 319
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 51 transition count 319
Applied a total of 32 rules in 47 ms. Remains 51 /67 variables (removed 16) and now considering 319/355 (removed 36) transitions.
// Phase 1: matrix 319 rows 51 cols
[2023-03-09 08:53:52] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-09 08:53:52] [INFO ] Implicit Places using invariants in 236 ms returned []
[2023-03-09 08:53:52] [INFO ] Invariant cache hit.
[2023-03-09 08:53:52] [INFO ] State equation strengthened by 159 read => feed constraints.
[2023-03-09 08:53:52] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
[2023-03-09 08:53:52] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-09 08:53:52] [INFO ] Invariant cache hit.
[2023-03-09 08:53:53] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/67 places, 319/355 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 871 ms. Remains : 51/67 places, 319/355 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-08 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:(OR (AND (EQ s1 1) (EQ s4 1) (EQ s29 1) (EQ s47 1)) (AND (EQ s1 1) (EQ s4 1) (EQ s21 1) (EQ s47 1)))], 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 10 steps with 0 reset in 13 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-08 finished in 975 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p1)||p0) U (X(p2) U p3)))'
Support contains 9 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 355/355 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 65 transition count 339
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 65 transition count 339
Applied a total of 4 rules in 8 ms. Remains 65 /67 variables (removed 2) and now considering 339/355 (removed 16) transitions.
// Phase 1: matrix 339 rows 65 cols
[2023-03-09 08:53:53] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-09 08:53:53] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-09 08:53:53] [INFO ] Invariant cache hit.
[2023-03-09 08:53:53] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-03-09 08:53:53] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
[2023-03-09 08:53:53] [INFO ] Invariant cache hit.
[2023-03-09 08:53:53] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/67 places, 339/355 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 725 ms. Remains : 65/67 places, 339/355 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p3), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p3))]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p3) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p3) p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p1) p2), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p3:(AND (EQ s1 1) (EQ s9 1) (EQ s27 1) (EQ s60 1)), p0:(OR (AND (EQ s1 1) (EQ s10 1) (EQ s15 1) (EQ s60 1)) (AND (EQ s1 1) (EQ s9 1) (EQ s44 1) (EQ s60 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-12 finished in 925 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 355/355 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 67 transition count 347
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 59 transition count 347
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 59 transition count 346
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 58 transition count 346
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 22 place count 54 transition count 314
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 54 transition count 314
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 30 place count 52 transition count 312
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 51 transition count 312
Applied a total of 32 rules in 38 ms. Remains 51 /67 variables (removed 16) and now considering 312/355 (removed 43) transitions.
// Phase 1: matrix 312 rows 51 cols
[2023-03-09 08:53:54] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-09 08:53:54] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-09 08:53:54] [INFO ] Invariant cache hit.
[2023-03-09 08:53:54] [INFO ] State equation strengthened by 152 read => feed constraints.
[2023-03-09 08:53:54] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
[2023-03-09 08:53:54] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-09 08:53:54] [INFO ] Invariant cache hit.
[2023-03-09 08:53:54] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/67 places, 312/355 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 640 ms. Remains : 51/67 places, 312/355 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s9 1) (EQ s15 1) (EQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-13 finished in 693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p1)&&p0))))'
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 355/355 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 63 transition count 323
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 63 transition count 323
Applied a total of 8 rules in 3 ms. Remains 63 /67 variables (removed 4) and now considering 323/355 (removed 32) transitions.
// Phase 1: matrix 323 rows 63 cols
[2023-03-09 08:53:54] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-09 08:53:54] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-09 08:53:54] [INFO ] Invariant cache hit.
[2023-03-09 08:53:55] [INFO ] State equation strengthened by 150 read => feed constraints.
[2023-03-09 08:53:55] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2023-03-09 08:53:55] [INFO ] Invariant cache hit.
[2023-03-09 08:53:55] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/67 places, 323/355 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 564 ms. Remains : 63/67 places, 323/355 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s1 1) (EQ s7 1) (EQ s41 1) (EQ s58 1)), p1:(AND (EQ s1 1) (EQ s7 1) (EQ s41 1) (EQ s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 78 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-15 finished in 664 ms.
All properties solved by simple procedures.
Total runtime 20630 ms.
ITS solved all properties within timeout

BK_STOP 1678352035711

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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-07a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is AutonomousCar-PT-07a, 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 r007-oct2-167813595800628"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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