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-167813595700563.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-03a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-oct2-167813595700563
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 12:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 12:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 12:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 25 12:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 12:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 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 42K 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-03a-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678351423153

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-03a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 08:43:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 08:43:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:43:45] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2023-03-09 08:43:45] [INFO ] Transformed 41 places.
[2023-03-09 08:43:45] [INFO ] Transformed 121 transitions.
[2023-03-09 08:43:45] [INFO ] Found NUPN structural information;
[2023-03-09 08:43:45] [INFO ] Parsed PT model containing 41 places and 121 transitions and 745 arcs in 175 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
FORMULA AutonomousCar-PT-03a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 76/76 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 40 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 40 transition count 75
Applied a total of 2 rules in 12 ms. Remains 40 /41 variables (removed 1) and now considering 75/76 (removed 1) transitions.
// Phase 1: matrix 75 rows 40 cols
[2023-03-09 08:43:46] [INFO ] Computed 7 place invariants in 11 ms
[2023-03-09 08:43:46] [INFO ] Implicit Places using invariants in 221 ms returned []
[2023-03-09 08:43:46] [INFO ] Invariant cache hit.
[2023-03-09 08:43:46] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-09 08:43:46] [INFO ] Implicit Places using invariants and state equation in 152 ms returned [38]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 446 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 39/41 places, 75/76 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 461 ms. Remains : 39/41 places, 75/76 transitions.
Support contains 25 out of 39 places after structural reductions.
[2023-03-09 08:43:46] [INFO ] Flatten gal took : 52 ms
[2023-03-09 08:43:46] [INFO ] Flatten gal took : 12 ms
[2023-03-09 08:43:46] [INFO ] Input system was already deterministic with 75 transitions.
Support contains 24 out of 39 places (down from 25) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 528 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 19) seen :17
Incomplete Best-First random walk after 10001 steps, including 136 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 117 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 75 rows 39 cols
[2023-03-09 08:43:47] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 08:43:47] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-09 08:43:47] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-09 08:43:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-09 08:43:47] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
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' '!(((p0&&X(F(!p1))) U (p2&&X(X(X(p2))))))'
Support contains 5 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 75/75 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 36 transition count 63
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 36 transition count 63
Applied a total of 6 rules in 35 ms. Remains 36 /39 variables (removed 3) and now considering 63/75 (removed 12) transitions.
// Phase 1: matrix 63 rows 36 cols
[2023-03-09 08:43:47] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-09 08:43:47] [INFO ] Implicit Places using invariants in 183 ms returned []
[2023-03-09 08:43:47] [INFO ] Invariant cache hit.
[2023-03-09 08:43:47] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-09 08:43:48] [INFO ] Implicit Places using invariants and state equation in 174 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 364 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 35/39 places, 63/75 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 400 ms. Remains : 35/39 places, 63/75 transitions.
Stuttering acceptance computed with spot in 1440 ms :[(NOT p2), true, p1, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) p1), (NOT p2), (NOT p2), (NOT p2), (AND p1 (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND p1 (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p2 p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(OR (AND (NOT p2) p0) (AND p2 p1)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 8}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 9}, { cond=(AND p2 p0), acceptance={} source=4 dest: 10}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 1}], [{ cond=p1, acceptance={} source=7 dest: 11}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={} source=8 dest: 12}, { cond=(AND p2 (NOT p0)), acceptance={} source=8 dest: 13}, { cond=(AND p2 p0), acceptance={} source=8 dest: 14}], [{ cond=true, acceptance={} source=9 dest: 15}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=10 dest: 15}, { cond=(AND p2 p1), acceptance={} source=10 dest: 16}, { cond=(AND (NOT p2) p0), acceptance={} source=10 dest: 17}, { cond=(AND p2 (NOT p0)), acceptance={} source=10 dest: 18}, { cond=(AND p2 p0), acceptance={} source=10 dest: 19}], [{ cond=(AND (NOT p2) p1), acceptance={} source=11 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={} source=12 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=12 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=12 dest: 2}], [{ cond=(NOT p2), acceptance={} source=13 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=14 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=14 dest: 7}, { cond=(AND (NOT p2) p0), acceptance={} source=14 dest: 8}], [{ cond=(NOT p2), acceptance={} source=15 dest: 6}], [{ cond=(AND (NOT p2) p1), acceptance={} source=16 dest: 11}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=17 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={} source=17 dest: 12}], [{ cond=(NOT p2), acceptance={} source=18 dest: 15}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=19 dest: 15}, { cond=(AND (NOT p2) p0), acceptance={} source=19 dest: 17}]], initial=0, aps=[p2:(OR (EQ s27 0) (EQ s3 1)), p0:(EQ s1 1), p1:(OR (EQ s2 0) (EQ s28 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 371 ms.
Product exploration explored 100000 steps with 25000 reset in 248 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Detected a total of 3/35 stabilizing places and 2/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (OR (AND (NOT p2) p0) (AND p2 p1)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (AND p2 p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (OR (AND (NOT p2) p0) (AND p2 p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 943 ms. Reduced automaton from 20 states, 41 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Finished random walk after 207 steps, including 10 resets, run visited all 1 properties in 4 ms. (steps per millisecond=51 )
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (OR (AND (NOT p2) p0) (AND p2 p1)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (AND p2 p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (OR (AND (NOT p2) p0) (AND p2 p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 16 factoid took 1046 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 225 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Support contains 2 out of 35 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 35 cols
[2023-03-09 08:43:52] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 08:43:53] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-09 08:43:53] [INFO ] Invariant cache hit.
[2023-03-09 08:43:53] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-09 08:43:53] [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:43:53] [INFO ] Invariant cache hit.
[2023-03-09 08:43:53] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 518 ms. Remains : 35/35 places, 63/63 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [p2, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Finished random walk after 48 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=48 )
Knowledge obtained : [p2, true]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 259 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 274 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Product exploration explored 100000 steps with 25000 reset in 275 ms.
Product exploration explored 100000 steps with 25000 reset in 153 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 285 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Support contains 2 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 63/63 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 35 transition count 63
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 5 place count 35 transition count 65
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 35 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 35 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 34 transition count 64
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 34 transition count 64
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 9 rules in 13 ms. Remains 34 /35 variables (removed 1) and now considering 64/63 (removed -1) transitions.
[2023-03-09 08:43:55] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 64 rows 34 cols
[2023-03-09 08:43:55] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 08:43:55] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/35 places, 64/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 110 ms. Remains : 34/35 places, 64/63 transitions.
Support contains 2 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 35 cols
[2023-03-09 08:43:55] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-09 08:43:56] [INFO ] Implicit Places using invariants in 272 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 274 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 34/35 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 276 ms. Remains : 34/35 places, 63/63 transitions.
Treatment of property AutonomousCar-PT-03a-LTLCardinality-01 finished in 8531 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(p0)&&F(p1))))'
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 75/75 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 36 transition count 63
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 36 transition count 63
Applied a total of 6 rules in 14 ms. Remains 36 /39 variables (removed 3) and now considering 63/75 (removed 12) transitions.
// Phase 1: matrix 63 rows 36 cols
[2023-03-09 08:43:56] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 08:43:56] [INFO ] Implicit Places using invariants in 81 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 84 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 35/39 places, 63/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 100 ms. Remains : 35/39 places, 63/75 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s3 0) (EQ s31 1)), p0:(AND (EQ s11 0) (EQ s9 1))], 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, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-03a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLCardinality-02 finished in 322 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(p0)))'
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 75/75 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 37 transition count 67
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 37 transition count 67
Applied a total of 4 rules in 5 ms. Remains 37 /39 variables (removed 2) and now considering 67/75 (removed 8) transitions.
// Phase 1: matrix 67 rows 37 cols
[2023-03-09 08:43:56] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-09 08:43:56] [INFO ] Implicit Places using invariants in 236 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 239 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 36/39 places, 67/75 transitions.
Applied a total of 0 rules in 1 ms. Remains 36 /36 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 246 ms. Remains : 36/39 places, 67/75 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s16 0) (EQ s28 1))], 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]]
Product exploration explored 100000 steps with 50000 reset in 152 ms.
Product exploration explored 100000 steps with 50000 reset in 132 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-03a-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-03a-LTLCardinality-03 finished in 793 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(p0) U p1))'
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 75/75 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 37 transition count 67
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 37 transition count 67
Applied a total of 4 rules in 1 ms. Remains 37 /39 variables (removed 2) and now considering 67/75 (removed 8) transitions.
// Phase 1: matrix 67 rows 37 cols
[2023-03-09 08:43:57] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-09 08:43:57] [INFO ] Implicit Places using invariants in 143 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 143 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 36/39 places, 67/75 transitions.
Applied a total of 0 rules in 1 ms. Remains 36 /36 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 145 ms. Remains : 36/39 places, 67/75 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s35 1), p0:(OR (EQ s33 0) (EQ s8 1))], 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, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLCardinality-05 finished in 278 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 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 75/75 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 37 transition count 70
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 33 transition count 70
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 11 place count 31 transition count 62
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 31 transition count 62
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 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 20 place count 27 transition count 59
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 27 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 26 transition count 58
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 4 with 2 rules applied. Total rules applied 24 place count 25 transition count 58
Applied a total of 24 rules in 16 ms. Remains 25 /39 variables (removed 14) and now considering 58/75 (removed 17) transitions.
// Phase 1: matrix 58 rows 25 cols
[2023-03-09 08:43:57] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-09 08:43:57] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-09 08:43:57] [INFO ] Invariant cache hit.
[2023-03-09 08:43:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:43:57] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2023-03-09 08:43:57] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-09 08:43:57] [INFO ] Invariant cache hit.
[2023-03-09 08:43:57] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/39 places, 58/75 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 301 ms. Remains : 25/39 places, 58/75 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-06 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 (EQ s10 0) (EQ s21 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]]
Product exploration explored 100000 steps with 2 reset in 105 ms.
Product exploration explored 100000 steps with 3 reset in 107 ms.
Computed a total of 3 stabilizing places and 5 stable transitions
Computed a total of 3 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Finished random walk after 74 steps, including 7 resets, run visited all 1 properties in 1 ms. (steps per millisecond=74 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 58/58 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2023-03-09 08:43:58] [INFO ] Invariant cache hit.
[2023-03-09 08:43:58] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-09 08:43:58] [INFO ] Invariant cache hit.
[2023-03-09 08:43:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:43:58] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2023-03-09 08:43:58] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-09 08:43:58] [INFO ] Invariant cache hit.
[2023-03-09 08:43:59] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 368 ms. Remains : 25/25 places, 58/58 transitions.
Computed a total of 3 stabilizing places and 5 stable transitions
Computed a total of 3 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0)]
Finished random walk after 32 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=16 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 228 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering criterion allowed to conclude after 106 steps with 9 reset in 1 ms.
FORMULA AutonomousCar-PT-03a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLCardinality-06 finished in 2493 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(X(X(G(p0)))))'
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 75/75 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 36 transition count 63
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 36 transition count 63
Applied a total of 6 rules in 3 ms. Remains 36 /39 variables (removed 3) and now considering 63/75 (removed 12) transitions.
// Phase 1: matrix 63 rows 36 cols
[2023-03-09 08:44:00] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-09 08:44:00] [INFO ] Implicit Places using invariants in 95 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 96 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 35/39 places, 63/75 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 103 ms. Remains : 35/39 places, 63/75 transitions.
Stuttering acceptance computed with spot in 282 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s21 0) (EQ s6 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLCardinality-07 finished in 420 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(p0)||F(G(p1))))'
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 75/75 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 37 transition count 70
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 33 transition count 70
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 11 place count 31 transition count 62
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 31 transition count 62
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 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 20 place count 27 transition count 59
Applied a total of 20 rules in 8 ms. Remains 27 /39 variables (removed 12) and now considering 59/75 (removed 16) transitions.
// Phase 1: matrix 59 rows 27 cols
[2023-03-09 08:44:00] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-09 08:44:00] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-09 08:44:00] [INFO ] Invariant cache hit.
[2023-03-09 08:44:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:44:00] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2023-03-09 08:44:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 08:44:00] [INFO ] Invariant cache hit.
[2023-03-09 08:44:00] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/39 places, 59/75 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 309 ms. Remains : 27/39 places, 59/75 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s10 0) (EQ s20 1)), p1:(AND (EQ s20 0) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 70 steps with 7 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLCardinality-09 finished in 412 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(p0))'
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 75/75 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 36 transition count 63
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 36 transition count 63
Applied a total of 6 rules in 3 ms. Remains 36 /39 variables (removed 3) and now considering 63/75 (removed 12) transitions.
// Phase 1: matrix 63 rows 36 cols
[2023-03-09 08:44:00] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 08:44:00] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-09 08:44:00] [INFO ] Invariant cache hit.
[2023-03-09 08:44:00] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-09 08:44:00] [INFO ] Implicit Places using invariants and state equation in 104 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 186 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 35/39 places, 63/75 transitions.
Applied a total of 0 rules in 3 ms. Remains 35 /35 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 192 ms. Remains : 35/39 places, 63/75 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 189 ms.
Product exploration explored 100000 steps with 50000 reset in 128 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Detected a total of 3/35 stabilizing places and 2/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-03a-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-03a-LTLCardinality-12 finished in 824 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(((p1 U (p2||G(p1)))||p0))))'
Support contains 5 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 75/75 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 36 transition count 63
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 36 transition count 63
Applied a total of 6 rules in 3 ms. Remains 36 /39 variables (removed 3) and now considering 63/75 (removed 12) transitions.
[2023-03-09 08:44:01] [INFO ] Invariant cache hit.
[2023-03-09 08:44:01] [INFO ] Implicit Places using invariants in 44 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 35/39 places, 63/75 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49 ms. Remains : 35/39 places, 63/75 transitions.
Stuttering acceptance computed with spot in 194 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(OR p0 p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(AND (NOT (OR (EQ s3 0) (EQ s2 1))) (NEQ s1 1)), p1:(NEQ s1 1), p0:(OR (EQ s18 0) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 88 ms.
Product exploration explored 100000 steps with 4 reset in 66 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (OR p0 p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (OR p0 p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 676 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Finished random walk after 56 steps, including 3 resets, run visited all 6 properties in 3 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (OR p0 p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (OR p0 p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (OR p0 p2))), (F (AND (NOT p1) (NOT p2))), (F p2), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 11 factoid took 722 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 227 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 5 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 35 cols
[2023-03-09 08:44:04] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 08:44:04] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-09 08:44:04] [INFO ] Invariant cache hit.
[2023-03-09 08:44:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:44:04] [INFO ] Implicit Places using invariants and state equation in 91 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 199 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 34/35 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 201 ms. Remains : 34/35 places, 63/63 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (OR p0 p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT p2))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (OR p0 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 573 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Finished random walk after 111 steps, including 8 resets, run visited all 6 properties in 14 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (OR p0 p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT p2))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (OR p0 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (OR p0 p2))), (F (AND (NOT p1) (NOT p2))), (F p2), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 11 factoid took 727 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 212 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 260 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Entered a terminal (fully accepting) state of product in 45 steps with 4 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLCardinality-14 finished in 4910 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' '!(((p0&&X(F(!p1))) U (p2&&X(X(X(p2))))))'
[2023-03-09 08:44:06] [INFO ] Flatten gal took : 20 ms
[2023-03-09 08:44:06] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-09 08:44:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 39 places, 75 transitions and 433 arcs took 2 ms.
Total runtime 21105 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT AutonomousCar-PT-03a
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/378
LTLCardinality

FORMULA AutonomousCar-PT-03a-LTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678351447085

--------------------
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:
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/378/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/378/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/378/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 AutonomousCar-PT-03a-LTLCardinality-01
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for AutonomousCar-PT-03a-LTLCardinality-01
lola: result : true
lola: markings : 43
lola: fired transitions : 42
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-03a-LTLCardinality-01: LTL true LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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-03a"
export BK_EXAMINATION="LTLCardinality"
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-03a, examination is LTLCardinality"
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-167813595700563"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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