fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r005-oct2-167813593300580
Last Updated
May 14, 2023

About the Execution of ITS-Tools for AutonomousCar-PT-04a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
884.088 32014.00 51701.00 3015.20 FTTFFFFTFFFFFFFF normal

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.r005-oct2-167813593300580.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 itstools
Input is AutonomousCar-PT-04a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813593300580
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.0K Feb 25 12:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 12:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 12:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 25 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 12:53 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 72K 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-04a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678520655010

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-04a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 07:44:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 07:44:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 07:44:17] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2023-03-11 07:44:17] [INFO ] Transformed 49 places.
[2023-03-11 07:44:17] [INFO ] Transformed 193 transitions.
[2023-03-11 07:44:17] [INFO ] Found NUPN structural information;
[2023-03-11 07:44:17] [INFO ] Parsed PT model containing 49 places and 193 transitions and 1306 arcs in 109 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 3 formulas.
Ensure Unique test removed 75 transitions
Reduce redundant transitions removed 75 transitions.
FORMULA AutonomousCar-PT-04a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 118/118 transitions.
Applied a total of 0 rules in 9 ms. Remains 49 /49 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2023-03-11 07:44:17] [INFO ] Flow matrix only has 117 transitions (discarded 1 similar events)
// Phase 1: matrix 117 rows 49 cols
[2023-03-11 07:44:17] [INFO ] Computed 9 place invariants in 6 ms
[2023-03-11 07:44:17] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-11 07:44:17] [INFO ] Flow matrix only has 117 transitions (discarded 1 similar events)
[2023-03-11 07:44:17] [INFO ] Invariant cache hit.
[2023-03-11 07:44:17] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-11 07:44:17] [INFO ] Implicit Places using invariants and state equation in 192 ms returned [44, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 405 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/49 places, 118/118 transitions.
Applied a total of 0 rules in 3 ms. Remains 47 /47 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 417 ms. Remains : 47/49 places, 118/118 transitions.
Support contains 31 out of 47 places after structural reductions.
[2023-03-11 07:44:18] [INFO ] Flatten gal took : 42 ms
[2023-03-11 07:44:18] [INFO ] Flatten gal took : 15 ms
[2023-03-11 07:44:18] [INFO ] Input system was already deterministic with 118 transitions.
Incomplete random walk after 10000 steps, including 551 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 25) seen :24
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 07:44:18] [INFO ] Flow matrix only has 117 transitions (discarded 1 similar events)
// Phase 1: matrix 117 rows 47 cols
[2023-03-11 07:44:18] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-11 07:44:18] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-11 07:44:18] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 3 stabilizing places and 2 stable transitions
FORMULA AutonomousCar-PT-04a-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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))||G(p1)))'
Support contains 9 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 97
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 97
Applied a total of 10 rules in 4 ms. Remains 42 /47 variables (removed 5) and now considering 97/118 (removed 21) transitions.
// Phase 1: matrix 97 rows 42 cols
[2023-03-11 07:44:18] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-11 07:44:18] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-11 07:44:18] [INFO ] Invariant cache hit.
[2023-03-11 07:44:18] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-11 07:44:18] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2023-03-11 07:44:18] [INFO ] Invariant cache hit.
[2023-03-11 07:44:19] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 42/47 places, 97/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 305 ms. Remains : 42/47 places, 97/118 transitions.
Stuttering acceptance computed with spot in 334 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (EQ s1 1) (EQ s5 1) (EQ s12 1) (EQ s37 1) (EQ s11 1) (EQ s19 1) (EQ s25 1) (EQ s29 1) (EQ s38 1)) (AND (EQ s11 1) (EQ s19 1) (EQ s25 1) (EQ s2...], 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]]
Stuttering criterion allowed to conclude after 23 steps with 1 reset in 4 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-00 finished in 736 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)||F(p1))))'
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 98
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 98
Applied a total of 8 rules in 8 ms. Remains 43 /47 variables (removed 4) and now considering 98/118 (removed 20) transitions.
[2023-03-11 07:44:19] [INFO ] Flow matrix only has 97 transitions (discarded 1 similar events)
// Phase 1: matrix 97 rows 43 cols
[2023-03-11 07:44:19] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-11 07:44:19] [INFO ] Implicit Places using invariants in 263 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 268 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/47 places, 98/118 transitions.
Applied a total of 0 rules in 2 ms. Remains 42 /42 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 278 ms. Remains : 42/47 places, 98/118 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s39 0), p0:(EQ s26 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]]
Product exploration explored 100000 steps with 50000 reset in 287 ms.
Product exploration explored 100000 steps with 50000 reset in 207 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 p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 6 factoid took 98 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-04a-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-04a-LTLFireability-01 finished in 1027 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 4 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 47 transition count 113
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 42 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 41 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 41 transition count 111
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 40 transition count 111
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 19 place count 35 transition count 90
Iterating global reduction 3 with 5 rules applied. Total rules applied 24 place count 35 transition count 90
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 28 place count 33 transition count 88
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 32 transition count 88
Applied a total of 30 rules in 18 ms. Remains 32 /47 variables (removed 15) and now considering 88/118 (removed 30) transitions.
// Phase 1: matrix 88 rows 32 cols
[2023-03-11 07:44:20] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-11 07:44:20] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-11 07:44:20] [INFO ] Invariant cache hit.
[2023-03-11 07:44:20] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-11 07:44:20] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2023-03-11 07:44:20] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-11 07:44:20] [INFO ] Invariant cache hit.
[2023-03-11 07:44:20] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/47 places, 88/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 226 ms. Remains : 32/47 places, 88/118 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-03 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:(AND (EQ s1 1) (EQ s6 1) (EQ s15 1) (EQ s28 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 17 steps with 1 reset in 1 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-03 finished in 318 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(((F(p0) U G(p1))&&(p1 U p2)))))'
Support contains 6 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 44 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 44 transition count 107
Applied a total of 6 rules in 4 ms. Remains 44 /47 variables (removed 3) and now considering 107/118 (removed 11) transitions.
// Phase 1: matrix 107 rows 44 cols
[2023-03-11 07:44:20] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-11 07:44:20] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-11 07:44:20] [INFO ] Invariant cache hit.
[2023-03-11 07:44:20] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-11 07:44:21] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2023-03-11 07:44:21] [INFO ] Invariant cache hit.
[2023-03-11 07:44:21] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 44/47 places, 107/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 356 ms. Remains : 44/47 places, 107/118 transitions.
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true, (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s31 1), p2:(AND (EQ s1 1) (EQ s5 1) (EQ s24 1) (EQ s39 1)), p0:(EQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-05 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(X((G((X(p1)||p0))||G(p2)))))'
Support contains 7 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 44 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 44 transition count 107
Applied a total of 6 rules in 1 ms. Remains 44 /47 variables (removed 3) and now considering 107/118 (removed 11) transitions.
// Phase 1: matrix 107 rows 44 cols
[2023-03-11 07:44:21] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-11 07:44:21] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-11 07:44:21] [INFO ] Invariant cache hit.
[2023-03-11 07:44:21] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-11 07:44:21] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2023-03-11 07:44:21] [INFO ] Invariant cache hit.
[2023-03-11 07:44:21] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 44/47 places, 107/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 318 ms. Remains : 44/47 places, 107/118 transitions.
Stuttering acceptance computed with spot in 281 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 3}], [{ cond=(NOT p2), acceptance={} source=7 dest: 0}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=5, aps=[p1:(OR (EQ s1 0) (EQ s7 0) (EQ s17 0) (EQ s39 0)), p0:(OR (EQ s1 0) (EQ s2 0) (EQ s10 0) (EQ s39 0)), p2:(EQ s13 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, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5 reset in 201 ms.
Product exploration explored 100000 steps with 33 reset in 83 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 p0 (NOT p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 249 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 374 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 548 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 15) seen :13
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 07:44:23] [INFO ] Invariant cache hit.
[2023-03-11 07:44:23] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 07:44:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 07:44:23] [INFO ] After 36ms 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.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (G (NOT (AND p1 (NOT p0) p2))), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : [(F (AND p1 p0 p2)), (F (NOT (AND p1 p0 (NOT p2)))), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p1) p2)), (F (AND p0 p2)), (F (AND p1 (NOT p0) (NOT p2))), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p0))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 7 factoid took 516 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 44 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 107/107 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2023-03-11 07:44:24] [INFO ] Invariant cache hit.
[2023-03-11 07:44:24] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-11 07:44:24] [INFO ] Invariant cache hit.
[2023-03-11 07:44:24] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-11 07:44:24] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2023-03-11 07:44:24] [INFO ] Invariant cache hit.
[2023-03-11 07:44:24] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 351 ms. Remains : 44/44 places, 107/107 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 : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 1056 steps, including 62 resets, run visited all 4 properties in 24 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 2 factoid took 177 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 21 reset in 116 ms.
Product exploration explored 100000 steps with 5 reset in 139 ms.
Built C files in :
/tmp/ltsmin17847959384933667687
[2023-03-11 07:44:26] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17847959384933667687
Running compilation step : cd /tmp/ltsmin17847959384933667687;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 382 ms.
Running link step : cd /tmp/ltsmin17847959384933667687;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 90 ms.
Running LTSmin : cd /tmp/ltsmin17847959384933667687;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7229515288653052253.hoa' '--buchi-type=spotba'
LTSmin run took 1411 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-04a-LTLFireability-07 finished in 6617 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((p0||X(F((X(p2)&&p1))))))'
Support contains 8 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 97
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 97
Applied a total of 10 rules in 2 ms. Remains 42 /47 variables (removed 5) and now considering 97/118 (removed 21) transitions.
// Phase 1: matrix 97 rows 42 cols
[2023-03-11 07:44:28] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-11 07:44:28] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-11 07:44:28] [INFO ] Invariant cache hit.
[2023-03-11 07:44:28] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-11 07:44:28] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2023-03-11 07:44:28] [INFO ] Invariant cache hit.
[2023-03-11 07:44:28] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 42/47 places, 97/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 374 ms. Remains : 42/47 places, 97/118 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s1 1) (EQ s6 1) (EQ s12 1) (EQ s37 1)), p1:(AND (EQ s1 1) (EQ s5 1) (EQ s30 1) (EQ s37 1)), p2:(AND (EQ s1 1) (EQ s2 1) (EQ s20 1) (EQ s37 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 13 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-09 finished in 539 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))))'
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 118/118 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 45 transition count 113
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 41 transition count 111
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 39 transition count 111
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 13 place count 39 transition count 110
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 15 place count 38 transition count 110
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 20 place count 33 transition count 89
Iterating global reduction 3 with 5 rules applied. Total rules applied 25 place count 33 transition count 89
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 29 place count 31 transition count 87
Applied a total of 29 rules in 9 ms. Remains 31 /47 variables (removed 16) and now considering 87/118 (removed 31) transitions.
// Phase 1: matrix 87 rows 31 cols
[2023-03-11 07:44:28] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-11 07:44:28] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-11 07:44:28] [INFO ] Invariant cache hit.
[2023-03-11 07:44:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:44:28] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2023-03-11 07:44:28] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 07:44:28] [INFO ] Invariant cache hit.
[2023-03-11 07:44:28] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/47 places, 87/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 257 ms. Remains : 31/47 places, 87/118 transitions.
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s18 1), p1:(EQ s26 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 17 reset in 154 ms.
Product exploration explored 100000 steps with 12 reset in 196 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 7 factoid took 436 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 1412 steps, including 101 resets, run visited all 4 properties in 6 ms. (steps per millisecond=235 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 565 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 87/87 transitions.
Applied a total of 0 rules in 4 ms. Remains 31 /31 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2023-03-11 07:44:30] [INFO ] Invariant cache hit.
[2023-03-11 07:44:30] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-11 07:44:30] [INFO ] Invariant cache hit.
[2023-03-11 07:44:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:44:30] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2023-03-11 07:44:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 07:44:30] [INFO ] Invariant cache hit.
[2023-03-11 07:44:30] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 291 ms. Remains : 31/31 places, 87/87 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 7 factoid took 394 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 3189 steps, including 251 resets, run visited all 4 properties in 8 ms. (steps per millisecond=398 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 556 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 27 reset in 62 ms.
Product exploration explored 100000 steps with 12 reset in 161 ms.
Built C files in :
/tmp/ltsmin11727220779945948264
[2023-03-11 07:44:32] [INFO ] Computing symmetric may disable matrix : 87 transitions.
[2023-03-11 07:44:32] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:44:32] [INFO ] Computing symmetric may enable matrix : 87 transitions.
[2023-03-11 07:44:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:44:32] [INFO ] Computing Do-Not-Accords matrix : 87 transitions.
[2023-03-11 07:44:32] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:44:32] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11727220779945948264
Running compilation step : cd /tmp/ltsmin11727220779945948264;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 189 ms.
Running link step : cd /tmp/ltsmin11727220779945948264;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 21 ms.
Running LTSmin : cd /tmp/ltsmin11727220779945948264;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7873889763706629723.hoa' '--buchi-type=spotba'
LTSmin run took 156 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-04a-LTLFireability-11 finished in 4002 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) U X(p1)))))'
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 45 transition count 112
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 40 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 11 place count 40 transition count 111
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 13 place count 39 transition count 111
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 17 place count 35 transition count 95
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 35 transition count 95
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 25 place count 33 transition count 93
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 27 place count 32 transition count 93
Applied a total of 27 rules in 9 ms. Remains 32 /47 variables (removed 15) and now considering 93/118 (removed 25) transitions.
// Phase 1: matrix 93 rows 32 cols
[2023-03-11 07:44:32] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-11 07:44:32] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-11 07:44:32] [INFO ] Invariant cache hit.
[2023-03-11 07:44:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 07:44:32] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-11 07:44:32] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-11 07:44:32] [INFO ] Invariant cache hit.
[2023-03-11 07:44:32] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/47 places, 93/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 287 ms. Remains : 32/47 places, 93/118 transitions.
Stuttering acceptance computed with spot in 2432 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s16 1), p1:(EQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 38 steps with 8 reset in 1 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-12 finished in 2743 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((G(F(!p0))||(G((p1&&F(!p2)))&&X(F(!p0)))))))'
Support contains 10 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 97
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 97
Applied a total of 10 rules in 15 ms. Remains 42 /47 variables (removed 5) and now considering 97/118 (removed 21) transitions.
// Phase 1: matrix 97 rows 42 cols
[2023-03-11 07:44:35] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-11 07:44:35] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-11 07:44:35] [INFO ] Invariant cache hit.
[2023-03-11 07:44:35] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-11 07:44:35] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-11 07:44:35] [INFO ] Invariant cache hit.
[2023-03-11 07:44:35] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 42/47 places, 97/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 185 ms. Remains : 42/47 places, 97/118 transitions.
Stuttering acceptance computed with spot in 218 ms :[p0, p0, p0, (OR (AND p0 (NOT p1)) (AND p0 p2)), (AND p0 p2)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(OR p0 p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s9 1), p0:(AND (EQ s1 1) (EQ s7 1) (EQ s30 1) (EQ s37 1)), p2:(AND (EQ s13 1) (EQ s19 1) (EQ s23 1) (EQ s29 1) (EQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 5 reset in 60 ms.
Product exploration explored 100000 steps with 2 reset in 85 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) (NOT p2)), (X p1), (X (OR p0 p1)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (OR p0 p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 345 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[p0, p0, p0, (OR (AND p0 (NOT p1)) (AND p0 p2)), (AND p0 p2)]
Incomplete random walk after 10000 steps, including 572 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 07:44:36] [INFO ] Invariant cache hit.
[2023-03-11 07:44:36] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-11 07:44:36] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X p1), (X (OR p0 p1)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (OR p0 p1))), (X (X (NOT p0))), (G (NOT (AND p1 p2 p0))), (G (NOT (AND p2 p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p1)), (F p0), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 10 factoid took 471 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 164 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Support contains 5 out of 42 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 97/97 transitions.
Applied a total of 0 rules in 0 ms. Remains 42 /42 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-11 07:44:37] [INFO ] Invariant cache hit.
[2023-03-11 07:44:37] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-11 07:44:37] [INFO ] Invariant cache hit.
[2023-03-11 07:44:37] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-11 07:44:37] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2023-03-11 07:44:37] [INFO ] Invariant cache hit.
[2023-03-11 07:44:37] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 301 ms. Remains : 42/42 places, 97/97 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 : [(AND p1 (NOT p0)), (X p1), (X (OR p1 p0)), (X (X p1)), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 998 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Finished random walk after 678 steps, including 37 resets, run visited all 4 properties in 3 ms. (steps per millisecond=226 )
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (OR p1 p0)), (X (X p1)), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p1)), (F p0), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 7 factoid took 350 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 173 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 155 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 28 reset in 36 ms.
Product exploration explored 100000 steps with 43 reset in 81 ms.
Applying partial POR strategy [false, false, true, false]
Stuttering acceptance computed with spot in 149 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Support contains 5 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 97/97 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 42 transition count 97
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 42 transition count 99
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 42 transition count 99
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 42 transition count 99
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 41 transition count 98
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 41 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 41 transition count 101
Deduced a syphon composed of 8 places in 1 ms
Applied a total of 11 rules in 34 ms. Remains 41 /42 variables (removed 1) and now considering 101/97 (removed -4) transitions.
[2023-03-11 07:44:40] [INFO ] Redundant transitions in 42 ms returned []
// Phase 1: matrix 101 rows 41 cols
[2023-03-11 07:44:40] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-11 07:44:40] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/42 places, 101/97 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 195 ms. Remains : 41/42 places, 101/97 transitions.
Built C files in :
/tmp/ltsmin2310631904717285963
[2023-03-11 07:44:40] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2310631904717285963
Running compilation step : cd /tmp/ltsmin2310631904717285963;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 186 ms.
Running link step : cd /tmp/ltsmin2310631904717285963;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin2310631904717285963;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2630326371759883148.hoa' '--buchi-type=spotba'
LTSmin run took 466 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-04a-LTLFireability-13 finished in 5724 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 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 47 transition count 113
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 42 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 41 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 41 transition count 111
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 14 place count 40 transition count 111
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 19 place count 35 transition count 90
Iterating global reduction 3 with 5 rules applied. Total rules applied 24 place count 35 transition count 90
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 28 place count 33 transition count 88
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 32 transition count 88
Applied a total of 30 rules in 7 ms. Remains 32 /47 variables (removed 15) and now considering 88/118 (removed 30) transitions.
// Phase 1: matrix 88 rows 32 cols
[2023-03-11 07:44:41] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-11 07:44:41] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-11 07:44:41] [INFO ] Invariant cache hit.
[2023-03-11 07:44:41] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-11 07:44:41] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2023-03-11 07:44:41] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-11 07:44:41] [INFO ] Invariant cache hit.
[2023-03-11 07:44:41] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/47 places, 88/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 392 ms. Remains : 32/47 places, 88/118 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s6 0) (EQ s10 0) (EQ s28 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 17 reset in 43 ms.
Product exploration explored 100000 steps with 10 reset in 78 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Finished random walk after 43 steps, including 4 resets, run visited all 1 properties in 1 ms. (steps per millisecond=43 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 88/88 transitions.
Applied a total of 0 rules in 4 ms. Remains 32 /32 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2023-03-11 07:44:42] [INFO ] Invariant cache hit.
[2023-03-11 07:44:42] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-11 07:44:42] [INFO ] Invariant cache hit.
[2023-03-11 07:44:42] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-11 07:44:42] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2023-03-11 07:44:42] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-11 07:44:42] [INFO ] Invariant cache hit.
[2023-03-11 07:44:42] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 203 ms. Remains : 32/32 places, 88/88 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 84 steps, including 7 resets, run visited all 1 properties in 1 ms. (steps per millisecond=84 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Product exploration explored 100000 steps with 8 reset in 45 ms.
Product exploration explored 100000 steps with 35 reset in 48 ms.
Built C files in :
/tmp/ltsmin4042789005757143012
[2023-03-11 07:44:42] [INFO ] Computing symmetric may disable matrix : 88 transitions.
[2023-03-11 07:44:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:44:42] [INFO ] Computing symmetric may enable matrix : 88 transitions.
[2023-03-11 07:44:42] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:44:42] [INFO ] Computing Do-Not-Accords matrix : 88 transitions.
[2023-03-11 07:44:42] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:44:42] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4042789005757143012
Running compilation step : cd /tmp/ltsmin4042789005757143012;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2867 ms.
Running link step : cd /tmp/ltsmin4042789005757143012;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 21 ms.
Running LTSmin : cd /tmp/ltsmin4042789005757143012;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12685035197465111584.hoa' '--buchi-type=spotba'
LTSmin run took 124 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-04a-LTLFireability-14 finished in 4762 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 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 118/118 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 47 transition count 112
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 41 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 41 transition count 111
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 14 place count 40 transition count 111
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 18 place count 36 transition count 95
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 36 transition count 95
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 35 transition count 94
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 34 transition count 94
Applied a total of 26 rules in 19 ms. Remains 34 /47 variables (removed 13) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 34 cols
[2023-03-11 07:44:45] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-11 07:44:45] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-11 07:44:45] [INFO ] Invariant cache hit.
[2023-03-11 07:44:45] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-11 07:44:46] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2023-03-11 07:44:46] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-11 07:44:46] [INFO ] Invariant cache hit.
[2023-03-11 07:44:46] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/47 places, 94/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 254 ms. Remains : 34/47 places, 94/118 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-15 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 s2 1) (EQ s19 1) (EQ s30 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 8 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-15 finished in 291 ms.
All properties solved by simple procedures.
Total runtime 29234 ms.

BK_STOP 1678520687024

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-04a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-04a, 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 r005-oct2-167813593300580"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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